This paper studies some model-theoretic properties of special groups of finite type. Special groups are a first-order axiomatization of the algebraic theory of quadratic forms, introduced by Dickmann and Miraglia, which is essentially equivalent to abstract Witt rings. More precisely, we consider elementary equivalence, saturation, elementary embeddings, quantifier elimination, stability and Morley rank.

This work presents a model-theoretic approach to the study of first-order theories of classes of BL-chains. Among other facts, we present several classes of BL-algebras, generating the whole variety of BL-algebras, whose first-order theory has quantifier elimination. Model-completeness and decision problems are also investigated. Then we investigate classes of BL-algebras having (or not having) the amalgamation property or the joint embedding property and we relate the above properties to the existence of ultrahomogeneous models.

If are structures for a first-order language , is said to be algebraically closed in just in case every positive existential -sentence true in is true in . In 1976 Elliott showed that unital AF algebras are classified up to isomorphism by corresponding dimension groups with order unit. This paper shows that one dimension group with order unit is algebraically closed in another just in case the corresponding AF algebras, viewed as metric structures, fall in the same relation.

An exponential $\exp $ on an ordered field $$. The structure $$ is then called an ordered exponential field. A linearly ordered structure $$ is called o-minimal if every parametrically definable subset of M is a finite union of points and open intervals of M.The main subject of this thesis is the algebraic and model theoretic examination of o-minimal exponential fields $$ whose exponential satisfies the differential equation $\exp ' = \exp $ with initial condition $\exp = 1$. (...) This study is mainly motivated by the Transfer Conjecture, which states as follows:Any o-minimal exponential field $$ whose exponential satisfies the differential equation $\exp ' = \exp $ with initial condition $\exp =1$ is elementarily equivalent to $\mathbb {R}_{\exp }$.Here, $\mathbb {R}_{\exp }$ denotes the real exponential field $$, where $\exp $ denotes the standard exponential $x \mapsto \mathrm {e}^x$ on $\mathbb {R}$. Moreover, elementary equivalence means that any first-order sentence in the language $\mathcal {L}_{\exp } = \{+,-,\cdot,0,1, <,\exp \}$ holds for $$ if and only if it holds for $\mathbb {R}_{\exp }$.The Transfer Conjecture, and thus the study of o-minimal exponential fields, is of particular interest in the light of the decidability of $\mathbb {R}_{\exp }$. To the date, it is not known if $\mathbb {R}_{\exp }$ is decidable, i.e., whether there exists a procedure determining for a given first-order $\mathcal {L}_{\exp }$ -sentence whether it is true or false in $\mathbb {R}_{\exp }$. However, under the assumption of Schanuel’s Conjecture—a famous open conjecture from Transcendental Number Theory—a decision procedure for $\mathbb {R}_{\exp }$ exists. Also a positive answer to the Transfer Conjecture would result in the decidability of $\mathbb {R}_{\exp }$. Thus, we study o-minimal exponential fields with regard to the Transfer Conjecture, Schanuel’s Conjecture, and the decidability question of $\mathbb {R}_{\exp }$.Overall, we shed light on the valuation theoretic invariants of o-minimal exponential fields—the residue field and the value group—with additional induced structure. Moreover, we explore elementary substructures and extensions of o-minimal exponential fields to the maximal ends—the smallest elementary substructures being prime models and the maximal elementary extensions being contained in the surreal numbers. Further, we draw connections to models of Peano Arithmetic, integer parts, density in real closure, definable Henselian valuations, and strongly NIP ordered fields.Parts of this thesis were published in [2–5].Abstract prepared by Lothar Sebastian KrappE-mail: [email protected]: https://d-nb.info/1202012558/34. (shrink)

Let T be an algebraically bounded theory. We consider the L ( δ ¯ ) $L(\bar \delta )$ upper L left parenthesis delta overbar right parenthesis -expansions of T by a tuple δ ¯ $\bar {\delta }$ delta overbar of derivations (which may be commuting or not). We investigate the model completion of either of the above theories, whose existence has been established in [21], with particular attention to its model-theoretic properties, including ω $\omega $ omega -stability, (...) simplicity, open core, and elimination of imaginaries. (shrink)

The present paper studies the general implications of theprinciple of compositionality for the organization of grammar.It will be argued that Janssen''s (1986) requirement that syntax andsemantics be similar algebras is too strong, and that the moreliberal requirement that syntax be interpretable into semanticsleads to a formalization that can be motivated and applied more easily,while it avoids the complications that encumber Janssen''s formalization.Moreover, it will be shown that this alternative formalization evenallows one to further complete the formal theory of compositionality, inthat (...) it is capable of clarifying the role played by translation,model-theoretic interpretation and meaning postulates,of which the latter two aspects received little or no attention inMontague (1970) and Janssen (1986). (shrink)

