We show that an infinite group G definable in a $1$-h-minimal field admits a strictly K-differentiable structure with respect to which G is a (weak) Lie group, and we show that definable local subgroups sharing the same Lie algebra have the same germ at the identity. We conclude that infinite fields definable in K are definably isomorphic to finite extensions of K and that $1$-dimensional groups definable in K are finite-by-abelian-by-finite. Along the way, we develop the basic theory of definable weak K-manifolds and definable morphisms between them.

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.

In this paper, using a propositional modal language extended with the window modality, we capture the first-order properties of various mereological theories. In this setting, $\Box \varphi $ reads all the parts (of the current object) are $\varphi $, interpreted on the models with a whole-part binary relation under various constraints. We show that all the usual mereological theories can be captured by modal formulas in our language via frame correspondence. We also correct a mistake in the existing completeness proof for a basic system of mereology by providing a new construction of the canonical model.

We ask, when is a property of a model a logical property? According to the so-called Tarski–Sher criterion this is the case when the property is preserved by isomorphisms. We relate this to model-theoretic characteristics of abstract logics in which the model class is definable. This results in a graded concept of logicality in the terminology of Sagi [46]. We investigate which characteristics of logics, such as variants of the Löwenheim–Skolem theorem, Completeness theorem, and absoluteness, are relevant from the logicality point of view, continuing earlier work by Bonnay, Feferman, and Sagi. We suggest that a logic is the more logical the closer it is to first order logic. We also offer a refinement of the result of McGee that logical properties of models can be expressed in $L_{\infty \infty }$ if the expression is allowed to depend on the cardinality of the model, based on replacing $L_{\infty \infty }$ by a “tamer” logic.

We study the first-order theories of some natural and important classes of coloured trees, including the four classes of trees whose paths have the order type respectively of the natural numbers, the integers, the rationals, and the reals. We develop a technique for approximating a tree as a suitably coloured linear order. We then present the first-order theories of certain classes of coloured linear orders and use them, along with the approximating technique, to establish complete axiomatisations of the four classes of trees mentioned above.

A complete list of one dimensional groups definable in the p-adic numbers is given, up to a finite index subgroup and a quotient by a finite subgroup.

Inquisitive modal logic, InqML, is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that they are interested in. Technically, InqML fits within the family of logics based on team semantics. From a model-theoretic perspective, it takes us a step in the direction of monadic second-order logic, as inquisitive modal operators involve quantification over sets of worlds. We introduce and investigate the natural notion of bisimulation equivalence in the setting of InqML. We compare the expressiveness of InqML and first-order logic in the context of relational structures with two sorts, one for worlds and one for information states, and characterise inquisitive modal logic as the bisimulation invariant fragment of first-order logic over various natural classes of two-sorted structures.

In the literature, there have been several methods and definitions for working out whether two theories are “equivalent” (essentially the same) or not. In this article, we do something subtler. We provide a means to measure distances (and explore connections) between formal theories. We introduce two natural notions for such distances. The first one is that of axiomatic distance, but we argue that it might be of limited interest. The more interesting and widely applicable notion is that of conceptual distance which measures the minimum number of concepts that distinguish two theories. For instance, we use conceptual distance to show that relativistic and classical kinematics are distinguished by one concept only.

This essay discusses rules and semantic clauses relating to Substitution—Leibniz’s law in the conjunctive-implicational form $s\dot{ = }t \wedge A\left( s \right) \to A\left( t \right)$—as these are put forward in Priest’s books In Contradiction and An Introduction to Non-Classical Logic: From If to Is. The stated rules and clauses are shown to be too weak in some cases and too strong in others. New ones are presented and shown to be correct. Justification for the various rules is probed and it is argued that Substitution ought to fail.

We consider the structure $({\Bbb Z}, + ,0,|_{p_1 } , \ldots ,|_{p_n } )$, where $x|_p y$ means $v_p \left( x \right) \leqslant v_p \left( y \right)$ and vp is the p-adic valuation. We prove that this structure has quantifier elimination in a natural expansion of the language of abelian groups, and that it has dp-rank n. In addition, we prove that a first order structure with universe ${\Bbb Z}$ which is an expansion of $({\Bbb Z}, + ,0)$ and a reduct of $({\Bbb Z}, + ,0,|_p )$ must be interdefinable with one of them. We also give an alternative proof for Conant’s analogous result about $({\Bbb Z}, + ,0, < )$.

