English
Related papers

Related papers: Models of expansions of N with no end extensions

200 papers

Simpson showed that every countable model $\mathcal{M} \models \mathsf{PA}$ has an expansion $(\mathcal{M}, X) \models \mathsf{PA}^*$ that is pointwise definable. A natural question is whether, in general, one can obtain expansions of a…

Logic · Mathematics 2019-02-20 Athar Abdul-Quader

Let M be a model of Peano Arithmetic that is countably generated over an exponentially closed cut I. We characterize those sets X of subsets of I for which there is a finitely (or countably) generated cofinal extension N of M such that I is…

Logic · Mathematics 2017-08-04 James H. Schmerl

We prove that bold N, the standard model of arithmetic, has an uncountable elementary extension N such that there is no ultrafilter on the Boolean Algebra of subsets of bold N represented in N which is minimal (i.e. as in Rudin-Keisler…

Logic · Mathematics 2018-01-16 Saharon Shelah

This paper is a contribution to the study of extensions of arbitrary models of ZF (Zermelo-Fraenkel set theory), with no regard to countability or well-foundedness of the models involved. We present some new constructions of certain types…

Logic · Mathematics 2026-04-07 Ali Enayat

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

Throughout the course of mathematical history, generalizations of previously understood concepts and structures have led to the fruitful development of the hierarchy of number systems, non-euclidean geometry, and many other epochal phases…

Logic · Mathematics 2013-11-26 Samuel Reid

This is a survey of results on definability and undefinability in models of arithmetic. The goal is to present a stark difference between undefinability results in the standard model and much stronger versions about expansions of…

Logic · Mathematics 2023-04-17 Roman Kossak

According to the math tea argument, there must be real numbers that we cannot describe or define, because there are uncountably many real numbers, but only countably many definitions. And yet, the existence of pointwise-definable models of…

Logic · Mathematics 2024-04-09 Joel David Hamkins

For $N \geq 2$, we study the structure of definable abelian group extensions of the additive group $(\mathbb{R}^N,+)$ by countable abelian (Borel) groups $G$. Given an extension $H$ of $(\mathbb{R}^N,+)$ by $G$, we measure the definability…

Logic · Mathematics 2025-05-13 Linus Richter

We prove that in Borel models of arithmetic on an uncountable Polish space, neither addition nor multiplication is continuous. This is an analogue of Tennenbaum's Theorem for topological models of arithmetic. This answers a question of…

Logic · Mathematics 2023-11-27 Elliot Glazer

We characterize models of Peano arithmetic (PA) with infinitely many infinite primes p such that p + 2 has no finite prime divisor.

Number Theory · Mathematics 2022-12-21 Daniele Mundici

Given a Boolean algebra B and an embedding e:B -> P(N)/fin we consider the possibility of extending each or some automorphism of B to the whole P(N)/fin. Among other things, we show, assuming CH, that for a wide class of Boolean algebras…

Logic · Mathematics 2024-08-27 A. Bella , A. Dow , K. P. Hart , M. Hrusak , J. van Mill , P. Ursino

Let $A$ be an abelian variety in a field of characteristic $0$. We prove that the expansion of $A$ by a generic divisible subgroup of $A$ with the same torsion exists provided $A$ has few algebraic endomorphisms, namely…

Logic · Mathematics 2019-12-24 Christian d'Elbée

I shall describe a general model-theoretic task to construct expansions of pseudofinite structures and discuss several examples of particular relevance to computational complexity. Then I will present one specific situation where finding a…

Logic · Mathematics 2017-02-10 Jan Krajicek

General mathematical reasoning is computationally undecidable, but humans routinely solve new problems. Moreover, discoveries developed over centuries are taught to subsequent generations quickly. What structure enables this, and how might…

Artificial Intelligence · Computer Science 2023-06-21 Gabriel Poesia , Noah D. Goodman

A subset of a model of ${\sf PA}$ is called neutral if it does not change the $\mathrm{dcl}$ relation. A model with undefinable neutral classes is called neutrally expandable. We study the existence and non-existence of neutral sets in…

Logic · Mathematics 2021-06-07 Athar Abdul-Quader , Roman Kossak

Every mathematical structure has an elementary extension to a pseudo-countable structure, one that is seen as countable inside a suitable class model of set theory, even though it may actually be uncountable. This observation, proved easily…

Logic · Mathematics 2022-10-11 Joel David Hamkins

Suppose that ${\mathcal M}$ is a model of PA and ${\mathcal N}$ is a countably generated elementary end extension of ${\mathcal M}$. Let ${\mathfrak X}$ be the set of subsets of M that are coded by ${\mathcal N}$. Then ${\mathcal M}$ has a…

Logic · Mathematics 2016-09-09 James H. Schmerl

We continue investigating the structure of externally definable sets in NIP theories and preservation of NIP after expanding by new predicates. Most importantly: types over finite sets are uniformly definable; over a model, a family of…

Logic · Mathematics 2012-02-14 Artem Chernikov , Pierre Simon

Ali Enayat had asked whether there is a nonstandard model of Peano arithmetic (PA) that can be represented as $\langle\mathbb{Q},\oplus,\otimes\rangle$, where $\oplus$ and $\otimes$ are continuous functions on the rationals $\mathbb{Q}$. We…

Logic · Mathematics 2020-11-11 Ali Enayat , Joel David Hamkins , Bartosz Wcisło
‹ Prev 1 2 3 10 Next ›