We prove the following algebraic characterization of elementary equivalence: $\equiv$ restricted to countable structures of finite type is minimal among the equivalence relations, other than isomorphism, which are preserved under reduct and renaming and which have the Robinson property; the latter is a faithful adaptation for equivalence relations of the familiar model theoretical notion. We apply this result to Friedman's fourth problem by proving that if L = L ωω (Q i ) i ∈ ω 1 is an (ω (...) 1 , ω)-compact logic satisfying both the Robinson consistency theorem on countable structures of finite type and the Löwenheim-Skolem theorem for some $\lambda for theories having ω 1 many sentences, then $\equiv_L = \equiv$ on such structures. (shrink)

Given a class $$\mathcal {C}$$ of models, a binary relation $$\mathcal {R}$$ between models, and a model-theoretic language L, we consider the modal logic and the modal algebra of the theory of $$\mathcal {C}$$ in L where the modal operator is interpreted via $$\mathcal {R}$$. We discuss how modal theories of $$\mathcal {C}$$ and $$\mathcal {R}$$ depend on the model-theoretic language, their Kripke completeness, and expressibility of the modality inside L. We calculate such theories for (...) the submodel and the quotient relations. We prove a downward Löwenheim–Skolem theorem for first-order language expanded with the modal operator for the extension relation between models. (shrink)

In this paper the class of Fidel-structures for the paraconsistent logic mbC is studied from the point of view of Model Theory and Category Theory. The basic point is that Fidel-structures for mbC (or mbC-structures) can be seen as first-order structures over the signature of Boolean algebras expanded by two binary predicate symbols N (for negation) and O (for the consistency connective) satisfying certain Horn sentences. This perspective allows us to consider notions and results from Model Theory in (...) order to analyze the class of mbC-structures. Thus, substructures, union of chains, direct products, direct limits, congruences and quotient structures can be analyzed under this perspective. In particular, a Birkhoff-like representation theorem for mbC-structures as subdirect poducts in terms of subdirectly irreducible mbC-structures is obtained by adapting a general result for first-order structures due to Caicedo. Moreover, a characterization of all the subdirectly irreducible mbC-structures is also given. An alternative decomposition theorem is obtained by using the notions of weak substructure and weak isomorphism considered by Fidel for Cn-structures. (shrink)

We study relationships between certain algebraic properties of groups and rings definable in a first order structure or *-closed in a compact G-space. As a consequence, we obtain a few structural results about ω-categorical rings as well as about small, nm-stable compact G-rings, and we also obtain surprising relationships between some conjectures concerning small profinite groups.

We examine topological dynamical systems on the Cantor set from the point of view of the continuous model theory of commutative C*-algebras. After some general remarks, we focus our attention on the generic homeomorphism of the Cantor set, as constructed by Akin, Glasner, and Weiss. We show that this homeomorphism is the prime model of its theory. We also show that the notion of “generic” used by Akin, Glasner, and Weiss is distinct from the notion of “generic” encountered (...) in Fraïssé theory. (shrink)

Monadic second order logic and linear temporal logic are two logical formalisms that can be used to describe classes of infinite words, i.e., first-order models based on the natural numbers with order, successor, and finitely many unary predicate symbols.Monadic second order logic over infinite words can alternatively be described as a first-order logic interpreted in${\cal P}\left$, the power set Boolean algebra of the natural numbers, equipped with modal operators for ‘initial’, ‘next’, and ‘future’ states. We prove that the first-order (...) theory of this structure is the model companion of a class of algebras corresponding to a version of linear temporal logic without until.The proof makes crucial use of two classical, nontrivial results from the literature, namely the completeness of LTL with respect to the natural numbers, and the correspondence between S1S-formulas and Büchi automata. (shrink)

Infinitary languages are used to prove that any strong isomorphism of substructures of isomorphic structures can be extended to an isomorphism of the structures. If the structures are models of a theory that has quantifier elimination, any isomorphism of substructures is strong. This theorem is a partial generalization of Steinitz’s theorem for algebraically closed fields and has as special case the analogous theorem for differentially closed fields. In this note, we announce results which will be proved elsewhere. DOI: 10.5007/1808-1711.2011v15n1p107.

We re-prove Becker’s theorem from Becker :229–234, 1981) by showing that \}\) implies that \\vDash ``\omega _2\) is -supercompact”. Our proof uses inner model theoretic tools instead of Baire category. We also show that \ is \-strongly compact.

We give a model-theoretic treatment of the fundamental results of Kechris-Pestov-Todorčević theory in the more general context of automorphism groups of not necessarily countable structures. One of the main points is a description of the universal ambit as a certain space of types in an expanded language. Using this, we recover results of Kechris et al. (Funct Anal 15:106–189, 2005), Moore (Fund Math 220:263–280, 2013), Ngyuen Van Thé (Fund Math 222: 19–47, 2013), in the context of automorphism groups (...) of not necessarily countable structures, as well as Zucker (Trans Am Math Soc 368, 6715–6740, 2016). (shrink)

