Displaying similar documents to “Basis problems in combinatorial set theory.”

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...

Definitions of finiteness based on order properties

Omar De la Cruz, Damir D. Dzhafarov, Eric J. Hall (2006)

Fundamenta Mathematicae

Similarity:

A definition of finiteness is a set-theoretical property of a set that, if the Axiom of Choice (AC) is assumed, is equivalent to stating that the set is finite; several such definitions have been studied over the years. In this article we introduce a framework for generating definitions of finiteness in a systematical way: basic definitions are obtained from properties of certain classes of binary relations, and further definitions are obtained from the basic ones by closing them...

On rigid relation principles in set theory without the axiom of choice

Paul Howard, Eleftherios Tachtsis (2016)

Fundamenta Mathematicae

Similarity:

We study the deductive strength of the following statements: 𝖱𝖱: every set has a rigid binary relation, 𝖧𝖱𝖱: every set has a hereditarily rigid binary relation, 𝖲𝖱𝖱: every set has a strongly rigid binary relation, in set theory without the Axiom of Choice. 𝖱𝖱 was recently formulated by J. D. Hamkins and J. Palumbo, and 𝖲𝖱𝖱 is a classical (non-trivial) 𝖹𝖥𝖢-result by P. Vopěnka, A. Pultr and Z. Hedrlín. ...

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..............................................................

α-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 α < ω₁.

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.

[unknown]

M. Jelić (1990)

Matematički Vesnik

Similarity:

Rudin's Dowker space in the extension with a Suslin tree

Teruyuki Yorioka (2008)

Fundamenta Mathematicae

Similarity:

We introduce a generalization of a Dowker space constructed from a Suslin tree by Mary Ellen Rudin, and the rectangle refining property for forcing notions, which modifies the one for partitions due to Paul B. Larson and Stevo Todorčević and is stronger than the countable chain condition. It is proved that Martin's Axiom for forcing notions with the rectangle refining property implies that every generalized Rudin space constructed from Aronszajn trees is non-Dowker, and that the same...

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.