We introduce a notion of the space of types in positive model theory based on Stone duality for distributive lattices. We show that this space closely mirrors the Stone space of types in the full first-order model theory with negation (Tarskian model theory). We use this to generalise some classical results on countable models from the Tarskian setting to positive model theory.

Given two structures ${\cal M}$ and ${\cal N}$ on the same domain, we say that ${\cal N}$ is a reduct of ${\cal M}$ if all $\emptyset$-definable relations of ${\cal N}$ are $\emptyset$-definable in ${\cal M}$. In this article the reducts of the Henson digraphs are classified. Henson digraphs are homogeneous countable digraphs that omit some set of finite tournaments. As the Henson digraphs are ${\aleph _0}$-categorical, determining their reducts is equivalent to determining the closed supergroups G ≤ Sym(ℕ) of their automorphism groups.

A consequence of the classification is that there are ${2^{{\aleph _0}}}$ pairwise noninterdefinable Henson digraphs which have no proper nontrivial reducts. Taking their automorphisms groups gives a positive answer to a question of Macpherson that asked if there are ${2^{{\aleph _0}}}$ pairwise nonconjugate maximal-closed subgroups of Sym(ℕ). By the reconstruction results of Rubin, these groups are also nonisomorphic as abstract groups.

We study random relational structures that are relatively exchangeable—that is, whose distributions are invariant under the automorphisms of a reference structure ${M}$. When ${M}$ is ultrahomogeneous and has trivial definable closure, all random structures relatively exchangeable with respect to $m$ satisfy a general Aldous–Hoover-type representation. If ${M}$ also satisfies the n-disjoint amalgamation property (n-DAP) for all $n \ge 1$, then relatively exchangeable structures have a more precise description whereby each component depends locally on ${M}$.

We show that if a first-order structure ${\cal M}$, with universe ℤ, is an expansion of (ℤ,+,0) and a reduct of (ℤ,+,<,0), then ${\cal M}$ must be interdefinable with (ℤ ,+,0) or (ℤ ,+,<,0).

A relational structure is called reversible iff each bijective endomorphism (condensation) of that structure is an automorphism. We show that reversibility is an invariant of some forms of L∞ω −bi-interpretability, implying that the condensation monoids of structures are topologically isomorphic. Applying these results, we prove that, in particular, all orbits of ultrahomogeneous tournaments and reversible ultrahomogeneous m-uniform hypergraphs are reversible relations and that the same holds for the orbits of reversible ultrahomogeneous digraphs definable by formulas which are not R-negative.

We discuss the connection between decidability of a theory of a large algebraic extensions of ${\Bbb Q}$ and the recursiveness of the field as a subset of a fixed algebraic closure. In particular, we prove that if an algebraic extension K of ${\Bbb Q}$ has a decidable existential theory, then within any fixed algebraic closure $\widetilde{\Bbb Q}$ of ${\Bbb Q}$, the field K must be conjugate over ${\Bbb Q}$ to a field which is recursive as a subset of the algebraic closure. We also show that for each positive integer e there are infinitely many e-tuples $\sigma \in {\text{Gal}}\left( {\Bbb Q} \right)^e $ such that the field $\widetilde{\Bbb Q}\left( \sigma \right)$ is primitive recursive in $\widetilde{\Bbb Q}$ and its elementary theory is primitive recursively decidable. Moreover, $\widetilde{\Bbb Q}\left( \sigma \right)$ is PAC and ${\text{Gal}}\left( {\widetilde{\Bbb Q}\left( \sigma \right)} \right)$ is isomorphic to the free profinite group on e generators.

Let ($\rm L$;C) be the (up to isomorphism unique) countable homogeneous structure carrying a binary branching C-relation. We study the reducts of ($\rm L$;C), i.e., the structures with domain $\rm L$ that are first-order definable in ($\rm L$;C). We show that up to existential interdefinability, there are finitely many such reducts. This implies that there are finitely many reducts up to first-order interdefinability, thus confirming a conjecture of Simon Thomas for the special case of ($\rm L$;C). We also study the endomorphism monoids of such reducts and show that they fall into four categories.

Assume that $G$ is a group covered by countably many sets $X_n,\,n\,{<}\,\omega$. It is proved that $G$ is generated in two or three steps by a small number of the sets $X_n$. These results are generalized for countable coverings of types and countable colourings of graphs.