User Noah Schweber

3 votes

How to define compatible topology for first-order structures?

answered Aug 28, 2013 at 1:50

3 votes

Accepted

Isomorphism of a chain of structures

answered Jan 5, 2014 at 20:02

3 votes

Accepted

Proper classes subnumerous to $V$ in a model of a Morse-Kelley related theory

answered Sep 20, 2016 at 16:00

3 votes

Analogue break down between complexity theory and computability theory

answered Oct 21, 2016 at 17:02

3 votes

Accepted

Intuition behind the non-Borel Lusin example

answered Nov 3, 2016 at 2:16

3 votes

Accepted

Can a Boolean Set Algebra be Restricted in the Analytical hierarchy?

answered Apr 16, 2017 at 1:38

3 votes

Wondering if the following set-theoretic assertion is known to be consistent w/ ZFC

answered Dec 14, 2016 at 16:53

3 votes

Relationship between computational undecidability and axiomatic undecidability

answered Jun 12, 2016 at 6:06

3 votes

Axiom of countable choice need for the cantor-bernstein theorem

answered Feb 1, 2016 at 6:33

3 votes

Accepted

Comparing the sizes of uncountable sets of reals under AD

answered Jul 13, 2016 at 0:36

3 votes

What are the minimal requirements for the definable hyperreal field plus transfer?

answered Jun 30, 2016 at 14:03

3 votes

Vopěnka cardinals

answered Aug 28, 2017 at 23:27

3 votes

Accepted

Reduction of the predicate calculus to the propositional calculus in the case of one sigle object in the universe?

answered Oct 19, 2018 at 15:39

3 votes

Spinozistic partitionings [sic]

answered Nov 17, 2018 at 17:02

3 votes

Accepted

Is Replacement motivated by ranked iterative conception of sets?

answered Nov 23, 2018 at 17:57

3 votes

Accepted

Is the notion of measurable cardinal definable from the perspective of set-theoretical potentialism?

answered Mar 7, 2019 at 17:14

3 votes

Accepted

Uncountable ordinals and graphs of functions

answered May 9, 2019 at 22:37

2 votes

Accepted

How much can complexities of bases of a "simple" space vary?

answered Feb 17, 2019 at 22:57

2 votes

What Turing degree would allow you to "compute" the axioms of ZFC in some countable model of ZFC?

answered Sep 6, 2017 at 13:14

2 votes

Accepted

The smallest initial ordinal which is not defined using first-order formulas with parameters of smaller ordinals?

answered Oct 12, 2017 at 2:33

2 votes

Strong limit cardinals in AD

answered Dec 10, 2017 at 23:42

2 votes

Large cardinals and elementary embeddings for infinitary languages

answered Jan 3, 2018 at 22:23

2 votes

Accepted

Can there be such an elementary embedding?

answered Jul 12, 2018 at 23:16

2 votes

Is every c.c.c. non-atomic partial order of size $\omega_1$ a union of countable complete suborders?

answered Aug 25, 2016 at 18:09

2 votes

Accepted

Forcing the consistency of $ZF$ from a fragment of $ZF$

answered Jan 9, 2017 at 17:50

2 votes

Accepted

what ordinals were used in proving unique factorization over $\mathbb{Z}$

answered Mar 11, 2017 at 17:41

2 votes

Is every formula of LΩ equivalent to a formula of L1 modulo T1?

answered Dec 14, 2016 at 1:56

2 votes

Accepted

How are Koepke's ordinal computability and E-recursion related?

answered Nov 27, 2016 at 20:36

2 votes

The existence of the Mostowski collapses for a non-set-like well-founded relation from which there is a homomorphism to $Ord$

answered Nov 30, 2016 at 4:30

2 votes

What is the role of absoluteness in existence of a non-trivial self elementary embedding on an inner model?

answered Oct 27, 2013 at 6:58

Stack Exchange Network

478 Answers

How to define compatible topology for first-order structures?

Isomorphism of a chain of structures

Proper classes subnumerous to $V$ in a model of a Morse-Kelley related theory

Analogue break down between complexity theory and computability theory

Intuition behind the non-Borel Lusin example

Can a Boolean Set Algebra be Restricted in the Analytical hierarchy?

Wondering if the following set-theoretic assertion is known to be consistent w/ ZFC

Relationship between computational undecidability and axiomatic undecidability

Axiom of countable choice need for the cantor-bernstein theorem

Comparing the sizes of uncountable sets of reals under AD

What are the minimal requirements for the definable hyperreal field plus transfer?

Vopěnka cardinals

Reduction of the predicate calculus to the propositional calculus in the case of one sigle object in the universe?

Spinozistic partitionings [sic]

Is Replacement motivated by ranked iterative conception of sets?

Is the notion of measurable cardinal definable from the perspective of set-theoretical potentialism?

Uncountable ordinals and graphs of functions

How much can complexities of bases of a "simple" space vary?

What Turing degree would allow you to "compute" the axioms of ZFC in some countable model of ZFC?

The smallest initial ordinal which is not defined using first-order formulas with parameters of smaller ordinals?

Strong limit cardinals in AD

Large cardinals and elementary embeddings for infinitary languages

Can there be such an elementary embedding?

Is every c.c.c. non-atomic partial order of size $\omega_1$ a union of countable complete suborders?

Forcing the consistency of $ZF$ from a fragment of $ZF$

what ordinals were used in proving unique factorization over $\mathbb{Z}$

Is every formula of LΩ equivalent to a formula of L1 modulo T1?

How are Koepke's ordinal computability and E-recursion related?

The existence of the Mostowski collapses for a non-set-like well-founded relation from which there is a homomorphism to $Ord$

What is the role of absoluteness in existence of a non-trivial self elementary embedding on an inner model?