We carry out some of Galois' work in the setting of an arbitrary first-order theory T. We replace the ambient algebraically closed field by a large model M of T, replace fields by definably closed subsets of M, assume that T codes finite sets, and obtain the fundamental duality of Galois theory matching subgroups of the Galois group of L over F with intermediate extensions F ≤ K ≤ L. This exposition of a special case of [10] has the (...) advantage of requiring almost no background beyond familiarity with fields, polynomials, first-order formulae, and automorphisms. (shrink)

In [6], Metakides and Nerode introduced the study of the lattice of recursively enumerable substructures of a recursively presented model as a means to understand the recursive content of certain algebraic constructions. For example, the lattice of recursively enumerable subspaces,, of a recursively presented vector spaceV∞has been studied by Kalantari, Metakides and Nerode, Retzlaff, Remmel and Shore. Similar studies have been done by Remmel [12], [13] for Boolean algebras and by Metakides and Nerode [9] for algebraically closed fields. In (...) all of these models, the algebraic closure of a set is nontrivial., is given in §1, however in vector spaces, cl is just the subspace generated byS, in Boolean algebras, cl is just the subalgebra generated byS, and in algebraically closed fields, cl is just the algebraically closed subfield generated byS.)In this paper, we give a general model theoretic setting in which we are able to give constructions which generalize many of the constructions of classical recursion theory. One of the main features of the modelswhich we study is that the algebraic closure of setis just itself, i.e., cl = S. Examples of such models include the natural numbers under equality 〈N, = 〉, the rational numbers under the usual ordering 〈Q, ≤〉, and a large class ofn-dimensional partial orderings. (shrink)

An elementary algebra identifies conceptual and corresponding applicational limitations in John Kemeny and Paul Oppenheim’s (K-O) 1956 model of theoretical reduction in the sciences. The K-O model was once widely accepted, at least in spirit, but seems afterward to have been discredited, or in any event superceeded. Today, the K-O reduction model is seldom mentioned, except to clarify when a reduction in the Kemeny-Oppenheim sense is not intended. The present essay takes a fresh look at the (...) basic mathematics of K-O comparative vocabulary theoretical term reductions, from historical and philosophical standpoints, as a contribution to the history of the philosophy of science. The K-O theoretical reduction model qualifies a theory replacement as a successful reduction when preconditions of explanatory adequacy and comparable systematicization are met, and there occur fewer numbers of theoretical terms identified as replicable syntax types in the most economical statement of a theory’s putative propositional truths, as compared with the theoretical term count for the theory it replaces. The challenge to the historical model developed here, to help explain its scope and limitations, involves the potential for equivocal theoretical meanings of multiple theoretical term tokens of the same syntactical type. (shrink)

Preferential model is one of the important semantical structures in nonmonotonic logic. This paper aims to establish an isomorphism theorem for preferential models, which gives us a purely algebraic characterization of the equivalence of preferential models. To this end, we present the notions of local similarity and local simulation. Based on these notions, two operators Δ(·) and μ(·) over preferential models are introduced and explored respectively. Together with other two existent operators ρ(·) and ΠD(·), we introduce an operator ∂D(·). (...) Then the isomorphism theorem is obtained in terms of ∂D(·), which asserts that for any two preferential models M₁ and M₂, they generate the same preferential inference if and only if ∂D(M₁) and ∂D(M₂) are isomorphic. Based on ∂D(·), we also get an alternative model-theoretical characterization of the well-known postulate "Weaken Disjunctive Rationality". Moreover, in the finite language framework, we show that Δ(μ(·)) is competent for the task of eliminating redundancy, and provide a representation result for k-relations. (shrink)

We introduce type-theoretic algebraic weak factorisation systems and show how they give rise to homotopy-theoretic models of Martin-Löf type theory. This is done by showing that the comprehension category associated with a type-theoretic algebraic weak factorisation system satisfies the assumptions necessary to apply a right adjoint method for splitting comprehension categories. We then provide methods for constructing several examples of type-theoretic algebraic weak factorisation systems, encompassing the existing groupoid and cubical sets models, as well as new (...) models based on normal fibrations. (shrink)

This paper introduces a natural extension of Kolchin's differential Galois theory to positive characteristic iterative differential fields, generalizing to the non-linear case the iterative Picard—Vessiot theory recently developed by Matzat and van der Put. We use the methods and framework provided by the model theory of iterative differential fields. We offer a definition of strongly normal extension of iterative differential fields, and then prove that these extensions have good Galois theory and that a G-primitive element theorem holds. In addition, (...) making use of the basic theory of arc spaces of algebraic groups, we define iterative logarithmic equations, finally proving that our strongly normal extensions are Galois extensions for these equations. (shrink)

