Displaying similar documents to “Stranger things about forcing without AC”

Inaccessible cardinals without the axiom of choice

Andreas Blass, Ioanna M. Dimitriou, Benedikt Löwe (2007)

Fundamenta Mathematicae

Similarity:

We consider four notions of strong inaccessibility that are equivalent in ZFC and show that they are not equivalent in ZF.

α-Properness and Axiom A

Tetsuya Ishiu (2005)

Fundamenta Mathematicae

Similarity:

We show that under ZFC, for every indecomposable ordinal α < ω₁, there exists a poset which is β-proper for every β < α but not α-proper. It is also shown that a poset is forcing equivalent to a poset satisfying Axiom A if and only if it is α-proper for every α < ω₁.

Internal and forcing models for the impredicative theory of classes

Rolando Chuaqui

Similarity:

CONTENTSIntroduction............................................................................................................ 5I. Axiom system and elementary consequences........................................... 61. Axioms........................................................................................................................ 62. Definitions and elementary consequences........................................................ 9II. Principles of definitions by recursion..............................................................

On a Certain Notion of Finite and a Finiteness Class in Set Theory without Choice

Horst Herrlich, Paul Howard, Eleftherios Tachtsis (2015)

Bulletin of the Polish Academy of Sciences. Mathematics

Similarity:

We study the deductive strength of properties under basic set-theoretical operations of the subclass E-Fin of the Dedekind finite sets in set theory without the Axiom of Choice ( AC ), which consists of all E-finite sets, where a set X is called E-finite if for no proper subset Y of X is there a surjection f:Y → X.

On partial orderings having precalibre-ℵ₁ and fragments of Martin's axiom

Joan Bagaria, Saharon Shelah (2016)

Fundamenta Mathematicae

Similarity:

We define a countable antichain condition (ccc) property for partial orderings, weaker than precalibre-ℵ₁, and show that Martin's axiom restricted to the class of partial orderings that have the property does not imply Martin's axiom for σ-linked partial orderings. This yields a new solution to an old question of the first author about the relative strength of Martin's axiom for σ-centered partial orderings together with the assertion that every Aronszajn tree is special. We also answer...

On the Leibniz-Mycielski axiom in set theory

Ali Enayat (2004)

Fundamenta Mathematicae

Similarity:

Motivated by Leibniz’s thesis on the identity of indiscernibles, Mycielski introduced a set-theoretic axiom, here dubbed the Leibniz-Mycielski axiom LM, which asserts that for each pair of distinct sets x and y there exists an ordinal α exceeding the ranks of x and y, and a formula φ(v), such that ( V α , ∈ ) satisfies φ(x) ∧¬ φ(y). We examine the relationship between LM and some other axioms of set theory. Our principal results are as follows: 1. In the presence of ZF, the following are equivalent: (a)...

Set-theoretic constructions of two-point sets

Ben Chad, Robin Knight, Rolf Suabedissen (2009)

Fundamenta Mathematicae

Similarity:

A two-point set is a subset of the plane which meets every line in exactly two points. By working in models of set theory other than ZFC, we demonstrate two new constructions of two-point sets. Our first construction shows that in ZFC + CH there exist two-point sets which are contained within the union of a countable collection of concentric circles. Our second construction shows that in certain models of ZF, we can show the existence of two-point sets without explicitly invoking the...