On the public citation graph
The quantity of nonautoequivalent constructivizations
0 signed · 58 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/bf00967504openalex-snapshot
Some properties of the constructivization of Boolean algebras
inferredcites →https://doi.org/10.1007/bf01668470openalex-snapshot
Autostability and computable families of constructivizations
inferredcites →https://doi.org/10.1007/bf01877237openalex-snapshot
Enumerations of families of general recursive functions
inferredcites →https://doi.org/10.1070/rm1961v016n03abeh001120openalex-snapshot
CONSTRUCTIVE ALGEBRAS I
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.19860322514openalex-snapshot
Relations Intrinsically Recursive in Linear Orders
inferred← citeshttps://doi.org/10.1002/malq.202100016openalex-snapshot
On the effective universality of mereological theories
inferred← citeshttps://doi.org/10.1007/11494645_58openalex-snapshot
Presentations of Structures in Admissible Sets
inferred← citeshttps://doi.org/10.1007/978-0-387-68546-5_2openalex-snapshot
Computability and Numberings
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-0325-4_1openalex-snapshot
The Work of Anil Nerode: A Retrospective
inferred← citeshttps://doi.org/10.1007/978-3-319-55911-7_7openalex-snapshot
A Note on Effective Categoricity for Linear Orderings
inferred← citeshttps://doi.org/10.1007/bf00971397openalex-snapshot
Computable classes of constructivizations for models of finite computability type
inferred← citeshttps://doi.org/10.1007/bf01669101openalex-snapshot
Autostability of models and Abelian groups
inferred← citeshttps://doi.org/10.1007/bf01669323openalex-snapshot
Problem of the number of non-self-equivalent constructivizations
inferred← citeshttps://doi.org/10.1007/bf02263053openalex-snapshot
Effectively infinite classes of weak constructivizations of models
inferred← citeshttps://doi.org/10.1007/bf02671950openalex-snapshot
A description of autostable models
inferred← citeshttps://doi.org/10.1007/s00153-005-0326-7openalex-snapshot
A computably stable structure with no Scott family of finitary formulas
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/s10469-015-9333-xopenalex-snapshot
Preserving Categoricity and Complexity of Relations
inferred← citeshttps://doi.org/10.1007/s10469-015-9353-6openalex-snapshot
Index Sets for n-Decidable Structures Categorical Relative to m-Decidable Presentations
inferred← citeshttps://doi.org/10.1007/s10469-015-9357-2openalex-snapshot
Ash’s Theorem on Δ α 0 -Categorical Structures and a Condition for Infinite Δ α 0 -Dimension
inferred← citeshttps://doi.org/10.1007/s10469-019-09558-8openalex-snapshot
Constructing Decidable Graphs from Decidable Structures
inferred← citeshttps://doi.org/10.1007/s10958-014-2032-7openalex-snapshot
Hyperarithmetical Categoricity of Boolean Algebras of Type B $$ \mathfrak{B} $$ (ω α × η)
inferred← citeshttps://doi.org/10.1007/s10958-014-2148-9openalex-snapshot
Δ 2 0 -Categoricity of Boolean Algebras
inferred← citeshttps://doi.org/10.1007/s10958-021-05419-xopenalex-snapshot
Categoricity Spectra of Computable Structures
inferred← citeshttps://doi.org/10.1007/s11202-007-0112-3openalex-snapshot
An autostable 2 nilpotent group with no Scott family of finitary formulas
inferred← citeshttps://doi.org/10.1016/0168-0072(87)90038-8openalex-snapshot
Categoricity in hyperarithmetical degrees
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90231-2openalex-snapshot
Stability among r.e. quotient algebras
inferred← citeshttps://doi.org/10.1016/j.apal.2005.02.001openalex-snapshot
Enumerations in computable structure theory
inferred← citeshttps://doi.org/10.1016/j.apal.2005.10.002openalex-snapshot
Effective categoricity of equivalence structures
inferred← citeshttps://doi.org/10.1016/j.apal.2008.11.003openalex-snapshot
Effective categoricity of Abelian p -groups
inferred← citeshttps://doi.org/10.1016/j.apal.2019.01.003openalex-snapshot
Computability-theoretic categoricity and Scott families
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)80004-9openalex-snapshot
Chapter 3 Isomorphic recursive structures
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80005-0openalex-snapshot
Chapter 4 Computable classes of constructive models
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)80047-5openalex-snapshot
Chapter 14 Computability theory and linear orderings
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00087-2openalex-snapshot
Degree spectra and computable dimensions in algebraic structures
inferred← citeshttps://doi.org/10.1016/s0168-0072(02)00035-0openalex-snapshot
Δ20-categoricity in Boolean algebras and linear orderings
inferred← citeshttps://doi.org/10.1017/cbo9781139028592.005openalex-snapshot
Computable structure theory using admissible recursion theory on ω1 using admissibility
inferred← citeshttps://doi.org/10.1017/jsl.2016.43openalex-snapshot
DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS
inferred← citeshttps://doi.org/10.1017/jsl.2017.50openalex-snapshot
A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
inferred← citeshttps://doi.org/10.1017/jsl.2025.10106openalex-snapshot
LATTICE EMBEDDINGS AND PUNCTUAL LINEAR ORDERS
inferred← citeshttps://doi.org/10.1017/s096012951600030xopenalex-snapshot
Autostability spectra for decidable structures
inferred← citeshttps://doi.org/10.1017/s1446788700023302openalex-snapshot
Recursive properties of isomorphism types
inferred← citeshttps://doi.org/10.1023/a:1021758312697openalex-snapshot
Computable Structure and Non-Structure Theorems
inferred← citeshttps://doi.org/10.1023/a:1025971406116openalex-snapshot
Uniformity in Computable Structure Theory
inferred← citeshttps://doi.org/10.1090/s0002-9947-1986-0860377-7openalex-snapshot
Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
inferred← citeshttps://doi.org/10.2178/jsl/1082418544openalex-snapshot
Π11 relations and paths through
inferred← citeshttps://doi.org/10.2178/jsl/1245158098openalex-snapshot
Intrinsic bounds on complexity and definability at limit levels
inferred← citeshttps://doi.org/10.2307/2274481openalex-snapshot
Effective model theory vs. recursive model theory
inferred← citeshttps://doi.org/10.2307/2274483openalex-snapshot
The Complexity of intrinsically r.e. subsets of existentially decidable models
inferred← citeshttps://doi.org/10.2307/421207openalex-snapshot
Degree Spectra of Relations on Computable Structures
inferred← citeshttps://doi.org/10.48550/arxiv.0805.1889openalex-snapshot
Effective categoricity of Abelian p-groups
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.