On the public citation graph

Iterated inductive definitions, trees and ordinals

https://doi.org/10.1007/bfb0066745
0 signed · 29 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.19790253002openalex-snapshot
Über ein mit der Bar‐Induktion Verwandtes Schema
inferred← citeshttps://doi.org/10.1007/978-1-4899-0548-2_11openalex-snapshot
A Typed λ-calculus and Girard’s Model of Ptykes
inferred← citeshttps://doi.org/10.1007/978-3-319-63334-3_9openalex-snapshot
Iterated Inductive Definitions Revisited
inferred← citeshttps://doi.org/10.1007/bf01084980openalex-snapshot
Theory of proofs (arithmetic and analysis)
inferred← citeshttps://doi.org/10.1007/bf01641707openalex-snapshot
Beweistheoretische Abgrenzung von Teilsystemen der Analysis
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/bf02011877openalex-snapshot
Über die mit dem Bar-Rekursor vom Typ 0 definierbaren Ordinalzahlen
inferred← citeshttps://doi.org/10.1007/bfb0032393openalex-snapshot
A functional system with transfinitely defined types
inferred← citeshttps://doi.org/10.1007/bfb0062852openalex-snapshot
A language and axioms for explicit mathematics
inferred← citeshttps://doi.org/10.1007/bfb0079558openalex-snapshot
An upper bound for the provability of transfinite induction in systems with N-times iterated inductive definitions
inferred← citeshttps://doi.org/10.1016/0168-0072(89)90050-xopenalex-snapshot
The machinery of consistency proofs
inferred← citeshttps://doi.org/10.1016/j.apal.2008.06.002openalex-snapshot
Parameter-free polymorphic types
inferred← citeshttps://doi.org/10.1016/j.apal.2014.11.001openalex-snapshot
Notes on some second-order systems of iterated inductive definitions and Π11 -comprehensions and relevant subsystems of set theory
inferred← citeshttps://doi.org/10.1016/j.apal.2019.04.011openalex-snapshot
Representing definable functions of HA by neighbourhood functions
inferred← citeshttps://doi.org/10.1016/j.apal.2020.102903openalex-snapshot
Intuitionistic fixed point logic
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71120-0openalex-snapshot
An Introduction to Inductive Definitions
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71126-1openalex-snapshot
Theories of Finite Type Related to Mathematical Practice
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)70127-2openalex-snapshot
Constructive Hovels for Set Theory with Extensionalitv
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70128-4openalex-snapshot
A Note on Bar Induction Rule
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70186-7openalex-snapshot
Admissibility in Proof Theory; A Survey
inferred← citeshttps://doi.org/10.1017/cbo9780511546464.013openalex-snapshot
Recursion on the partial continuous functionals
inferred← citeshttps://doi.org/10.2178/jsl/1254748682openalex-snapshot
Functional interpretation and inductive definitions
inferred← citeshttps://doi.org/10.2307/1971023openalex-snapshot
Set Theoretic Foundations for Constructive Analysis
inferred← citeshttps://doi.org/10.2307/2271891openalex-snapshot
One hundred and two problems in mathematical logic
inferred← citeshttps://doi.org/10.2307/2271954openalex-snapshot
Provable wellorderings of formal theories for transfinitely iterated inductive definitions
inferred← citeshttps://doi.org/10.2307/2272816openalex-snapshot
Ordinals connected with formal theories for transfinitely iterated inductive definitions
inferred← citeshttps://doi.org/10.2307/2272821openalex-snapshot
Some relations between classical and constructive mathematics
inferred← citeshttps://doi.org/10.2307/2273152openalex-snapshot
On the role of Ramsey quantifiers in first order arithmetic
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.