English
Related papers

Related papers: When does every definable nonempty set have a defi…

200 papers

A pointwise definable model is one in which every object is definable without parameters. In a model of set theory, this property strengthens V=HOD, but is not first-order expressible. Nevertheless, if ZFC is consistent, then there are…

Logic · Mathematics 2012-06-20 Joel David Hamkins , David Linetsky , Jonas Reitz

We prove that the class of all ordinals Ord is not weakly compact with respect to definable classes. Specifically, in any model of ZFC, the definable tree property fails for Ord, in that there is a definable Ord tree with no definable…

Logic · Mathematics 2017-10-27 Ali Enayat , Joel David Hamkins

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

It is true in the Solovay model that every countable ordinal-definable set of sets of reals contains only ordinal-definable elements.

Logic · Mathematics 2018-08-16 Vladimir Kanovei

We define a certain finite set in set theory $\{x\mid\varphi(x)\}$ and prove that it exhibits a universal extension property: it can be any desired particular finite set in the right set-theoretic universe and it can become successively any…

Logic · Mathematics 2018-06-21 Joel David Hamkins , W. Hugh Woodin

Assume $\mathsf{ZF + AD^+ + V = L(\mathscr{P}(\mathbb{R}))}$. Let $E$ be a $\mathbf{\Sigma}^1_1$ equivalence relation coded in $\mathrm{HOD}$. $E$ has an ordinal definable equivalence class without any ordinal definable elements if and only…

Logic · Mathematics 2017-11-15 William Chan

Ehrenfeucht's lemma (1973) asserts that whenever one element of a model of Peano arithmetic is definable from another, then they satisfy different types. We consider here the analogue of Ehrenfeucht's lemma for models of set theory. The…

Logic · Mathematics 2018-08-15 Gunter Fuchs , Victoria Gitman , Joel David Hamkins

We make use of a finite support product of Jensen forcing to define a model in which there is a countable non-empty lightface $\Pi^1_2$ set of reals containing no ordinal-definable real.

Logic · Mathematics 2018-09-05 Vladimir Kanovei , Vassily Lyubetsky

Assuming that ORD is $\omega +\omega $-Erd\"os we show that if a class forcing amenable to $L$ (an $L$-forcing) has a generic then it has one definable in a set-generic extension of $L[O^\#]$. In fact we may choose such a generic to be {\it…

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

Let $M$ be a tame mouse modelling ZFC. We show that $M$ satisfies "$V=\mathrm{HOD}_x$ for some real $x$", and that the restriction $\mathbb{E}\upharpoonright[\omega_1^M,\mathrm{OR}^M)$ of the extender sequence $\mathbb{E}^M$ of $M$ to…

Logic · Mathematics 2026-04-15 Farmer Schlutzenberg

In light of the celebrated theorem of Vop\v{e}nka (1972), proving in ZFC that every set is generic over HOD, it is natural to inquire whether the set-theoretic universe $V$ must be a class-forcing extension of HOD by some possibly…

Logic · Mathematics 2017-09-25 Joel David Hamkins , Jonas Reitz

We analyze the effect of replacing several natural uses of definability in set theory by the weaker model-theoretic notion of algebraicity. We find, for example, that the class of hereditarily ordinal algebraic sets is the same as the class…

Logic · Mathematics 2016-09-14 Joel David Hamkins , Cole Leahy

We give characterizations for the (in ZFC unprovable) sentences ``Every $\Sb{1}{2}$--set is measurable" and ``Every $\Db{1}{2}$--set is measurable" for various notions of measurability derived from well--known forcing partial orderings.

Logic · Mathematics 2016-09-07 Jörg Brendle , Benedikt Loewe

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 holds.…

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

In this paper, a computably definable predicate is defined and characterized. Then, it is proved that every separable infinite-dimensional Hilbert structure in an effectively presented language is computable. Moreover, every definable…

Logic in Computer Science · Computer Science 2020-11-12 Nazanin Roshandel Tavana

We give a new proof of quantifier elimination in the theory of all ordered abelian groups in a suitable language. More precisely, this is only "quantifier elimination relative to ordered sets" in the following sense. Each definable set in…

Logic · Mathematics 2012-01-24 Raf Cluckers , Immanuel Halupczok

Let $\mathcal F=(F, +. \cdot, <, 0, 1, \dots)$ be a definably complete locally o-minimal expansion of an ordered field. We demonstrate the existence of definable quotients of definable sets by definable equivalence relations when several…

Logic · Mathematics 2026-01-09 Masato Fujita , Tomohiro Kawakami

We produce, relative to a ${\sf ZFC}$ model with a supercompact cardinal, a ${\sf ZFC}$ model of the Proper Forcing Axiom in which the nonstationary ideal on $\omega_1$ is $\Pi_1$-definable in a parameter from $H_{\aleph_2}$.

Logic · Mathematics 2025-04-16 Stefan Hoffelner , Paul Larson , Ralf Schindler , Liuzhen Wu

We show that in $L(\mathbb{R})$, assuming large cardinals, $\mathsf{HOD} {\parallel}\eta^{+\mathsf{HOD}}$ is locally definable from $\mathsf{HOD} {\parallel}\eta$ for all $\mathsf{HOD}$-cardinals $\eta\in [\boldsymbol{\delta}^2_1,\Theta)$.…

Logic · Mathematics 2023-08-03 Obrad Kasum

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
‹ Prev 1 2 3 10 Next ›