English
Related papers

Related papers: Independence Results around Constructive ZF

200 papers

This paper is a contribution to the study of extensions of arbitrary models of ZF (Zermelo-Fraenkel set theory), with no regard to countability or well-foundedness of the models involved. We present some new constructions of certain types…

Logic · Mathematics 2026-04-07 Ali Enayat

A Coxeter group W is called reflection independent if its reflections are uniquely determined by W only, independently on the choice of the generating set. We give a new sufficient condition for the reflection independence, and examine this…

Group Theory · Mathematics 2007-05-23 Koji Nuida

We show that it is not provable in ZFC that any two countable elementarily equivalent structures have isomorphic ultrapowers relative to some ultrafilter on omega .

Logic · Mathematics 2008-02-03 Saharon Shelah

While it was defined long ago, the extension of CTL with quantification over atomic propositions has never been studied extensively. Considering two different semantics (depending whether propositional quantification refers to the Kripke…

Logic in Computer Science · Computer Science 2015-07-01 François Laroussinie , Nicolas Markey

We introduce finite support iterations of symmetric systems, and use them to provide a strongly modernized proof of David Pincus' classical result that the axiom of dependent choice is independent over ZF with the ordering principle…

Logic · Mathematics 2026-01-14 Peter Holy , Jonathan Schilhan

We provide a general preservation theorem for preserving selective independent families along countable support iterations. The theorem gives a general framework for a number of results in the literature concerning models in which the…

Logic · Mathematics 2022-08-23 Vera Fischer , Corey Bacal Switzer

This paper introduces an alternative approach to proving the existence of choice functions for specific families of sets within Zermelo-Fraenkel set theory (ZF) without assuming any form on the Axiom of Choice (AC). Traditional methods of…

Logic · Mathematics 2026-02-24 Valentyn Khokhlov

We construct in ZFC a countably compact group without non-trivial convergent sequences of size $2^{\mathfrak{c}}$, answering a question of Bellini, Rodrigues and Tomita. We also construct in ZFC a selectively pseudocompact group which is…

General Topology · Mathematics 2021-09-01 Artur Hideyuki Tomita , Juliane Trianon-Fraga

We give three counterexamples to the folklore claim that in an arbitrary theory, if a complete type $p$ over a set $B$ does not divide over $C\subseteq B$, then no extension of $p$ to a complete type over $\text{acl}(B)$ divides over $C$.…

Logic · Mathematics 2024-11-20 Gabriel Conant , Alex Kruckman

In [G. Curi, "Exact approximations to Stone-Cech compactification'', Ann. Pure Appl. Logic, 146, 2-3, 2007, pp. 103-123] a characterization is obtained of the locales of which the Stone-Cech compactification can be defined in constructive…

Logic · Mathematics 2010-01-12 Giovanni Curi

Structural independence is the (conditional) independence that arises from the structure rather than the precise numerical values of a distribution. We develop this concept and relate it to $d$-separation and structural causal models.…

Probability · Mathematics 2025-06-24 Matthias Georg Mayer

I introduce an approach for automated reasoning in first order set theories that are not finitely axiomatizable, such as $ZFC$, and describe its implementation alongside the automated theorem proving software E. I then compare the results…

Logic in Computer Science · Computer Science 2019-02-05 John Hester

Free independence is an important tool for studying the structure of operator algebras. It is natural to ask from the model-theoretic standpoint whether free independence is captured well in first-order model theory via the notion of a…

Operator Algebras · Mathematics 2026-02-25 William Boulanger , Jakub Curda , Emma Harvey , Yizhi Li , Jennifer Pi

Mathematicians still use Naive Set Theory when generating sets without danger of producing any contradiction. Therefore their working method can be considered as a consistent inference system with an experience of over 100 years. My…

Logic · Mathematics 2008-07-29 Werner DePauli-Schimanovich

This paper exposes a contradiction in the Zermelo-Fraenkel set theory with the axiom of choice (ZFC). While Godel's incompleteness theorems state that a consistent system cannot prove its consistency, they do not eliminate proofs using a…

Logic in Computer Science · Computer Science 2017-01-03 Minseong Kim

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

We discuss some highlights of our computer-verified proof of the construction, given a countable transitive set-model $M$ of $\mathit{ZFC}$, of generic extensions satisfying $\mathit{ZFC}+\neg\mathit{CH}$ and $\mathit{ZFC}+\mathit{CH}$.…

Let $\mathsf{KP}$ denote Kripke-Platek Set Theory and let $\mathsf{M}$ be the weak set theory obtained from $\mathsf{ZF}$ by removing the collection scheme, restricting separation to $\Delta_0$-formulae and adding an axiom asserting that…

Logic · Mathematics 2025-08-28 Zachiri McKenzie

Let $f$ be a transcendental entire function. The escaping set $I(f)$ consists of those points that tend to infinity under iteration of $f$. We show that $I(f)$ is not $\sigma$-compact, resolving a question of Rippon from 2009.

Dynamical Systems · Mathematics 2022-09-15 Lasse Rempe

A proof of G\"odel's incompleteness theorem is given. With this new proof a transfinite extension of G\"odel's theorem is considered. It is shown that if one assumes the set theory ZFC on the meta level as well as on the object level, a…

Logic · Mathematics 2009-05-25 Hitoshi Kitada