• Corpus ID: 235358089

Choiceless Chain Conditions

@inproceedings{Karagila2021ChoicelessCC,
  title={Choiceless Chain Conditions},
  author={Asaf Karagila and Noah David Schweber},
  year={2021}
}
. Chain conditions are one of the major tools used in the theory of forcing. We say that a partial order has the countable chain condition if every antichain (in the sense of forcing) is countable. Without the axiom of choice antichains tend to be of little use, for various reasons, and in this short note we study a number of conditions which in ZFC are equivalent to the countable chain condition. 

References

SHOWING 1-10 OF 17 REFERENCES
Provable Forms of Martin's Axiom
  • G. Shannon
  • Mathematics
    Notre Dame J. Formal Log.
  • 1990
It is shown that if Martin's Axiom (MA) is restricted to well-orderable sets, and if the countable antichain condition is replaced by either a finite antichain condition or a finite «Q-strong
Choiceless Löwenheim–Skolem Property and Uniform Definability of Grounds
  • Toshimichi Usuba
  • Economics, Mathematics
    Springer Proceedings in Mathematics & Statistics
  • 2021
In this paper, without the axiom of choice, we show that if a certain downward Lowenheim-Skolem property holds then all grounds are uniformly definable. We also prove that the axiom of choice is
The maximum principle in forcing and the axiom of choice
In this paper we prove that the maximum principle in forcing is equivalent to the axiom of choice. We also look at some specic partial orders in the basic Cohen model.
On Martin's Axiom and Forms of Choice
TLDR
This paper defines MA∗ to be the statement that for every (not necessarily well-ordered) cardinal n < 2א0 , the authors have that MAn holds, and investigates the set-theoretic strength of the principleMA∗.
Generic extensions of models of ZFC
The paper contains a self-contained alternative proof of my Theorem in Characterization of generic extensions of models of set theory, Fund. Math. 83 (1973), 35--46, saying that for models
ITERATING SYMMETRIC EXTENSIONS
TLDR
A framework for iterating symmetric extensions in order to construct new models of ZF is developed and it is shown how to obtain some well-known and lesser-known results using this framework.
THE AXIOM OF CHOICE
We propose that failures of the axiom of choice, that is, surjective functions admitting no sections, can be reasonably classified by means of invariants borrowed from algebraic topology. We show
Preserving Dependent Choice
  • Asaf Karagila
  • Mathematics
    Bulletin of the Polish Academy of Sciences Mathematics
  • 2019
We prove some general theorems for preserving Dependent Choice when taking symmetric extensions, some of which are unwritten folklore results. We apply these to various constructions to obtain
Intermediate Submodels and Generic Extensions in Set Theory
Six impossible rings
...
...