In this paper, we explore the possibility of constructing algebra-valued models of set theory based on Priest's Logic of Paradox. We show that we can build a non-classical model of ZFC which has as internal logic Priest's Logic of Paradox and validates Leibniz's law of indiscernibility of identicals. This is achieved by modifying the interpretation map for $\in$ and $=$ in our algebra-valued model. We end by comparing our model constructions to Priest's model-theoretic (...) strategy and point out that we have a tradeoff between desirable model-theoretic properties and the validity of ZFC and its theorems. (shrink)

An important part of the theory of algebraizable sentential logics consists of studying the algebraic semantics of these logics. As developed by Czelakowski, Blok, and Pigozzi and Font and Jansana, among others, it includes studying the properties of logical matrices serving as models of deductive systems and the properties of abstract logics serving as models of sentential logics. The present paper contributes to the development of the categorical theory by abstracting some of these model theoretic aspects and results (...) from the level of sentential logics to the level of π-institutions. (shrink)

I see model theory as becoming increasingly detached from set theory, and the Tarskian notion of set-theoretic model being no longer central to model theory. In much of modern mathematics, the set-theoretic component is of minor interest, and basic notions are geometric or category-theoretic. In algebraic geometry, schemes or algebraic spaces are the basic notions, with the older “sets of points in affine or projective space” no more than restrictive special cases. The basic notions (...) may be given sheaf-theoretically, or functorially. To understand in depth the historically important affine cases, one does best to work with more general schemes. The resulting relativization and “transfer of structure” is incomparably more flexible and powerful than anything yet known in “set-theoretic model theory”.It seems to me now uncontroversial to see the fine structure of definitions as becoming the central concern of model theory, to the extent that one can easily imagine the subject being called “Definability Theory” in the near future.Tarski's set-theoretic foundational formulations are still favoured by the majority of model-theorists, and evolution towards a more suggestive language has been perplexingly slow. None of the main texts uses in any nontrivial way the language of category theory, far less sheaf theory or topos theory. Given that the most notable interactions of model theory with geometry are in areas of geometry where the language of sheaves is almost indispensable, this is a curious situation, and I find it hard to imagine that it will not change soon, and rapidly. (shrink)

This textbook is a gently-paced, comprehensive introduction to model theory suitable for students of philosophy, linguistics, computer science, or mathematics who specialise in logic. The book assumes no preliminary knowledge of logic or algebra beyond the barest rudiments of set theory. After a thorough discussion of the elements of model theory (languages, structures, morphisms), the reader is led into a study of key model-theoretic properties (quantifier elimination, model-completeness), ideas (types, Morley rank) and classic applications (...) (to groups, vector spaces, algebraically closed and real closed fields). The book also discusses applications of model-theoretic ideas to philosophy and mathematical social science. More than 300 exercises with full solutions are designed to consolidate understanding and build confidence. A set-theoretic appendix covers in detail the theory of ordinal and cardinal numbers needed in the second half of the book. (shrink)

We use the category of presheaves over PTIME-functions in order to show that Cook and Urquhart's higher-order function algebra PV ω defines exactly the PTIME-functions. As a byproduct we obtain a syntax-free generalisation of PTIME-computability to higher types. By restricting to sheaves for a suitable topology we obtain a model for intuitionistic predicate logic with ∑ 1 b -induction over PV ω and use this to re-establish that the provably total functions in this system are polynomial time computable. (...) Finally, we apply the category-theoretic approach to a new higher-order extension of Bellantoni-Cook's system BC of safe recursion. (shrink)

We analyze the effect of replacing several natural uses of definability in set theory by the weaker model-theoretic notion of algebraicity. We find, for example, that the class of hereditarily ordinal algebraic sets is the same as the class of hereditarily ordinal definable sets; that is, $\mathrm{HOA}=\mathrm{HOD}$. Moreover, we show that every algebraic model of $\mathrm{ZF}$ is actually pointwise definable. Finally, we consider the implicitly constructible universe Imp—an algebraic analogue of the constructible universe—which is obtained by iteratively (...) adding not only the sets that are definable over what has been built so far, but also those that are algebraic over the existing structure. While we know that $\mathrm{Imp}$ can differ from $L$, the subtler properties of this new inner model are just now coming to light. Many questions remain open. (shrink)

We describe an explicit construction of algebraic models for theories with non-standard elements either with classical or constructive logic. The corresponding truthvalue algebra in our construction is a complete algebra of subsets of some concrete decidable set. This way we get a quite finitistic notion of true which reflects a notion of the deducibility of a given theory. It enables us to useconstructive, proof-theoretical methods for theories with non-standard elements. It is especially useful in the case of theories (...) with constructive logic where algorithmic properties are essential. (shrink)

