betaFeedback

WorksMathematics

The Compactness Theorem for Enriched Logic

Abstract

The framework of enriched logic extends positive logic (also known as coherent logic) from sets to structures internal to a symmetric monoidal closed category V\mathcal{V}. This framework was developed by Rosický and the second-named author. The main novelty of this logic is that the arities of the function and relation symbols are now objects in V\mathcal{V}. We prove the compactness theorem for this enriched logic. That is, a set of V\mathcal{V}-enriched sequents has a model (internal to V\mathcal{V}) if every finite subset has a model. To achieve this, we define ultraproducts of enriched structures and prove enriched versions of Łos' theorem. We then develop some model-theoretic applications. We start with an enriched version of the model-theoretic method of diagrams, establishing a correspondence between homomorphisms whose domain is some enriched structure AA and models of the set Diag⁡(A)\operatorname{Diag}(A) of all enriched atomic formulas with parameters from AA that are true in AA. Combining this with our compactness theorem, we prove amalgamation results, laying the foundations for enriched syntactic types (in the model-theoretic sense). We finish the paper with a collection of examples of V\mathcal{V} that our results apply to. Besides recovering the classical case when V=Set\mathcal{V} = \mathbf{Set}, these include many presheaf toposes, categories of monoid acts, the category of abelian groups and related additive categories, categories of (small) enriched categories, and the categories of posets and pseudometric spaces.

Introduction

The compactness theorem is one of the cornerstones of model theory. Together with Łoś’ theorem, it provides a powerful bridge between local and global properties, showing that structures satisfying arbitrarily large finite fragments of a theory can be assembled into genuine models. These ideas are behind some of the most important techniques in the subject, ranging from the model-theoretic method of diagrams and amalgamation to the construction of nonstandard models of analysis.

The first-named and second-named authors acknowledge with gratitude the support of the Marie Skłodowska-Curie postdoctoral fellowship 101130801 and the EPSRC postdoctoral fellowship EP/X027139/1, respectively.

From a categorical perspective, compactness is closely related to the existence and well-behaviour of ultraproducts. In the ordinary setting, Łos’ theorem identifies the interpretation of a first-order formula φ\varphi in an ultraproduct of structures A=∏i∈IAi/UA = \prod_{i\in I} A_i/\mathcal{U} with the ultraproduct of their interpretations:

φ(A)≅∏i∈Iφ(Ai)/U.\varphi(A) \cong\prod_{i\in I} \varphi(A_i)/\mathcal{U}.

The compactness theorem then follows by a standard ultraproduct construction.

The interaction between logic and category theory has proved remarkably fruitful, leading to deep connections with accessible categories [31, 4], ultracategories [30, 28], Grothendieck toposes [26, 29], the development of hyperdoctrines [25, 24], the theory of deductive systems [23], and type theory [39]. Recently, enriched versions of regular and positive logic (also known as coherent logic) have been developed in a series of papers by Rosický and the second-named author [37, 35, 36]. These frameworks extend familiar fragments of first-order logic from sets to structures internal to a symmetric monoidal closed category V\mathcal{V}, equipped with a suitable factorisation system (E,M)(\mathcal{E},\mathcal{M}), which encodes how subobjects and existential quantifiers are interpreted. They recover classical regular and positive logic when V=Set\mathcal{V} = \mathbf{Set}, while also including examples arising from algebra [33], order theory [8, 1], functional analysis [13], and theoretical computer science [32]. Despite the development of the syntax and semantics of enriched logic, a general compactness theorem has so far been missing.

Main results. The main goal of the present paper is to provide a compactness theorem for enriched logic. More precisely, we establish enriched versions of Łos’ theorem, which we will refer to as Łos-style theorems from now on, and compactness for both regular and positive logic. Our approach follows the classical strategy, but substantial new difficulties arise.

In the enriched setting, ultraproducts must be constructed at the level of the base of enrichment, and the interpretation of formulas involves the chosen factorisation system, rather than subobjects alone. As a consequence, the validity of the compactness theorem depends on categorical properties of the base of enrichment and chosen factorisation system that are automatic in Set\mathbf{Set}, but that are an additional and genuine requirement in a general enriched framework.

