Pages that link to "Item:Q2647392"
From MaRDI portal
The following pages link to Beweisbarkeit und Unbeweisbarkeit von Anfangsfällen der transfiniten Induktion in der reinen Zahlentheorie (Q2647392):
Displaying 41 items.
- Consistency, models, and soundness (Q551223) (← links)
- Subsystems of true arithmetic and hierarchies of functions (Q688433) (← links)
- Type-theoretic interpretation of iterated, strictly positive inductive definitions (Q688845) (← links)
- Proof-theoretical analysis: Weak systems of functions and classes (Q911585) (← links)
- Ordinal analysis of non-monotone \(\Pi_1^0\)-definable inductive definitions (Q958493) (← links)
- The machinery of consistency proofs (Q1124588) (← links)
- Nested recursion (Q1131248) (← links)
- Beweistheoretische Abgrenzung von Teilsystemen der Analysis (Q1139586) (← links)
- Gentzen reduction revisited (Q1140640) (← links)
- Some results on cut-elimination, provable well-orderings, induction and reflection (Q1295413) (← links)
- The middle ground-ancestral logic (Q2053352) (← links)
- ``Gaisi Takeuti's finitist standpoint'' and its mathematical embodiment (Q2097064) (← links)
- Ackermann and Goodstein go functorial (Q2234350) (← links)
- Proof theory and ordinal analysis (Q2276954) (← links)
- Notation systems for infinitary derivations (Q2277451) (← links)
- Gödel, Gentzen, Goodstein: the magic sound of a G-string (Q2341287) (← links)
- Slow reflection (Q2407272) (← links)
- Book review of: R. Kahle (ed.) and M. Rathjen (ed.), Gentzen's centenary. The quest for consistency (Q2409191) (← links)
- Levy and set theory (Q2493914) (← links)
- Exact estimates of the provability of transfinite induction in the initial segments of arithmetic (Q2557248) (← links)
- Type-theoretic approaches to ordinals (Q2700785) (← links)
- An Infinitary System for the Least Fixed-Point Logic restricted to Finite Models (Q2866740) (← links)
- Consistency of Heyting arithmetic in natural deduction (Q3066292) (← links)
- Proof Theory in Philosophy of Mathematics (Q3160752) (← links)
- Mathematical significance of consistency proofs (Q3260570) (← links)
- Well-Partial Orderings and their Maximal Order Types (Q3295157) (← links)
- From Subsystems of Analysis to Subsystems of Set Theory (Q3305559) (← links)
- Epistemic arithmetic is a conservative extension of intuitionistic arithmetic (Q3728881) (← links)
- On definition trees of ordinal recursive functionals: Reduction of the recursion orders by means of type level raising (Q3949042) (← links)
- Provable wellorderings of formal theories for transfinitely iterated inductive definitions (Q4198748) (← links)
- 1998 European Summer Meeting of the Association for Symbolic Logic (Q4254644) (← links)
- NOMINALISTIC ORDINALS, RECURSION ON HIGHER TYPES, AND FINITISM (Q4632541) (← links)
- The Mathematical Development of Set Theory from Cantor to Cohen (Q4879892) (← links)
- … and so on: Schütte on Naming Ordinals (Q5013893) (← links)
- A MATHEMATICAL COMMITMENT WITHOUT COMPUTATIONAL STRENGTH (Q5046601) (← links)
- On the Performance of Axiom Systems (Q5055280) (← links)
- Well-Ordering Principles in Proof Theory and Reverse Mathematics (Q5055281) (← links)
- Iterated Inductive Definitions Revisited (Q5214787) (← links)
- Eine Grenze Für die Beweisbarkeit der Transfiniten Induktion in der Verzweigten Typenlogik (Q5540436) (← links)
- Neo-Logicism and Its Logic (Q5871286) (← links)
- Dialogues and Proofs; Yankov’s Contribution to Proof Theory (Q5886456) (← links)