The logic DAI of demodalised analytic implication has been introduced by J.M. Dunn as a variation on a time-honoured logical system by C.I. Lewis’ student W.T. Parry. The main tenet underlying this logic is that no implication can be valid unless its consequent is “analytically contained” in its antecedent. DAI has been investigated both proof-theoretically and model-theoretically, but no study so far has focussed on DAI from the viewpoint of abstract algebraic logic. We provide several different algebraic semantics for (...) DAI, showing their equivalence with the known semantics by Dunn and Epstein. We also show that DAI is algebraisable and we identify its equivalent quasivariety semantics. This class turns out to be a linguistic and axiomatic expansion of involutive bisemilattices, a subquasivariety of which forms the algebraic counterpart of Paraconsistent Weak Kleene logic. This fact sheds further light on the relationship between containment logics and logics of nonsense. (shrink)

Computable model theory, also called effective or recursive model theory, studies algorithmic properties of mathematical structures, their relations, and isomorphisms. These properties can be described syntactically or semantically. One of the major tasks of computable model theory is to obtain, whenever possible, computability-theoretic versions of various classical model-theoretic notions and results. For example, in the 1950's, Fröhlich and Shepherdson realized that the concept of a computable function can make van der Waerden's intuitive notion of (...) an explicit field precise. This led to the notion of a computable structure. In 1960, Rabin proved that every computable field has a computable algebraic closure. However, not every classical result “effectivizes”. Unlike Vaught's theorem that no complete theory has exactly two nonisomorphic countable models, Millar's and Kudaibergenov's result establishes that there is a complete decidable theory that has exactly two nonisomorphic countable models with computable elementary diagrams. In the 1970's, Metakides and Nerode [58], [59] and Remmel [71], [72], [73] used more advanced methods of computability theory to investigate algorithmic properties of fields, vector spaces, and other mathematical structures. (shrink)

We introduce a new sheaf-theoretic construction called the ideal completion of a category and investigate its logical properties. We show that it satisfies the axioms for a category of classes in the sense of Joyal and Moerdijk [17], so that the tools of algebraic set theory can be applied to produce models of various elementary set theories. These results are then used to prove the conservativity of different set theories over various classical and constructive type theories.

This is a review of those aspects of the theory of varieties of Boolean algebras with operators that emphasise connections with modal logic and structural properties that are related to natural properties of logical systems.It begins with a survey of the duality that exists between BAO's and relational structures, focusing on the notions of bounded morphisms, inner substructures, disjoint and bounded unions, and canonical extensions of structures that originate in the study of validity-preserving operations on Kripke frames. This duality is (...) then applied to polymodal propositional logics having finitary intensional connectives that generalise the Box and Diamond connectives of unary modal logic. Issues discussed include validity in canonical structures, completeness under the relational semantics, and characterisations of logics by elementary classes of structures and by finite structures.It turns out that a logic is strongly complete for the relational semantics if the variety of algebras it defines is complex, which means that every algebra in the variety is embeddable into a full powerset algebras that is also in the variety. A hitherto unpublished formulation and proof of this is given that applies to quasi-varieties. This is followed by an algebraic demonstration that the temporal logic of Dedekind complete linear orderings defines a complex variety, adapting Gabbay's model-theoretic proof that this logic is strongly complete. (shrink)

We establish, generalizing Di Nola and Lettieri’s categorical equivalence, a Morita-equivalence between the theory of lattice-ordered abelian groups and that of perfect MV-algebras. Further, after observing that the two theories are not bi-interpretable in the classical sense, we identify, by considering appropriate topos-theoretic invariants on their common classifying topos, three levels of bi-interpretability holding for particular classes of formulas: irreducible formulas, geometric sentences, and imaginaries. Lastly, by investigating the classifying topos of the theory of perfect MV-algebras, we obtain various (...) results on its syntax and semantics also in relation to the cartesian theory of the variety generated by Chang’s MV-algebra, including a concrete representation for the finitely presentable models of the latter theory as finite products of finitely presentable perfect MV-algebras. Among the results established on the way, we mention a Morita-equivalence between the theory of lattice-ordered abelian groups and that of cancellative lattice-ordered abelian monoids with bottom element. (shrink)