To isolate the needed assumptions, we introduce the notion of reduced product stable enrichment bases (Theorems 3.3 and 4.1). This guarantees that reduced products interact suitably with finite limits, powers, and the chosen factorisation system. To cover the case of positive logic an additional condition is required, namely what we call the ultraproduct covering property (Theorem 4.2). This property controls the interaction between ultraproducts and finite coproducts and turns out to be satisfied in a large number of natural examples.

Under these hypotheses we prove Łos-style theorems for enriched logic. The first theorem states that the interpretation of regular formulas commutes with reduced products, and that the interpretation of positive formulas commutes with ultraproducts. The second theorem gives the familiar consequence: if a sequent holds on a large subset of the factors, then it holds in the corresponding reduced product (Theorem 4.6 establishes a converse under additional assumptions).

Theorem 1.1 (Łos-style theorem 1). Assume that V\mathcal{V} is reduced product stable. Let L\mathbb{L} be a language on V\mathcal{V} and let φ\varphi be an L\mathbb{L}-formula. Let A:=∏i∈IAi/FA := \prod_{i\in I} A_i/\mathcal{F} be a reduced product of L\mathbb{L}-structures. Then

φ(A)≅∏i∈Iφ(Ai)/F\varphi(A) \cong\prod_{i\in I} \varphi(A_i)/\mathcal{F}

provided that:

(i) φ\varphi is regular, or;

(ii) φ\varphi is positive, F\mathcal{F} is an ultrafilter, and V\mathcal{V} has the ultraproduct covering property.

Theorem 1.2 (Łos-style theorem 2). Assume that V\mathcal{V} is reduced product stable. Let L\mathbb{L} be a language on V\mathcal{V} and let σ\sigma be a sequent of L\mathbb{L}-formulas. Let A:=∏i∈IAi/FA := \prod_{i\in I} A_i/\mathcal{F} be a reduced product of L\mathbb{L}-structures. Then

{i∈I∣Ai⊨σ}∈FimpliesA⊨σ,\{i \in I \mid A_i \models\sigma\} \in\mathcal{F}\quad\text{implies}\quad A \models\sigma,

provided that:

(i) σ\sigma is a sequent of regular formulas, or;

(ii) σ\sigma is a sequent of positive formulas, F\mathcal{F} is an ultrafilter, and V\mathcal{V} has the ultraproduct covering property.

Another key feature of this paper is the treatment of formulas with parameters, which are extremely important in applications of the compactness theorem. In contrast with the classical setting, parameters cannot in general be represented by constant symbols, unless the base of enrichment is semicartesian (i.e., the monoidal unit is terminal, see Theorem 5.3 and § 6.1). This forces a separate treatment of parameters (see Theorem 5.1), so that our results are applicable beyond the semicartesian case. We extend our second Łoś-style theorem so that it can handle parameters (see Theorem 5.7). Using this we then prove the compactness theorem for enriched regular and positive logic, allowing parameters.

Theorem 1.3 (Compactness). Assume that V\mathcal{V} is reduced product stable. Let L\mathbb{L} be a language on V\mathcal{V}, let T\mathbb{T} be a theory, and let Σ\Sigma be a set of sequents with parameters in P\mathcal{P}. Assume also that the monoidal unit II is finitely presentable or that all sequents in Σ\Sigma are of the form ⊤⊢ψ(p1,…,pn)\top\vdash\psi(p_1,\ldots,p_n). If every finite subset of T∪Σ\mathbb{T} \cup\Sigma has a model then T∪Σ\mathbb{T} \cup\Sigma has a model, provided that:

(i) every sequent in T∪Σ\mathbb{T} \cup\Sigma is a sequent of regular formulas (possibly with parameters), or;

(ii) every sequent in T∪Σ\mathbb{T} \cup\Sigma is a sequent of positive formulas (possibly with parameters) and V\mathcal{V} has the ultraproduct covering property.

As an application, we develop an enriched version of the model-theoretic method of diagrams. Given an enriched structure AA, we show that homomorphisms with domain AA correspond precisely to models of the set Diag⁡(A)\operatorname{Diag}(A) of all (regular) atomic formulas with parameters from AA that are true in AA (this is called the diagram of AA, see Theorem 6.3).

Theorem 1.4 (Enriched model-theoretic method of diagrams). Assume that V0\mathcal{V}_0 is locally finitely presentable with its finitely presentable objects closed under the monoidal product and that (E,M)(\mathcal{E},\mathcal{M}) is proper. Let L\mathbb{L} be a language on V\mathcal{V} and let AA be an L\mathbb{L}-structure. Then the functor

