On the public citation graph

Normal derivability in classical logic

https://doi.org/10.1007/bfb0079691
0 signed · 150 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01201353openalex-snapshot
Untersuchungen �ber das logische Schlie�en. I
inferredcites →https://doi.org/10.1007/bf01342849openalex-snapshot
Beweistheoretische Erfassung der unendlichen Induktion in der Zahlentheorie
inferredcites →https://doi.org/10.1007/bf01361109openalex-snapshot
Kennzeichnung von Ordnungszahlen durch rekursiv erklärte Funktionen
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/bf01972460openalex-snapshot
Eine Grenze Für die Beweisbarkeit der Transfiniten Induktion in der Verzweigten Typenlogik
inferredcites →https://doi.org/10.1016/s0049-237x(08)71694-xopenalex-snapshot
Predicative Well-Orderings
inferredcites →https://doi.org/10.2307/2266681openalex-snapshot
Algebraische und logistische Untersuchungen über freie Verbände
inferredcites →https://doi.org/10.2307/2269764openalex-snapshot
Systems of predicative analysis
inferredcites →https://doi.org/10.2307/2271099openalex-snapshot
Infinitary logic and admissible sets
inferredcites →https://doi.org/10.2307/2314842openalex-snapshot
Languages with Expressions of Infinite Length.
inferredcites →https://doi.org/10.4064/fm-57-3-253-272openalex-snapshot
An interpolation theorem for denumerably long formulas

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.1002/malq.19890350202openalex-snapshot
Notes on Formal Theories of Truth
inferred← citeshttps://doi.org/10.1002/malq.19920380109openalex-snapshot
LEVELS OF IMPLICATION AND TYPE FREE THEORIES OF CLASSIFICATIONS WITH APPROXIMATION OPERATOR
inferred← citeshttps://doi.org/10.1006/jsco.1999.0359openalex-snapshot
Cut-elimination and Redundancy-elimination by Resolution
inferred← citeshttps://doi.org/10.1007/11916277_10openalex-snapshot
Modular Cut-Elimination: Finding Proofs or Counterexamples
inferred← citeshttps://doi.org/10.1007/3-540-45504-3_4openalex-snapshot
Comparing the Complexity of Cut-Elimination Methods
inferred← citeshttps://doi.org/10.1007/3-540-45616-3_3openalex-snapshot
A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic
inferred← citeshttps://doi.org/10.1007/3-540-56992-8_4openalex-snapshot
Algorithmic structuring of cut-free proofs
inferred← citeshttps://doi.org/10.1007/3-540-58715-2_114openalex-snapshot
Inductive definitions and type theory an introduction (preliminary version)
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-1-4899-0548-2_9openalex-snapshot
Reductions of Theories for Analysis
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-30229-0_13openalex-snapshot
Well-Partial Orderings and their Maximal Order Types
inferred← citeshttps://doi.org/10.1007/978-3-030-49424-7_10openalex-snapshot
The Limits of Predicativity Revisited
inferred← citeshttps://doi.org/10.1007/978-3-030-71258-7_12openalex-snapshot
Geometric Rules in Infinitary Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-06843-0_3openalex-snapshot
Dialogues and Proofs; Yankov’s Contribution to Proof Theory
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-29198-7_8openalex-snapshot
Some Remarks on the Proof-Theory and the Semantics of Infinitary Modal Logic
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-3-540-30124-0_38openalex-snapshot
Automated Generation of Analytic Calculi for Logics with Linearity
inferred← citeshttps://doi.org/10.1007/978-3-540-45206-5_5openalex-snapshot
A Labelled Sequent-Calculus for Observation Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_38openalex-snapshot
Propositional Logic for Circuit Classes
inferred← citeshttps://doi.org/10.1007/978-3-540-89439-1_32openalex-snapshot
Cut Elimination for First Order Gödel Logic by Hyperclause Resolution
inferred← citeshttps://doi.org/10.1007/978-3-642-02261-6_1openalex-snapshot
A Characterisation of Definable NP Search Problems in Peano Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-642-59048-1_10openalex-snapshot
Basic Proof Theory with Applications to Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-76799-9_6openalex-snapshot
Computability — Logical and Recursive Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-79361-5_6openalex-snapshot
A Deductive Approach to Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-7643-8653-5_16openalex-snapshot
Proof theory and Martin-Löf Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-7908-1818-5_1openalex-snapshot
A Natural Deduction System for Intuitionistic Fuzzy Logic
inferred← citeshttps://doi.org/10.1007/978-94-007-0320-9_5openalex-snapshot
Reduction and Elimination
inferred← citeshttps://doi.org/10.1007/978-94-007-0320-9_8openalex-snapshot
Applications of CERES
inferred← citeshttps://doi.org/10.1007/978-94-009-7066-3_2openalex-snapshot
Systems of Deduction
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-9056-2_6openalex-snapshot
Infinitary Logics
inferred← citeshttps://doi.org/10.1007/978-94-017-2796-9_2openalex-snapshot
Hightlights in Proof Theory
inferred← citeshttps://doi.org/10.1007/978-981-15-6459-8_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-981-15-6459-8_3openalex-snapshot
Cut-Elimination with Depths
inferred← citeshttps://doi.org/10.1007/978-981-15-6459-8_5openalex-snapshot
Iterations
inferred← citeshttps://doi.org/10.1007/bf01621472openalex-snapshot
Notation systems for infinitary derivations
inferred← citeshttps://doi.org/10.1007/bf01621474openalex-snapshot
Proof theory and ordinal analysis
inferred← citeshttps://doi.org/10.1007/bf01621477openalex-snapshot
Herbrand analyses
inferred← citeshttps://doi.org/10.1007/bf02011138openalex-snapshot
Beweistheorie vonKPN
inferred← citeshttps://doi.org/10.1007/bf02011633openalex-snapshot
The role of the Omitting Types Theorem in infinitary logic
inferred← citeshttps://doi.org/10.1007/bf02297652openalex-snapshot
Zur Beweistheorie Der Kripke-Platek-Mengenlehre Über Den Natürlichen Zahlen
inferred← citeshttps://doi.org/10.1007/bf02483891openalex-snapshot
Cut elimination and word problems for varieties of lattices
inferred← citeshttps://doi.org/10.1007/bf02925207openalex-snapshot
Effectiveness and provability
inferred← citeshttps://doi.org/10.1007/bfb0015041openalex-snapshot
The logic MPLω
inferred← citeshttps://doi.org/10.1007/bfb0079094openalex-snapshot
Lectures on proof theory
inferred← citeshttps://doi.org/10.1007/bfb0079549openalex-snapshot
Kombinatorische Konstruktionen mit Beweisen und Schnittelimination
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/s00153-004-0265-8openalex-snapshot
A proof-theoretical investigation of global intuitionistic (fuzzy) logic
inferred← citeshttps://doi.org/10.1007/s00153-010-0186-7openalex-snapshot
On the form of witness terms
inferred← citeshttps://doi.org/10.1007/s00153-021-00800-8openalex-snapshot
A note on cut-elimination for classical propositional logic
inferred← citeshttps://doi.org/10.1007/s00153-023-00892-4openalex-snapshot
Cut elimination by unthreading
inferred← citeshttps://doi.org/10.1007/s001530050061openalex-snapshot
A parallel game semantics for Linear Logic
inferred← citeshttps://doi.org/10.1007/s10670-025-01060-1openalex-snapshot
Deep Semantic Pollution
inferred← citeshttps://doi.org/10.1007/s10992-014-9339-1openalex-snapshot
Incomplete Symbols — Definite Descriptions Revisited
inferred← citeshttps://doi.org/10.1007/s10992-026-09832-yopenalex-snapshot
A Hypersequent Calculus for Classical Contingencies
inferred← citeshttps://doi.org/10.1007/s10992-026-09838-6openalex-snapshot
Metainferences, Invalidities and Contraction-Free Sequent Calculi for S5 and Carnap’s C
inferred← citeshttps://doi.org/10.1007/s11225-006-6605-4openalex-snapshot
Cut Elimination inside a Deep Inference System for Classical Predicate Logic
inferred← citeshttps://doi.org/10.1007/s11225-014-9563-2openalex-snapshot
Cut-Elimination: Syntax and Semantics
inferred← citeshttps://doi.org/10.1007/s11225-014-9567-yopenalex-snapshot
A Survey of Nonstandard Sequent Calculi
inferred← citeshttps://doi.org/10.1007/s11225-022-09998-xopenalex-snapshot
On the Proof Theory of Infinitary Modal Logic
inferred← citeshttps://doi.org/10.1007/s11229-004-6298-zopenalex-snapshot
Semantic Values for Natural Deduction Derivations
inferred← citeshttps://doi.org/10.1007/s11245-017-9478-4openalex-snapshot
Notational Variance and Its Variants
inferred← citeshttps://doi.org/10.1007/s11787-010-0011-4openalex-snapshot
Some General Results About Proof Normalization
inferred← citeshttps://doi.org/10.1007/s11787-023-00337-9openalex-snapshot
Complementary Proof Nets for Classical Logic
inferred← citeshttps://doi.org/10.1016/0168-0072(84)90034-4openalex-snapshot
A constructive consistency proof of a fragment of set theory
inferred← citeshttps://doi.org/10.1016/0168-0072(87)90078-9openalex-snapshot
An independence result for (II11-CA)+BI
inferred← citeshttps://doi.org/10.1016/0168-0072(94)00003-lopenalex-snapshot
Elementary descent recursion and proof theory
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90011-hopenalex-snapshot
Constructive logics Part I: A tutorial on proof systems and typed λ-calculi
inferred← citeshttps://doi.org/10.1016/j.apal.2007.08.001openalex-snapshot
Sufficient conditions for cut elimination with complexity analysis
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.2010.03.001openalex-snapshot
A minimal classical sequent calculus free of structural rules
inferred← citeshttps://doi.org/10.1016/j.apal.2016.12.003openalex-snapshot
Unifying the model theory of first-order and second-order arithmetic via WKL0⁎
inferred← citeshttps://doi.org/10.1016/j.apal.2020.102845openalex-snapshot
Proofs and surfaces
inferred← citeshttps://doi.org/10.1016/j.apal.2024.103550openalex-snapshot
Peano arithmetic, games and descent recursion
inferred← citeshttps://doi.org/10.1016/j.jal.2005.06.011openalex-snapshot
Deduction chains for common knowledge
inferred← citeshttps://doi.org/10.1016/j.jlap.2009.05.001openalex-snapshot
Dual Systems of Tableaux and Sequents for PLTL
inferred← citeshttps://doi.org/10.1016/j.jsc.2003.10.005openalex-snapshot
Towards a clausal analysis of cut-elimination
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70634-7openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70715-8openalex-snapshot
References
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)71124-8openalex-snapshot
Proof Theory: Some Applications of Cut-Elimination
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71126-1openalex-snapshot
Theories of Finite Type Related to Mathematical Practice
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71190-xopenalex-snapshot
Autonomous Transfinite Progressions and the Extent of Predicative Mathematics
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)x7031-4openalex-snapshot
Algebra of Proofs
inferred← citeshttps://doi.org/10.1016/s0049-237x(96)80017-6openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80016-5openalex-snapshot
An Introduction to Proof Theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80018-9openalex-snapshot
Hierarchies of Provably Recursive Functions
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80020-7openalex-snapshot
Gödel’s Functional (“Dialectica”) Interpretation
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80024-4openalex-snapshot
A Proof-Theoretic Framework for Logic Programming
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80032-9openalex-snapshot
Classifying Recursive Functions
inferred← citeshttps://doi.org/10.1016/s0168-0072(02)00040-4openalex-snapshot
Universes over Frege structures
inferred← citeshttps://doi.org/10.1017/bsl.2016.2openalex-snapshot
LINEAR TIME IN HYPERSEQUENT FRAMEWORK
inferred← citeshttps://doi.org/10.1017/cbo9780511896262.006openalex-snapshot
A simplified version of local predicativity
inferred← citeshttps://doi.org/10.1017/cbo9781139031905openalex-snapshot
Proofs and Computations
inferred← citeshttps://doi.org/10.1017/s0022481200031224openalex-snapshot
On the relation between choice and comprehension principles in second order arithmetic
inferred← citeshttps://doi.org/10.1017/s0960129507006573openalex-snapshot
Towards an algorithmic construction of cut-elimination procedures
inferred← citeshttps://doi.org/10.1017/s0960129599002844openalex-snapshot
A new method for establishing conservativity of classical systems over their intuitionistic version
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.1080/11663081.2020.1782593openalex-snapshot
Structural proof theory for first-order weak Kleene logics
inferred← citeshttps://doi.org/10.1090/conm/065/891248openalex-snapshot
Provably computable functions and the fast growing hierarchy
inferred← citeshttps://doi.org/10.1093/logcom/13.6.835openalex-snapshot
Hypersequent Calculi for Godel Logics -- a Survey
inferred← citeshttps://doi.org/10.1093/logcom/exac040openalex-snapshot
On infinitary Gödel logics
inferred← citeshttps://doi.org/10.1093/logcom/exx003openalex-snapshot
OUP accepted manuscript
inferred← citeshttps://doi.org/10.1109/ismvl.1996.508349openalex-snapshot
Intuitionistic counterparts of finitely-valued logics
inferred← citeshttps://doi.org/10.1109/lics.2008.9openalex-snapshot
On the Computational Complexity of Cut-Reduction
inferred← citeshttps://doi.org/10.1145/3570919openalex-snapshot
Linear Logic Properly Displayed
inferred← citeshttps://doi.org/10.1145/3579997openalex-snapshot
Circular (Yet Sound) Proofs in Propositional Logic
inferred← citeshttps://doi.org/10.1163/18756735-90000696openalex-snapshot
A SUBSTITUTIONAL FRAMEWORK FOR ARITHMETICAL VALIDITY
inferred← citeshttps://doi.org/10.13128/annali_dip_filos-11278openalex-snapshot
Annali del Dipartimento di Filosofia - contenuto non piu disponibile
inferred← citeshttps://doi.org/10.1515/9783110324907openalex-snapshot
Ways of Proof Theory
inferred← citeshttps://doi.org/10.1515/9783110324907.65openalex-snapshot
Characterising Definable Search Problems in Bounded Arithmetic via Proof Notations
inferred← citeshttps://doi.org/10.18778/0138-0680.44.3.4.04openalex-snapshot
Minimal Sequent Calculi for Łukasiewicz’s Finitely-Valued Logics
inferred← citeshttps://doi.org/10.2307/2271985openalex-snapshot
A converse of the Barwise completeness theorem
inferred← citeshttps://doi.org/10.2307/2273321openalex-snapshot
Choice principles, the bar rule and autonomously iterated comprehension schemes in analysis
inferred← citeshttps://doi.org/10.2307/2274102openalex-snapshot
Epistemic arithmetic is a conservative extension of intuitionistic arithmetic
inferred← citeshttps://doi.org/10.2307/2274140openalex-snapshot
The strength of admissibility without foundation
inferred← citeshttps://doi.org/10.2307/2275250openalex-snapshot
Lower bounds to the size of constant-depth propositional proofs
inferred← citeshttps://doi.org/10.2307/2275441openalex-snapshot
A proof-theoretic characterization of the primitive recursive set functions
inferred← citeshttps://doi.org/10.2307/2275451openalex-snapshot
About the proof-theoretic ordinals of weak fixed point theories
inferred← citeshttps://doi.org/10.2307/2275524openalex-snapshot
A semantics of evidence for classical arithmetic
inferred← citeshttps://doi.org/10.2307/2586766openalex-snapshot
Intuitionistic completeness for first order classical logic
inferred← citeshttps://doi.org/10.2307/2586791openalex-snapshot
On the No-Counterexample Interpretation
inferred← citeshttps://doi.org/10.2307/2586846openalex-snapshot
Explicit mathematics with the monotone fixed point principle
inferred← citeshttps://doi.org/10.23638/lmcs-13(3:6)2017openalex-snapshot
Focusing in Orthologic
inferred← citeshttps://doi.org/10.2969/msjmemoirs/00201c050openalex-snapshot
Constructivization via Approximations and Examples
inferred← citeshttps://doi.org/10.36253/979-12-215-0778-2.12openalex-snapshot
Sequent calculus and complexity theory
inferred← citeshttps://doi.org/10.4000/msh.2959openalex-snapshot
Proof Theory of Martin-Löf Type Theory. An overview
inferred← citeshttps://doi.org/10.4204/eptcs.164.4openalex-snapshot
Infinitary Classical Logic: Recursive Equations and Interactive Semantics
inferred← citeshttps://doi.org/10.4213/mzm10442openalex-snapshot
Циклические выводы для логики доказуемости Гeделя - Лeба
inferred← citeshttps://doi.org/10.48550/arxiv.0712.1499openalex-snapshot
On the computational complexity of cut-reduction
inferred← citeshttps://doi.org/10.48550/arxiv.math/0506463openalex-snapshot
A minimal classical sequent calculus free of structural rules
inferred← citeshttps://doi.org/10.70675/61bfbf53z121az472ez8c91ze9f6166c9a6aopenalex-snapshot
Applications of Foundational Proof Certificates in theorem proving
inferred← citeshttps://doi.org/10.7146/brics.v4i42.18968openalex-snapshot
On the No-Counterexample Interpretation
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.