English
Related papers

Related papers: The full basis theorem does not imply analytic wel…

200 papers

Using an invariant modification of Jensen's "minimal $\varPi^1_2$ singleton" forcing, we define a model of ZFC, in which, for a given $n\ge2$, there exists a lightface $\varPi^1_n$ unordered pair of non-OD (hence, OD-indiscernible)…

Logic · Mathematics 2020-01-01 Vladimir Kanovei , Vassily Lyubetsky

Using a modification of the invariant Jensen forcing, we define a model of ZFC, in which, for a given $n\ge3$, there exists a lightface $\varPi^1_n$ set of reals, which is a ${\mathsf E}_0$ equivalence class, hence a countable set, and…

Logic · Mathematics 2018-11-07 Vladimir Kanovei , Vassily Lyubetsky

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

We show that the theory ZFC-, consisting of the usual axioms of ZFC but with the power set axiom removed-specifically axiomatized by extensionality, foundation, pairing, union, infinity, separation, replacement and the assertion that every…

Logic · Mathematics 2015-08-05 Victoria Gitman , Joel David Hamkins , Thomas A. Johnstone

It is shown that the boldface maximality principle for subcomplete forcing, together with the assumption that the universe has only set-many grounds, implies the existence of a (parameter-free) definable well-ordering of…

Logic · Mathematics 2018-02-15 Gunter Fuchs

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

We construct a model of $\mathsf{ZF} + \mathsf{DC}$ containing a Luzin set, a Sierpi\'{n}ski set, as well as a Burstin basis but in which there is no a well ordering of the continuum.

Logic · Mathematics 2018-09-28 Jörg Brendle , Fabiana Castiblanco , Ralf Schindler , Liuzhen Wu , Liang Yu

We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…

Logic · Mathematics 2016-09-06 Alan H. Mekler , Saharon Shelah

The goal of this paper is twofold. In addition to the results stated in the next paragraph, we present some classical results on absoluteness relevant to functional analysis that are well known to logicians but not nearly as well advertised…

Operator Algebras · Mathematics 2026-02-18 Bruce Blackadar , Ilijas Farah

A set theory is developed based on the approximations of sets and denoted by AS. In AS the set of all sets exists but the argument for Russell's and Cantor's paradox fail. The Axioms of Separation, Replacement and Foundation are not valid.…

General Mathematics · Mathematics 2009-04-15 Slavko Rede

We show that, under the assumption of the existence of $M_1^{\#}$, there exists a model on which the restricted nonstationary ideal $\hbox{NS} \upharpoonright A$ is $\aleph_2$-saturated, for $A$ a stationary co-stationary subset of…

Logic · Mathematics 2016-10-14 Stefan Hoffelner

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

It is well known that ZFC, despite its usefulness as a foundational theory for mathematics, has two unwanted features: it cannot be written down explicitly due to its infinitely many axioms, and it has a countable model due to the…

General Mathematics · Mathematics 2021-06-15 Marcoen J. T. F. Cabbolet

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

We give a computational interpretation to an abstract instance of Zorn's lemma formulated as a wellfoundedness principle in the language of arithmetic in all finite types. This is achieved through G\"odel's functional interpretation, and…

Logic in Computer Science · Computer Science 2020-04-29 Thomas Powell

In [5], Hjorth proved that for every countable ordinal $\alpha$, there exists a complete $\mathcal{L}_{\omega_1,\omega}$-sentence $\phi_\alpha$ that has models of all cardinalities less than or equal to $\aleph_\alpha$, but no models of…

Logic · Mathematics 2021-09-16 Philipp Lücke , Ioannis Souldatos

In this paper I introduce a new and intuitive first-order foundational theory (where the concept of set is not primitive) and use it to show that the power set of an infinite set does not exist. In particular, proofs of uncountability of a…

Logic · Mathematics 2018-12-04 Eddy El Khalil

We will prove that there exists a model of ZFC+``c= omega_2'' in which every M subseteq R of cardinality less than continuum c is meager, and such that for every X subseteq R of cardinality c there exists a continuous function f:R-> R with…

Logic · Mathematics 2016-09-07 Krzysztof Ciesielski , Saharon Shelah

In two papers we noted that in common practice many algebraic constructions are defined only `up to isomorphism' rather than explicitly. We mentioned some questions raised by this fact, and we gave some partial answers. The present paper…

Logic · Mathematics 2007-05-23 Wilfrid Hodges , Saharon Shelah

A fully analytical approximation for the observable characteristics of many-electron atoms is developed via a complete and orthonormal hydrogen-like basis with a single-effective charge parameter for all electrons of a given atom. The basis…

Quantum Physics · Physics 2017-12-06 O. D. Skoromnik , I. D. Feranchuk , A. U. Leonau , C. H. Keitel
‹ Prev 1 2 3 10 Next ›