A/Str⁡(L)0⟶Mod⁡(Diag⁡(A)),A/\operatorname{Str}(\mathbb{L})_0 \longrightarrow\operatorname{Mod}(\operatorname{Diag}(A)),
h ⁣:A→B⟼(B,(h∘a)pa∈P(A)),h\colon A \to B \longmapsto(B,(h \circ a)_{p_a \in\mathcal{P}(A)}),

which is the identity on arrows, is an isomorphism of categories.

We use this machinery to derive amalgamation properties, which ultimately result in the power of the central model-theoretic notion of a type as a set of formulas. As a corollary we show how spans of structures, or even models of a fixed theory, can be amalgamated (Theorem 7.7) if one of the arrows is an immersion (i.e., reflects truth of formulas).

Theorem 1.5. Assume that V\mathcal{V} is reduced product stable, that V0\mathcal{V}_0 is locally finitely presentable, that (E,M)(\mathcal{E},\mathcal{M}) is proper, and that II is E\mathcal{E}-projective.

Let AA be an L\mathbb{L}-structure and BB be a model of some L\mathbb{L}-theory T\mathbb{T}, and let A←aX→bBA \xleftarrow{a} X \xrightarrow{b} B be a span of arrows in V\mathcal{V}. Suppose that tp⁡pp(a;A)⊆tp⁡pp(b;B)\operatorname{tp}_{\mathrm{pp}}(a;A) \subseteq\operatorname{tp}_{\mathrm{pp}}(b;B). Then there is a model CC of T\mathbb{T} together with homomorphisms f ⁣:A→Cf\colon A \to C and g ⁣:B→Cg\colon B \to C such that f∘a=g∘bf \circ a = g \circ b, provided that:

(i) T\mathbb{T} is regular, or;

(ii) T\mathbb{T} is positive and V\mathcal{V} has the ultraproduct covering property.

The assumptions required for our main results are shown to hold in a broad range of examples. Besides recovering the classical case over Set\mathbf{Set}, our framework applies to many presheaf top-oses, categories of monoid acts, the category of abelian groups and related additive categories, categories of (small) enriched categories, and the categories of posets and pseudometric spaces. We also exhibit examples where some of the assumptions fail (sometimes we still have enough for our results concerning regular logic, see § 9.3), showing that the additional categorical conditions introduced in the paper are genuinely necessary.

Overview. The paper is organised as follows. In § 2 we recall the required background on factorisation systems and enriched logic. We then start by defining ultraproducts and reduced products for enriched structures in § 3. Section 4 establishes enriched Łoś-style theorems. In § 5 we introduce parameters and prove the compactness theorem. § 6 and § 7 develop the enriched model-theoretic method of diagrams and its applications to amalgamation. The standalone § 8 studies the ultraproduct covering property and provides general criteria ensuring it holds. Finally, § 9 collects a range of examples and counterexamples illustrating the scope of our theory.

Preliminaries

Factorisation systems

Factorisation systems. We will assume the reader to be familiar with the notion of an (orthogonal) factorisation system, introduced in [11]. Given a category C\mathcal{C} this consists of a pair (E,M)(\mathcal{E},\mathcal{M}) formed by classes of arrows in C\mathcal{C} satisfying the properties of [11 Definition 2.2]. In this section we recall some basic properties of this theory.

Definition 2.1. A factorisation system (E,M)(\mathcal{E},\mathcal{M}) on a category C\mathcal{C} is called proper if E\mathcal{E} and M\mathcal{M} are contained in the classes of epimorphisms and monomorphisms, respectively.

Since our enrichment base will be complete and cocomplete, the following fact (and its dual) give equivalent characterisations of M\mathcal{M} being contained in the monomorphisms (and dually, E\mathcal{E} being contained in the epimorphisms).

Fact 2.2 ([11 Proposition 2.1.4]). The following are equivalent for a factorisation system (E,M)(\mathcal{E},\mathcal{M}) in a category with finite coproducts:

  • every arrow in M\mathcal{M} is a monomorphism;

  • E\mathcal{E} contains the strong epimorphisms;

  • E\mathcal{E} contains the split epimorphism;

  • E\mathcal{E} contains the regular epimorphisms;

  • the left cancellation property in E\mathcal{E} holds: fg∈Efg \in\mathcal{E} implies f∈Ef \in\mathcal{E}.

