English
Related papers

Related papers: Enayat Models of Peano Arithmetic

200 papers

Let $M$ be a fine structural mouse and let $F\in M$ be such that $M\models$``$F$ is a total extender'' and $(M||\mathrm{lh}(F),F)$ is a premouse. We show that it follows that $F\in\mathbb{E}^M$, where $\mathbb{E}^M$ is the extender sequence…

Logic · Mathematics 2019-03-20 Farmer Schlutzenberg

Generalized Additive Models (GAMs) have quickly become the leading choice for inherently-interpretable machine learning. However, unlike uninterpretable methods such as DNNs, they lack expressive power and easy scalability, and are hence…

Machine Learning · Computer Science 2022-10-20 Abhimanyu Dubey , Filip Radenovic , Dhruv Mahajan

If M is a nonstandard model of Peano Arithmetic, then M is lofty iff M has a simple elementary extension that is recursively saturated. This had previously been known for countable M.

Logic · Mathematics 2020-03-13 James H. Schmerl

Based on the MRDP theorem concerning the Hilbert tenth problem, there is a corresponding Diophantine equation called proof equation for every formula of the First-order Peano Arithmetic (PA). A formula is provable in PA, if and only if the…

Logic · Mathematics 2011-11-10 T. Mei

In a recent paper, Enayat and Le lyk [2024] show that second order arithmetic and countable set theory are not definitionally equivalent. It is well known that these theories are biinterpretable. Thus, we have a pair of natural theories…

Logic · Mathematics 2025-08-07 Jason Chen , Toby Meadows

Let $(M,\scott X) \models \ACA$ be such that $P_\scott X$, the collection of all unbounded sets in $\scott X$, admits a definable complete ultrafilter and let $T$ be a theory extending first order arithmetic coded in $\scott X$ such that…

Logic · Mathematics 2010-03-16 Fredrik Engström

Fix a countable nonstandard model $\mathcal M$ of Peano Arithmetic. Even with some rather severe restrictions placed on the types of minimal cofinal extensions $\mathcal N \succ \mathcal M$ that are allowed, we still find that there are…

Logic · Mathematics 2021-09-17 James H. Schmerl

A compactum $X\subset \C$ is unshielded if it coincides with the boundary of the unbounded component of $\C\sm X$. Call a compactum $X$ finitely Suslinian if every collection of pairwise disjoint subcontinua of $X$ whose diameters are…

General Topology · Mathematics 2016-01-18 Alexander Blokh , Clinton Curry , Lex Oversteegen

We study models M of set theory that are "condensable", in the sense that there is an "ordinal" v of M such that the rank initial segment of M determined by v is both isomorphic to M, and also an elementary submodel of M for infinitary…

Logic · Mathematics 2021-06-21 Ali Enayat

A Peano compactum is a compact metric space having locally connected components such that at most finitely many of them are of diameter greater than any fixed number C>0. Given a compactum K in the extended complex plane, it is known that…

Dynamical Systems · Mathematics 2024-08-14 Jun Luo , Yi Yang , Xiaoting Yao

In this paper, we extend the concept of a Lascar generic automorphism in the setting of models of Peano arithmetic ($\mathrm{PA}$) to the subgroup of the automorphism group of a countable recursively saturated model $\mathcal{M}$ of…

Logic · Mathematics 2026-04-14 Saeideh Bahrami

In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…

Logic in Computer Science · Computer Science 2012-10-10 Domenico Cantone , Cristiano Longo

This paper extends prior work on the connections between logics from finite model theory and propositional/algebraic proof systems. We show that if all non-isomorphic graphs in a given graph class can be distinguished in the logic…

Logic in Computer Science · Computer Science 2023-02-13 Benedikt Pago

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…

Logic · Mathematics 2023-05-16 Alfredo Roque Freire , Kameryn J. Williams

We give a sheaf theoretic interpretation of Potts models with external magnetic field, in terms of constructible sheaves and their Euler characteristics. We show that the polynomial countability question for the hypersurfaces defined by the…

Mathematical Physics · Physics 2015-12-09 Shival Dasu , Matilde Marcolli

A result of Kaufmann shows that if $L_\alpha$ is countable, admissible and satisfies $\Pi_n\textsf{-Collection}$, then $\langle L_\alpha, \in \rangle$ has a proper $\Sigma_{n+1}$-elementary end extension. This paper investigates to what…

Logic · Mathematics 2022-01-14 Zachiri McKenzie

We consider definably complete and Baire expansions of ordered fields: every definable subset of the domain of the structure has a supremum and the domain can not be written as the union of a definable increasing family of nowhere dense…

Logic · Mathematics 2010-05-18 Antongiulio Fornasiero , Tamara Servi

In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…

Logic in Computer Science · Computer Science 2023-06-22 Arnon Avron , Liron Cohen

In this paper we study expansions of infinite dimensional Hilbert spaces with a unitary representation of a discrete countable group. When the group is finite, we prove the theory of the corresponding expansion, regardless if it is…

Logic · Mathematics 2025-08-20 Alexander Berenstein , Juan Manuel Pérez

Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…

Logic · Mathematics 2025-12-03 Jake Masters