On the public citation graph

Inductive definitions and subsystems of analysis

https://doi.org/10.1007/bfb0091895
0 signed · 24 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 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.1002/malq.19930390107openalex-snapshot
How to develop Proof‐Theoretic Ordinal Functions on the basis of admissible ordinals
inferred← citeshttps://doi.org/10.1007/3-540-18170-9_179openalex-snapshot
Relative konsistenz
inferred← citeshttps://doi.org/10.1007/978-1-4020-8926-8_19openalex-snapshot
Beyond Hilbert’s Reach?
inferred← citeshttps://doi.org/10.1007/978-3-030-77799-9_3openalex-snapshot
On the Performance of Axiom Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-15298-6_23openalex-snapshot
On the Computational Properties of the Uncountability of the Real Numbers
inferred← citeshttps://doi.org/10.1007/978-3-319-63334-3_20openalex-snapshot
Feferman’s Skepticism About Set Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-63334-3_9openalex-snapshot
Iterated Inductive Definitions Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-00596-1_7openalex-snapshot
On the Completeness of Dynamic Logic
inferred← citeshttps://doi.org/10.1007/978-94-011-5690-5_11openalex-snapshot
Aspects of Mathematical Experience
inferred← citeshttps://doi.org/10.1007/978-94-017-1592-8_10openalex-snapshot
Foundations for Analysis and Proof Theory
inferred← citeshttps://doi.org/10.1007/bf00485379openalex-snapshot
Relative consistency and accessible domains
inferred← citeshttps://doi.org/10.1007/bf00485460openalex-snapshot
Foundations for analysis and proof theory
inferred← citeshttps://doi.org/10.1007/bfb0032399openalex-snapshot
Well-ordering of algebras and Kruskal's theorem
inferred← citeshttps://doi.org/10.1017/s0022481200028310openalex-snapshot
Hilbert's program relativized; Proof-theoretical and foundational reductions
inferred← citeshttps://doi.org/10.1017/s0022481200031224openalex-snapshot
On the relation between choice and comprehension principles in second order arithmetic
inferred← citeshttps://doi.org/10.1017/s1755020314000379openalex-snapshot
AXIOMATIZING SEMANTIC THEORIES OF TRUTH?
inferred← citeshttps://doi.org/10.1017/s1755020316000411openalex-snapshot
THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC
inferred← citeshttps://doi.org/10.1023/a:1005033725849openalex-snapshot
Simplicity and Incompleteness
inferred← citeshttps://doi.org/10.1080/01445340.2024.2439683openalex-snapshot
An Introduction to Lorenzen's ‘Algebraic and Logistic Investigations on Free Lattices’ (1951)
inferred← citeshttps://doi.org/10.1093/pq/pqaf019openalex-snapshot
A type-theoretical Curry paradox and its solution
inferred← citeshttps://doi.org/10.1112/blms.12763openalex-snapshot
Locally hyperarithmetical induction
inferred← citeshttps://doi.org/10.2307/2274713openalex-snapshot
The role of parameters in bar rule and bar induction
inferred← citeshttps://doi.org/10.2307/2275671openalex-snapshot
On power set in explicit mathematics
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.