Definition 2.3. Let (E,M)(\mathcal{E},\mathcal{M}) be a factorisation system on a cocomplete category C\mathcal{C}. A set of objects X\mathcal{X} in C\mathcal{C} is called an E\mathcal{E}-generator if for any object AA in C\mathcal{C} the arrow

∐f:X→A, X∈XX⟶A\coprod_{f:X\to A,\ X\in\mathcal{X}} X \longrightarrow A

is in E\mathcal{E}.

The notions that are usually referred to as generator and strong generator (recalled below) arise in this way and are used quite often in category theory.

Remark 2.4. If C\mathcal{C} is a locally presentable category both the (strong epi, mono) and (epi, strong mono) factorisation systems exist by [4 Proposition 1.61]. Then we say that X⊆C\mathcal{X} \subseteq\mathcal{C} is a:

  • generator if it is an (epi)-generator,

  • strong generator if it is a (strong epi)-generator.

Beside the equivalent characterisation given by Theorem 2.5 below we also have the following (see [9 Propositions 4.5.8 and 4.5.20]): let J:C→[Xop,Set]J:\mathcal{C}\to[\mathcal{X}^{\mathrm{op}},\mathbf{Set}] be the restriction of the Yoneda embedding; then

(1) X\mathcal{X} is a generator if and only if JJ is faithful;

(2) X\mathcal{X} is a strong generator if and only if JJ is conservative.

We will freely use the following equivalent characterisation of E\mathcal{E}-generators.

Proposition 2.5. Let (E,M)(\mathcal{E},\mathcal{M}) be a factorisation system on a cocomplete category C\mathcal{C} with M\mathcal{M} contained in the monomorphisms. A set of objects X\mathcal{X} in C\mathcal{C} is an E\mathcal{E}-generator if and only if for any A∈CA\in\mathcal{C} there is a family {Xi}i∈I\{X_i\}_{i\in I} of objects in X\mathcal{X} and an arrow ∐i∈IXi→A\coprod_{i\in I}X_i\to A in E\mathcal{E}.

Proof. The left to right direction is trivial. The other direction follows from the canonical factorisation

∐i∈IXi⟶∐f:X→A, X∈XX⟶A\coprod_{i\in I}X_i \longrightarrow\coprod_{f:X\to A,\ X\in\mathcal{X}}X \longrightarrow A

of the arrow ∐i∈IXi→A\coprod_{i\in I}X_i\to A in E\mathcal{E}, and the fact that E\mathcal{E} has the left cancellation property by Theorem 2.2. □

Remark 2.6. If (E,M)(\mathcal{E},\mathcal{M}) is a factorisation system on a locally finitely presentable category C\mathcal{C}, with M\mathcal{M} contained in the monomorphisms, then Cfp\mathcal{C}_{\mathrm{fp}} is an E\mathcal{E}-generator. Indeed, by definition Cfp\mathcal{C}_{\mathrm{fp}} is a strong generator of C\mathcal{C} and E\mathcal{E} contains the strong epimorphisms by Theorem 2.2.

Lemma 2.7. Let (E,M)(\mathcal{E},\mathcal{M}) be a factorisation system on a cocomplete category C\mathcal{C} with M\mathcal{M} contained in the monomorphisms. Assume also that C\mathcal{C} has an E\mathcal{E}-generator X\mathcal{X}. Suppose that f:A→Bf:A\to B is an arrow such that any g:X→Bg:X\to B, with X∈XX\in\mathcal{X}, factors through ff. Then f∈Ef\in\mathcal{E}.

Proof. Since X\mathcal{X} is an E\mathcal{E}-generator we have an arrow ∑j∈Jgj:∑j∈JXj→B\sum_{j\in J}g_j:\sum_{j\in J}X_j\to B, with Xj∈XX_j\in\mathcal{X}, which lies in E\mathcal{E}. By assumption each gjg_j factors through ff inducing an arrow g~j:Xj→A\widetilde{g}_j:X_j\to A. It follows that the triangle

