Search Results
| 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 proof-theory
Search options not deleted
user 2004
For question in Proof Theory, where "proofs" themselves are the object of mathematical investigation. It is not to be used to request a proof of some result.
10
votes
Accepted
Arithmetic strength of Peano + the Howard ordinal
The answer is yes, using the ordinal analysis of KP. See Pohlers' A Short Course in Ordinal Analysis for why the usual ordinal analyses are profound, that is, they imply conservativity of the analyzed …
- 1,467
5
votes
Can the Burgess-Hazen analysis of Predicative Arithmetic be extended to Transfinite Types?
I'm not aware of anyone doing the setup exactly as you describe, although it is very likely that it has been done, because it is very similar to Kreisel's proposed method of analyzing finitism in Ordi …
- 1,467
5
votes
Has the Ramified Theory of Types been applied to NBG?
You may be interested in Feferman's Unfolding Program, which gives a predicative closure to any schematic theory such as PA or ZFC. The unfolding of PA has the same strength as ATR$_0$, and Feferman c …
- 1,467