-/- Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) to various natural classes of complete metric structures (such as probability algebras, Hilbert spaces, and Banach spaces). With research in continuous first-order logic preoccupied with studying the model theory of this framework, we find a natural question calls for attention. Is there an interesting set of axioms yielding a completeness result? -/- The primary purpose (...) of this article is to show that a certain, interesting set of axioms does indeed yield a completeness result for continuous first-order logic. In particular, we show that in continuous first-order logic a set of formulae is (completely) satisfiable if (and only if) it is consistent. From this result it follows that continuous first-order logic also satisfies an approximated form of strong completeness, whereby Σ⊧φ (if and) only if Σ⊢φ ∸2−n for all n < ω. This approximated form of strong completeness asserts that if Σ⊧φ, then proofs from Σ, being finite, can provide arbitrarily better approximations of the truth of φ. -/- Additionally, we consider a different kind of question traditionally arising in model theory—that of decidability. When is the set of all consequences of a theory (in a countable, recursive language) recursive? Say that a complete theory T is decidable if for every sentence φ, the value φ T is a recursive real, and moreover, uniformly computable from φ. If T is incomplete, we say it is decidable if for every sentence φ the real number φ T o is uniformly recursive from φ, where φ T o is the maximal value of φ consistent with T. As in classical first-order logic, it follows from the completeness theorem of continuous first-order logic that if a complete theory admits a recursive (or even recursively enumerable) axiomatization then it is decidable. (shrink)

This paper is a general introduction to Positive Logic, where only what we call h-inductive sentences are under consideration, allowing the extension to homomorphisms of model-theoric notions which are classically associated to embeddings; in particular, the existentially closed models, that were primitively defined by Abraham Robinson, become here positively closed models. It accounts for recent results in this domain, and is oriented towards the positivisation of Jonsson theories.

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.

For a NIP theory T, a sufficiently saturated model ${\mathfrak C}$ of T, and an invariant (over some small subset of ${\mathfrak C}$ ) global type p, we prove that there exists a finest relatively type-definable over a small set of parameters from ${\mathfrak C}$ equivalence relation on the set of realizations of p which has stable quotient. This is a counterpart for equivalence relations of the main result of [2] on the existence of maximal stable quotients of type-definable groups (...) in NIP theories. Our proof adapts the ideas of the proof of this result, working with relatively type-definable subsets of the group of automorphisms of the monster model as defined in [3]. (shrink)

We introduce the framework of AECats, generalizing both the category of models of some first-order theory and the category of subsets of models. Any AEC and any compact abstract theory forms an AECat. In particular, we find applications in positive logic and continuous logic: the category of models of a positive or continuous theory is an AECat. The Kim–Pillay theorem for first-order logic characterizes simple theories by the properties dividing independence has. We prove a version of the Kim–Pillay theorem for (...) AECats with the amalgamation property, generalizing the first-order version and existing versions for positive logic. (shrink)

The classes stable, simple, and NSOP $_1$ in the stability hierarchy for first-order theories can be characterised by the existence of a certain independence relation. For each of them there is a canonicity theorem: there can be at most one nice independence relation. Independence in stable and simple first-order theories must come from forking and dividing (which then coincide), and for NSOP $_1$ theories it must come from Kim-dividing. We generalise this work to the framework of Abstract Elementary Categories (AECats) (...) with the amalgamation property. These are a certain kind of accessible category generalising the category of (subsets of) models of some theory. We prove canonicity theorems for stable, simple, and NSOP $_1$ -like independence relations. The stable and simple cases have been done before in slightly different setups, but we provide them here as well so that we can recover part of the original stability hierarchy. We also provide abstract definitions for each of these independence relations as what we call isi-dividing, isi-forking, and long Kim-dividing. (shrink)

We prove that the definition of supersimplicity in metric structures from [7] is equivalent to an a priori stronger variant. This stronger variant is then used to prove that if T is a supersimple Hausdorff cat then so is its theory of lovely pairs.

We prove that under reasonable assumptions, every cat (compact abstract theory) is metric, and develop some of the theory of metric cats. We generalise Morley's theorem: if a countable Hausdorff cat T has a unique complete model of density character Λ ≥ ω₁, then it has a unique complete model of density character Λ for every Λ ≥ ω₁.

A ternary relation [Formula: see text] between subsets of the big model of a complete first-order theory T is called an independence relation if it satisfies a certain set of axioms. The primary example is forking in a simple theory, but o-minimal theories are also known to have an interesting independence relation. Our approach in this paper is to treat independence relations as mathematical objects worth studying. The main application is a better understanding of thorn-forking, which turns out to be (...) closely related to modular pairs in the lattice of algebraically closed sets. (shrink)

A ternary relation [Formula: see text] between subsets of the big model of a complete first-order theory T is called an independence relation if it satisfies a certain set of axioms. The primary example is forking in a simple theory, but o-minimal theories are also known to have an interesting independence relation. Our approach in this paper is to treat independence relations as mathematical objects worth studying. The main application is a better understanding of thorn-forking, which turns out to be (...) closely related to modular pairs in the lattice of algebraically closed sets. (shrink)

We study thorn forking and rosiness in the context of continuous logic. We prove that the Urysohn sphere is rosy (with respect to finitary imaginaries), providing the first example of an essentially continuous unstable theory with a nice notion of independence. In the process, we show that a real rosy theory which has weak elimination of finitary imaginaries is rosy with respect to finitary imaginaries, a fact which is new even for discrete first-order real rosy theories.