∑j∈JXj→∑j∈Jg~jA∑j∈Jgj↓↓fB=B\begin{CD} \sum_{j\in J}X_j @>{\sum_{j\in J}\widetilde{g}_j}>> A\\ @V{\sum_{j\in J}g_j}VV @VV{f}V\\ B @= B \end{CD}

commutes. Since M\mathcal{M} is contained in the monomorphisms, the left cancellation property holds, so that f∈Ef\in\mathcal{E}.

Enriched logic

We assume the reader to be familiar with the basics of enriched category theory. For a reference on this topic, see [17].

We work in the setting developed in [37, 35, 36]; and therefore we fix a symmetric monoidal closed complete and cocomplete category V=(V0,⊗,I)\mathcal{V}=(\mathcal{V}_0,\otimes,I) endowed with a factorisation system (E,M)(\mathcal{E},\mathcal{M}), which is:

  • enriched [27]: M\mathcal{M} is closed in V2\mathcal{V}^{2} under powers (or equivalently, E\mathcal{E} is closed under tensors);

  • such that every arrow in M\mathcal{M} is a monomorphism.

Later on we shall assume additional hypotheses on V\mathcal{V} and (E,M)(\mathcal{E},\mathcal{M}), depending on the results that we need to prove; in particular, V0\mathcal{V}_0 will often be assumed to be locally finitely presentable and (E,M)(\mathcal{E},\mathcal{M}) to be proper.

We denote by Vfp\mathcal{V}_{\mathrm{fp}} the full subcategory spanned by the finitely presentable objects of V0\mathcal{V}_0. When V\mathcal{V} is locally finitely presentable as a closed category, meaning that Vfp\mathcal{V}_{\mathrm{fp}} contains the unit and is closed under the monoidal product, there is a well-behaved theory of locally finitely presentable V\mathcal{V}-categories (see [18]), and Vfp\mathcal{V}_{\mathrm{fp}} coincides with the full subcategory of the enriched finitely presentable objects of V\mathcal{V}. However, we will not consider enriched presentability in this paper.

Unlike the references we follow, that allow infinitary logic, in this paper we will treat only the finitary case, so that whenever we talk about languages, formulas, and theories, we actually mean finitary languages, finitary formulas, and finitary theories. Let us begin by recalling the notions of a language L\mathbb{L}, L\mathbb{L}-structures, and terms in L\mathbb{L}.

