Related papers: A characterization theorem for geometric logic

We rewrite classical topological definitions using the category-theoretic notation of arrows and are led to concise reformulations in terms of simplicial categories and orthogonality of morphisms, which we hope might be of use in the…

We give several characterizations of when a complete first-order theory $T$ is monadically NIP, i.e. when expansions of $T$ by arbitrary unary predicates do not have the independence property. The central characterization is a condition on…

We provide an explicit characterization of the covariant isotropy group of any Grothendieck topos, i.e. the group of (extended) inner automorphisms of any sheaf over a small site. As a consequence, we obtain an explicit characterization of…

We define the continuous modeling property for first-order structures and show that a first-order structure has the continuous modelling property if and only if its age has the embedding Ramsey property. We use generalized indiscernible…

We define a category of planar diagrams whose Grothendieck group contains an integral version of the infinite rank Heisenberg algebra, thus yielding a categorification of this algebra. Our category, which is a q-deformation of one defined…

We suggest an ordering for the predicates in continuous logic so that the semantics of continuous logic can be formulated as a hyperdoctrine. We show that this hyperdoctrine can be embedded into the hyperdoctrine of subobjects of a suitable…

Given an infinity-category C, one can naturally construct an infinity-category Fam(C) of families of objects in C indexed by infinity-groupoids. An ordinary categorical version of this construction was used by Borceux and Janelidze in the…

Grothendieck fibrations provide a unifying algebraic framework that underlies the treatment of various form of logics, such as first order logic, higher order logics and dependent type theories. In the categorical approach to logic proposed…

We investigate a generalization of the {\L}o\'s-Tarski preservation theorem via the semantic notion of \emph{preservation under substructures modulo $k$-sized cores}. It was shown earlier that over arbitrary structures, this semantic notion…

In this paper we investigate an infinitely categorical analogue of the theory of Grothendieck topoi. In particular, we define infinity topoi and prove an analogue of Giraud's theorem, expressing the equivalence of ``intrinsic'' and…

Using Butz and Moerdijk's topological groupoid representation of a topos with enough points, a `syntax-semantics' duality for geometric theories is constructed. The emphasis is on a logical presentation, starting with a description of the…

We introduce the category of structures and interpretations which allows us to discuss some issues of Grothendieck's anabelian geometry in model-theory terms. Our main result is a formulation in terms of pure stability theory of a problem…

Frick and Grohe [J. ACM 48 (2006), 1184-1206] introduced a notion of graph classes with locally bounded tree-width and established that every first order logic property can be decided in almost linear time in such a graph class. Here, we…

This paper answers a question raised by Grothendieck in 1970 on the "Grothendieck closure" of an integral linear group and proves a conjecture of the first author made in 1980. This is done by a detailed study of the congruence topology of…

Inspired by the theory of classifying topoi for geometric theories, we define rounded sketches and logoi and provide the notion of classifying logos for a rounded sketch. Rounded sketches can be used to axiomatise all the known fragments of…

The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter…

This note sketches the extension of the basic characterisation theorems as the bisimulation-invariant fragment of first-order logic to modal logic with graded modalities and matching adaptation of bisimulation. We focus on showing…

Tarski initiated a logic-based approach to formal geometry that studies first-order structures with a ternary betweenness relation (\beta) and a quaternary equidistance relation (\equiv). Tarski established, inter alia, that the first-order…

We define and study structural properties of hypergraphs of models of a theory including lattice ones. Characterizations for the lattice properties of hypergraphs of models of a theory, as well as for structures on sets of isomorphism types…

The characterization of PSPACE-queries over ordered structures as exactly those expressible in first-order logic with partial fixpoints (Vardi'82) is one of the classical results in the field of descriptive complexity. In this paper, we…