We generalise the properties $\mathsf {OP}$, $\mathsf {IP}$, k- $\mathsf {TP}$, $\mathsf {TP}_{1}$, k- $\mathsf {TP}_{2}$, $\mathsf {SOP}_{1}$, $\mathsf {SOP}_{2}$, and $\mathsf {SOP}_{3}$ to positive logic, and prove various implications and equivalences between them. We also provide a characterisation of stability in positive logic in analogy with the one in full first-order logic, both on the level of formulas and on the level of theories. For simple theories there are the classically equivalent definitions of not having $\mathsf {TP}$ and dividing (...) having local character, which we prove to be equivalent in positive logic as well. Finally, we show that a thick theory T has $\mathsf {OP}$ iff it has $\mathsf {IP}$ or $\mathsf {SOP}_{1}$ and that T has $\mathsf {TP}$ iff it has $\mathsf {SOP}_{1}$ or $\mathsf {TP}_{2}$, analogous to the well-known results in full first-order logic where $\mathsf {SOP}_{1}$ is replaced by $\mathsf {SOP}$ in the former and by $\mathsf {TP}_{1}$ in the latter. Our proofs of these final two theorems are new and make use of Kim-independence. (shrink)

We initiate a systematic study of the class of theories without the tree property of the second kind — NTP2. Most importantly, we show: the burden is “sub-multiplicative” in arbitrary theories ; NTP2 is equivalent to the generalized Kimʼs lemma and to the boundedness of ist-weight; the dp-rank of a type in an arbitrary theory is witnessed by mutually indiscernible sequences of realizations of the type, after adding some parameters — so the dp-rank of a 1-type in any theory is (...) always witnessed by sequences of singletons; in NTP2 theories, simple types are co-simple, characterized by the co-independence theorem, and forking between the realizations of a simple type and arbitrary elements satisfies full symmetry; a Henselian valued field of characteristic is NTP2 if and only if the residue field is NTP2 , so in particular any ultraproduct of p-adics is NTP2; adding a generic predicate to a geometric NTP2 theory preserves NTP2. (shrink)

We define elementary extension and elementary equivalence in Positive Logic.

Let G be a countable group. We prove that there is a model companion for the theory of Hilbert spaces with a group G of automorphisms. We use a theorem of Hulanicki to show that G is amenable if and only if the structure induced by countable copies of the regular representation of G is existentially closed.

We interpret the algebra of finite rank operators as imaginaries inside a Hilbert space. We prove that the Hilbert space enlarged with these imaginaries has built-in canonical bases.

We develop several aspects of local and global stability in continuous first order logic. In particular, we study type-definable groups and genericity.

We lay down the groundwork for the treatment of almost hyperdefinable groups: notions from [5] are put into a natural hierarchy, and new notions, essential to the study to such groups, fit elegantly into this hierarchy. We show that "classical" properties of definable and hyperdefinable groups in simple theories can be generalised to this context. In particular, we prove the existence of stabilisers of Lascar strong types and of the connected and locally connected components of subgroups, and that in a (...) simple one-based theory an almost hyperdefinable group is bounded-by-abelian-by-bounded. (shrink)

We develop positive model theory, which is a non first order analogue of classical model theory where compactness is kept at the expense of negation. The analogue of a first order theory in this framework is a compact abstract theory: several equivalent yet conceptually different presentations of this notion are given. We prove in particular that Banach and Hilbert spaces are compact abstract theories, and in fact very well-behaved as such.

We characterise imaginaries (up to interdefinability) in Hilbert spaces using a Galois theory for compact unitary groups.

This paper completes the proof of the group configuration theorem for simple theories started in [1]. We introduce the notion of an almost hyperdefinable structure, and show that it has a reasonable model theory. We then construct an almost hyperdefinable group from a polygroup chunk.

This communication deals with positive model theory, a non first order model theoretic setting which preserves compactness at the cost of giving up negation. Positive model theory deals transparently with hyperimaginaries, and accommodates various analytic structures which defy direct first order treatment. We describe the development of simplicity theory in this setting, and an application to the lovely pairs of models of simple theories without the weak non finite cover property.

We continue the analysis of foundations of positive model theory as introduced by Ben Yaacov and Poizat. The objects of this analysis are $h$-inductive theories and their models, especially the “positively” existentially closed ones. We analyze topological properties of spaces of types, introduce forms of quantifier elimination, and characterize minimal completions of arbitrary $h$-inductive theories. The main technical tools consist of various forms of amalgamations in special classes of structures.

The randomization of a complete first-order theory [Formula: see text] is the complete continuous theory [Formula: see text] with two sorts, a sort for random elements of models of [Formula: see text] and a sort for events in an underlying atomless probability space. We study independence relations and related ternary relations on the randomization of [Formula: see text]. We show that if [Formula: see text] has the exchange property and [Formula: see text], then [Formula: see text] has a strict independence (...) relation in the home sort, and hence is real rosy. In particular, if [Formula: see text] is o-minimal, then [Formula: see text] is real rosy. (shrink)

We prove that the definition of supersimplicity in metric structures from [Ben Yaacov, Uncountable dense categoricity in cats] is equivalent to an textit{a priori} stronger variant. This stronger variant is then used to prove that if $T$ is a supersimple Hausdorff cat then so is its theory of lovely pairs.

We prove that for every simple theory $T$ (or even simple thick compact abstract theory) there is a (unique) compact abstract theory $T^fP$ whose saturated models are the lovely pairs of $T$. Independence-theoretic results that were proved in [Ben Yaacov, Pillay, Vassiliev - Lovely pairs of models] when $T^fP$ is a first order theory are proved for the general case: in particular $T^fP$ is simple and we characterise independence.