English
Related papers

Related papers: A definable nonstandard model of the reals

200 papers

Consider an expansion $\mathcal R=(R,<,+,\ldots)$ of an ordered divisible Abelian group of finite burden defining no nonempty subset $X$ of $R$ which is dense and codense in a definable open subset $U$ of $R$ with $X \subseteq U$. We…

Logic · Mathematics 2025-02-27 Masato Fujita

The purpose of this paper is to clarify the relationship between various conditions implying essential undecidability: our main result is that there exists a theory $T$ in which all partially recursive functions are representable, yet $T$…

Logic · Mathematics 2020-05-13 Emil Jeřábek

We prove an analogue of Morley's categoricity theorem where cardinality is replaced by the recursion-theoretic notion of arithmetic degree. We say that a complete arithmetically definable theory $T$ is $D$-categorical if any two…

Logic · Mathematics 2026-05-04 Jun Le Goh , Chieu-Minh Tran

We show that in an ultraproduct of finite fields, the mod-$n$ nonstandard size of definable sets varies definably in families. Moreover, if $K$ is any pseudofinite field, then one can assign "nonstandard sizes mod $n$" to definable sets in…

Logic · Mathematics 2019-12-17 Will Johnson

This work is motivated by the problem of finding the limit of the applicability of the first incompleteness theorem ($\sf G1$). A natural question is: can we find a minimal theory for which $\sf G1$ holds? We examine the Turing degree…

Logic · Mathematics 2025-10-07 Yong Cheng

In this paper we prove three theorems about the theory of Borel sets in models of ZF without any form of the axiom of choice. We prove that if B is a G-delta-sigma set, then either B is countable or B contains a perfect subset. Second, we…

Logic · Mathematics 2008-06-13 Arnold W. Miller

Let $T$ be a countable complete first-order theory with a definable, infinite, discrete linear order. We prove that $T$ has continuum-many countable models. The proof is purely first-order, but raises the question of Borel completeness of…

Logic · Mathematics 2026-02-24 Predrag Tanović

We show that ${\mathbb Z}$ is definable in ${\mathbb Q}$ by a universal first-order formula in the language of rings. We also present an $\forall\exists$-formula for ${\mathbb Z}$ in ${\mathbb Q}$ with just one universal quantifier. We…

Number Theory · Mathematics 2013-11-14 Jochen Koenigsmann

If ZFC is consistent, then the collection of countable computably saturated models of ZFC satisfies all of the Multiverse Axioms introduced by Hamkins.

Logic · Mathematics 2011-04-25 Victoria Gitman , Joel David Hamkins

Suppose L = {<, . . .} is any countable first order language in which < is interpreted as a linear order. Let T be any complete first order theory in the language L such that T has a kappa-like model where kappa is an inaccessible cardinal.…

Logic · Mathematics 2010-06-22 Shahram Mohsenipour

We show that an inner model of a class-generic extension of L need not itself be such an extension. Our example is of the form L[R], where R is a real belonging to a class-generic extension of L and constructible from 0#.

Logic · Mathematics 2016-09-06 Sy D. Friedman

We prove the existence of infinite dense free sets (in the usual topology) for set mappings on the reals, under reasonable assumptions.

Logic · Mathematics 2016-11-15 Shimon Garti

The well known binary and decimal representations of the integers, and other similar number systems, admit many generalisations. Here, we investigate whether still every integer could have a finite expansion on a given integer base b, when…

Number Theory · Mathematics 2008-10-03 Christiaan van de Woestijne

We provide a real algebraic symbolic-numeric algorithm for computing the real variety $V_R(I)$ of an ideal $I$, assuming it is finite while $V_C(I)$ may not be. Our approach uses sets of linear functionals on $R[X]$, vanishing on a given…

Algebraic Geometry · Mathematics 2009-01-16 J. B. Lasserre , M. Laurent , P. Rostalski

Exploring further the properties of ITRM-recognizable reals, we provide a detailed analysis of recognizable reals and their distribution in G\"odels constructible universe L. In particular, we show that, for unresetting infinite time…

Logic · Mathematics 2026-05-19 Merlin Carl

By Tzouvaras, a set is nontypical in the Russell sense, if it belongs to a countable ordinal definable set. The class HNT of all hereditarily nontypical sets satisfies all axioms of ZF and the double inclusion HOD$\subseteq$HNT$\subseteq$V…

Logic · Mathematics 2021-11-16 Vladimir Kanovei , Vassily Lyubetsky

Let R be a sufficiently saturated o-minimal expansion of a real closed field, let O be the convex hull of the rationals in R, and let st: O^n \to \mathbb{R}^n be the standard part map. For X \subseteq R^n define st(X):=st(X \cap O^n). We…

Logic · Mathematics 2007-06-04 Jana Maříková

We develop a realizability model in which the realizers are the reals not just Turing computable in a fixed real but rather the reals in a countable ideal of Turing degrees. This is then applied to prove several separation results involving…

Logic · Mathematics 2015-10-09 Robert S. Lubarsky , Michael Rathjen

Let $\mathcal{R}$ be an expansion of the ordered real additive group. When $\mathcal{R}$ is o-minimal, it is known that either $\mathcal{R}$ defines an ordered field isomorphic to $(\mathbb{R},<,+,\cdot)$ on some open subinterval…

Logic · Mathematics 2021-03-09 Philipp Hieronymi , Erik Walsberg

A new axiom is proposed, the Ground Axiom, asserting that the universe is not a nontrivial set forcing extension of any inner model. The Ground Axiom is first-order expressible, and any model of ZFC has a class forcing extension which…

Logic · Mathematics 2007-05-23 Jonas Reitz
‹ Prev 1 4 5 6 7 8 10 Next ›