We construct a 2-equivalence \(\mathfrak {CohTheory}^{op }\simeq \mathfrak {TypeSpaceFunc}\). Here \(\mathfrak {CohTheory}\) is the 2-category of positive theories and \(\mathfrak {TypeSpaceFunc}\) is the 2-category of type space functors. We give a precise definition of interpretations for positive logic, which will be the 1-cells in \(\mathfrak {CohTheory}\). The 2-cells are definable homomorphisms. The 2-equivalence restricts to a duality of categories, making precise the philosophy that a theory is ‘the same’ as the collection of its type spaces (i.e. its type space functor). (...) In characterising those functors that arise as type space functors, we find that they are specific instances of (coherent) hyperdoctrines. This connects two different schools of thought on the logical structure of a theory. The key ingredient, the Deligne completeness theorem, arises from topos theory, where positive theories have been studied under the name of coherent theories. (shrink)

In this paper we extend of the notion of algebraically closed given in the case of groups and skew fields to an arbitrary h-inductive theory. The main subject of this paper is the study of the notion of positive algebraic closedness and its relationship with the notion of positive closedness and the amalgamation 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.

Lindström’s Theorem characterizes first order logic as the maximal logic satisfying the Compactness Theorem and the Downward Löwenheim-Skolem Theorem. If we do not assume that logics are closed under negation, there is an obvious extension of first order logic with the two model theoretic properties mentioned, namely existential second order logic. We show that existential second order logic has a whole family of proper extensions satisfying the Compactness Theorem and the Downward Löwenheim-Skolem Theorem. Furthermore, we show that in the context (...) of negation-less logics, _positive logics_, as we call them, there is no strongest extension of first order logic with the Compactness Theorem and the Downward Löwenheim-Skolem Theorem. (shrink)

We generalise various theorems for finding indiscernible trees and arrays to positive logic: based on an existing modelling theorem for s-trees, we prove modelling theorems for str-trees, str$$_0$$ 0 -trees (the reduct of str-trees that forgets the length comparison relation) and arrays. In doing so, we prove stronger versions for basing—rather than locally basing or EM-basing—str-trees on s-trees and str$$_0$$ 0 -trees on str-trees. As an application we show that a thick positive theory has k-$$\mathsf {TP_2}$$ TP 2 iff it (...) has 2-$$\mathsf {TP_2}$$ TP 2. (shrink)

We introduce the notions of weakly and locally positive Robinson theories. We give a characterization of weakly positive Robinson theories by the amalgamation property, and a syntactic characterization of locally positive Robinson theories.

La Logique positive a été introduite au début de ce troisième millénaire par Itaï Ben Yaacov, qui y a été conduit par une nécessité interne à la Théorie des modèles. Dans ce contexte de validité du Théorème de compacité, l’absence de négation provoque des situations inhabituelles, comme celle des structures infinies qui ont une extension élémentaire maximale, que nous étudions ici.

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.

We study the amalgamation property in positive logic, where we shed light on some connections between the amalgamation property, Robinson theories, model-complete theories and the Hausdorff property.