All Questions
Tagged with set-theory foundations
33 questions with no upvoted or accepted answers
19
votes
0
answers
703
views
The cofinality of $(\mathbb{N}^\kappa,\le)$ for uncountable $\kappa$?
For a partially ordered set $P$, a set $A\subseteq P$ is cofinal if for each element of $P$ there is a larger element in $A$. The cofinality of $P$, ${\rm cof}(P)$, is the minimal cardinality of a ...
- 3,104
17
votes
0
answers
509
views
The free complete lattice on three generators, beyond ZF
This was originally asked at MSE; although it is still under bounty it seems unlikely to be answered there.
$\mathsf{ZF}$ proves that there is no free complete lattice on three generators since any ...
- 20.5k
14
votes
0
answers
390
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
0
answers
210
views
Are there times when replacement is "more natural" than collection?
There are a couple examples I'm aware of where choosing to axiomatize $\mathsf{ZF(C)}$ using collection instead of replacement results in a much nicer (or at least less surprising) picture:
Let $\...
- 20.5k
12
votes
0
answers
269
views
Freiling's question
(I've asked this question at Math StackExchange here but haven't gotten any response, so I decided to take a shot here as well.)
In his paper "Axioms of Symmetry: Throwing Darts at the Real ...
- 231
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
6
votes
0
answers
190
views
Is Vopěnka's principle inherited by Grothendieck topoi?
I call the Vopěnka's principle:
Every subfunctor of an accessible functor is accessible
but other formulations (which may lose equivalence in weak contexts?) are also interesting to me.
If this is ...
- 6,962
5
votes
0
answers
278
views
Class theory of ZF-minus-Powerset as classical predicative system?
I've been thinking about some mathematics in weaker foundational systems a little bit, largely from a structural viewpoint, and with particular attention to classes.
Some categories I've been keeping ...
- 35.5k
4
votes
0
answers
140
views
Is well-pointedness the reason that the internal/external distinction seems not to apply to $\mathbf{Set}$?
When reasoning about the category of sets, we usually don't have to worry about the internal/external distinction. For example, if $f : X \rightarrow Y$ is a morphism of sets, then $f$ is either ...
- 3,793
4
votes
0
answers
424
views
What are the requirements of a foundational theory?
There are multiple languages to describe all of mathematics, and there are some equivalences between them, some more successful then others.
My question is can we describe some requirements (in some ...
- 773
3
votes
0
answers
165
views
Suitability of formal type theory for mathematical thinking (vs. traditional set theory)
Type theory has advantages over set theory for the (computer) formalisation of mathematics, but has anybody who does mathematics with pen and paper found proof assistants or automated theorem provers, ...
3
votes
0
answers
184
views
Can we interpret ZFC in GEM?
I have long held similar views as put forth here. As professor Hamkins points out though, $(M,\subseteq)$ is insufficient to model most of mathematics. However, this is unsatisfactory to me, as this ...
- 433
3
votes
0
answers
301
views
What does second order set theory give us that is new?
There is a natural analogy between the theories PA and ZFC. See the linked question by Gro-Tsen here.
Peano arithmetic (PA) is a first order approximation to the natural numbers. As is well known, ...
- 18.7k
2
votes
0
answers
220
views
Which is richer Set or Graph Theory?
This theory about structures, defined as abstractions over isomorphic graphs, can interpret Set Theory in a rather creepy manner. Though the theory is largely technical, yet it is not far from being ...
- 11.3k
2
votes
0
answers
133
views
Higher-order oracle computation of reals and axiom of constructibility
Certain real numbers can be approximated arbitrarily well by computable functions. If we introduce halting oracles, then more real numbers can be "computed", like Chaitin's constant or the ...
- 173
2
votes
0
answers
159
views
Why not replace reflection by bounded reflection in Muller's approach?
Bounded Reflection: If $\phi$ is a formula in the language of set theory [i.e.; $\small \sf FOL(=,\in)$], in which all and only symbols $``x,x_1,..,x_n"$ occur free, and $\phi^V$ is the formula ...
- 11.3k
2
votes
0
answers
305
views
Does this axiomatic system satisfy requirements for founding mathematics?
In this article, the author, F.A.Muller, suggests criteria for a founding theory of mathematics (pp:14-16). The author proposes $ARC$ Class Theory to embody these requirements. The motivation is ...
- 11.3k
2
votes
0
answers
92
views
Constructing the Von Neuman Hierarchy at ω+ω in a structural set theory
I'm working in SEAR which is a relatively new structural set theory, and I am trying to prove the existence of big sets.
SEAR has the collection axiom which is, loosely speaking, that for every ...
2
votes
0
answers
150
views
Is there equality between sets in structural set theory?
In material set theory, the axiom of extensionality defines equality between sets: two sets are equal iff they have the same elements. In structural set theory, one cannot formulate this.
But however,...
- 21
2
votes
0
answers
264
views
About the limitation by size
This could be a big post, so I'll try to summarize my thoughts and divide them into several questions.
When working in category theory, I used to choose the following definition. A category $C$ is ...
- 1,017
2
votes
0
answers
167
views
Multitype approaches to choice?
I wonder if anyone has developed a set theory which approaches the issue of the non-emptiness of products of non-empty sets via a hierarchy of types (comparable to how Von Neumann–Bernays–Gödel set ...
- 17.6k
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
1
vote
0
answers
57
views
What is the consistency strength of this addition on simple type-set theory?
Language: multi-sorted first order logic with equality and membership, where for each natural $n$ there is a set $x^n$ of sort $n$. Equality "$=$" only occurs between variables of the same ...
- 11.3k
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
1
vote
0
answers
127
views
What is the proof theoretic ordinal of this kind of predicative type-set theory?
The following is a kind of Predicative Type Set Theory.
The question is about what is exactly the proof theoretic ordinal of this theory? Is it lower than the one expected for predicative theories, i....
- 11.3k
1
vote
0
answers
117
views
Can this type theory interpret second order arithmetic?
Language: multi-sorted first order logic with equality and membership, where for each natural $t$ there is a set $x^t$ of sort $t$. Equality "$=$" only occurs between variables of the same ...
- 11.3k
1
vote
0
answers
94
views
Is definability in $V$ in $\sf Ack+MK$ expressible in its language?
Recall Ackermann set theory. If we extend Ackermann's set theory by adding all axioms of $\sf MK$ to it. We shall denote the universe of all elements by $W$, while $V$ is the primitive constant symbol ...
- 11.3k
1
vote
0
answers
204
views
Can Frege set extensions of second order unary predicates serve as a foundation for mathematics?
To second order logic, add a primitive partial one place function symbol "$\epsilon$" from unary predicate symbols [upper cases] to object symbols [lower cases].
Define: $ x=y \equiv_{df} \...
- 11.3k
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
1
vote
0
answers
278
views
A countable set theory providing choice?
Instead of Zermelo set theory $Z$ take $Y$ = $Z$ minus the power set axiom plus
Enumerability: $\forall x(x\neq \emptyset \to\exists f[f:\mathbb{N}\overset{onto}{\frown}x ])$
$\imath$ is the ...
- 3,574
1
vote
0
answers
223
views
What should one know about abstract sets and structural foundations?
Recently I came by accident across the book sets for mathematics by Lawvere. It says:
First we deplete the object of nearly all content. We could think of an idealized
computer memory bank that ...
1
vote
0
answers
257
views
Is there a non-trivial consistency preserving transformation?
In set theory "equiconsistency" (and not "consistency") of the theories is the main part of researches. So we usually try to construct a new model using a given one. In the ...
user36136
0
votes
0
answers
78
views
'Maximising interpretative power entails maximising consistency strength'?
I'm hoping there is a clear mathematical answer to this question (hence asking it here) rather than anything more exegetical (in which case it's presumably not appropriate for this site).
In his paper ...
- 161