English
Related papers

Related papers: Definable ${\mathsf E}_0$ classes at arbitrary pro…

200 papers

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 $n$ be a positive integer, and let $R$ be a (possibly infinite dimensional) finitely presented algebra over a computable field of characteristic zero. We describe an algorithm for deciding (in principle) whether $R$ has at most finitely…

Rings and Algebras · Mathematics 2007-05-23 Edward S. Letzter

In $\mathsf{ZFC}$, if there is a measurable cardinal with infinitely many Woodin cardinals below it, then for every equivalence relation $E \in L(\mathbb{R})$ on $\mathbb{R}$ with all $\mathbf{\Delta}_1^1$ classes and every $\sigma$-ideal…

Logic · Mathematics 2016-08-18 William Chan , Menachem Magidor

We show in ZFC that there is no set of reals of size continuum which can be translated away from every set in the Marczewski ideal. We also show that in the Cohen model, every set with this property is countable.

Logic · Mathematics 2024-01-10 Joerg Brendle , Wolfgang Wohofsky

It was realized early on that topologies can model constructive systems, as the open sets form a Heyting algebra. After the development of forcing, in the form of Boolean-valued models, it became clear that, just as over ZF any…

Logic · Mathematics 2015-10-06 Robert Lubarsky

CZF is a system of set theory which, over classical logic, is equivalent to ZF, while over intuitionistic logic, it has a well-known constructive type-theoretic interpretation. This article introduces a simpler, intuitive family of…

Logic · Mathematics 2011-02-23 Daniel Méhkeri

We construct, in $\mathsf{ZFC}$, a countably compact subgroup of $2^{\mathfrak{c}}$ without non-trivial convergent sequences, answering an old problem of van Douwen. As a consequence we also prove the existence of two countably compact…

General Topology · Mathematics 2021-02-23 Michael Hrušák , Jan van Mill , Ulises Ariet Ramos-García , Saharon Shelah

If F is a type-definable family of commensurable subsets, subgroups or sub-vector spaces in a metric structure, then there is an invariant subset, subgroup or sub-vector space commensurable with F. This in particular applies to…

Logic · Mathematics 2020-04-10 Itaï Ben Yaacov , Frank Olaf Wagner

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

A subset $A$ of a topological space $X$ is called relatively functionally countable (RFC) in $X$, if for each continuous function $f : X \to \mathbb{R}$ the set $f[A]$ is countable. We prove that all RFC subsets of a product…

General Topology · Mathematics 2024-11-11 Anton Lipin

In this paper, we deal with the notions of naturality from category theory and definablity from model theory and their interactions. In this regard, we present three results. First, we show, under some mild conditions, that naturality…

Logic · Mathematics 2025-10-02 Mohsen Asgharzadeh , Mohammad Golshani , Saharon Shelah

A new construction is given of non-standard uniserial modules over certain valuation domains; the construction resembles that of a special Aronszajn tree in set theory. A consequence is the proof of a sufficient condition for the existence…

Logic · Mathematics 2009-09-25 Paul C. Eklof , Saharon Shelah

We make use of generalized iterations of Jensen forcing to define a cardinal-preserving generic model of ZF for any $n\ge 1$ and each of the following four Choice hypotheses: (1)…

Logic · Mathematics 2025-12-22 Vladimir Kanovei , Vassily Lyubetsky

We introduce a ZFC method that enables us to build spaces (in fact special dense subspaces of certain Cantor cubes) in which we have "full control" over all dense subsets. Using this method we are able to construct, in ZFC, for each…

General Topology · Mathematics 2007-05-23 Istvan Juhasz , Lajos Soukup , Zoltan Szentmiklossy

We formalize the theory of forcing in the set theory framework of Isabelle/ZF. Under the assumption of the existence of a countable transitive model of ZFC, we construct a proper generic extension and show that the latter also satisfies…

Logic in Computer Science · Computer Science 2020-04-21 Emmanuel Gunther , Miguel Pagano , Pedro Sánchez Terraf

We use the technique of "classical realizability" to build new models of ZF + DC in which R is not well ordered. This gives new relative consistency results, probably not obtainable by forcing. This gives also a new method to get programs…

Logic in Computer Science · Computer Science 2018-03-20 Jean-Louis Krivine

The compactness phenomenon is one of the featured aspects of structuralism in mathematics. In simple and broad words, a compactness property holds in a structure if a related property is satisfied by sufficiently many substructures of that…

Logic · Mathematics 2024-08-29 Rahman Mohammadpour

The axiom of countable choice for reals is one of the most basic fragments of the axiom of choice needed in many parts of mathematics. Descriptive choice principles are a further stratification of this fragment by the descriptive complexity…

Logic · Mathematics 2023-07-20 Lucas Wansner , Ned J H Wontner

We study uncountable structures similar to the Fra\"iss\'e limits. The standard inductive arguments from the Fra\"iss\'e theory are replaced by forcing, so the structures we obtain are highly sensitive to the universe of set theory. In…

Logic · Mathematics 2024-12-19 Ziemowit Kostana

Let $F_{\omega_1}$ be the countable admissible ordinal equivalence relation defined on ${}^\omega 2$ by $x \ F_{\omega_1} \ y$ if and only if $\omega_1^x = \omega_1^y$. It will be shown that $F_{\omega_1}$ is classifiable by countable…

Logic · Mathematics 2016-02-01 William Chan