We generalize a well-known theorem binding the elementary equivalence relation on the level of PAC fields and the isomorphism type of their absolute Galois groups. Our results concern two cases: saturated PAC structures and nonsaturated PAC structures.

We consider semi‐algebraic sets and properties of these sets that are expressible by sentences in first‐order logic over the reals. We are interested in first‐order properties that are invariant under topological transformations of the ambient space. Two semi‐algebraic sets are called topologically elementarily equivalent if they cannot be distinguished by such topological first‐order sentences. So far, only semi‐algebraic sets in one and two‐dimensional space have been considered in this context. Our contribution is a natural characterisation of topological elementary (...) class='Hi'>equivalence of regular closed semi‐algebraic sets in three‐dimensional space, extending a known characterisation for the two‐dimensional case. Our characterisation is based on the local topological behaviour of semi‐algebraic sets and the key observation that topologically elementarily equivalent sets can be transformed into each other by means of geometric transformations, each of them mapping a set to a first‐order indistinguishable one. (shrink)

This paper is a contribution to the study of equality-free logic, that is, first-order logic without equality. We mainly devote ourselves to the study of algebraic characterizations of its relation of elementary equivalence by providing some Keisler-Shelah type ultrapower theorems and an Ehrenfeucht-Fraïssé type theorem. We also give characterizations of elementary classes in equality-free logic. As a by-product we characterize the sentences that are logically equivalent to an equality-free one.

We characterize elementary equivalences and inclusions between von Neumann regular real closed rings in terms of their boolean algebras of idempotents, and prove that their theories are always decidable. We then show that, under some hypotheses, the map sending an L-structure R to the L-structure of definable functions from R n to R preserves elementary inclusions and equivalences and gives a structure with a decidable theory whenever R is decidable. We briefly consider structures of definable functions satisfying an (...) extra condition such as continuity. (shrink)

Our work is a contribution to the model theory of fuzzy predicate logics. In this paper we characterize elementary equivalence between models of fuzzy predicate logic using elementary mappings. Refining the method of diagrams we give a solution to an open problem of Hájek and Cintula (J Symb Log 71(3):863–880, 2006, Conjectures 1 and 2). We investigate also the properties of elementary extensions in witnessed and quasi-witnessed theories, generalizing some results of Section 7 of Hájek and (...) Cintula (J Symb Log 71(3):863–880, 2006) and of Section 4 of Cerami and Esteva (Arch Math Log 50(5/6):625–641, 2011) to non-exhaustive models. (shrink)

Let D be a division ring such that the number of conjugacy classes of the multiplicative group D ∗ is equal to the power of D ∗ . Suppose that H is the group GL or PGL, where V is a vector space of infinite dimension ϰ over D . We prove, in particular, that, uniformly in κ and D , the first-order theory of H is mutually syntactically interpretable with the theory of the two-sorted structure 〈κ,D〉 in the second-order (...) logic with quantification over arbitrary relations of power ⩽κ . A certain analogue of this results is proved for the groups ΓL and PΓL . These results imply criteria of elementary equivalence for infinite-dimensional classical groups of types H= ΓL , PΓL , GL, PGL over division rings, and solve, for these groups, a problem posed by U. Felgner. It follows from the criteria that if H≡H then κ 1 and κ 2 are second-order equivalent as sets. (shrink)

We investigate topological properties of subsets S of the real plane, expressed by first-order logic sentences in the language of the reals augmented with a binary relation symbol for S. Two sets are called topologically elementary equivalent if they have the same such first-order topological properties. The contribution of this paper is a natural and effective characterization of topological elementary equivalence of closed semi-algebraic sets.

We investigate topological properties of subsets S of the real plane, expressed by first-order logic sentences in the language of the reals augmented with a binary relation symbol for S. Two sets are called topologically elementary equivalent if they have the same such first-order topological properties. The contribution of this paper is a natural and effective characterization of topological elementary equivalence of closed semi-algebraic sets.

We introduce prime products as a generalization of ultraproducts for positive logic. Prime products are shown to satisfy a version of Łoś’s Theorem restricted to positive formulas, as well as the following variant of the Keisler Isomorphism Theorem: under the generalized continuum hypothesis, two models have the same positive theory if and only if they have isomorphic prime powers of ultrapowers.

