Questions tagged [set-theory]
forcing, large cardinals, descriptive set theory, infinite combinatorics, cardinal characteristics, forcing axioms, ultrapowers, measures, reflection, pcf theory, models of set theory, axioms of set theory, independence, axiom of choice, continuum hypothesis, determinacy, Borel equivalence relations, Boolean-valued models, embeddings, orders, relations, transfinite recursion, set theory as a foundation of mathematics, the philosophy of set theory.
1,112 questions
-1
votes
2
answers
263
views
Selection problem in a collection of non-empty sets
Is there a set $X\neq\emptyset$ and a collection ${\cal F}\subseteq {\cal P}(X)\setminus\{\emptyset\}$ of non-empty subsets of $X$ with the following properties?
$a\in {\cal F} \implies |a|\geq 2$,
$...
- 48.9k
-1
votes
1
answer
827
views
Is it possible to derive the rules of set theory as transfers from the pure finite set world, and can we extend this further?
Informally the idea of this question is about whether the rules of set theory can be derived as a transfer of some rules from the hereditarily finite set realm, and whether this transfer principle ...
- 11.3k
-1
votes
1
answer
573
views
is the existence of an inaccessible cardinal stronger than just CON(ZFC)? [closed]
is it even stronger than that ZFC has a transtitive model?
- 21
-1
votes
1
answer
261
views
Is Proper Class Choice equivalent to Global Choice?
Working in "MK-Regularity-Limitation of Size + Replacement for sets", call it the Base theory, let's coin the following axiom:
Axiom of Super-Choice:$$\forall \ relation \ R \ \exists F \...
- 11.3k
-1
votes
1
answer
402
views
Ubiquity beyond infinity, transitive closure and the recursion theorem?
I am considering a Principle of Ubiquity, expressed as follows - for a class theory where precisely the elements are sets - with the aid of set abstracts:
For $\alpha(y,z)$ a first order condition so ...
- 3,574
-1
votes
3
answers
637
views
What is the consistency strength of Z+ Accessibility?
Informally the axiom schema of accessibility states that for each unary function $F$ that is definable over the whole universe of discourse "in the language of set theory", like the powerset function $...
- 11.3k
-2
votes
1
answer
155
views
Does MK prove internally that there are more proper classes than sets?
Is the following provable in MK?
$\not \exists S: \\ \text{ } \\1. \ \ \forall s \in S \exists a,b (s=\langle a,b \rangle) \\ \text{ } \\2. \ \ \forall x (set(x) \to \exists! X (\neg set(X) \land \{...
- 11.3k
-2
votes
1
answer
167
views
If we limit matters what ZFC can prove, would that be consistent?
I was thinking about a principle that occurred to me regarding provability in ZFC and truth. The principle outrageously states that: whatever ZFC shows, it is! In other words whatever ZFC can prove ...
- 11.3k
-3
votes
1
answer
117
views
Can stratification be used to internalize functions on models of $\sf Z$?
Suppose $M$ is a model of $\sf Z +\neg AC$ that is externally bijective to an element $k \in M$. Obviously if $j$ denotes such an external bijection, then it cannot be used in Separation within $M$, ...
- 11.3k
-3
votes
1
answer
296
views
Can this form of reflection be consistent?
Is this form of reflection consistent?
First I'll begin by clarifying the notation I'm using here:
By a quantifier being relativized or bounded it means that the first occurrence of the quantified ...
- 11.3k
-4
votes
1
answer
267
views
Is Nested Selection equivalent to AC?
Nested Selection: For every infinite set $G$ of pairwise disjoint infinite sets such that any two distinct elements $x,y$ of $G$ either "$y$ is a set of proper supersets of elements of $x$ and ...
- 11.3k
-4
votes
1
answer
198
views
Is Bounding Reflection consistent?
Working in the first order language of set theory.
Let $\varphi^{*B}$ be the formula obtained from $\varphi$ by merely bounding all open quantifiers in $\varphi$ by the symbol "$B$".
Here a ...
- 11.3k