On the public citation graph

Finite investigations of transfinite derivations

0 signed · 65 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/978-3-540-89107-9_6openalex-snapshot
Grundlagen der Mathematik
inferredcites →https://doi.org/10.1007/bf01091551openalex-snapshot
Heyting predicate calculus with epsilon symbol
inferredcites →https://doi.org/10.1016/s0049-237x(08)70771-7openalex-snapshot
On a Number Theoretic Choice Schema and its Relation to Induction
inferredcites →https://doi.org/10.2307/2270324openalex-snapshot
A survey of proof theory

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.19810272507openalex-snapshot
A General Theorem on Existence Theorems
inferred← citeshttps://doi.org/10.1007/11874683_7openalex-snapshot
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
inferred← citeshttps://doi.org/10.1007/3-540-18170-9_177openalex-snapshot
Ein einfaches Verfahren zur Normalisierung unendlicher Herleitungen
inferred← citeshttps://doi.org/10.1007/3-540-45793-3_5openalex-snapshot
On Continuous Normalization
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-319-10103-3_10openalex-snapshot
Cut Elimination In Situ
inferred← citeshttps://doi.org/10.1007/978-3-319-29198-7_13openalex-snapshot
Pointwise Transfinite Induction and a Miniaturized Predicativity
inferred← citeshttps://doi.org/10.1007/978-3-319-63334-3_6openalex-snapshot
Tiered Arithmetics
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-20920-8_21openalex-snapshot
Countable Version of Omega-Rule
inferred← citeshttps://doi.org/10.1007/978-3-662-55386-2_13openalex-snapshot
The Lambek Calculus with Iteration: Two Variants
inferred← citeshttps://doi.org/10.1007/978-88-470-3968-1_6openalex-snapshot
Gli ordinali
inferred← citeshttps://doi.org/10.1007/978-981-10-6355-8_6openalex-snapshot
Contentual and Formal Aspects of Gentzen’s Consistency Proofs
inferred← citeshttps://doi.org/10.1007/bf01091742openalex-snapshot
Transfinite expansions of arithmetic formulas
inferred← citeshttps://doi.org/10.1007/bf01621472openalex-snapshot
Notation systems for infinitary derivations
inferred← citeshttps://doi.org/10.1007/bf02017499openalex-snapshot
On cut elimination in the presence of perice rule
inferred← citeshttps://doi.org/10.1007/bfb0027402openalex-snapshot
Three faces of natural deduction
inferred← citeshttps://doi.org/10.1007/bfb0028033openalex-snapshot
A simple ordinal recursive normalization of Gödel's T
inferred← citeshttps://doi.org/10.1007/s00153-020-00716-9openalex-snapshot
Completeness of the primitive recursive $$\omega $$-rule
inferred← citeshttps://doi.org/10.1007/s001530000064openalex-snapshot
Explaining the Gentzen-Takeuti reduction steps: a second-order system
inferred← citeshttps://doi.org/10.1007/s10958-009-9405-3openalex-snapshot
Proof compressions with circuit-structured substitutions
inferred← citeshttps://doi.org/10.1007/s11225-012-9378-yopenalex-snapshot
Effective Cut-elimination for a Fragment of Modal mu-calculus
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/0168-0072(94)00003-lopenalex-snapshot
Elementary descent recursion and proof theory
inferred← citeshttps://doi.org/10.1016/j.aim.2019.106767openalex-snapshot
Π11 -comprehension as a well-ordering principle
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.2005.05.006openalex-snapshot
A term calculus for (co-)recursive definitions on streamlike data structures
inferred← citeshttps://doi.org/10.1016/j.apal.2007.11.008openalex-snapshot
Cut elimination for a simple formulation of epsilon calculus
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.2011.03.002openalex-snapshot
Quick cut-elimination for strictly positive cuts
inferred← citeshttps://doi.org/10.1016/j.apal.2024.103550openalex-snapshot
Peano arithmetic, games and descent recursion
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.07.025openalex-snapshot
Substitution in non-wellfounded syntax with variable binding
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70686-xopenalex-snapshot
Applications of Proof-Theoretic Transformation (Abstract)
inferred← citeshttps://doi.org/10.1016/s0049-237x(96)80017-6openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80032-9openalex-snapshot
Classifying Recursive Functions
inferred← citeshttps://doi.org/10.1016/s0168-0072(00)00011-7openalex-snapshot
Reduction of finite and infinite derivations
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00073-0openalex-snapshot
Finite notations for infinite terms
inferred← citeshttps://doi.org/10.1016/s0168-0072(98)00020-7openalex-snapshot
Some results on cut-elimination, provable well-orderings, induction and reflection
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00451-6openalex-snapshot
A termination proof for epsilon substitution using partial derivations
inferred← citeshttps://doi.org/10.1017/bsl.2022.23openalex-snapshot
A NOTE ON FRAGMENTS OF UNIFORM REFLECTION IN SECOND ORDER ARITHMETIC
inferred← citeshttps://doi.org/10.1017/cbo9781139031905openalex-snapshot
Proofs and Computations
inferred← citeshttps://doi.org/10.1017/jsl.2017.71openalex-snapshot
A NOTE ON PREDICATIVE ORDINAL ANALYSIS I: ITERATED COMPREHENSION AND TRANSFINITE INDUCTION
inferred← citeshttps://doi.org/10.1023/a:1005016206457openalex-snapshot
Linear Lambda-Terms and Natural Deduction
inferred← citeshttps://doi.org/10.1023/a:1005278215757openalex-snapshot
A Note on Goodman's Theorem
inferred← citeshttps://doi.org/10.1093/9780197784402.003.0017openalex-snapshot
A Metapredicative Study of μ -Arithmetics
inferred← citeshttps://doi.org/10.1093/jigpal/6.3.451openalex-snapshot
Substructural logics on display
inferred← citeshttps://doi.org/10.1109/lics.2008.9openalex-snapshot
On the Computational Complexity of Cut-Reduction
inferred← citeshttps://doi.org/10.1142/9789814360548_0001openalex-snapshot
PROVABLY $\Delta _2^0$ AND WEAKLY DESCENDING CHAINS
inferred← citeshttps://doi.org/10.1145/1481848.1481852openalex-snapshot
Refinement types and computational duality
inferred← citeshttps://doi.org/10.1145/3479394.3479402openalex-snapshot
Canonical proof-objects for coinductive programming: infinets with infinitely many cuts
inferred← citeshttps://doi.org/10.1145/3531130.3533340openalex-snapshot
Cyclic Implicit Complexity
inferred← citeshttps://doi.org/10.1145/3531130.3533375openalex-snapshot
Bouncing threads for circular and non-wellfounded proofs -- Towards compositionality with circular proofs (Extended version)
inferred← citeshttps://doi.org/10.1145/3793666openalex-snapshot
Cyclic Implicit Complexity
inferred← citeshttps://doi.org/10.1145/91556.91675openalex-snapshot
Discrete polymorphism
inferred← citeshttps://doi.org/10.1515/9783110324907.65openalex-snapshot
Characterising Definable Search Problems in Bounded Arithmetic via Proof Notations
inferred← citeshttps://doi.org/10.2307/2275019openalex-snapshot
Generalizations of the one-dimensional version of the Kruskal-Friedman theorems
inferred← citeshttps://doi.org/10.4204/eptcs.153.4openalex-snapshot
Normalization by Evaluation in the Delay Monad: A Case Study for Coinduction via Copatterns and Sized Types
inferred← citeshttps://doi.org/10.4230/lipics.fscd.2021.29openalex-snapshot
A circular version of Gödel's T and its abstraction complexity
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2023.37openalex-snapshot
Inductive Continuity via Brouwer Trees
inferred← citeshttps://doi.org/10.4288/jafpos.27.0_1openalex-snapshot
On the Intuitionistic Background of Gentzen's 1935 and 1936 Consistency Proofs and Their Philosophical Aspects
inferred← citeshttps://doi.org/10.4288/kisoron.41.1_1openalex-snapshot
Reading Gentzen's Three Consistency Proofs Uniformly
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.