A sentence of the usual language of set theory is said to be stratified if it is obtained by “erasing” type indices in a sentence of the language of Russell's Simple Theory of Types. In this paper we give an alternative presentation of a proof the ambiguity theorem stating that any provable stratified sentence has a stratified proof. To this end, we introduce a new set of ambiguity axioms, inspired by Fraïssé's characterization of elementary equivalence; these axioms can (...) be naturally used to give different proofs of the ambiguity theorem . MSC: 03B15, 03F50, 03F55. (shrink)

THEOREM 1. (⋄ ℵ 1 ) If B is an infinite Boolean algebra (BA), then there is B 1 such that $|\operatorname{Aut} (B_1)| \leq B_1| = \aleph_1$ and $\langle B_1, \operatorname{Aut} (B_1)\rangle \equiv \langle B, \operatorname{Aut}(B)\rangle$ . THEOREM 2. (⋄ ℵ 1 ) There is a countably compact logic stronger than first-order logic even on finite models. This partially answers a question of H. Friedman. These theorems appear in §§ 1 and 2. THEOREM 3. (a) (⋄ ℵ 1 ) If (...) B is an atomic ℵ 1 -saturated infinite BA, ψ ε L ω 1ω and $\langle B, \operatorname{Aut} (B)\rangle \models\psi$ then there is B 1 such that $|\operatorname{Aut}(B_1)| \leq |B_1| = \aleph_1$ and $\langle B_1, \operatorname{Aut}(B_1)\rangle\models\psi$ . In particular if B is 1-homogeneous so is B 1 . (b) (a) holds for B = P(ω) even if we assume only CH. (shrink)

There is a natural map which assigns to every modelU of typeτ, (U ε Stτ) a groupG (U) in such a way that elementarily equivalent models are mapped into isomorphic groups.G(U) is a subset of a collection whose members are called Fraisse arrows (they are decreasing sequences of sets of partial isomorphisms) and which arise in connection with the Fraisse characterization of elementary equivalence. LetEC λ U be defined as {U εStr τ: ℬ ≡U and |ℬ|=λ; thenEG λ (...) U can be faithfully (i.e. 1-1) represented onto G(U) ×π *, whereπ *, is a collection of partitions over λ∪λ2∪.. (shrink)

We show that there are models and such that elementarily embeds into but their ultrafilter extensions and are not elementarily equivalent.

An elementary notion of gauge equivalence is introduced that does not require any Lagrangian or Hamiltonian apparatus. It is shown that in the special case of theories, such as general relativity, whose symmetries can be identified with spacetime diffeomorphisms this elementary notion has many of the same features as the usual notion. In particular, it performs well in the presence of asymptotic boundary conditions.

Aim of this paper is to provide a self-contained presentation of the natural equivalence between MV-algebras and lattice-ordered abelian groups with strong unit.

We generalize and extend the class of Sahlqvist formulae in arbitrary polyadic modal languages, to the class of so called inductive formulae. To introduce them we use a representation of modal polyadic languages in a combinatorial style and thus, in particular, develop what we believe to be a better syntactic approach to elementary canonical formulae altogether. By generalizing the method of minimal valuations à la Sahlqvist–van Benthem and the topological approach of Sambin and Vaccaro we prove that all inductive (...) formulae are elementary canonical and thus extend Sahlqvist’s theorem over them. In particular, we give a simple example of an inductive formula which is not frame-equivalent to any Sahlqvist formula. Then, after a deeper analysis of the inductive formulae as set-theoretic operators in descriptive and Kripke frames, we establish a somewhat stronger model-theoretic characterization of these formulae in terms of a suitable equivalence to syntactically simpler formulae in the extension of the language with reversive modalities. Lastly, we study and characterize the elementary canonical formulae in reversive languages with nominals, where the relevant notion of persistence is with respect to discrete frames. (shrink)

In this paper we study abstract elementary classes using infinitary logics and prove a number of results relating them. For example, if is an a.e.c. with Löwenheim–Skolem number κ then is closed under L∞,κ+-elementary equivalence. If κ=ω and has finite character then is closed under L∞,ω-elementary equivalence. Analogous results are established for . Galois types, saturation, and categoricity are also studied. We prove, for example, that if is finitary and λ-categorical for some infinite λ then (...) there is some σLω1,ω such that and contain precisely the same models of cardinality at least λ. (shrink)

In terms of validity in Kripke frames, a modal formula expresses a universal monadic second-order condition. Those modal formulae which are equivalent to first-order conditions are called elementary. Modal formulae which have a certain persistence property which implies their validity in all canonical frames of modal logics axiomatized with them, and therefore their completeness, are called canonical. This is a survey of a recent and ongoing study of the class of elementary and canonical modal formulae. We summarize main (...) ideas and results, and outline further research perspectives. (shrink)

In this paper we study abstract elementary classes with Löwenheim-Skolem number $\kappa$ , where $\kappa$ is cofinal with $\omega$ , which have finite character. We generalize results obtained by Kueker for $\kappa=\omega$ . In particular, we show that $\mathbb{K}$ is closed under $L_{\infty,\kappa}$ -elementary equivalence and obtain sufficient conditions for $\mathbb{K}$ to be $L_{\infty,\kappa}$ -axiomatizable. In addition, we provide an example to illustrate that if $\kappa$ is uncountable regular then $\mathbb{K}$ is not closed under $L_{\infty,\kappa}$ -elementary (...) equivalence. (shrink)

In terms of validity in Kripke frames, a modal formula expresses a universal monadic second-order condition. Those modal formulae which are equivalent to first-order conditions are called \emph{elementary}. Modal formulae which have a certain persistence property which implies their validity in all canonical frames of modal logics axiomatized with them, and therefore their completeness, are called \emph{canonical}. This is a survey of a recent and ongoing study of the class of elementary and canonical modal formulae. We summarize main (...) ideas and results, and outline further research perspectives. (shrink)

We will study patterns which occur when considering how Σ 1 -elementary substructures arise within hierarchies of structures. The order in which such patterns evolve will be seen to be independent of the hierarchy of structures provided the hierarchy satisfies some mild conditions. These patterns form the lowest level of what we call patterns of resemblance . They were originally used by the author to verify a conjecture of W. Reinhardt concerning epistemic theories 449–460; Ann. Pure Appl. Logic, to (...) appear), but their relationship to axioms of infinity and usefulness for ordinal analysis were manifest from the beginning. This paper is the first part of a series which provides an introduction to an extensive program including the ordinal analysis of set theories. Future papers will conclude the introduction and establish, among other things, that notations we will derive from the patterns considered here represent the proof-theoretic ordinal of the theory KPℓ 0 or, equivalently, Π 1 1 −CA 0. (shrink)