The gravitational hierarchy problem—why gravity is ~10^45 times weaker than electromagnetism at the electron mass scale—has resisted parameter-free resolution despite decades of effort in supersymmetry, extra-dimension models, and warped geometry frameworks. All existing approaches introduce new degrees of freedom or symmetry principles without deriving the gravitational coupling constant alpha_G = G m_e^2 / (hbar c) from first principles. -/- This paper derives alpha_G solely from the Tier-1 axioms of Cognitional Mechanics (CM) and the algebraic structure of M_3(C), the minimal noncommutative (...) finite-dimensional C*-algebra. The principal result is alpha_G = alpha^(n(2n+1)) * sqrt(n(n+1)/(2n+1)) with n=3, yielding alpha_G^(CM) = 1.75192 x 10^-45. All factors—the exponent 21, numerator 12, and denominator 7—emerge purely from the dimension parameter n; no empirical fitting is performed. -/- The zeroth-order residual against CODATA 2022 is 6.1 x 10^-5, within the 5.5 x 10^-4 experimental scatter band of independent G measurements. The leading correction C_3^G = -(delta^2 - delta/(2*sqrt(n))) * alpha^2, derived from Tier-1 constants delta^2 = n/2 and n alone, reduces the residual to 5.5 x 10^-8, well below current experimental resolution. This establishes alpha_G as a Tier-1 structural invariant of M_3(C) and provides an algebraic resolution to the gravitational hierarchy problem. The CM-implied value G_implied = 6.67471 x 10^-11 m^3 kg^-1 s^-2 serves as a theoretical convergence point for future precision G metrology. (shrink)

In Andreka-Nemeti [1] the class ST r of all small trees over C is dened for an arbitrary category C. Throughout the present paper C de- notes an arbitrary category. In Def. 4 of [1] on p. 367 the injectivity relation j= ) is dened. Intuitively the members of ST r represent the formulas and j= represents the validity relation be- tween objects of C considered as models and small trees of C considered as formulas. If ' 2 ST r (...) and a 2 Ob C then the statement a j= ' is associated to the model theoretic statement \the formula ' is valid in the model a". It is proved there that the Los lemma is true in every category C if we use the above quoted concepts. To this the notion of an ultra- product Pi2Iai=U of objects 2 IOb C of C if we use the above quoted concepts. To this the notion of an ultraproduct Pi2Iai=U of objects 2 IOb C of C is dened in [1], in [2] and in [7] Def. 12. Then the problem was asked there \for which categories is the characterization theorem of axiomatizable hulls of classes of models Mod T h K = Uf U p K true?", where the operators Uf and U p on classes of models is dened on p. 319 of the book [3]. Of course, here in the denition of Uf and U p on classes K Ob C of objects of C we have to replace the standard notion of ultraproducts of models by the above quoted category theoretic ultraproduct Pi2Iai=U of objects of C. That is for any C and K Ob C we dene U p K exactly as in [2] p. 136, but a more detailed denition is found in [7] Def. 17. (shrink)

In the first section of this paper I present a well known objection to meaning holism, according to which holism is inconsistent with natural language being learnable. Then I show that the objection fails if language acquisition includes stages of partial grasp of the meaning of at least some expressions, and I argue that standard model theoretic semantics cannot fully capture such stages. In the second section the above claims are supported through a review of current research into (...) language acquisition. Finally, in the third section it is argued that contemporary algebraic logical systems consist in a superior formal vehicle through which to capture stages of partial grasp of meaning; this claim is supported by concrete examples. (shrink)

We study finitely generated free Heyting algebras from a topological and from a model theoretic point of view. We review Bellissima’s representation of the finitely generated free Heyting algebra; we prove that it yields an embedding in the profinite completion, which is also the completion with respect to a naturally defined metric. We give an algebraic interpretation of the Kripke model used by Bellissima as the principal ideal spectrum and show it to be first order interpretable (...) in the Heyting algebra, from which several model theoretic and algebraic properties are derived. In particular, we prove that a free finitely generated Heyting algebra has only one set of free generators, which is definable in it. As a consequence its automorphism group is the permutation group over its generators. (shrink)

We shall present two novel ways of deriving simply typed combinatory models. These are of interest in a constructive setting. First we look at extension models, which are certain subalgebras of full function space models. Then we shall show how the space of singletons of a combinatory model can itself be made into one. The two and the algebras in between will have many common features. We use these two constructions in proving: There is a model of constructive (...) set theory in which every closed extensional theory of simple typed combinatory logic is the theory of a full function space model. (shrink)

What makes our utterances mean what they do? In this work I formulate and justify a structural constraint on possible answers to this key question in the philosophy of language, and I show that accepting this constraint leads naturally to the adoption of an algebraic formalization of truth-theoretic semantics. I develop such a formalization, and show that applying algebraic methodology to the theory of meaning yields important insights into the nature of language. ;The constraint I propose is, roughly, this: (...) the meaning of an utterance of a natural language sentence is derived from the place of that sentence within a system that includes other sentences, and is structured in virtue of primitive semantic facts about complete sentences. This constraint calls for a formal semantics program where the meaning of natural language sentences is represented by an appropriate assignment of the elements of an algebraic structure to sentences, an assignment that represents facts concerning complete sentences. I call the above constraint 'The Algebraic Thesis', and the corresponding formal semantics program 'Algebraic Semantics.' ;I introduce AT by carving it out of the holistic views of language of Quine and Davidson, and I show that it is independent of other important features of these philosophers' views. I then argue for AT, taking into account recent work by Brandom, Dummett, Fodor and Lepore, Gaifman and Perry. In developing Algebraic Semantics I present structures of two basic types: Boolean algebras and cylindric algebras; these structures are construed in the context of AT in a novel way: they are treated as applying to classes of sentences as numbers apply to physical objects in measurement. Applying algebraic methodology to formal semantics and to the theory of meaning, I develop these results: ; An account of the semantics of necessity and possibility that avoids both Quine's dismissal of these notions and their reduction by David Lewis to quantification over possible worlds; ; The application of the model-theoretic notion of expansion to capture the process of our learning progressively more of the meaning of expressions in our first languages. (shrink)

