English
Related papers

Related papers: Adding linear orders

200 papers

We introduce proof nets for PiL, an extension of first-order multiplicative additive linear logic with new operators allowing a shallow encoding of processes in the {\pi}-calculus as formulas. We provide correctness criterion,…

Logic in Computer Science · Computer Science 2026-05-15 Matteo Acclavio , Giulia Manara

We prove that there are continuum-many axiomatic extensions of the full Lambek calculus with exchange that have the deductive interpolation property. Further, we extend this result to both classical and intuitionistic linear logic as well…

Logic · Mathematics 2023-08-04 Wesley Fussner , Simon Santschi

We prove a generalization of Maehara's lemma to show that the extensions of classical and intuitionistic first-order logic with a special type of geometric axioms, called singular geometric axioms, have Craig's interpolation property. As a…

Logic · Mathematics 2019-03-12 Guido Gherardi , Paolo Maffezioli , Eugenio Orlandelli

We prove that for any monotone class of finite relational structures, the first-order theory of the class is NIP in the sense of stability theory if, and only if, the collection of Gaifman graphs of structures in this class is nowhere…

Logic · Mathematics 2023-02-14 Samuel Braunfeld , Anuj Dawar , Ioannis Eleftheriadis , Aris Papadopoulos

Suppose L = {<, . . .} is any countable first order language in which < is interpreted as a linear order. Let T be any complete first order theory in the language L such that T has a kappa-like model where kappa is an inaccessible cardinal.…

Logic · Mathematics 2010-06-22 Shahram Mohsenipour

Let $\mathcal{R}$ be an expansion of the ordered real additive group. When $\mathcal{R}$ is o-minimal, it is known that either $\mathcal{R}$ defines an ordered field isomorphic to $(\mathbb{R},<,+,\cdot)$ on some open subinterval…

Logic · Mathematics 2021-03-09 Philipp Hieronymi , Erik Walsberg

Logical Neural Networks (LNNs) are a type of architecture which combine a neural network's abilities to learn and systems of formal logic's abilities to perform symbolic reasoning. LLNs provide programmers the ability to implicitly modify…

Artificial Intelligence · Computer Science 2022-08-15 Aidan Evans , Jorge Blanco

We give category-theoretic reformulations of stability, NIP, NTP, and non-dividing by observing that their characterisations in terms of indiscernible sequences are naturally expressed as Quillen lifting properties %(negation) of certain…

Logic · Mathematics 2020-10-20 Misha Gavrilovich

In continuous logic, there are plenty of examples of interesting stable metric structures. However, on the other side of the SOP line, there are only a few metric structures where order is relevant, and orders often appear in different…

Logic · Mathematics 2025-10-15 Aaron Anderson , Diego Bejarano

In this paper we describe all those ordered semigroups which are the nil extension of Clifford, left Clifford, group like, left group like ordered semigroups.

Rings and Algebras · Mathematics 2017-01-26 Anjan Kr Bhuniya , Kalyan Hansda

We generalize the Unstable Formula Theorem characterization of stable theories from \citep{sh78}: that a theory $T$ is stable just in case any infinite indiscernible sequence in a model of $T$ is an indiscernible set. We use a generalized…

Logic · Mathematics 2013-03-15 Lynn Scow

In various places in the literature it is stated that every separable linear order embeds into the real line. This is, however, not the case, at least not with respect to the usual definition of separability. We correct this misconception.

Logic · Mathematics 2016-06-02 Stefan Geschke

Let $\mathcal{R}$ be an $\mathrm{NIP}$ expansion of $(\mathbb{R},<,+)$ by closed subsets of $\mathbb{R}^n$ and continuous functions $f : \mathbb{R}^m \to \mathbb{R}^n$. Then $\mathcal{R}$ is generically locally o-minimal. It follows that if…

Logic · Mathematics 2020-03-30 Erik Walsberg

A theory is NIP (resp. stable) if and only if every formula with parameters in two single variables is NIP (resp. does not have the order property).

Logic · Mathematics 2021-03-30 Pierre Simon

For each member $\mathcal{A}$ of a family of linear cycle sets whose underlying abelian group is cyclic of order a power of a prime number, we compute all the central extensions of $\mathcal{A}$ by an arbitrary abelian group.

K-Theory and Homology · Mathematics 2021-09-14 Jorge A. Guccione , Juan J. Guccione

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…

Logic · Mathematics 2026-05-06 Samuel Braunfeld , Michael C. Laskowski

We investigate infinitary wellfounded systems for linear logic with fixed points, with transfinite branching rules indexed by some closure ordinal $\alpha$ for fixed points. Our main result is that provability in the system for some…

Logic · Mathematics 2026-02-24 Anupam Das , Tikhon Pshenitsyn

Every definably complete expansion of an ordered field satisfies an analogue of the Baire Category Theorem.

Logic · Mathematics 2013-01-29 Philipp Hieronymi

We give a general exposition of model theoretic connected components of groups. We show that if a group G has NIP, then there exists the smallest invariant (over some small set) subgroup of G with bounded index (Theorem 5.3). This result…

Logic · Mathematics 2010-02-09 Jakub Gismatullin

We give a criterion when an expansion of the ordered set of real numbers defines the image of the expansion of the real field by the set of natural numbers under a semialgebraic injection. In particular, we show that for a non-quadratic…

Logic · Mathematics 2015-10-13 Philipp Hieronymi , Michael Tychonievich