Related papers: Pseudosaturation and the Interpretability Orders
Prior work in semantic parsing has shown that conventional seq2seq models fail at compositional generalization tasks. This limitation led to a resurgence of methods that model alignments between sentences and their corresponding meaning…
Let $T$ be a complete, superstable theory with fewer than $2^{\aleph_{0}}$ countable models. Assuming that generic types of infinite, simple groups definable in $T^{eq}$ are sufficiently non-isolated we prove that $\omega^{\omega}$ is the…
Our aim is to prove that if T is a complete first order theory, which is not superstable (no knowledge on this notion is required), included in a theory T_1 then for any lambda > |T_1| there are 2^lambda models of T_1 such that for any two…
The constraint satisfaction problem (CSP) of a first-order theory T is the computational problem of deciding whether a given conjunction of atomic formulas is satisfiable in some model of T. We study the computational complexity of CSP$(T_1…
This paper continues math.LO/0009087. We present a rank function for NSOP_1 theories and give an example of a theory which is NSOP_1 but not simple. We also investigate the connection between maximality in the ordering <^* among complete…
We present and analyze a natural hierarchy of weak theories, develop analysis in them, and show that they are interpretable in bounded quantifier arithmetic $\text{I}\Delta_0$ (and hence in Robinson arithmetic Q). The strongest theories…
We show that, under the assumption of the existence of $M_1^{\#}$, there exists a model on which the restricted nonstationary ideal $\hbox{NS} \upharpoonright A$ is $\aleph_2$-saturated, for $A$ a stationary co-stationary subset of…
Existing work on theorem proving for the assertion language of separation logic (SL) either focuses on abstract semantics which are not readily available in most applications of program verification, or on concrete models for which…
Strict-Tolerant Logic (ST) underpins naive theories of truth and vagueness (respectively including a fully disquotational truth predicate and an unrestricted tolerance principle) without jettisoning any classically valid laws. The classical…
In a countable superstable NDOP theory, the existence of a rigid aleph_epsilon-saturated model implies the existence of 2^lambda rigid aleph_epsilon-saturated models of power lambda for every lambda>2^{aleph_0}.
For a first-order theory $T$, the Constraint Satisfaction Problem of $T$ is the computational problem of deciding whether a given conjunction of atomic formulas is satisfiable in some model of $T$. In this article we develop sufficient…
We extend the concept of "almost indiscernible theory" introduced by Pillay and Sklinos in [Bull. Symb. Log., 2015] (which was itself a modernization and expansion of Baldwin and Shelah [Algebra Universalis, 1983]), to uncountable languages…
We introduce a flexible class of well-quasi-orderings (WQOs) on words that generalizes the ordering of (not necessarily contiguous) subwords. Each such WQO induces a class of piecewise testable languages (PTLs) as Boolean combinations of…
Tuple interpretations are a class of algebraic interpretation that subsumes both polynomial and matrix interpretations as it does not impose simple termination and allows non-linear interpretations. It was developed in the context of…
A theory T is tight if different deductively closed extensions of T (in the same language) cannot be bi-interpretable. Many well-studied foundational theories are tight, including PA [Visser2006], ZF, Z2, and KM [enayat2017]. In this…
We study pushdown systems where control states, stack alphabet, and transition relation, instead of being finite, are first-order definable in a fixed countably-infinite structure. We show that the reachability analysis can be addressed…
The class of abelian $p$-groups are an example of some very interesting phenomena in computable structure theory. We will give an elementary first-order theory $T_p$ whose models are each bi-interpretable with the disjoint union of an…
For a cardinal of the form $\kappa=\beth_\kappa$, Shelah's logic $L^1_\kappa$ has a characterisation as the maximal logic above $\bigcup_{\lambda<\kappa} L_{\lambda, \omega}$ satisfying Strong Undefinability of Well Order (SUDWO). SUDWO is…
Schmerl and Beklemishev's work on iterated reflection achieves two aims: It introduces the important notion of $\Pi^0_1$-ordinal, characterizing the $\Pi^0_1$-theorems of a theory in terms of transfinite iterations of consistency; and it…
There are several finite axiomatizations of stratified comprehension. The famous two are Hailperin's and Randall Holmes's. However, the system presented here could be the shortest known one written in the first order language of set theory.…