On the public citation graph
On Degrees of Recursive Unsolvability
0 signed · 192 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.2307/1969708openalex-snapshot
The Upper Semi-Lattice of Degrees of Recursive Unsolvability
inferredcites →https://doi.org/10.2307/2372632openalex-snapshot
On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
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.19590050703openalex-snapshot
Reducibility and Completeness for Sets of Integers
inferred← citeshttps://doi.org/10.1002/malq.19680140704openalex-snapshot
The Degrees of Hyperimmune Sets
inferred← citeshttps://doi.org/10.1002/malq.19690150707openalex-snapshot
The degrees of bi‐immune sets
inferred← citeshttps://doi.org/10.1002/malq.19710170139openalex-snapshot
Arithmetical Reducibilities I
inferred← citeshttps://doi.org/10.1002/malq.19740200804openalex-snapshot
Minimal Degrees in Generalized Recursion Theory
inferred← citeshttps://doi.org/10.1002/malq.19740201311openalex-snapshot
Maximal Arithmetical Reducibilities
inferred← citeshttps://doi.org/10.1002/malq.19910373104openalex-snapshot
Topological Framework for Non‐Priority
inferred← citeshttps://doi.org/10.1002/malq.200410027openalex-snapshot
Properly ?2 minimal degrees and 0? complementation
inferred← citeshttps://doi.org/10.1002/malq.200410044openalex-snapshot
The minimal complementation property above 0′
inferred← citeshttps://doi.org/10.1007/978-1-4613-9754-0_11openalex-snapshot
Degrees of Constructibility
inferred← citeshttps://doi.org/10.1007/978-1-4615-0755-0_15openalex-snapshot
Local Properties of the Non-Total Enumeration Degrees
inferred← citeshttps://doi.org/10.1007/978-3-031-08740-0_20openalex-snapshot
ON TREES WITHOUT HYPERIMMUNE BRANCHES
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-032-31348-5_36openalex-snapshot
The More Gödels, the Better
inferred← citeshttps://doi.org/10.1007/978-3-319-23660-5_1openalex-snapshot
Degrees of Transducibility
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_13openalex-snapshot
Weakly Represented Families in Reverse Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_42openalex-snapshot
Lowness, Randomness, and Computable Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_33openalex-snapshot
Exact Pair Theorem for the ω-Enumeration Degrees
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_3openalex-snapshot
Structures of Some Strong Reducibilities
inferred← citeshttps://doi.org/10.1007/bf01342939openalex-snapshot
Computing degrees of unsolvability
inferred← citeshttps://doi.org/10.1007/bf01759368openalex-snapshot
Quasi-minimal enumeration degrees and minimal Turing degrees
inferred← citeshttps://doi.org/10.1007/bf01987834openalex-snapshot
Untersuchungen über die Struktur des Kleene-Postschen Halbverbandes der Grade der Rekursiven Unlösbarkeit
inferred← citeshttps://doi.org/10.1007/bf02127802openalex-snapshot
Definability, decidability, complexity
inferred← citeshttps://doi.org/10.1007/bf02761906openalex-snapshot
Automorphism bases for degrees of unsolvability
inferred← citeshttps://doi.org/10.1007/bf02772668openalex-snapshot
Initial segments of the degrees of size ℵ1
inferred← citeshttps://doi.org/10.1007/bf02785966openalex-snapshot
There exists a maximal 3-C.E. enumeration degree
inferred← citeshttps://doi.org/10.1007/bfb0076226openalex-snapshot
Generic objects in recursion theory
inferred← citeshttps://doi.org/10.1007/bfb0076230openalex-snapshot
Recursion theoretic aspects of the dual ramsey theorem
inferred← citeshttps://doi.org/10.1007/bfb0083669openalex-snapshot
The continuum hypothesis and the theory of the Kleene degrees
inferred← citeshttps://doi.org/10.1007/bfb0086114openalex-snapshot
Enumeration reducibility, nondeterministic computations and relative computability of partial functions
inferred← citeshttps://doi.org/10.1007/bfb0086118openalex-snapshot
A direct construction of a minimal recursively enumerable truth-table degree
inferred← citeshttps://doi.org/10.1007/bfb0090953openalex-snapshot
The degrees of unsolvability: Global results
inferred← citeshttps://doi.org/10.1007/s001530050063openalex-snapshot
Conjectures and questions from Gerald Sacks's Degrees of Unsolvability
inferred← citeshttps://doi.org/10.1007/s001530100078openalex-snapshot
Density results in the Δ 2 0 e-degrees
inferred← citeshttps://doi.org/10.1007/s00236-019-00353-7openalex-snapshot
Transducer degrees: atoms, infima and suprema
inferred← citeshttps://doi.org/10.1007/s10469-020-09605-9openalex-snapshot
Minimal Predicates for Δ-Definability
inferred← citeshttps://doi.org/10.1007/s11856-010-0064-3openalex-snapshot
The theory of the α degrees is undecidable
inferred← citeshttps://doi.org/10.1007/s11856-016-1420-8openalex-snapshot
Genericity for Mathias forcing over general Turing ideals
inferred← citeshttps://doi.org/10.1016/0001-8708(76)90187-0openalex-snapshot
Countable admissible ordinals and hyperdegrees
inferred← citeshttps://doi.org/10.1016/0001-8708(80)90027-4openalex-snapshot
Not every finite lattice is embeddable in the recursively enumerable degrees
inferred← citeshttps://doi.org/10.1016/0003-4843(71)90003-9openalex-snapshot
Enumeration reducibility and partial degrees
inferred← citeshttps://doi.org/10.1016/0003-4843(72)90011-3openalex-snapshot
Degrees of unsolvability complementary between recursively enumerable degrees, Part 1
inferred← citeshttps://doi.org/10.1016/0003-4843(76)90023-1openalex-snapshot
A degree-theoretic definition of the ramified analytical hierarchy
inferred← citeshttps://doi.org/10.1016/0003-4843(80)90004-2openalex-snapshot
Reducibility orderings: Theories, definability and automorphisms
inferred← citeshttps://doi.org/10.1016/0022-0000(89)90023-8openalex-snapshot
Honest polynomial time reducibilities and the P=?NP problem
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90024-fopenalex-snapshot
On the theory of the PTIME degrees of the recursive sets
inferred← citeshttps://doi.org/10.1016/0165-4896(88)90002-9openalex-snapshot
Lower bounds on degrees of game-theoretic structures
inferred← citeshttps://doi.org/10.1016/0168-0072(85)90001-6openalex-snapshot
Upper bounds for the arithmetical degrees
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90096-vopenalex-snapshot
Generic degrees are complemented
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90220-8openalex-snapshot
Lattice nonembeddings and intervals of the recursively enumerable degrees
inferred← citeshttps://doi.org/10.1016/0168-0072(94)90027-2openalex-snapshot
The structure of the honest polynomial m-degrees
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90036-3openalex-snapshot
Honest polynomial degrees and P=? NP
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90078-topenalex-snapshot
The p-T-degrees of the recursive sets: lattice embeddings, extensions of embeddings and the two-quantifier theory
inferred← citeshttps://doi.org/10.1016/b978-0-444-51621-3.50003-7openalex-snapshot
Infinite Combinatorics
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.2004.04.010openalex-snapshot
The minimal e-degree problem in fragments of Peano arithmetic
inferred← citeshttps://doi.org/10.1016/j.apal.2011.06.012openalex-snapshot
Empty intervals in the enumeration degrees
inferred← citeshttps://doi.org/10.1016/j.apal.2011.12.020openalex-snapshot
Closed choice and a Uniform Low Basis Theorem
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115324openalex-snapshot
A discrete linear order with non-dense punctual degrees
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70601-3openalex-snapshot
An Uncritical Bibliography of Papers on Generalized Recursion Theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70931-5openalex-snapshot
The intrinsic recursion theory on the countable or continuous functionals
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71117-0openalex-snapshot
Degrees of Unsolvability: A Survey of Results
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71223-0openalex-snapshot
Recursion Theoretic Structure for Relational Systems
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71230-8openalex-snapshot
Some Reasons for Generalizing Recursion Theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71260-6openalex-snapshot
Second order logic and first order theories of reducibility orderings*
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71511-8openalex-snapshot
Recursively Enumerable Degrees and the Degrees Less Than 0(1)
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71931-1openalex-snapshot
Initial Segments of the Degrees of Unsolvability Part I: A Survey
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70458-6openalex-snapshot
Thirty Years of Foundational Studies Lectures on the Development of Mathematical Logic and the Study of the Foundations of Mathematics in 1930–1964
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.1016/s0049-237x(99)80021-4openalex-snapshot
The Global Structure of the Turing Degrees
inferred← citeshttps://doi.org/10.1016/s0168-0072(96)00029-2openalex-snapshot
Π10 classes and minimal degrees
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00096-1openalex-snapshot
The turing closure of an archimedean field
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00018-xopenalex-snapshot
An oracle builder’s toolkit
inferred← citeshttps://doi.org/10.1017/9781316718254.005openalex-snapshot
Definability and global degree theory
inferred← citeshttps://doi.org/10.1017/9781316755785.017openalex-snapshot
The theory of is undecidable
inferred← citeshttps://doi.org/10.1017/cbo9780511605321.011openalex-snapshot
Strong minimal covers and a question of Yates: The story so far
inferred← citeshttps://doi.org/10.1017/cbo9780511605321.012openalex-snapshot
Embeddings into the Turing degrees
inferred← citeshttps://doi.org/10.1017/cbo9781107338579.005openalex-snapshot
Computability theory, algorithmic randomness and Turing's anticipation
inferred← citeshttps://doi.org/10.1017/cbo9781139519694.011openalex-snapshot
Recursion theoretic papers. Introduction to Part VI
inferred← citeshttps://doi.org/10.1017/jsl.2014.37openalex-snapshot
EXACT PAIRS FOR THE IDEAL OF THEK-TRIVIAL SEQUENCES IN THE TURING DEGREES
inferred← citeshttps://doi.org/10.1017/jsl.2018.68openalex-snapshot
A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE
inferred← citeshttps://doi.org/10.1017/s0027763000019061openalex-snapshot
On the upper semi-lattice of -degrees
inferred← citeshttps://doi.org/10.1017/s0305004100067694openalex-snapshot
Degrees bounding minimal degrees
inferred← citeshttps://doi.org/10.1017/s0960129506005603openalex-snapshot
Restricted jump interpolation in the d.c.e. degrees
inferred← citeshttps://doi.org/10.1017/s1755020321000307openalex-snapshot
HIERARCHICAL INCOMPLETENESS RESULTS FOR ARITHMETICALLY DEFINABLE EXTENSIONS OF FRAGMENTS OF ARITHMETIC
inferred← citeshttps://doi.org/10.1023/a:1005298819345openalex-snapshot
Algorithmic Information Theory and Undecidability
inferred← citeshttps://doi.org/10.1023/a:1021400820931openalex-snapshot
Embedding of Countable Orders in Turing Degrees
inferred← citeshttps://doi.org/10.1080/01445340.2015.1028146openalex-snapshot
Satisfying Predicates: Kleene's Proof of the Hilbert–Bernays Theorem
inferred← citeshttps://doi.org/10.1090/conm/257/04040openalex-snapshot
Natural definability in degree structures
inferred← citeshttps://doi.org/10.1090/memo/1284openalex-snapshot
Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees
inferred← citeshttps://doi.org/10.1090/s0002-9904-1955-09896-3openalex-snapshot
Hierarchies of number-theoretic predicates
inferred← citeshttps://doi.org/10.1090/s0002-9904-1961-10652-6openalex-snapshot
A minimal degree less than 0’
inferred← citeshttps://doi.org/10.1090/s0002-9904-1975-13876-6openalex-snapshot
The decision problem for recursively enumerable degrees
inferred← citeshttps://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferred← citeshttps://doi.org/10.1090/s0002-9939-1970-0265154-xopenalex-snapshot
Minimal Covers and Arithmetical Sets
inferred← citeshttps://doi.org/10.1090/s0002-9939-1973-0311467-5openalex-snapshot
A minimal partial degree ≤𝑂^{’}
inferred← citeshttps://doi.org/10.1090/s0002-9939-2012-11183-9openalex-snapshot
Measure and cupping in the Turing degrees
inferred← citeshttps://doi.org/10.1090/s0002-9947-03-03406-8openalex-snapshot
The ∀∃-theory of ℛ(≤,∨,∧) is undecidable
inferred← citeshttps://doi.org/10.1090/s0002-9947-07-04331-0openalex-snapshot
A single minimal complement for the c.e. degrees
inferred← citeshttps://doi.org/10.1090/s0002-9947-1955-0070594-4openalex-snapshot
Arithmetical Predicates and Function Quantifiers
inferred← citeshttps://doi.org/10.1090/s0002-9947-1959-0102480-9openalex-snapshot
Recursive functionals and quantifiers of finite types. I
inferred← citeshttps://doi.org/10.1090/s0002-9947-1963-0153557-4openalex-snapshot
Recursive Functionals and Quantifiers of Finite Types II
inferred← citeshttps://doi.org/10.1090/s0002-9947-1963-0155747-3openalex-snapshot
Recursive enumerability and the jump operator
inferred← citeshttps://doi.org/10.1090/s0002-9947-1964-0159755-9openalex-snapshot
Hierarchies in Recursive Function Theory
inferred← citeshttps://doi.org/10.1090/s0002-9947-1975-0392534-3openalex-snapshot
Minimal Covers and Hyperdegrees
inferred← citeshttps://doi.org/10.1090/s0002-9947-1979-0539912-0openalex-snapshot
Generic sets and minimal 𝛼-degrees
inferred← citeshttps://doi.org/10.1109/mahc.1981.10004openalex-snapshot
Origins of Recursive Function Theory
inferred← citeshttps://doi.org/10.1109/sct.1989.41804openalex-snapshot
The P-T-degrees of the recursive sets: lattice embeddings, extensions of embeddings and the two quantifier theory
inferred← citeshttps://doi.org/10.1109/sct.1989.41825openalex-snapshot
On honest polynomial reductions, relativizations, and P=NP
inferred← citeshttps://doi.org/10.1109/sfcs.1979.33openalex-snapshot
Origins of recursive function theory
inferred← citeshttps://doi.org/10.1109/sfcs.1984.715928openalex-snapshot
Minimal Degrees For Honest Polynomial Reducibilities
inferred← citeshttps://doi.org/10.1112/jlms/jdp049openalex-snapshot
A fixed-point-free minimal degree
inferred← citeshttps://doi.org/10.1112/jlms/s2-24.1.1openalex-snapshot
The Theory of the Degrees below 0 ′
inferred← citeshttps://doi.org/10.1142/9789812794055_0002openalex-snapshot
GLOBAL PROPERTIES OF THE TURING DEGREES AND THE TURING JUMP
inferred← citeshttps://doi.org/10.1142/9789814678001_0012openalex-snapshot
Large Cardinals and Higher Degree Theory
inferred← citeshttps://doi.org/10.1142/s0219061316500021openalex-snapshot
On notions of computability-theoretic reduction between Π21 principles
inferred← citeshttps://doi.org/10.1142/s0219061323500058openalex-snapshot
Coarse computability, the density metric, Hausdorff distances between Turing degrees, perfect trees, and reverse mathematics
inferred← citeshttps://doi.org/10.1145/23005.23009openalex-snapshot
Minimal degrees for polynomial reducibilities
inferred← citeshttps://doi.org/10.1215/00294527-3328401openalex-snapshot
Controlling Effective Packing Dimension of Δ20 Degrees
inferred← citeshttps://doi.org/10.1305/ndjfl/1179323263openalex-snapshot
On the Symmetric Enumeration Degrees
inferred← citeshttps://doi.org/10.18255/1818-1015-2012-4-59-66openalex-snapshot
Countable Ideals in a Semi-Lattice of the De Enumeration Degrees
inferred← citeshttps://doi.org/10.2140/pjm.1961.11.1479openalex-snapshot
Category methods in recursion theory
inferred← citeshttps://doi.org/10.2140/pjm.1984.115.409openalex-snapshot
Density of a final segment of the truth-table degrees
inferred← citeshttps://doi.org/10.2178/bsl/1046288724openalex-snapshot
Local Initial Segments of The Turing Degrees
inferred← citeshttps://doi.org/10.2178/bsl/1154698739openalex-snapshot
Degree Structures: Local and Global Investigations
inferred← citeshttps://doi.org/10.2178/jsl.7803180openalex-snapshot
Low Level Nondelegability Results: Domination and Recursive Enumeration
inferred← citeshttps://doi.org/10.2178/jsl/1045861506openalex-snapshot
On a problem of Cooper and Epstein
inferred← citeshttps://doi.org/10.2178/jsl/1052669063openalex-snapshot
Decomposition and infima in the computably enumerable degrees
inferred← citeshttps://doi.org/10.2178/jsl/1082418543openalex-snapshot
Degrees of unsolvability of continuous functions
inferred← citeshttps://doi.org/10.2178/jsl/1102022208openalex-snapshot
Minimal complements for degrees below 0′
inferred← citeshttps://doi.org/10.2178/jsl/1183743753openalex-snapshot
Relative Recursive Enumerability of Generic Degrees
inferred← citeshttps://doi.org/10.2178/jsl/1264433911openalex-snapshot
Lattice initial segments of the hyperdegrees
inferred← citeshttps://doi.org/10.2307/1970776openalex-snapshot
Interpolation and Embedding in the Recursively Enumerable Degrees
inferred← citeshttps://doi.org/10.2307/1970779openalex-snapshot
Initial Segments of the Degrees of Unsolvability
inferred← citeshttps://doi.org/10.2307/1971028openalex-snapshot
First-Order Theory of the Degrees of Recursive Unsolvability
inferred← citeshttps://doi.org/10.2307/2270264openalex-snapshot
Some contrasts between degrees and the arithmetical hierarchy
inferred← citeshttps://doi.org/10.2307/2270517openalex-snapshot
Initial segments of the degrees of unsolvability Part II: minimal degrees
inferred← citeshttps://doi.org/10.2307/2270584openalex-snapshot
On the notational independence of various hierarchies of degrees of unsolvability
inferred← citeshttps://doi.org/10.2307/2270699openalex-snapshot
A note on the hyperarithmetical hierarchy
inferred← citeshttps://doi.org/10.2307/2270984openalex-snapshot
Some nondistributive lattices as initial segments of the degrees of unsolvability
inferred← citeshttps://doi.org/10.2307/2271724openalex-snapshot
Minimal α-recursion theoretic degrees
inferred← citeshttps://doi.org/10.2307/2272061openalex-snapshot
Minimal degrees and the jump operator
inferred← citeshttps://doi.org/10.2307/2272064openalex-snapshot
An application of Σ40 determinacy to the degrees of unsolvability
inferred← citeshttps://doi.org/10.2307/2272637openalex-snapshot
Systems of notations and the ramified analytical hierarchy
inferred← citeshttps://doi.org/10.2307/2272899openalex-snapshot
A minimal degree not realizing least possible jump
inferred← citeshttps://doi.org/10.2307/2273985openalex-snapshot
On minimal pairs of enumeration degrees
inferred← citeshttps://doi.org/10.2307/2274335openalex-snapshot
Jumps of quasi-minimal enumeration degrees
inferred← citeshttps://doi.org/10.2307/2274468openalex-snapshot
Undecidability and initial segments of the (r.e.) tt-degrees
inferred← citeshttps://doi.org/10.2307/2275022openalex-snapshot
Complementation in the Turing degrees
inferred← citeshttps://doi.org/10.2307/2275334openalex-snapshot
Every n-generic degree is a minimal cover of an n-generic degree
inferred← citeshttps://doi.org/10.2307/2586653openalex-snapshot
Bounding minimal degrees by computably enumerable degrees
inferred← citeshttps://doi.org/10.2307/2586706openalex-snapshot
A 1-generic degree with a strong minimal cover
inferred← citeshttps://doi.org/10.2307/2694910openalex-snapshot
On the strength of Ramsey's theorem for pairs
inferred← citeshttps://doi.org/10.2307/2695042openalex-snapshot
On the structures inside truth-table degrees
inferred← citeshttps://doi.org/10.2307/2964288openalex-snapshot
Measure-theoretic construction of incomparable hyperdegrees
inferred← citeshttps://doi.org/10.2307/421070openalex-snapshot
2000 Annual Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.23638/lmcs-14(3:13)2018openalex-snapshot
A Galois connection between Turing jumps and limits
inferred← citeshttps://doi.org/10.26686/wgtn.17005114.v1openalex-snapshot
Matroids, Complexity and Computation
inferred← citeshttps://doi.org/10.3233/com-170068openalex-snapshot
The search for natural definability in the Turing degrees
inferred← citeshttps://doi.org/10.3233/com-210308openalex-snapshot
The Σ2 theory of Dh(⩽hO) as an uppersemilattice with least and greatest element is decidable
inferred← citeshttps://doi.org/10.4213/mzm456openalex-snapshot
О вложении счетных порядков в тьюринговые степени
inferred← citeshttps://doi.org/10.4310/mrl.2015.v22.n3.a5openalex-snapshot
Density, forcing, and the covering problem
inferred← citeshttps://doi.org/10.48550/arxiv.0801.0350openalex-snapshot
Refinment of the "up to a constant" ordering using contructive co-immunity and alike. Application to the Min/Max hierarchy of Kolmogorov complexities
inferred← citeshttps://doi.org/10.48550/arxiv.1409.1030openalex-snapshot
On effective undecidability and Post's problem
inferred← citeshttps://doi.org/10.48550/arxiv.1505.02226openalex-snapshot
Generics for Mathias forcing over general Turing ideals
inferred← citeshttps://doi.org/10.48550/arxiv.1804.09526openalex-snapshot
The Structure of Models of Second-order Set Theories
inferred← citeshttps://doi.org/10.5281/zenodo.188226openalex-snapshot
FIGURES 71–78 in A taxonomic study of the Indian species of Euops Schoenherr (Coleoptera: Curculionoidea: Attelabidae)
inferred← citeshttps://doi.org/10.82308/1688openalex-snapshot
Post's problem : priority method solution
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.