On the public citation graph
Beweistheoretische Erfassung der unendlichen Induktion in der Zahlentheorie
0 signed · 84 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-662-38452-7_13openalex-snapshot
Die Grundlegung der elementaren Zahlenlehre
inferredcites →https://doi.org/10.1007/bf01201353openalex-snapshot
Untersuchungen �ber das logische Schlie�en. I
inferredcites →https://doi.org/10.1007/bf01342950openalex-snapshot
Schlußweisen-Kalküle der Prädikatenlogik
inferredcites →https://doi.org/10.1007/bf01457953openalex-snapshot
Die Grundlegung der elementaren Zahlenlehre
inferredcites →https://doi.org/10.1007/bf01564760openalex-snapshot
Beweisbarkeit und Unbeweisbarkeit von Anfangsfällen der transfiniten Induktion in der reinen Zahlentheorie
inferredcites →https://doi.org/10.1007/bf01565428openalex-snapshot
Die Widerspruchsfreiheit der reinen Zahlentheorie
inferredcites →https://doi.org/10.1007/bf01700692openalex-snapshot
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
inferredcites →https://doi.org/10.1007/s00605-006-0423-7openalex-snapshot
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
inferredcites →https://doi.org/10.2307/2266226openalex-snapshot
Gerhard Gentzen. Neue Fassung des Widerspruchsfreiheitsbeweises für die reine Zahlentheorie. Forschungen zur Logik und zur Grundlegung der exakten Wissenschaften, neue Folge, Heft 4, S. 19–44. S. Hirzel, Leipzig1938.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.19680140702openalex-snapshot
Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
inferred← citeshttps://doi.org/10.1007/3-540-63385-5_29openalex-snapshot
Explaining Gentzen's consistency proof within infinitary proof theory
inferred← citeshttps://doi.org/10.1007/978-3-030-06170-8_1openalex-snapshot
Theoretical Computer Science: Computability, Decidability and Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-22996-2_13openalex-snapshot
A Note on the Ordinal Analysis of $$\mathbf {RCA}_0 + \mathrm {WO}(\mathbf {\sigma })$$
inferred← citeshttps://doi.org/10.1007/978-3-030-35934-8_20openalex-snapshot
Der Hilbert’sche Kritizismus
inferred← citeshttps://doi.org/10.1007/978-3-030-49424-7_1openalex-snapshot
“Sehr geehrter Herr Professor!” Proof Theory in 1949 in a Letter from Schütte to Bernays
inferred← citeshttps://doi.org/10.1007/978-3-030-49424-7_12openalex-snapshot
Well-ordering Principles, ω-models and $$ \varPi_{1}^{1} $$-comprehension
inferred← citeshttps://doi.org/10.1007/978-3-030-65824-3_5openalex-snapshot
Lorenzen Between Gentzen and Schütte
inferred← citeshttps://doi.org/10.1007/978-3-030-77799-9_4openalex-snapshot
Well-Ordering Principles in Proof Theory and Reverse Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-319-10103-3_12openalex-snapshot
Climbing Mount $$\varepsilon _{0}$$
inferred← citeshttps://doi.org/10.1007/978-3-319-10103-3_19openalex-snapshot
Well-Ordering Principles and Bar Induction
inferred← citeshttps://doi.org/10.1007/978-3-319-10103-3_6openalex-snapshot
A Note on How to Extend Gentzen’s Second Consistency Proof to a Proof of Normalization for First Order Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-319-10103-3_8openalex-snapshot
Gentzen’s Original Consistency Proof and the Bar Theorem
inferred← citeshttps://doi.org/10.1007/978-3-319-42120-9_2openalex-snapshot
Part II: An Overview of the shorthand notes
inferred← citeshttps://doi.org/10.1007/978-3-319-42120-9_3openalex-snapshot
Part III: The original writings
inferred← citeshttps://doi.org/10.1007/978-94-009-8356-4_10openalex-snapshot
Philosophical aspects of proof theory
inferred← citeshttps://doi.org/10.1007/978-94-009-8937-5_9openalex-snapshot
Intuitive Proofs and First-Order Derivations: Some Notes on the Metamathematics of First-Order Number Theory
inferred← citeshttps://doi.org/10.1007/978-94-010-1138-9_19openalex-snapshot
Do-it-Yourself Semantics for Classical Sequent Calculi, Including Ramified Type Theory
inferred← citeshttps://doi.org/10.1007/bf01343133openalex-snapshot
Zur Widerspruchsfreiheit einer typenfreien Logik
inferred← citeshttps://doi.org/10.1007/bf01343554openalex-snapshot
Beweistheoretische Untersuchung der verzweigten Analysis
inferred← citeshttps://doi.org/10.1007/bf01621472openalex-snapshot
Notation systems for infinitary derivations
inferred← citeshttps://doi.org/10.1007/bf01969991openalex-snapshot
Ein System des Verknüpfenden Schliessens
inferred← citeshttps://doi.org/10.1007/bf02011876openalex-snapshot
Consistency proof without transfinite induction for a formal system for turing machines
inferred← citeshttps://doi.org/10.1007/bf02465850openalex-snapshot
Infinitary calculus for a restricted first-order linear temporal logic without contraction on quantified formulas
inferred← citeshttps://doi.org/10.1007/bfb0079543openalex-snapshot
Verzeichnis der Publikationen von Kurt Schütte
inferred← citeshttps://doi.org/10.1007/bfb0079559openalex-snapshot
Comments on gentzen-type procedures and the classical notion of truth
inferred← citeshttps://doi.org/10.1007/bfb0079691openalex-snapshot
Normal derivability in classical logic
inferred← citeshttps://doi.org/10.1007/s00153-020-00716-9openalex-snapshot
Completeness of the primitive recursive $$\omega $$-rule
inferred← citeshttps://doi.org/10.1007/s10958-005-0109-zopenalex-snapshot
Invertible infinitary calculus without loop rules for restricted FTL
inferred← citeshttps://doi.org/10.1007/s11229-004-6298-zopenalex-snapshot
Semantic Values for Natural Deduction Derivations
inferred← citeshttps://doi.org/10.1016/0168-0072(88)90055-3openalex-snapshot
Proof-theoretical analysis: weak systems of functions and classes
inferred← citeshttps://doi.org/10.1016/j.apal.2004.10.003openalex-snapshot
Continuous normalization for the lambda-calculus and Gödel’s T
inferred← citeshttps://doi.org/10.1016/j.apal.2008.09.011openalex-snapshot
Ordinal analysis by transformations
inferred← citeshttps://doi.org/10.1016/j.apal.2009.06.004openalex-snapshot
On the computational complexity of cut-reduction
inferred← citeshttps://doi.org/10.1016/j.apal.2024.103550openalex-snapshot
Peano arithmetic, games and descent recursion
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.03.067openalex-snapshot
An Infinitary System for the Least Fixed-Point Logic restricted to Finite Models
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70655-4openalex-snapshot
Semi-Formal Beth Tableaux
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70768-7openalex-snapshot
Herbrand-Style Consistency Proofs
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70772-9openalex-snapshot
Applications of the Cut Elimination Theorem to Some Subsystems of Classical Analysis
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70849-8openalex-snapshot
Ideas and Results in Proof Theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71689-6openalex-snapshot
Infinitely Long Terms of Transfinite Type
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70458-6openalex-snapshot
Thirty Years of Foundational Studies Lectures on the Development of Mathematical Logic and the Study of the Foundations of Mathematics in 1930–1964
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80032-9openalex-snapshot
Classifying Recursive Functions
inferred← citeshttps://doi.org/10.1017/s1755020315000337openalex-snapshot
FROM STENIUS’ CONSISTENCY PROOF TO SCHÜTTE’S CUT ELIMINATION FOR ω-ARITHMETIC
inferred← citeshttps://doi.org/10.1023/a:1017990121294openalex-snapshot
⊃E is Admissible in “true” relevant arithmetic
inferred← citeshttps://doi.org/10.1080/01445340.2024.2439683openalex-snapshot
An Introduction to Lorenzen's ‘Algebraic and Logistic Investigations on Free Lattices’ (1951)
inferred← citeshttps://doi.org/10.1093/jigpal/jzp020openalex-snapshot
Natural deduction for the finite least fixed point logic with an infinitary rule
inferred← citeshttps://doi.org/10.1093/logcom/exz011openalex-snapshot
Towards automated reasoning in Herbrand structures
inferred← citeshttps://doi.org/10.1093/philmat/9.1.87openalex-snapshot
Godel's Unpublished Papers on Foundations of Mathematics†
inferred← citeshttps://doi.org/10.1093/philmat/nkaf018openalex-snapshot
Charles Parsons April 13, 1933 – April 19, 2024
inferred← citeshttps://doi.org/10.1109/lics.2008.9openalex-snapshot
On the Computational Complexity of Cut-Reduction
inferred← citeshttps://doi.org/10.21099/tkbjm/1496158381openalex-snapshot
A note on provable well-orderings in first order systems with infinitary inference rules
inferred← citeshttps://doi.org/10.2178/bsl/1120231632openalex-snapshot
Gödel's Reformulation of Gentzen's First Consistency Proof For Arithmetic: The No-Counterexample Interpretation
inferred← citeshttps://doi.org/10.2178/jsl/1164060454openalex-snapshot
A Buchholz derivation system for the ordinal analysis of KP + Π3-reflection
inferred← citeshttps://doi.org/10.2307/2586525openalex-snapshot
The anatytic conception of truth and the foundations of arithmetic
inferred← citeshttps://doi.org/10.2307/2964396openalex-snapshot
Mathematical significance of consistency proofs
inferred← citeshttps://doi.org/10.2307/421132openalex-snapshot
Recent Advances in Ordinal Analysis: Π12— CA and Related Systems
inferred← citeshttps://doi.org/10.29007/kx2mopenalex-snapshot
Reasoning Inside The Box: Deduction in Herbrand Logics
inferred← citeshttps://doi.org/10.2969/jmsj/01240392openalex-snapshot
On a certain system with infinite induction.
inferred← citeshttps://doi.org/10.4064/-46-1-179-225openalex-snapshot
Strong normalization proofs for cut elimination in Gentzen's sequent calculi
inferred← citeshttps://doi.org/10.4288/jafpos1956.1.269openalex-snapshot
Non-constructive Proofs of a Metamathematical Theorem Concerning the Consistency of Analysis and its Extension
inferred← citeshttps://doi.org/10.47749/t/unicamp.2003.303374openalex-snapshot
Incompletude e auto-organização
inferred← citeshttps://doi.org/10.48550/arxiv.2109.06258openalex-snapshot
Unprovability in Mathematics: A First Course on Ordinal Analysis
inferred← citeshttps://doi.org/10.70675/61bfbf53z121az472ez8c91ze9f6166c9a6aopenalex-snapshot
Applications of Foundational Proof Certificates in theorem proving
inferred← citeshttps://doi.org/10.70675/ebffbe00z3617z41e5z91bfzd4ec1aa303afopenalex-snapshot
Le statut dynamique des axiomes : des preuves aux modèles
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.