On the public citation graph
Degrees of models
0 signed · 67 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/bf01696781openalex-snapshot
Die Vollständigkeit der Axiome des logischen Funktionenkalküls
inferredcites →https://doi.org/10.1016/s0049-237x(09)70260-5openalex-snapshot
A formula with no recursively enumerable model
inferredcites →https://doi.org/10.1090/s0002-9947-1955-0070594-4openalex-snapshot
Arithmetical Predicates and Function Quantifiers
inferredcites →https://doi.org/10.1093/bjps/iv.14.107openalex-snapshot
A VARIANT TO HILBERT'S THEORY OF THE FOUNDATIONS OF ARITHMETIC
inferredcites →https://doi.org/10.2307/1969708openalex-snapshot
The Upper Semi-Lattice of Degrees of Recursive Unsolvability
inferredcites →https://doi.org/10.2307/2267044openalex-snapshot
The completeness of the first-order functional calculus
inferredcites →https://doi.org/10.2307/2372632openalex-snapshot
On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
inferredcites →https://doi.org/10.4064/fm-42-1-125-140openalex-snapshot
A formula with no recursively enumerable model
inferredcites →https://doi.org/10.5840/wcp11195314447openalex-snapshot
Note on Arithmetic Models for Consistent Formulae of the Predicate Calculus II
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.19670131302openalex-snapshot
Arithmetical Sets and Retracing Functions
inferred← citeshttps://doi.org/10.1002/malq.19770230705openalex-snapshot
The Complexity of Some Combinatorial Constructions
inferred← citeshttps://doi.org/10.1002/malq.19980440405openalex-snapshot
Reverse Mathematics and Recursive Graph Theory
inferred← citeshttps://doi.org/10.1002/malq.201800056openalex-snapshot
Bi‐embeddability spectra and bases of spectra
inferred← citeshttps://doi.org/10.1007/11750321_74openalex-snapshot
On Mass Problems of Presentability
inferred← citeshttps://doi.org/10.1007/978-1-4612-0125-0_5openalex-snapshot
Decidability and Completeness
inferred← citeshttps://doi.org/10.1007/978-3-031-36978-0_3openalex-snapshot
Direct Construction of Scott Ideals
inferred← citeshttps://doi.org/10.1007/978-3-319-20028-6_9openalex-snapshot
Degrees of Unsolvability: A Tutorial
inferred← citeshttps://doi.org/10.1007/978-3-319-40189-8_13openalex-snapshot
Computability in Symbolic Dynamics
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_19openalex-snapshot
Enumeration Reducibility and Computable Structure Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_25openalex-snapshot
The Shrinking Property for NP and coNP
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_40openalex-snapshot
A Thirty Year Old Conjecture about Promise Problems
inferred← citeshttps://doi.org/10.1007/bf01269946openalex-snapshot
Connected components of graphs and reverse mathematics
inferred← citeshttps://doi.org/10.1007/s00037-015-0107-6openalex-snapshot
A thirty Year old conjecture about promise problems
inferred← citeshttps://doi.org/10.1007/s00153-012-0310-yopenalex-snapshot
Antibasis theorems for $${\Pi^0_1}$$ classes and the jump hierarchy
inferred← citeshttps://doi.org/10.1007/s10469-008-0007-9openalex-snapshot
Degrees of presentability of structures. II
inferred← citeshttps://doi.org/10.1007/s40574-022-00325-9openalex-snapshot
Provability logic: models within models in Peano Arithmetic
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50010-1openalex-snapshot
Degrees of Unsolvability
inferred← citeshttps://doi.org/10.1016/b978-0-7204-2233-7.50054-xopenalex-snapshot
A BIBLIOGRAPHY OF THE THEORY OF MODELS
inferred← citeshttps://doi.org/10.1016/j.apal.2015.08.001openalex-snapshot
Measuring complexities of classes of structures
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2014.02.027openalex-snapshot
Infinite dimensional proper subspaces of computable vector spaces
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)80002-5openalex-snapshot
Chapter 1 Pure computable model theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80012-8openalex-snapshot
Chapter 11 A bibliography of recursive algebra and recursive model theory
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/s0049-237x(98)80046-3openalex-snapshot
Chapter 13 Π10 classes in mathematics
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80049-9openalex-snapshot
Chapter 16 A survey of recursive combinatorics
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80018-4openalex-snapshot
∏10 Classes in Computability Theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80020-2openalex-snapshot
Local Degree Theory* *Preparation of this paper partially supported by E.P.S.R.C. research grants nos. GR/H91213 and GR/H02165, and by EC Human Capital and Mobility network ‘Complexity, Logic and Recursion Theory’.
inferred← citeshttps://doi.org/10.1017/s1079898600005746openalex-snapshot
In Memoriam: Joseph R. Shoenfield 1927–2000
inferred← citeshttps://doi.org/10.1017/s1755020316000411openalex-snapshot
THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC
inferred← citeshttps://doi.org/10.1090/s0002-9947-06-03984-5openalex-snapshot
Invariance in ℰ* and ℰ_{Π}
inferred← citeshttps://doi.org/10.1090/s0002-9947-1972-0316227-0openalex-snapshot
Π⁰₁ classes and degrees of theories
inferred← citeshttps://doi.org/10.1112/plms/s3-25.4.615openalex-snapshot
Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall)
inferred← citeshttps://doi.org/10.1137/0217018openalex-snapshot
Complexity Measures for Public-Key Cryptosystems
inferred← citeshttps://doi.org/10.1145/2696081.2696095openalex-snapshot
Disjoint NP-Pairs and Propositional Proof Systems
inferred← citeshttps://doi.org/10.1145/48014.63139openalex-snapshot
Meager and replete failures of relative completeness
inferred← citeshttps://doi.org/10.1201/b21197-9openalex-snapshot
Peano Arithmetic Models and Computability
inferred← citeshttps://doi.org/10.1215/00294527-2010-009openalex-snapshot
Π 1 0 Classes, Peano Arithmetic, Randomness, and Computable Domination
inferred← citeshttps://doi.org/10.1215/00294527-2864298openalex-snapshot
Weak Truth Table Degrees of Structures
inferred← citeshttps://doi.org/10.1305/ndjfl/1172787551openalex-snapshot
Computability of Homogeneous Models
inferred← citeshttps://doi.org/10.2140/pjm.1969.30.67openalex-snapshot
Countable retracing functions and Π20predicates
inferred← citeshttps://doi.org/10.2140/pjm.1972.40.605openalex-snapshot
Degrees of members of Π10classes
inferred← citeshttps://doi.org/10.2178/bsl/1333560805openalex-snapshot
A Survey of Mučnik and Medvedev Degrees
inferred← citeshttps://doi.org/10.2178/jsl/1146620150openalex-snapshot
Complexity, decidability and completeness
inferred← citeshttps://doi.org/10.2307/2270853openalex-snapshot
Effectively retractable theories and degrees of undecidability
inferred← citeshttps://doi.org/10.2307/2274174openalex-snapshot
Two theorems on degrees of models of true arithmetic
inferred← citeshttps://doi.org/10.31274/etd-180810-4556openalex-snapshot
Randomness in completeness and space-bounded computations
inferred← citeshttps://doi.org/10.48550/arxiv.1007.2376openalex-snapshot
A Survey of Muchnik and Medvedev degrees
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.