We characterize the elementary classes generated from a distinguished subclass closing by taking direct products and elementary equivalence. In the second part we give the same characterization in terms of atomic Boolean products. In the last part, we study the cases when the class of Boolean products is elementary but is not given by a discriminator.

Recent work has considered the problem of extending to the case of iterated belief change the so-called `Harper Identity' (HI), which defines single-shot contraction in terms of single-shot revision. The present paper considers the prospects of providing a similar extension of the Levi Identity (LI), in which the direction of definition runs the other way. We restrict our attention here to the three classic iterated revision operators--natural, restrained and lexicographic, for which we provide here the first collective characterisation in the (...) literature, under the appellation of `elementary' operators. We consider two prima facie plausible ways of extending (LI). The first proposal involves the use of the rational closure operator to offer a `reductive' account of iterated revision in terms of iterated contraction. The second, which doesn't commit to reductionism, was put forward some years ago by Nayak et al. We establish that, for elementary revision operators and under mild assumptions regarding contraction, Nayak's proposal is equivalent to a new set of postulates formalising the claim that contraction by ¬A should be considered to be a kind of `mild' revision by A. We then show that these, in turn, under slightly weaker assumptions, jointly amount to the conjunction of a pair of constraints on the extension of (HI) that were recently proposed in the literature. Finally, we consider the consequences of endorsing both suggestions and show that this would yield an identification of rational revision with natural revision. We close the paper by discussing the general prospects for defining iterated revision in terms of iterated contraction. (shrink)

This note presents a very simple way of interpreting the Gini coefficient of inequality, in `equivalent' welfare terms, as the proportion of a cake of given size going to the poorer of two individuals in a two-person cake-sharing problem.