All Questions
16 questions
1
vote
0
answers
81
views
How strong is separation + reflection without transitivity?
Consider a theory $T$ with a binary relation $\in$ and the following axiom schemas:
$\exists u \forall x (x \in u \leftrightarrow x \in a \land \phi)$ where $u$ is not free in $\phi$. This is the ...
- 2,203
14
votes
0
answers
391
views
Can the axiom of choice be expressed in 4 quantifiers?
This 2007 paper presents a 5-quantifier $(\in, =)$-expression that is ZF-equivalent to the axiom of choice, but leaves open the 4-quantifier case:
Thus the gap is reduced to the undecided case of a 4 ...
- 2,203
12
votes
1
answer
227
views
Is there a $\Pi_2$ sentence $A$ such that $\text{ZFC}^- + A$ proves powerset?
This is a follow-up to this question.
Let $\text{ZFC}^-$ be ZFC without powerset and with collection rather than replacement, as described here.
Is there a $\Pi_2$ (or perhaps $\Sigma_2$) sentence $A$ ...
- 2,203
4
votes
1
answer
369
views
Bounded alternatives to powerset that interpret ZFC
In set theory, many properties/relations of interest can be expressed as $\Delta_0$ formulas (formulas with only bounded quantifiers):
\begin{align}
\text{empty}(a) &\equiv \forall x \in a . \...
- 2,203
3
votes
1
answer
510
views
Harvey Friedman: The expanding mind
In reference 1, Friedman writes:
I discuss my efforts concerning 3 crucial issues in the foundations of mathematics that are deeply connected with the great work of Kurt Gödel.
[...]
B. Are there ...
- 2,203
6
votes
1
answer
205
views
How strong is separation + reflection of unbounded quantifiers?
Consider a set theory with the following axioms:
separation: $\exists y \forall x (x \in y \leftrightarrow \phi \land x \in a)$ where $y$ is not free in $\phi$
reflection: $\phi \to \exists u \phi^u$
...
- 2,203
1
vote
0
answers
123
views
Is $\sf \Gamma_0$ the proof theoretic ordinal of this kind of predicative class theory?
Adopting the approach of Mono-sorted $\sf NBG$, define sets as elements of classes, then axiomatize:
Extensionality, Predicative Class comprehension, emptyset, in the usual manner along mono-sorted $\...
- 11.3k
7
votes
2
answers
588
views
Consistency strength of an attempt at higher order set theory
Work in a theory with (deep breath) a countable number of primitives denoted with capital letters from the end of the alphabet with numerical subscripts $\{X_n,Y_n,Z_n,\dots\}_{n<\omega}$ ...
- 10.1k
12
votes
0
answers
574
views
Harvey Friedman's minimalist axioms for set theory
[This is a question on the FOM mailing list.]
In 1997, Harvey Friedman introduced the following theory: Let $\in$ be a binary predicate and $U$ be a constant. Add the following axioms:
Subworld ...
- 2,203
1
vote
0
answers
192
views
Does foundationless Ackermann set theory prove replacement?
From Ackermann's set theory equals ZF (1970) by William N. Reinhardt:
Let A be the theory determined by the following axioms:
Extensionality: $\forall z (z \in x \leftrightarrow z \in y) \to x = y$
...
- 2,203
5
votes
2
answers
629
views
Applications of ZFA-Set Theory
The set theory with atoms (ZFA), is a modified version of set theory, and is characterized by the fact that it admits objects other than sets, atoms. Atoms are objects which do not have any elements.
...
- 115
3
votes
2
answers
720
views
Shortest axiom of infinity for foundationless set theory
Let $T$ be the theory with a binary symbol $\in$, an unary symbol $S$, and the following axioms:
Axiom of extension:
\begin{equation}
\forall x \forall y (\forall z (z \in x \leftrightarrow z \in ...
- 2,203
55
votes
10
answers
11k
views
How should a "working mathematician" think about sets? (ZFC, category theory, urelements)
Note that "a working mathematician" is probably not the best choice of words, it's supposed to mean "someone who needs the theory for applications rather than for its own sake". Think about it as a ...
- 1,115
-3
votes
1
answer
262
views
An axiomatic system with a set of constants that form a complete ordered field [closed]
I am developing a ZFC axiomatic system where together with the empty set, there is a singular (and huge) set of constants that are themselves sets and form a complete ordered field (cof) these ...
- 201
5
votes
1
answer
191
views
Class theory with support for self-application of class functions?
To every natural number $n$, we can assign its Church numeral $\underline{n}.$ A formal definition would be:
$\underline{0}(f)=\mathrm{id}_{\mathrm{dom}(f)}$
$\underline{n+1}(f) = \underline{n}...
- 3,793
4
votes
2
answers
452
views
On wild behavior of $\omega_{1}$ in the absence of some essential axioms of $ZFC$
The regularity of $\omega_{1}$ is one of the most well known facts of set theory. But it seems that in order to prove this simple fact we need the "full power" of mathematics! For example by an ...
user36136