On the public citation graph
Zur Theorie der konstruktiven Wohlordnungen
0 signed · 49 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.1007/bf01565439openalex-snapshot
General recursive functions of natural numbers
inferredcites →https://doi.org/10.1007/bf01700692openalex-snapshot
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
inferredcites →https://doi.org/10.1007/s00605-006-0423-7openalex-snapshot
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
inferredcites →https://doi.org/10.1016/s0049-237x(09)70461-6openalex-snapshot
On definable sets of positive integers )
inferredcites →https://doi.org/10.1090/s0002-9904-1938-06720-1openalex-snapshot
The constructive second number class
inferredcites →https://doi.org/10.1090/s0002-9947-1943-0007371-8openalex-snapshot
Recursive Predicates and Quantifiers
inferredcites →https://doi.org/10.2307/2371894openalex-snapshot
On the Forms of the Predicates in the Theory of Constructive Ordinals
inferredcites →https://doi.org/10.4064/fm-28-1-11-21openalex-snapshot
Formal definitions in the theory of ordinal numbers
inferredcites →https://doi.org/10.4064/fm-34-1-81-112openalex-snapshot
On definable sets of positive integers
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.19680140702openalex-snapshot
Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-04027-6_5openalex-snapshot
Kleene’s Amazing Second Recursion Theorem
inferred← citeshttps://doi.org/10.1007/978-94-009-7798-3_9openalex-snapshot
Infinite Ordered Sets, A Recursive Perspective
inferred← citeshttps://doi.org/10.1007/bf01977246openalex-snapshot
Über die Bestimmbarkeit des Verhaltens von Algorithmen
inferred← citeshttps://doi.org/10.1007/bf01977642openalex-snapshot
Number theoretic concepts and recursive well-orderings
inferred← citeshttps://doi.org/10.1007/bf02023921openalex-snapshot
On a consistency theorem connected with the generalized continuum problem
inferred← citeshttps://doi.org/10.1007/s00153-009-0146-2openalex-snapshot
Infinite time extensions of Kleene’s $${\mathcal{O}}$$
inferred← citeshttps://doi.org/10.1007/s00153-024-00958-xopenalex-snapshot
Constructivity conditions on immune sets
inferred← citeshttps://doi.org/10.1016/0003-4843(70)90001-xopenalex-snapshot
Formal systems for some branches of intuitionistic analysis
inferred← citeshttps://doi.org/10.1016/0003-4843(75)90005-4openalex-snapshot
Small recursive ordinals, many-one degrees, and the arithmetical difference hierarchy
inferred← citeshttps://doi.org/10.1016/0168-0072(80)90003-2openalex-snapshot
Borel ideals vs. Borel sets of countable relations and trees
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70271-xopenalex-snapshot
A generalization of the incompleteness theorem
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70278-2openalex-snapshot
Representability of Sets in Formal Systems
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80001-3openalex-snapshot
Introduction to the handbook of Recursive Mathematics
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80045-1openalex-snapshot
Introduction to the handbook of recursive mathematics
inferred← citeshttps://doi.org/10.1016/s0079-8169(08)60602-9openalex-snapshot
Complete Bibliography Of Linear Orderings
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00193-6openalex-snapshot
Hyper-polynomial hierarchies and the polynomial jump
inferred← citeshttps://doi.org/10.1080/19300980.1959.12467602openalex-snapshot
Some Comments on the Role of the Axiom of Choice in the Development of Abstract Set Theory
inferred← citeshttps://doi.org/10.1090/memo/1135openalex-snapshot
Classes of Polish spaces under effective Borel isomorphism
inferred← citeshttps://doi.org/10.1090/s0002-9904-1964-11104-6openalex-snapshot
A complete classification of the Δ₂¹-functions
inferred← citeshttps://doi.org/10.1090/s0002-9939-1969-0249293-7openalex-snapshot
Recursive Functions Defined by Ordinal Recursions
inferred← citeshttps://doi.org/10.1090/s0002-9947-1956-0083454-0openalex-snapshot
Recursive and Recursively Enumerable Orders
inferred← citeshttps://doi.org/10.1090/s0002-9947-1956-0085187-3openalex-snapshot
Degrees of Computability
inferred← citeshttps://doi.org/10.1090/s0002-9947-1968-0263626-0openalex-snapshot
A Hierarchy Based on a Type Two Object
inferred← citeshttps://doi.org/10.1109/ccc.1997.612305openalex-snapshot
Hyper-polynomial hierarchies and the NP-jump
inferred← citeshttps://doi.org/10.1142/s021906132050021xopenalex-snapshot
Turing degrees in Polish spaces and decomposability of Borel functions
inferred← citeshttps://doi.org/10.1305/ndjfl/1093957150openalex-snapshot
Four types of general recursive well-orderings.
inferred← citeshttps://doi.org/10.2178/bsl/1286889124openalex-snapshot
Kleene's Amazing Second Recursion Theorem
inferred← citeshttps://doi.org/10.2307/2273392openalex-snapshot
On generalized quantifiers in arithmetic
inferred← citeshttps://doi.org/10.26686/wgtn.25573695openalex-snapshot
On the Definability and Complexity of Sets and Structures
inferred← citeshttps://doi.org/10.4099/jjm1924.28.0_1openalex-snapshot
Sur les Ensembles Nommables et le Fondement de l' Analyse Mathématique, I
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.