On the public citation graph
Epsilon substitution method for elementary analysis
0 signed · 52 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-642-86896-2openalex-snapshot
Grundlagen der Mathematik II
inferredcites →https://doi.org/10.1007/978-3-662-28615-9_26openalex-snapshot
David Hilbert and His Mathematical Work
inferredcites →https://doi.org/10.1007/bf01449946openalex-snapshot
Begr�ndung des ?tertium non datur? mittels der Hilbertschen Theorie der Widerspruchsfreiheit
inferredcites →https://doi.org/10.1007/bf01450016openalex-snapshot
Zur Widerspruchsfreiheit der Zahlentheorie
inferredcites →https://doi.org/10.1007/bf01565428openalex-snapshot
Die Widerspruchsfreiheit der reinen Zahlentheorie
inferredcites →https://doi.org/10.1007/bf01782335openalex-snapshot
Probleme der Grundlegung der Mathematik
inferredcites →https://doi.org/10.1016/s0049-237x(06)80040-6openalex-snapshot
Gentzen-type systems and Hilbert's epsilon substitution method. I
inferredcites →https://doi.org/10.1017/s0022481200100581openalex-snapshot
On the Interpretation of Non-Finitist Proofs--Part I
inferredcites →https://doi.org/10.1090/s0002-9904-1944-08178-0openalex-snapshot
David Hilbert and his mathematical work
inferredcites →https://doi.org/10.2307/2267457openalex-snapshot
On the interpretation of non-finitist proofs–Part II
inferredcites →https://doi.org/10.2307/2270132openalex-snapshot
Functionals defined by transfinite recursion
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-63045-7_12openalex-snapshot
Cut elimination for the second order propositional logic with Hilbert's ε-symbol, extensionality, and full comprehension
inferred← citeshttps://doi.org/10.1007/978-3-319-10103-3_1openalex-snapshot
Gentzen’s Consistency Proof in Context
inferred← citeshttps://doi.org/10.1007/978-3-319-10103-3_17openalex-snapshot
Non-deterministic Epsilon Substitution Method for PA and ID 1
inferred← citeshttps://doi.org/10.1007/978-94-017-2109-7_8openalex-snapshot
Epsilon-Substitution Method for the Ramified Language and $$\Delta _1^1$$ -Comprehension Rule
inferred← citeshttps://doi.org/10.1007/bf02358997openalex-snapshot
A method of epsilon substitution for the predicate logic with equality
inferred← citeshttps://doi.org/10.1007/s00153-004-0241-3openalex-snapshot
Epsilon substitution for transfinite induction
inferred← citeshttps://doi.org/10.1007/s00153-005-0290-2openalex-snapshot
Epsilon substitution method for [Π01, Π01]-FIX
inferred← citeshttps://doi.org/10.1007/s00153-017-0590-3openalex-snapshot
Epsilon substitution for $$\textit{ID}_1$$ ID 1 via cut-elimination
inferred← citeshttps://doi.org/10.1007/s001530100108openalex-snapshot
Epsilon substitution method for theories of jump hierarchies
inferred← citeshttps://doi.org/10.1016/j.apal.2005.09.016openalex-snapshot
Ackermann’s substitution method (remixed)
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.2011.12.004openalex-snapshot
A constructive analysis of learning in Peano Arithmetic
inferred← citeshttps://doi.org/10.1016/j.apal.2012.05.004openalex-snapshot
Epsilon substitution for first- and second-order predicate logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.07.013openalex-snapshot
Cut Elimination for a Simple Formulation of PAε
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.02.028openalex-snapshot
On natural deduction in classical first-order logic: Curry–Howard correspondence, strong normalization and Herbrand's theorem
inferred← citeshttps://doi.org/10.1016/s0168-0072(02)00112-4openalex-snapshot
Epsilon substitution method for ID1(Π10∨Σ10)
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.1016/s1874-5857(09)70013-5openalex-snapshot
Hilbert’s Epsilon Calculus and its Successors
inferred← citeshttps://doi.org/10.1017/9781316755983.006openalex-snapshot
The epsilon substitutionmethod and continuity
inferred← citeshttps://doi.org/10.1017/s0960129513000455openalex-snapshot
Interactive Realizability for second-order Heyting arithmetic with EM1 and SK1
inferred← citeshttps://doi.org/10.1017/s0960129515000468openalex-snapshot
Constructive forcing, CPS translations and witness extraction in Interactive realizability
inferred← citeshttps://doi.org/10.1017/s1755020316000198openalex-snapshot
VON NEUMANN’S CONSISTENCY PROOF
inferred← citeshttps://doi.org/10.1023/a:1026247421383openalex-snapshot
The Practice of Finitism: Epsilon Calculus and Consistency Proofs in Hilbert's Program
inferred← citeshttps://doi.org/10.11575/prism/38830openalex-snapshot
Hilbert’s Finitism: Historical, Philosophical, and Metamathematical Perspectives
inferred← citeshttps://doi.org/10.13140/rg.2.1.2855.5769openalex-snapshot
Existence Assumptions and Logical Principles : Choice Operators in Intuitionistic Logic
inferred← citeshttps://doi.org/10.2178/bsl/1140640947openalex-snapshot
2005 Annual Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.2178/jsl/1164060450openalex-snapshot
Epsilon substitution method for -FIX
inferred← citeshttps://doi.org/10.2307/2275811openalex-snapshot
Strong termination for the epsilon substitution method
inferred← citeshttps://doi.org/10.2307/2586480openalex-snapshot
Cut-elimination for simple type theory with an axiom of choice
inferred← citeshttps://doi.org/10.2307/421188openalex-snapshot
1998–99 Annual Meeting of the Association for Symbolic Logic
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.97.1openalex-snapshot
Interactive Realizability and the elimination of Skolem functions in Peano Arithmetic
inferred← citeshttps://doi.org/10.4230/lipics.csl.2011.20openalex-snapshot
Transfinite Update Procedures for Predicative Systems of Analysis
inferred← citeshttps://doi.org/10.4230/lipics.csl.2012.31openalex-snapshot
Interactive Realizability for Classical Peano Arithmetic with Skolem Axioms
inferred← citeshttps://doi.org/10.4230/lipics.csl.2013.45openalex-snapshot
Realizability and Strong Normalization for a Curry-Howard Interpretation of HA + EM1
inferred← citeshttps://doi.org/10.48550/arxiv.0812.3434openalex-snapshot
Priority Arguments and Epsilon Substitutions
inferred← citeshttps://doi.org/10.48550/arxiv.1509.00390openalex-snapshot
Epsilon Substitution for $ID_1$ via Cut-Elimination
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.