We combine computable structure theory and algorithmic learning theory to study learning of families of algebraic structures. Our main result is a model-theoretic characterization of the learning type InfEx_\iso, consisting of the structures whose isomorphism types can be learned in the limit. We show that a family of structures is InfEx_\iso-learnable if and only if the structures can be distinguished in terms of their \Sigma^2_inf-theories. We apply this characterization to familiar cases and we show the following: there is (...) an infinite learnable family of distributive lattices; no pair of Boolean algebras is learnable; no infinite family of linear orders is learnable. (shrink)

In this paper the following theorem is proved regarding groups of finite Morley rank which are perfect central extensions of quasisimple algebraic groups.Theorem1.Let G be a perfect group of finite Morley rank and let C0be a definable central subgroup of G such that G/C0is a universal linear algebraic group over an algebraically closed field; that is G is a perfect central extension of finite Morley rank of a universal linear algebraic group. Then C0= 1.Contrary to an impression which exists in (...) some circles, the center of the universal extension of a simple algebraic group, as an abstract group, is not finite in general. Thus the finite Morley rank assumption cannot be omitted.Corollary1.Let G be a perfect group of finite Morley rank such that G/Z(G) is a quasisimple algebraic group. Then G is an algebraic group. In particular, Z(G) is finite([4],Section27.5).An understanding of central extensions of quasisimple linear algebraic groups which are groups of finite Morley rank is necessary for the classification oftamesimpleK*-groupsof finite Morley rank, which constitutes an approach to the Cherlin-Zil’ber conjecture. For this reason the theorem above and its corollary were proven in [1] (Theorems 4.1 and 4.2) under the assumption oftameness, which simplifies the argument considerably. The result of the present paper shows that this assumption can be dropped. The main line of argument is parallel to that in [1]; the absence of the tameness assumption will be countered by a model-theoretic result and results fromK-theory. The model-theoretic result places limitations on definability in stable fields, and may possibly be relevant to eliminating certain other uses of tameness. (shrink)

Let ℛ be an o-minimal expansion of a real closed field R. We continue here the investigation we began in [11] of differentiability with respect to the algebraically closed field [Formula: see text]. We develop the basic theory of such K-differentiability for definable functions of several variables, proving theorems on removable singularities as well as analogues of the Weierstrass preparation and division theorems for definable functions. We consider also definably meromorphic functions and prove that every definable function which is meromorphic (...) on Kn is necessarily a rational function. We finally discuss definable analogues of complex analytic manifolds, with possible connections to the model theoretic work on compact complex manifolds, and present two examples of "nonstandard manifolds" in our setting. (shrink)

As a continuation of the work of the third author in [5], we make further observations on the features of Galois cohomology in the general model theoretic context. We make explicit the connection between forms of definable groups and first cohomology sets with coefficients in a suitable automorphism group. We then use a method of twisting cohomology (inspired by Serre’s algebraic twisting) to describe arbitrary fibres in cohomology sequences—yielding a useful “finiteness” result on cohomology sets.Applied to the special (...) case of differential fields and Kolchin’s constrained cohomology, we complete results from [3] by proving that the first constrained cohomology set of a differential algebraic group over a bounded, differentially large, field is countable. (shrink)

We introduce the notion of n-nuanced MV-algebra by performing a Łukasiewicz–Moisil nuancing construction on top of MV-algebras. These structures extend both MV-algebras and Łukasiewicz–Moisil algebras, thus unifying two important types of structures in the algebra of logic. On a logical level, n-nuanced MV-algebras amalgamate two distinct approaches to many valuedness: that of the infinitely valued Łukasiewicz logic, more related in spirit to the fuzzy approach, and that of Moisil n-nuanced logic, which is more concerned with nuances of truth (...) rather than truth degree. We study n-nuanced MV-algebras mainly from the algebraic and categorical points of view, and also consider some basic model-theoretic aspects. The relationship with a suitable notion of n-nuanced ordered group via an extension of the Γ construction is also analyzed. (shrink)

