On the public citation graph

Beweistheorie vonKPN

0 signed · 31 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-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/bfb0079691openalex-snapshot
Normal derivability in classical logic
inferredcites →https://doi.org/10.1017/9781316717196openalex-snapshot
Admissible Sets and Structures
inferredcites →https://doi.org/10.2307/1971023openalex-snapshot
Set Theoretic Foundations for Constructive Analysis

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.19840300102openalex-snapshot
A VERSION OF KRIPKE‐PLATEK SET THEORY WHICH IS CONSERVATIVE OVER PEANO ARITHMETIC
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_157openalex-snapshot
Ellipsoid Method
inferred← citeshttps://doi.org/10.1007/978-3-030-49424-7_9openalex-snapshot
Having a Look Again at Some Theories ofProof-Theoretic Strengths around $$ \varGamma_{0} $$
inferred← citeshttps://doi.org/10.1007/978-3-030-77799-9_4openalex-snapshot
Well-Ordering Principles in Proof Theory and Reverse Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-319-29198-7_4openalex-snapshot
Ordinal Analysis of Intuitionistic Power and Exponentiation Kripke Platek Set Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-29198-7_9openalex-snapshot
From Subsystems of Analysis to Subsystems of Set Theory
inferred← citeshttps://doi.org/10.1007/bf02011638openalex-snapshot
Cut-elimination for impredicative infinitary systems part I. Ordinal-analysis for ID1
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/bf02391553openalex-snapshot
Second order theories with ordinals and elementary comprehension
inferred← citeshttps://doi.org/10.1007/s00029-023-00879-2openalex-snapshot
Well ordering principles for iterated $$\Pi ^1_1$$-comprehension
inferred← citeshttps://doi.org/10.1007/s001530050105openalex-snapshot
The $\mu$ quantification operator in explicit mathematics with universes and iterated fixed point theories with ordinals
inferred← citeshttps://doi.org/10.1007/s001530050161openalex-snapshot
Fixed point theories and dependent choice
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90039-gopenalex-snapshot
Fixed points in Peano arithmetic with ordinals
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.2009.01.010openalex-snapshot
Full operational set theory with unbounded existential quantification and power set
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71880-9openalex-snapshot
Iterating Admissibility in Proof Theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70515-4openalex-snapshot
Set Theoretic Aspects of Atr0
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70553-1openalex-snapshot
Some Proof-Theoretic Contributions to Theories of Sets
inferred← citeshttps://doi.org/10.1016/s0168-0072(02)00040-4openalex-snapshot
Universes over Frege structures
inferred← citeshttps://doi.org/10.1016/s0168-0072(96)00005-xopenalex-snapshot
Systems of explicit mathematics with non-constructive μ-operator and join
inferred← citeshttps://doi.org/10.1017/cbo9781107325944.016openalex-snapshot
First Steps into Metapredicativity in Explicit Mathematics
inferred← citeshttps://doi.org/10.2307/2274140openalex-snapshot
The strength of admissibility without foundation
inferred← citeshttps://doi.org/10.2307/2275787openalex-snapshot
Some theories with positive induction of ordinal strength φω0
inferred← citeshttps://doi.org/10.2307/2695093openalex-snapshot
First order theories for nonmonotone inductive definitions: recursively inaccessible and Mahlo
inferred← citeshttps://doi.org/10.2307/421132openalex-snapshot
Recent Advances in Ordinal Analysis: Π12— CA and Related Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1610.02194openalex-snapshot
Classifying the provably total set functions of KP and KP(P)
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.