On the public citation graph
Recursive well-orderings
0 signed · 200 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/bf01361115openalex-snapshot
Zur Theorie der konstruktiven Wohlordnungen
inferredcites →https://doi.org/10.1016/0016-0032(86)90212-7openalex-snapshot
American journal of mathematics
inferredcites →https://doi.org/10.1016/s0049-237x(09)70461-6openalex-snapshot
On definable sets of positive integers )
inferredcites →https://doi.org/10.1090/bullopenalex-snapshot
Bulletin of the American Mathematical Society
inferredcites →https://doi.org/10.1090/s0002-9904-1944-08111-1openalex-snapshot
Recursively enumerable sets of positive integers and their decision problems
inferredcites →https://doi.org/10.1090/s0002-9947-1943-0007371-8openalex-snapshot
Recursive Predicates and Quantifiers
inferredcites →https://doi.org/10.1090/tranopenalex-snapshot
Transactions of the American Mathematical Society
inferredcites →https://doi.org/10.2307/1969708openalex-snapshot
The Upper Semi-Lattice of Degrees of Recursive Unsolvability
inferredcites →https://doi.org/10.2307/2266626openalex-snapshot
Andrzej Mostowski. A classification of logical systems. Studia philosophica (Poznań), vol. 4 (for 1949–50, pub. 1951), pp. 237–274.
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-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.19590051403openalex-snapshot
Ordinal Numbers and Predicative Set Theory
inferred← citeshttps://doi.org/10.1002/malq.19670131302openalex-snapshot
Arithmetical Sets and Retracing Functions
inferred← citeshttps://doi.org/10.1002/malq.19690152004openalex-snapshot
Some applications of forcing to hierarchy problems in arithmetic
inferred← citeshttps://doi.org/10.1002/malq.19700160205openalex-snapshot
The Hyperprojective Hierarchy
inferred← citeshttps://doi.org/10.1002/malq.19710170144openalex-snapshot
An Extension of the Hyperprojective Hierarchy
inferred← citeshttps://doi.org/10.1002/malq.19720180403openalex-snapshot
Some Properties of the Extended Hyperprojective Hierarchy
inferred← citeshttps://doi.org/10.1002/malq.201600094openalex-snapshot
A recursion theoretic characterization of the Topological Vaught Conjecture in the Zermelo‐Fraenkel set theory
inferred← citeshttps://doi.org/10.1006/inco.1996.0068openalex-snapshot
Self-Monitoring Machines and anωωHierarchy of Loops
inferred← citeshttps://doi.org/10.1007/11780342_58openalex-snapshot
Non-deterministic Halting Times for Hamkins-Kidder Turing Machines
inferred← citeshttps://doi.org/10.1007/978-0-387-69245-6_3openalex-snapshot
Computability and Computable Models
inferred← citeshttps://doi.org/10.1007/978-1-4612-2822-6_18openalex-snapshot
Finite and Infinite Dialogues
inferred← citeshttps://doi.org/10.1007/978-3-032-31348-5_14openalex-snapshot
Free Sets, Thin Sets and Rainbows for Barriers
inferred← citeshttps://doi.org/10.1007/978-3-319-63334-3_15openalex-snapshot
Predicativity and Feferman
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-3-642-11072-6_4openalex-snapshot
Priority Arguments in Higher Recursion Theory
inferred← citeshttps://doi.org/10.1007/978-3-662-12898-5openalex-snapshot
Recursion-Theoretic Hierarchies
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/bf02007560openalex-snapshot
Optimal bounds for ordinal comparison maps
inferred← citeshttps://doi.org/10.1007/bf02218636openalex-snapshot
On a class of recursive hierarchies
inferred← citeshttps://doi.org/10.1007/bf02219828openalex-snapshot
A variation of Richter's construction of ordinals
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-00934-5openalex-snapshot
On categoricity of scattered linear orders of constructive ranks
inferred← citeshttps://doi.org/10.1007/s10992-018-9486-xopenalex-snapshot
Ungroundedness in Tarskian Languages
inferred← citeshttps://doi.org/10.1007/s10992-026-09839-5openalex-snapshot
On the Methodology of Informal Rigour: Set Theory, Semantics, and Intuitionism
inferred← citeshttps://doi.org/10.1007/s11083-007-9058-0openalex-snapshot
Computable Linearizations of Well-partial-orderings
inferred← citeshttps://doi.org/10.1007/s11098-019-01303-2openalex-snapshot
A note on Dasgupta’s Generalism
inferred← citeshttps://doi.org/10.1016/0001-8708(71)90042-9openalex-snapshot
On the reducibility of ⊓11 sets
inferred← citeshttps://doi.org/10.1016/0001-8708(80)90057-2openalex-snapshot
Inductive definability: Measure and category
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/0003-4843(76)90023-1openalex-snapshot
A degree-theoretic definition of the ramified analytical hierarchy
inferred← citeshttps://doi.org/10.1016/0003-4843(78)90001-3openalex-snapshot
Recursive well-founded orderings
inferred← citeshttps://doi.org/10.1016/0003-4843(79)90025-1openalex-snapshot
The next admissible ordinal
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/0168-0072(91)90038-nopenalex-snapshot
Degrees of orderings not isomorphic to recursive linear orderings
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.aim.2012.11.012openalex-snapshot
A computability theoretic equivalent to Vaught’s conjecture
inferred← citeshttps://doi.org/10.1016/j.apal.2018.06.001openalex-snapshot
The Dyck and the Preiss separation uniformly
inferred← citeshttps://doi.org/10.1016/j.apal.2021.103060openalex-snapshot
On bi-embeddable categoricity of algebraic structures
inferred← citeshttps://doi.org/10.1016/j.apal.2025.103644openalex-snapshot
Countable ordered groups and Weihrauch reducibility
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70582-2openalex-snapshot
The 1-Section of a Type n Object
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70590-1openalex-snapshot
Ordinal Recursion and Inductive Definitions
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)71147-9openalex-snapshot
References and Index to References
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)71231-xopenalex-snapshot
Axioms for Computation Theories-First Draft
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71261-8openalex-snapshot
Post's Problem, Absoluteness and Recursion in Finite Types
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71263-1openalex-snapshot
The Hierarchy Based on the Jump Operator*
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71365-xopenalex-snapshot
A Finite Combinatorial Principle Which is Equivalent to the 1-Consistency of Predicative Analysis
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71865-2openalex-snapshot
Chapter XXV Ordinal Numbers and Predicative Set Theory
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)70158-2openalex-snapshot
Friedman's Research on Subsystems of Second Order Arithmetic
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70436-7openalex-snapshot
Between Recursion Theory and set Theory
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(98)80001-3openalex-snapshot
Introduction to the handbook of Recursive Mathematics
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/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.1017/bsl.2017.41openalex-snapshot
A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES
inferred← citeshttps://doi.org/10.1017/bsl.2024.23openalex-snapshot
ITERATED PRIORITY ARGUMENTS IN DESCRIPTIVE SET THEORY
inferred← citeshttps://doi.org/10.1017/cbo9781107338579.012openalex-snapshot
Higher generalizations of the Turing Model
inferred← citeshttps://doi.org/10.1017/cbo9781139028592.003openalex-snapshot
Some results on ℝ-computable structures
inferred← citeshttps://doi.org/10.1017/fms.2015.5openalex-snapshot
ANALYTIC EQUIVALENCE RELATIONS SATISFYING HYPERARITHMETIC-IS-RECURSIVE
inferred← citeshttps://doi.org/10.1017/jsl.2019.26openalex-snapshot
AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
inferred← citeshttps://doi.org/10.1017/jsl.2021.50openalex-snapshot
ORDINAL ANALYSIS OF PARTIAL COMBINATORY ALGEBRAS
inferred← citeshttps://doi.org/10.1017/s0027763000013581openalex-snapshot
On a Π01 Set of Positive Measure
inferred← citeshttps://doi.org/10.1017/s096012951300025xopenalex-snapshot
Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization
inferred← citeshttps://doi.org/10.1090/memo/1135openalex-snapshot
Classes of Polish spaces under effective Borel isomorphism
inferred← citeshttps://doi.org/10.1090/proc/13218openalex-snapshot
Degree-invariant, analytic equivalence relations without perfectly many classes
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-1960-10518-6openalex-snapshot
On a problem of Kleene’s
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-9904-1966-11416-7openalex-snapshot
Metarecursively enumerable sets and admissible ordinals
inferred← citeshttps://doi.org/10.1090/s0002-9939-1957-0091243-2openalex-snapshot
A Note on Function Quantification
inferred← citeshttps://doi.org/10.1090/s0002-9939-1959-0111685-8openalex-snapshot
Recursive Functions Over Well Ordered Partial Orderings
inferred← citeshttps://doi.org/10.1090/s0002-9939-1983-0684647-3openalex-snapshot
On the First Order Theory of the Arithmetical Degrees
inferred← citeshttps://doi.org/10.1090/s0002-9947-07-04285-7openalex-snapshot
Ranked structures and arithmetic transfinite recursion
inferred← citeshttps://doi.org/10.1090/s0002-9947-09-04783-7openalex-snapshot
A Π¹₁-uniformization principle for reals
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-1961-0151396-xopenalex-snapshot
Constructive Versions of Ordinal Number Classes
inferred← citeshttps://doi.org/10.1090/s0002-9947-1962-0142453-3openalex-snapshot
Classifications of Recursive Functions by Means of Hierarchies
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-1964-0159755-9openalex-snapshot
Hierarchies in Recursive Function Theory
inferred← citeshttps://doi.org/10.1090/s0002-9947-1965-0184852-2openalex-snapshot
On Minimal and Almost-Minimal Systems of Notations
inferred← citeshttps://doi.org/10.1090/s0002-9947-1966-0201299-1openalex-snapshot
Post’s problem, admissible ordinals, and regularity
inferred← citeshttps://doi.org/10.1090/s0002-9947-1967-0211873-5openalex-snapshot
A nonconstructible Δ₃¹ set of integers
inferred← citeshttps://doi.org/10.1090/s0002-9947-1967-0219421-0openalex-snapshot
The Forcing Method and the Upper Semilattice of Hyperdegrees
inferred← citeshttps://doi.org/10.1090/s0002-9947-1968-0244049-7openalex-snapshot
Recursive Pseudo-Well-Orderings
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.1090/s0002-9947-1969-0242673-xopenalex-snapshot
A Recursion-Theoretic Characterization of the Ramified Analytical Hierarchy
inferred← citeshttps://doi.org/10.1090/s0002-9947-1969-0244045-0openalex-snapshot
Abstract first order computability. I, II
inferred← citeshttps://doi.org/10.1090/s0002-9947-1969-0253895-6openalex-snapshot
Measure-theoretic uniformity in recursion theory and set theory
inferred← citeshttps://doi.org/10.1090/s0002-9947-1974-0349367-2openalex-snapshot
Many-one reducibility within the Turing degrees of the hyperarithmetic sets 𝐻ₐ(𝑥)
inferred← citeshttps://doi.org/10.1090/s0002-9947-1975-0392534-3openalex-snapshot
Minimal Covers and Hyperdegrees
inferred← citeshttps://doi.org/10.1090/s0002-9947-2012-05416-xopenalex-snapshot
Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem
inferred← citeshttps://doi.org/10.1093/oxfordhb/9780195325928.003.0019openalex-snapshot
Predicativity
inferred← citeshttps://doi.org/10.1109/ccc.1997.612305openalex-snapshot
Hyper-polynomial hierarchies and the NP-jump
inferred← citeshttps://doi.org/10.1109/mahc.1981.10004openalex-snapshot
Origins of Recursive Function Theory
inferred← citeshttps://doi.org/10.1109/sfcs.1979.33openalex-snapshot
Origins of recursive function theory
inferred← citeshttps://doi.org/10.1111/j.1755-2567.1966.tb00598.xopenalex-snapshot
On characterizability in Lω1ω0
inferred← citeshttps://doi.org/10.1112/jlms.12707openalex-snapshot
The $\Pi^1_2$ Consequences of a Theory
inferred← citeshttps://doi.org/10.1134/s1995080214040192openalex-snapshot
Using computability to measure complexity of algebraic structures and classes of structures
inferred← citeshttps://doi.org/10.1142/9789814678001_0012openalex-snapshot
Large Cardinals and Higher Degree Theory
inferred← citeshttps://doi.org/10.1142/s0219061306000517openalex-snapshot
INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
inferred← citeshttps://doi.org/10.1142/s021906132050021xopenalex-snapshot
Turing degrees in Polish spaces and decomposability of Borel functions
inferred← citeshttps://doi.org/10.1142/s0219061321500136openalex-snapshot
The weakness of the pigeonhole principle under hyperarithmetical reductions
inferred← citeshttps://doi.org/10.1142/s0219061324500156openalex-snapshot
Martin’s conjecture for regressive functions on the hyperarithmetic degrees
inferred← citeshttps://doi.org/10.1145/1656242.1656246openalex-snapshot
Weyl's predicative classical mathematics as a logic-enriched type theory
inferred← citeshttps://doi.org/10.1177/22113568251406822openalex-snapshot
On ordinals realized by c.e. equivalence relations
inferred← citeshttps://doi.org/10.1215/00294527-2018-0020openalex-snapshot
Π10-Encodability and Omniscient Reductions
inferred← citeshttps://doi.org/10.1215/00294527-2022-0012openalex-snapshot
Decision Times of Infinite Computations
inferred← citeshttps://doi.org/10.1305/ndjfl/1093888204openalex-snapshot
Isomorphism types of the hyperarithmetic sets ${\bf H}_a$.
inferred← citeshttps://doi.org/10.1305/ndjfl/1093893720openalex-snapshot
A semi-completeness theorem.
inferred← citeshttps://doi.org/10.1305/ndjfl/1093894157openalex-snapshot
Generalized ordinal notation.
inferred← citeshttps://doi.org/10.1305/ndjfl/1093957229openalex-snapshot
Recursive linear orderings and hyperarithmetical functions.
inferred← citeshttps://doi.org/10.2140/pjm.1966.18.329openalex-snapshot
Many-one degrees of the predicatesHa(x)
inferred← citeshttps://doi.org/10.2178/bsl/1174668219openalex-snapshot
On the Equimorphism Types of Linear Orderings
inferred← citeshttps://doi.org/10.2178/bsl/1286889124openalex-snapshot
Kleene's Amazing Second Recursion Theorem
inferred← citeshttps://doi.org/10.2178/jsl/1082418544openalex-snapshot
Π11 relations and paths through
inferred← citeshttps://doi.org/10.2178/jsl/1120224717openalex-snapshot
Up to equimorphism, hyperarithmetic is recursive
inferred← citeshttps://doi.org/10.2307/1995364openalex-snapshot
Measure-Theoretic Uniformity in Recursion Theory and Set Theory
inferred← citeshttps://doi.org/10.2307/2269866openalex-snapshot
Systems of predicative analysis, II: Representations of ordinals
inferred← citeshttps://doi.org/10.2307/2270051openalex-snapshot
Constructively accessible ordinal numbers
inferred← citeshttps://doi.org/10.2307/2270134openalex-snapshot
Extensions of the constructive ordinals
inferred← citeshttps://doi.org/10.2307/2270372openalex-snapshot
Hierarchies over recursive well-orderings
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/2270854openalex-snapshot
Abstract Computability and Invariant Definability
inferred← citeshttps://doi.org/10.2307/2271094openalex-snapshot
Π11 Sets, ω-Sets, and metacompleteness
inferred← citeshttps://doi.org/10.2307/2271956openalex-snapshot
Sets which do not have subsets of every higher degree
inferred← citeshttps://doi.org/10.2307/2272637openalex-snapshot
Systems of notations and the ramified analytical hierarchy
inferred← citeshttps://doi.org/10.2307/2273465openalex-snapshot
Forcing and reductibilities. II. Forcing in fragments of analysis
inferred← citeshttps://doi.org/10.2307/2964288openalex-snapshot
Measure-theoretic construction of incomparable hyperdegrees
inferred← citeshttps://doi.org/10.2307/2964544openalex-snapshot
Incompleteness along paths in progressions of theories
inferred← citeshttps://doi.org/10.2307/2964572openalex-snapshot
Constructive definition of certain analytic sets of numbers
inferred← citeshttps://doi.org/10.2307/2964649openalex-snapshot
Transfinite recursive progressions of axiomatic theories
inferred← citeshttps://doi.org/10.26686/wgtn.25573695openalex-snapshot
On the Definability and Complexity of Sets and Structures
inferred← citeshttps://doi.org/10.2969/jmsj/01220119openalex-snapshot
On the recursive functions of ordinal numbers.
inferred← citeshttps://doi.org/10.2969/jmsj/01420199openalex-snapshot
On hierarchies of predicates of ordinal numbers
inferred← citeshttps://doi.org/10.2969/jmsj/02540609openalex-snapshot
Π11 sets of sets, hyperdegrees and related problems
inferred← citeshttps://doi.org/10.2977/prims/1195195654openalex-snapshot
Some results in the effective descriptive set theory
inferred← citeshttps://doi.org/10.3792/pja/1195524146openalex-snapshot
On predicates expressible in the $1$-function quantifier forms in Kleene Hierarchy with free variables of type $2$
inferred← citeshttps://doi.org/10.4099/jjm1924.28.0_1openalex-snapshot
Sur les Ensembles Nommables et le Fondement de l' Analyse Mathématique, I
inferred← citeshttps://doi.org/10.4213/im9480openalex-snapshot
Алгоритмическая сложность теорий коммутативных алгебр Клини
inferred← citeshttps://doi.org/10.4213/im9480eopenalex-snapshot
Algorithmic complexity for theories of commutative Kleene algebras
inferred← citeshttps://doi.org/10.4213/rm10268openalex-snapshot
Алгоритмическая сложность теорий с итерацией Клини
inferred← citeshttps://doi.org/10.4213/rm10268eopenalex-snapshot
Algorithmic complexity of theories with Kleene iteration
inferred← citeshttps://doi.org/10.4288/jafpos1956.3.231openalex-snapshot
Notes on Measure and Category in Recursion Theory
inferred← citeshttps://doi.org/10.48550/arxiv.0803.3404openalex-snapshot
Some results on $\mathbb{R}$-computable structures
inferred← citeshttps://doi.org/10.48550/arxiv.1206.5682openalex-snapshot
A computability theoretic equivalent to Vaught's conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.1501.00386openalex-snapshot
Computability on the space of countable ordinals
inferred← citeshttps://doi.org/10.48550/arxiv.1610.04852openalex-snapshot
One more recursive-theoretic characterization of the Topological Vaught Conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.1701.03735openalex-snapshot
Classes of Polish spaces under effective Borel isomorphism
inferred← citeshttps://doi.org/10.48550/arxiv.1703.06480openalex-snapshot
The Dyck and the Preiss separation uniformly
inferred← citeshttps://doi.org/10.48550/arxiv.2001.08017openalex-snapshot
Comparing the isomorphism types of equivalence structures and preorders
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.