Related papers: Kim-independence in positive logic

We identify a canonical structure J associated to any first-order theory, the {\it space of definability patterns}. It generalizes the imaginary algebraic closure in a stable theory, and the hyperimaginary bounded closure in simple…

We reformulate Hrushovski's definability patterns from the setting of first order logic to the setting of positive logic. Given an h-universal theory T we put two structures on the type spaces of models of T in two languages, \mathcal{L}…

Separation logic is a substructural logic which has proved to have numerous and fruitful applications to the verification of programs working on dynamic data structures. Recently, Barthe, Hsu and Liao have proposed a new way of giving…

Independence logic cannot be effectively axiomatized. However, first-order consequences of independence logic sentences can be axiomatized. In this article we give an explicit axiomatization and prove that it is complete in this sense. The…

The notion of a complete type can be generalized in a natural manner to allow assigning a value in an arbitrary Boolean algebra B to each formula. We show some basic results regarding the effect of the properties of B on the behavior of…

Starting from elementary considerations about independence and Markov processes in classical probability we arrive at the new concept of conditional monotone independence (or operator-valued monotone independence). With the help of product…

Following the types-as-sets paradigm, we present a mechanized embedding of dependent function types with a hierarchy of universes into schematic first-order logic with equality, with axiom schemas of Tarski-Grothendieck set theory. We carry…

We investigate the notion of independence, which is at the basis of many, seemingly unrelated, properties of logic like Rational Monotony in non-monotonic logics, and interpolation theorems.

This paper builds model-theoretic tools to detect changes in complexity among the simple theories. We develop a generalization of dividing, called shearing, which depends on a so-called context c. This leads to defining c-superstability, a…

We critically examine the magnitude of theoretical uncertainties in perturbative calculations of first-order phase transitions, using the Standard Model effective field theory as our guide. In the usual daisy-resummed approach, we find…

We give an overview of some developments in dependence and independence logic. This is a tiny selection, intended for a newcomer, from a rapidly growing literature on the topic. Furthermore, we discuss conditional independence atoms and we…

This paper deals with the class of existentially closed models of fields with a distinguished submodule (over a fixed subring). In the positive characteristic case, this class is elementary and was investigated by the first-named author.…

We present a natural standard translation of inquisitive modal logic InqML into first-order logic over the natural two-sorted relational representations of the intended models, which captures the built-in higher-order features of InqML.…

We prove that the expressive power of first-order logic with team semantics plus contradictory negation does not rise beyond that of first-order logic (with respect to sentences), and that the totality atoms of arity k +1 are not definable…

We introduce ordinal collapsing principles that are inspired by proof theory but have a set theoretic flavor. These principles are shown to be equivalent to iterated $\Pi^1_1$-comprehension and the existence of admissible sets, over weak…

We introduce the notions of triviality and order-triviality for global invariant types in an arbitrary first-order theory and show that they are well behaved in the NIP context. We show that these two notions agree for invariant global…

We introduce a new logic, called \emph{cluster first-order logic}, a restricted fragment of first-order logic specifically designed to study order invariance. An order-invariant formula is one on a vocabulary that contains an order;…

In this note we develop and clarify some of the basic combinatorial properties of the new notion of $n$-dependence (for $1\leq n < \omega$) recently introduced by Shelah. In the same way as dependence of a theory means its inability to…

A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to…

The paper considers algorithmic properties of classical and non-classical first-order logics and theories in bounded languages. The main idea is to prove the undecidability of various fragments of classical and non-classical first-order…