Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 10384

Mathematical logic, Set theory, Peano arithmetic, Model theory, Proof theory, Recursion theory, Computability theory, Univalent foundations, Reverse mathematics, Frege foundation of arithmetic, Goedel's incompleteness and Mathematics, Structural set theory, Category theory, Type theory.

5 votes

Is a paraconsistent and provably non-trivial foundation for math possible?

Zach Weber has been working on developing a paraconsistent set theory that can serve as a foundation for mathematics.
Jeremy Rickard's user avatar
10 votes

Ultrainfinitism, or a step beyond the transfinite

Perhaps you could take a look at William Reinhardt's paper 'Remarks on reflection principles, large cardinals, and elementary embeddings' (1974). Reinhardt suggests extending the set-theoretic univers …
Benedict Eastaugh's user avatar