Publisher
Springer Science and Business Media LLC
Reference18 articles.
1. Buchholz, W., Wainer, S.: Provably computable functions and the fast growing hierarchy. In: Simpsons, S.G. (ed.) Mathematical logic and combinatorics. AMS Contemp. Math.65, 179–198 (1987)
2. Gentzen, G.: Die Widerspruchsfreiheit der reinen Zahlentheorie. Math. Ann.112, 493–565 (1936)
3. Gentzen, G.: Neue Fassung des Widerspruchsfreiheitsbeweises für die reine Zahlentheorie. Forschungen zur Logik und zur Grundlegung der exakten Wissenschaften. Neue Folge 4, pp. 19–44 (1938)
4. Gentzen, G.: Beweisbarkeit und Unbeweisbarkeit von Anfangsfällen der transfiniten Induktion in der reinen Zahlentheorie. Math. Ann.119, 149–161 (1943)
5. Girard, J.Y.: Proof theory and logical complexity. Studies in proof theory, Monographs 1. Napoli: Bibliopolis 1987
Cited by
49 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Type-theoretic approaches to ordinals;Theoretical Computer Science;2023-05
2. The uniform Kruskal theorem: between finite combinatorics and strong set existence;Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences;2023-04-10
3. Ordinal analysis and the set existence property for intuitionistic set theories;Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences;2023-04-10
4. AN INCOMPLETENESS THEOREM VIA ORDINAL ANALYSIS;The Journal of Symbolic Logic;2022-09-12
5. A NOTE ON FRAGMENTS OF UNIFORM REFLECTION IN SECOND ORDER ARITHMETIC;The Bulletin of Symbolic Logic;2022-06-09