Skip to main content

All Questions

Tagged with
Filter by
Sorted by
Tagged with
5 votes
4 answers
2k views

Subsystems of Peano arithmetic and incompleteness theorem

I think everyone is familiar with Goedel's incompleteness theorems. In particular they imply that PA (Peano arithmetic) can not prove its own consistency. Now my question is what is the largest ...
8 votes
1 answer
3k views

Foundations: Existence of uncountable ordinals.

This isn't really a research question, but at least it's research-level mathematics. I'm talking with some other people about the first uncountable ordinal, and I want some facts to inform this ...
11 votes
3 answers
2k views

Kunen's use of Countable Transitive Models

Hi, I have a doubt concerning Kunen's exposition of forcing in his classical book (arguably $the$ book on forcing). When dealing with Countable Transitive Models to set up the forcing machinery, ...
7 votes
2 answers
736 views

Sets as Combinatorial Games

Just a few days ago my seemingly eternal and recurrent fascination for Conway's combinatorial game theory (CGT) & surreal numbers had a recrudescence, so I grabbed this excellent survey, and began ...
8 votes
2 answers
863 views

Consistent hierarchy of axiomatic systems

First of all, I am not an expert in model theory. I just want to get my personal view on the foundations of mathematics straight. I just learned in Sergey Melikhov's answer to another question ...
5 votes
5 answers
1k views

Concrete models of abstract structures

Most mathematicians seem to be contented with the fact, that abstract structures cannot be directly modelled as such in a set theory without ur-elements. What seems to me the standard stance: Set ...
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 ...

1 2 3
4