An algebraization of the notion of topology has been proposed more than 70 years ago in a classical paper by McKinsey and Tarski, leading to an area of research still active today, with connections to algebra, geometry, logic and many applications, in particular, to modal logics. In McKinsey and Tarski’s setting the model theoretical notion of homomorphism does not correspond to the notion of continuity. We notice that the two notions correspond if instead we consider a preorder relation (...) ⊑\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ \sqsubseteq $$\end{document} defined by a⊑b\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$a \sqsubseteq b$$\end{document} if a is contained in the topological closure of b, for a, b subsets of some topological space. A specialization poset is a partially ordered set endowed with a further coarser preorder relation ⊑\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ \sqsubseteq $$\end{document}. We show that every specialization poset can be embedded in the specialization poset naturally associated to some topological space, where the order relation corresponds to set-theoretical inclusion. Specialization semilattices are defined in an analogous way and the corresponding embedding theorem is proved. Specialization semilattices have the amalgamation property. Some basic topological facts and notions are recovered in this apparently very weak setting. The interest of these structures arises from the fact that they also occur in many rather disparate contexts, even far removed from topology. (shrink)

This paper completes the algebraic unification of the atomic constituents -- electron, proton, and neutron -- within the Cognitional Mechanics (CM) framework. The three atomic substances are shown to be not ontological primitives but distinct spectral projection modes of the single algebra M₃(ℂ). The automorphism group Aut(M₃(ℂ)) ≅ SU(3)/ℤ₃ is derived internally from Axioms A1-A2 via the Skolem-Noether theorem, without external introduction of SU(3). The isospin symmetry SU(2)_isospin is uniquely identified as the SU(2)₁₂ subalgebra. The dimension n=3 is proved (...) unique: n=2 cannot generate the required roots, while n≥4 violates the Redundancy Exclusion Axiom A4. The neutron is established as ontologically non-independent: it is the T₃=-1/2 projection of the SU(2)₁₂ isospin doublet, with no independent Tier-2 existence separate from the proton. The nucleon magnetic moment ratio is derived in two layers. The first-order prediction μₚ/|μₙ| = 1.4630 (residual 0.21% against experiment 1.4599) follows from the correction coefficient Φ₁Φ₂/n², derived from the structural identity [Tr_adj(H²)]²/Tr_adj(H⁴) = Φ₂, which holds for ALL traceless Cartan generators via the pure algebraic identity a⁴+b⁴+(a+b)⁴ = 2(a²+ab+b²)² combined with the A1 trace-zero condition. The second-order correction δ₁ = αs·4/39, with normalization constant Φ₃ = 13 uniquely forced by the CM Self-Containment principle and the internal structure of Axiom A2, reduces the residual to 0.006%, yielding μₚ/|μₙ| = 1.45999. No free parameters enter at any stage. The Standard Model gauge structure SU(3)×SU(2)×U(1) is subsumed as the Tier-3 image of M₃(ℂ)⊕ℂ under projection, not negated. -/- Published on March 29, 2026 DOI: 10.5281/zenodo.19301842. (shrink)

In this paper we study the relations between the fragment L of classical logic having just conjunction and disjunction and the variety D of distributive lattices, within the context of Algebraic Logic. We prove that these relations cannot be fully expressed either with the tools of Blok and Pigozzi's theory of algebraizable logics or with the use of reduced matrices for L. However, these relations can be naturally formulated when we introduce a new notion of model of a sequent (...) calculus. When applied to a certain natural calculus for L, the resulting models are equivalent to a class of abstract logics (in the sense of Brown and Suszko) which we call distributive. Among other results, we prove that D is exactly the class of the algebraic reducts of the reduced models of L, that there is an embedding of the theories of L into the theories of the equational consequence (in the sense of Blok and Pigozzi) relative to D, and that for any algebra A of type (2,2) there is an isomorphism between the D-congruences of A and the models of L over A. In the second part of this paper (which will be published separately) we will also apply some results to give proofs with a logical flavour for several new or well-known lattice-theoretical properties. (shrink)

A graph-theoretic account of fibring of logics is developed, capitalizing on the interleaving characteristics of fibring at the linguistic, semantic and proof levels. Fibring of two signatures is seen as a multi-graph (m-graph) where the nodes and the m-edges include the sorts and the constructors of the signatures at hand. Fibring of two models is a multi-graph (m-graph) where the nodes and the m-edges are the values and the operations in the models, respectively. Fibring of two deductive systems is (...) an m-graph whose nodes are language expressions and the m-edges represent the inference rules of the two original systems. The sobriety of the approach is confirmed by proving that all the fibring notions are universal constructions. This graph-theoretic view is general enough to accommodate very different fibrings of propositional based logics encompassing logics with non-deterministic semantics, logics with an algebraic semantics, logics with partial semantics and substructural logics, among others. Soundness and weak completeness are proved to be preserved under very general conditions. Strong completeness is also shown to be preserved under tighter conditions. In this setting, the collapsing problem appearing in several combinations of logic systems can be avoided. (shrink)