References

  1. [1]J. Adámek, M. Dostál, and J. Velebil. A categorical view of varieties of ordered algebras. Mathematical Structures in Computer Science, 32(4):349–373, 2022.arxiv.org/abs/2011.13839
  2. [2]J. Adámek, S. Milius, L. S. Moss, and H. Urbat. On finitary functors and their presentations. Journal of Computer and System Sciences, 81(5):813–833, 2015.
  3. [3]J. Adámek, E. Nelson, and J. Reiterman. The Birkhoff variety theorem for continuous algebras. algebra universalis, 20(3):328–350, 1985.
  4. [4]J. Adámek and J. Rosický. Locally presentable and accessible categories, volume 189 of London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge, 1994.
  5. [5]J. Adámek and J. Rosický. Approximate injectivity and smallness in metric-enriched categories. Journal of Pure and Applied Algebra, 226(6), 2022.arxiv.org/abs/2006.01399
  6. [6]J. Adámek, J. Rosický, and E. M. Vitale. Algebraic Theories: A Categorical Introduction to General Algebra. Cambridge Tracts in Mathematics. Cambridge University Press, 2010.
  7. [7]J. Adámek and L. Sousa. Graduated categories of presheaves, 2026. arXiv:2609.30444 (preprint).arxiv.org/abs/2609.30444
  8. [8]S. L. Bloom. Varieties of ordered algebras. Journal of Computer and System Sciences, 13(2):200–212, 1976.DOI
  9. [9]F. Borceux. Handbook of Categorical Algebra: Volume 2, Categories and Structures. Cambridge University Press, 1994.
  10. [10]B. J. Day. Construction of Biclosed Categories. PhD thesis, UNSW Sydney, 1970.DOI
  11. [11]P. J. Freyd and G. M. Kelly. Categories of continuous functors, I. Journal of pure and applied algebra, 2(3):169–191, 1972.DOI
  12. [12]N. Gambino and G. Tendas. Isoregular theories, accessible 2-categories, and free constructions, 2026. arXiv:2606.26717 (preprint).arxiv.org/abs/2606.26717
  13. [13]J. Iovino. Applications of model theory to functional analysis. Courier Corporation, 2014.
  14. [14]G. Janelidze and G. Kelly. A note on actions of a monoidal category. Theory and Applications of Categories, 9(4):61–91, 2001.DOI
  15. [15]P. Johnstone. Sketches of an Elephant: A Topos Theory Compendium. Oxford Logic Guides, 2002.DOI
  16. [16]K. Kanalas. Realizing types in topos-valued models, June 2026. Slides, Making Categorical Model Theory Accessible, Brno.
  17. [17]G. M. Kelly. Basic Concepts of Enriched Category Theory. Cambridge University Press, 1982.
  18. [18]G. M. Kelly. Structures defined by finite limits in the enriched context. I. Cahiers de Topologie et Géométrie Différentielle, 23(1):3–42, 1982.
  19. [19]G. M. Kelly and S. Lack. V-Cat is locally presentable or locally bounded if V is so. Theory and Applications of Categories, 8:555–575, 2001.
  20. [20]S. Lack and G. Tendas. Enriched regular theories. Journal of Pure and Applied Algebra, 224(6), 2020.DOI
  21. [21]S. Lack and G. Tendas. Flat vs. filtered colimits in the enriched context. Advances in Mathematics, 404, 2022.DOI
  22. [22]S. Lack and G. Tendas. Virtual concepts in the theory of accessible categories. Journal of Pure and Applied Algebra, 227(2), 2023.DOI
  23. [23]J. Lambek. Deductive systems and categories: I. syntactic calculus and residuated categories. Mathematical systems theory, 2(4):287–318, 1968.DOI
  24. [24]F. W. Lawvere. Equality in hyperdoctrines and comprehension schema as an adjoint functor. Forschungsinst. f. Mathe., 1968.
  25. [25]F. W. Lawvere. Adjointness in foundations. Dialectica, 23(3/4):281–296, 1969.DOI
  26. [26]F. W. Lawvere. Quantifiers and sheaves. In Actes du congres international des mathematiciens, Nice, volume 1, pages 329–334, 1970.
  27. [27]R. B. Lucashyn-Wright. Enriched factorization systems. Theory and Applications of Categories, 29(18):475–495, 2014.
  28. [28]J. Lurie. Ultracategories, 2018.
  29. [29]S. MacLane and I. Moerdijk. Sheaves in geometry and logic: A first introduction to topos theory. Springer Science & Business Media, 2012.
  30. [30]M. Makkai. Some duality for first order logic. Advances in Mathematics, 65(2):97–170, Aug. 1987.
  31. [31]M. Makkai and R. Paré. Accessible Categories: The Foundations of Categorical Model Theory. Number 104 in Contemporary Mathematics. American Mathematical Society, 1989.DOI
  32. [32]R. Mardare, P. Panangaden, and G. Plotkin. Quantitative algebraic reasoning. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, pages 700–709, 2016.
  33. [33]M. Prest. Definable Additive Categories: Purity and Model Theory. Memoirs of the American Mathematical Society, 2011.DOI
  34. [34]J. Rosický. Metric monads. Mathematical Structures in Computer Science, 31(5):535–552, 2021.
  35. [35]J. Rosický and G. Tendas. Enriched concepts of regular logic. The Journal of Symbolic Logic, 2025.arxiv.org/abs/2406.12617
  36. [36]J. Rosický and G. Tendas. Enriched positive logic, 2025. arXiv:2509.20019 (preprint).arxiv.org/abs/2509.20019
  37. [37]J. Rosický and G. Tendas. Towards enriched universal algebra. Selecta Mathematica, 32(2):21, 2026.DOI
  38. [38]G. J. Seal. Tensors, monads and actions. Theory and Applications of Categories, 28(15):403–434, July 2013.arxiv.org/abs/1205.0101
  39. [39]R. A. Seely. Locally cartesian closed categories and type theory. In Mathematical proceedings of the Cambridge philosophical society, volume 95, pages 33–48. Cambridge University Press, 1984.DOI
  40. [40]I. Tomašić. A topos-theoretic view of difference algebra, 2020. arXiv:2001.09075 (preprint).arxiv.org/abs/2001.09075

Paper details

vlnc:W_a62ffk5z
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents