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 24734
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.
2
votes
0
answers
180
views
Cut elimination proofs of the consistency of arithmetic
It is well known that one can use cut elimination to establish the consistency of arithmetic (though this involves assuming transfinite induction up to $\varepsilon_0$.) Most proofs, however, work wit …
- 358
2
votes
Looking for Fitch-style Natural Deduction system that allows for open formula
Dag Prawitz' systems in his book Natural Deduction (1965) seem to meet your requirements.
- 358
5
votes
Accepted
Reference request on Gentzen's proof of the consistency of PA
Pohlers's 1989 book 'Proof Theory, An Introduction' gives a very clean, streamlined approach (based on work by Tait.)
Takeuti's presentation in his 'Proof Theory' is closer to Gentzen's original proof …
- 358