On the public citation graph

Pure Proof Theory Aims, Methods and Results: Extended Version of Talks Given at Oberwolfach and Haifa

https://doi.org/10.2307/421108
0 signed · 30 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.1002/malq.19940400212openalex-snapshot
A Uniform Approach to Fundamental Sequences and Hierarchies
inferredcites →https://doi.org/10.1007/978-3-319-23627-8openalex-snapshot
Theory of Reflection
inferredcites →https://doi.org/10.1007/978-3-540-46825-7openalex-snapshot
Proof Theory: An Introduction
inferredcites →https://doi.org/10.1007/978-3-540-79890-3openalex-snapshot
K-theory: An introduction
inferredcites →https://doi.org/10.1007/978-3-642-66473-1openalex-snapshot
Proof Theory
inferredcites →https://doi.org/10.1007/978-3-662-11035-5openalex-snapshot
Admissible Sets and Structures
inferredcites →https://doi.org/10.1007/bf01275469openalex-snapshot
Collapsing functions based on recursively large ordinals: A well-ordering proof for KPM
inferredcites →https://doi.org/10.1007/bf01621474openalex-snapshot
Proof theory and ordinal analysis
inferredcites →https://doi.org/10.1007/bf01621475openalex-snapshot
Proof-theoretic analysis of KPM
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.1007/bf02011634openalex-snapshot
On the strength of several versions of Dirichlet's (“pigeon-hole”-)principle in the sense of first-order logic
inferredcites →https://doi.org/10.1007/bf02023014openalex-snapshot
A well-ordering proof for Feferman's theoryT 0
inferredcites →https://doi.org/10.1007/bfb0062852openalex-snapshot
A language and axioms for explicit mathematics
inferredcites →https://doi.org/10.1007/bfb0091894openalex-snapshot
Iterated Inductive Definitions and Subsystems of Analysis: Recent Proof-Theoretical Studies
inferredcites →https://doi.org/10.1016/0168-0072(94)90074-4openalex-snapshot
Proof theory of reflection
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7085-5openalex-snapshot
Formal Systems and Recursive Functions
inferredcites →https://doi.org/10.1017/9781316717196openalex-snapshot
Admissible Sets and Structures
inferredcites →https://doi.org/10.2307/2269764openalex-snapshot
Systems of predicative analysis
inferredcites →https://doi.org/10.2307/2275597openalex-snapshot
How to characterize provably total functions by local predicativity

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

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/s001530050075openalex-snapshot
A proof of strongly uniform termination for Gödel's $T$ by methods from local predicativity
inferred← citeshttps://doi.org/10.1007/s00591-006-0012-9openalex-snapshot
Die Gödelschen Unvollständigkeitssätze
inferred← citeshttps://doi.org/10.1016/j.apal.2004.01.001openalex-snapshot
Proof theory for theories of ordinals II: Π3-reflection
inferred← citeshttps://doi.org/10.1023/a:1005006610269openalex-snapshot
Second Thoughts Around Some of Göde's Writings:
inferred← citeshttps://doi.org/10.1023/a:1020892011851openalex-snapshot
Mathematical Proof Theory in the Light of Ordinal Analysis
inferred← citeshttps://doi.org/10.1515/9783110324907.315openalex-snapshot
An Extended Predicative Definition of the Mahlo Universe
inferred← citeshttps://doi.org/10.2307/2586654openalex-snapshot
How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study
inferred← citeshttps://doi.org/10.2307/2586705openalex-snapshot
Ordinal diagrams for Π3-reflection
inferred← citeshttps://doi.org/10.2307/2695093openalex-snapshot
First order theories for nonmonotone inductive definitions: recursively inaccessible and Mahlo
inferred← citeshttps://doi.org/10.48550/arxiv.math/0509244openalex-snapshot
Predicativity beyond Gamma_0
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.