English
Related papers

Related papers: Enayat Models of Peano Arithmetic

200 papers

We introduce \emph{expander evolution algebras} (EEAs), a class of nonassociative algebras defined over an arbitrary field $\K$ in which the underlying undirected loopless graph of the algebra -- in the sense of Kowalski -- is an expander…

Rings and Algebras · Mathematics 2026-05-14 Piero Giacomelli

Answering a special case of a question of Chernikov and Simon, we show that any non-dividing formula over a model M in a distal NIP theory is a member of a consistent definable family, definable over M.

Logic · Mathematics 2017-01-23 Gareth Boxall , Charlotte Kestner

Given an argumentation framework AF, we introduce a mapping function that constructs a disjunctive logic program P, such that the preferred extensions of AF correspond to the stable models of P, after intersecting each stable model with the…

Artificial Intelligence · Computer Science 2008-12-18 Juan Carlos Nieves , Mauricio Osorio , Ulises Cortés

We prove that externally definable sets in first order NIP theories have honest definitions, giving a new proof of Shelah's expansion theorem. Also we discuss a weak notion of stable embeddedness true in this context. Those results are then…

Logic · Mathematics 2011-09-16 Artem Chernikov , Pierre Simon

We show that assuming modest large cardinals, there is a definable class of ordinals, closed and unbounded beneath every uncountable cardinal, so that for any closed and unbounded subclasses $P, Q$, $\langle L[P],\in ,P \rangle$ and…

Logic · Mathematics 2019-03-08 Philip Welch

We formalise the undecidability of solvability of Diophantine equations, i.e. polynomial equations over natural numbers, in Coq's constructive type theory. To do so, we give the first full mechanisation of the…

Logic in Computer Science · Computer Science 2023-06-22 Dominique Larchey-Wendling , Yannick Forster

We develop the notion of coherent ultrafilters (extenders without normality or well-foundedness). We then use definable coherent ultraproducts to characterize any extension of a model $M$ in any fragment of $\mathbb{L}_{\infty, \omega}$…

Logic · Mathematics 2026-04-30 Will Boney

Let T be an NIP L-theory and T' be an enrichment. We give a sufficient condition on T' for the underlying L-type of any definable (respectively invariant) type over a model of T' to be definable (respectively invariant) as an L-type.…

Logic · Mathematics 2016-12-08 Silvain Rideau , Pierre Simon

An \'etale structure over a topological space $X$ is a continuous family of structures (in some first-order language) indexed over $X$. We give an exposition of this fundamental concept from sheaf theory and its relevance to countable model…

Logic · Mathematics 2023-10-19 Ruiyuan Chen

We prove several theorems relating amenability of groups in various categories (discrete, definable, topological, automorphism group) to model-theoretic invariants (quotients by connected components, Lascar Galois group, G-compactness,…

Logic · Mathematics 2019-01-11 Krzysztof Krupinski , Anand Pillay

Automatic presentations, also called FA-presentations, were introduced to extend finite model theory to infinite structures whilst retaining the solubility of fundamental decision problems. This paper studies FA-presentable algebras. First,…

Logic · Mathematics 2015-10-21 Alan J. Cain , Nik Ruškuc

We discuss the externally definable Ramsey property, a weakening of the Ramsey property for ultrahomogeneous structures, where the only colourings considered are those that are externally definable: that is, definable with parameters in an…

Logic · Mathematics 2025-10-20 Nadav Meir , Rob Sullivan

We initiate an investigation of structures on the set of real numbers having the property that path components of definable sets are definable. All o\nobreakdash-\hspace{0pt}minimal structures on $(\mathbb{R},<)$ have the property, as do…

Recursive saturation and resplendence are two important notions in models of arithmetic. Kaye, Kossak, and Kotlarski introduced the notion of arithmetic saturation and argued that recursive saturation might not be as rigid as first assumed.…

Logic · Mathematics 2007-05-23 Fredrik Engström

We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating that "a real is c.e. and random iff it is the halting…

Computational Complexity · Computer Science 2009-06-08 Cristian S. Calude , Nicholas J. Hay

We introduce a model-complete theory which completely axiomatizes the structure $Z_{\alpha}=(Z, +, 0, 1, f)$ where $f : x \to \lfloor{\alpha} x \rfloor $ is a unary function with $\alpha$ a fixed transcendental number. When $\alpha$ is…

Logic · Mathematics 2025-10-16 Mohsen Khani , Ali N. Valizadeh , Afshin Zarei

We show that if $X$ is an infinite-dimensional separable Banach space (or more generally a Banach space with an infinite-dimensional separable quotient) then there is a continuous mapping $f\colon X\to X$ such that the autonomous…

Classical Analysis and ODEs · Mathematics 2009-11-26 Petr Hájek , Michal Johanis

This paper has two parts. In the first one, we prove that an invariant dp-minimal type is either finitely satisfiable or definable. We also prove that a definable version of the (p,q)-theorem holds in dp-minimal theories of small or medium…

Logic · Mathematics 2015-09-24 Pierre Simon

We give a complete description of the genus expansion of the one-cut solution to the generalized Penner model. The solution is presented in a form which allows us in a very straightforward manner to localize critical points and to…

High Energy Physics - Theory · Physics 2009-10-28 J. Ambjorn , Yu. Makeenko , C. F. Kristjansen

Let $M$ be a short extender mouse. We prove that if $E\in M$ and $M$ satisfies "$E$ is a countably complete short extender whose support is a cardinal $\theta$ and $\mathcal{H}_\theta\subseteq\mathrm{Ult}(V,E)$", then $E$ is in the extender…

Logic · Mathematics 2025-04-11 Farmer Schlutzenberg