English
Related papers

Related papers: A definable nonstandard model of the reals

200 papers

We prove that $ZF+DC+"$there exists a transcendence basis for the reals$"+"$there is no well-ordering of the reals$"$ is consistent relative to $ZFC$. This answers a question of Larson and Zapletal.

Logic · Mathematics 2019-01-29 Haim Horowitz , Saharon Shelah

Let U be a monster model and let D be a subset of U. Let (U,D) denote theexpansion of U with a new predicate for D. Write e(D) for the collection of all subsets C of U such that (U,C) is elementary equivalent to (U,D). We prove that if e(D)…

Logic · Mathematics 2015-08-21 Domenico Zambella

It is often claimed that analysis with infinitesimals requires more substantial use of the Axiom of Choice than traditional elementary analysis. The claim is based on the observation that the hyperreals entail the existence of nonprincipal…

Logic · Mathematics 2021-03-08 Karel Hrbacek , Mikhail G. Katz

It is well known that in Zermelo-Fraenkel (ZF) set theory any finite set is decidable. In this paper we discuss an extension of ZF where this result is no longer valid. Such an extension is quasi-set theory and it has its origin on problems…

Quantum Physics · Physics 2007-05-23 Adonai S. Sant'Anna

We introduce the notion of "functional extension" of a set X, by means of two natural algebraic properties of the operator * on unary functions. We study the connections with ultrapowers of structures with universe X, and we give a simple…

Logic · Mathematics 2017-12-19 Marco Forti

We show, assuming PD, that every complete finitely axiomatized second order theory with a countable model is categorical, but that there is, assuming again PD, a complete recursively axiomatized second order theory with a countable model…

Logic · Mathematics 2024-05-07 Tapio Saarinen , Jouko Väänänen , William Hugh Woodin

We extend the theory of infinite-exponent partition relations to arbitrary linear order types, with a particular focus on the real number line. We give a complete classification of all consistent partition relations on the real line with…

Logic · Mathematics 2026-04-08 Lyra A. Gardiner

Our theme is that not every interesting question in set theory is independent of $ZFC$. We give an example of a first order theory $T$ with countable $D(T)$ which cannot have a universal model at $\aleph_1$ without CH; we prove in $ZFC$ a…

Logic · Mathematics 2009-09-25 Menachem Kojman , Saharon Shelah

Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…

General Mathematics · Mathematics 2007-05-23 W. Mueckenheim

We show a transfer principle for the property that all types realised in a given elementary extension are definable. It can be written as follows: a Henselian valued fields is stably embedded in an elementary extension if and only if its…

Logic · Mathematics 2020-12-01 Pierre Touchard

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

We consider the foundational relation between arithmetic and set theory. Our goal is to criticize the construction of standard arithmetic models as providing grounds for arithmetic truth (even in a relative sense). Our method is to…

Logic · Mathematics 2020-02-06 Alfredo Roque Freire

We use a generalization of a construction by Ziegler to show that for any field $F$ and any countable collection of countable subsets $A_i \subseteq F, i \in \calI \subset \Z_{>0}$ there exist infinitely many fields $K$ of arbitrary…

Logic · Mathematics 2011-05-16 Alexandra Shlapentokh , Carlos Videla

We present an extension to the quantifier-free theory of integer arrays which allows us to express counting. The properties expressible in Array Folds Logic (AFL) include statements such as "the first array cell contains the array length,"…

Formal Languages and Automata Theory · Computer Science 2016-05-13 Przemysław Daca , Thomas A. Henzinger , Andrey Kupriyanov

All known structural extensions of the substructural logic $\mathsf{FL_e}$, Full Lambek calculus with exchange/commutativity, (corresponding to subvarieties of commutative residuated lattices axiomatized by $\{\vee, \cdot, 1\}$-equations)…

Logic · Mathematics 2023-10-04 Nikolaos Galatos , Gavin St. John

Suppose $E \subseteq \mathbb{R}$ is nowhere dense. If $(\mathbb{R},<,+,(x \mapsto \lambda x)_{\lambda \in \mathbb{R} }, E)$ does not define every bounded Borel subset of every $\mathbb{R}^n$ then for every $s > 0$ we have $$ | \{ k \in…

Logic · Mathematics 2020-10-21 Erik Walsberg

We survey the complexity class $\exists \mathbb{R}$, which captures the complexity of deciding the existential theory of the reals. The class $\exists \mathbb{R}$ has roots in two different traditions, one based on the Blum-Shub-Smale model…

Computational Complexity · Computer Science 2024-07-26 Marcus Schaefer , Jean Cardinal , Tillmann Miltzow

Laver, and Woodin independently, showed that models of ${\rm ZFC}$ are uniformly definable in their set-forcing extensions, using a ground model parameter. We investigate ground model definability for models of fragments of ${\rm ZFC}$,…

Logic · Mathematics 2013-11-27 Victoria Gitman , Thomas A. Johnstone

We study first-order expansions of the reals which do not define the set of natural numbers. We also show that several stronger notions of tameness are equivalent to each others.

Logic · Mathematics 2011-04-12 Antongiulio Fornasiero

Assume ZF (without the Axiom of Choice). Let $j:V_\varepsilon\to V_\delta$ be a non-trivial $\in$-cofinal $\Sigma_1$-elementary embedding, where $\varepsilon,\delta$ are limit ordinals. We prove some restrictions on the constructibility of…

Logic · Mathematics 2020-12-21 Farmer Schlutzenberg
‹ Prev 1 3 4 5 6 7 10 Next ›