On the public citation graph
The use of abstract language in elementary metamathematics: Some pedagogic examples
0 signed · 57 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.1002/malq.19680140702openalex-snapshot
Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
inferredcites →https://doi.org/10.1007/bf01594179openalex-snapshot
Die Widerspruchsfreiheit der allgemeinen Mengenlehre
inferredcites →https://doi.org/10.1007/bf01974148openalex-snapshot
Mehrsortige logische Systeme mit unendlich langen Formeln I
inferredcites →https://doi.org/10.1016/b978-0-7204-2233-7.50011-3openalex-snapshot
CONTINUOUS MODEL THEORY
inferredcites →https://doi.org/10.1016/s0049-237x(08)70769-9openalex-snapshot
Iterated Inductive Definitions and Σ21-AC
inferredcites →https://doi.org/10.1016/s0049-237x(08)70845-0openalex-snapshot
A Survey of Proof Theory II
inferredcites →https://doi.org/10.1016/s0049-237x(08)70847-4openalex-snapshot
Hauptsatz for the Intuitionistic Theory of Iterated Inductive Definitions
inferredcites →https://doi.org/10.1016/s0049-237x(08)71194-7openalex-snapshot
On Simple Type Theory with Extensionality
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7039-9openalex-snapshot
The Collected Papers of Gerhard Gentzen
inferredcites →https://doi.org/10.1090/pspum/005/0141595openalex-snapshot
Algebras of sets binumerable in complete extensions of arithmetic
inferredcites →https://doi.org/10.1090/s0002-9904-1963-10990-8openalex-snapshot
False lemmas in Herbrand
inferredcites →https://doi.org/10.1090/s0002-9947-1972-0316227-0openalex-snapshot
Π⁰₁ classes and degrees of theories
inferredcites →https://doi.org/10.1515/9781400882052openalex-snapshot
Continuous Model Theory. (AM-58)
inferredcites →https://doi.org/10.2307/2025206openalex-snapshot
The Collected Papers of Gerhard Gentzen
inferredcites →https://doi.org/10.2307/2271438openalex-snapshot
Many-valued logics of extended Gentzen style II
inferredcites →https://doi.org/10.2307/2963525openalex-snapshot
Syntactical and semantical properties of simple type theory
inferredcites →https://doi.org/10.2307/2964336openalex-snapshot
Sentences true in all constructive models
inferredcites →https://doi.org/10.3792/pja/1195521329openalex-snapshot
Simple type theory of Gentzen style with the inference of extensionality
inferredcites →https://doi.org/10.4064/fm-90-2-159-172openalex-snapshot
On an extremely restricted ω-rule
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11753728_27openalex-snapshot
Unwinding a Non-effective Cut Elimination Proof
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-51486-4_101openalex-snapshot
Constructive aspects of the omega-rule : Application to proof systems in computer science and algorithmic logic
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-319-10103-3_17openalex-snapshot
Non-deterministic Epsilon Substitution Method for PA and ID 1
inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_28openalex-snapshot
Proof Search Tree and Cut Elimination
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-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-009-9825-4_1openalex-snapshot
Some Facts from the Theory of Proofs and Some Fictions from General Proof Theory
inferred← citeshttps://doi.org/10.1007/978-94-010-0630-9_2openalex-snapshot
The Proof Theory of Stig Kanger: A Personal Recollection
inferred← citeshttps://doi.org/10.1007/978-981-15-6459-8_2openalex-snapshot
Calculi for Classical Logic
inferred← citeshttps://doi.org/10.1007/bf01621472openalex-snapshot
Notation systems for infinitary derivations
inferred← citeshttps://doi.org/10.1007/bf02297650openalex-snapshot
Further applications of ultra-conservative ω-rules
inferred← citeshttps://doi.org/10.1007/bfb0079551openalex-snapshot
Observations on a recent generalization of completeness theorems due to Schütte
inferred← citeshttps://doi.org/10.1007/s10992-026-09839-5openalex-snapshot
On the Methodology of Informal Rigour: Set Theory, Semantics, and Intuitionism
inferred← citeshttps://doi.org/10.1016/0003-4843(78)90011-6openalex-snapshot
Bounds for proof-search and speed-up in the predicate calculus
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.2009.06.004openalex-snapshot
On the computational complexity of cut-reduction
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70646-3openalex-snapshot
Infinite Rules in Finite Systems
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70442-2openalex-snapshot
Complexity of Derivations from Quantifier-Free Horn Formulae, Mechanical Introduction of Explicit Definitions, and Refinement of Completeness Theorems
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70685-8openalex-snapshot
The Use of Ordinals in the Constructive Foundations of Mathematics
inferred← citeshttps://doi.org/10.1017/s1755020316000411openalex-snapshot
THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC
inferred← citeshttps://doi.org/10.1109/lics.2008.9openalex-snapshot
On the Computational Complexity of Cut-Reduction
inferred← citeshttps://doi.org/10.2168/lmcs-3(3:1)2007openalex-snapshot
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
inferred← citeshttps://doi.org/10.2307/2273818openalex-snapshot
European Summer Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.2307/2275367openalex-snapshot
Effective bounds from ineffective proofs in analysis: An application of functional interpretation and majorization
inferred← citeshttps://doi.org/10.48550/arxiv.0712.1499openalex-snapshot
On the computational complexity of cut-reduction
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.