On the public citation graph
Strong and weak constructivization and computable families
0 signed · 81 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.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.1007/11494645_58openalex-snapshot
Presentations of Structures in Admissible Sets
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-94-009-7798-3_9openalex-snapshot
Infinite Ordered Sets, A Recursive Perspective
inferred← citeshttps://doi.org/10.1007/978-981-95-4839-2_7openalex-snapshot
On a Computability-Theoretic Approach to Boolean-Valued Models
inferred← citeshttps://doi.org/10.1007/bf00967032openalex-snapshot
Computability of certain classes of constructive algebras
inferred← citeshttps://doi.org/10.1007/bf00967767openalex-snapshot
Constructivizations of Boolean algebras
inferred← citeshttps://doi.org/10.1007/bf00968687openalex-snapshot
Autostability and extensions of constructivizations
inferred← citeshttps://doi.org/10.1007/bf00971397openalex-snapshot
Computable classes of constructivizations for models of finite computability type
inferred← citeshttps://doi.org/10.1007/bf01668470openalex-snapshot
Autostability and computable families of constructivizations
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/bf01669502openalex-snapshot
A theory with two strongly constructivizable models
inferred← citeshttps://doi.org/10.1007/bf01979674openalex-snapshot
Complexity of the index set of a constructive model
inferred← citeshttps://doi.org/10.1007/bf02259824openalex-snapshot
Criteria of autostability for 1-decidable models
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/bfb0090954openalex-snapshot
Two theorems on autostability in p-Groups
inferred← citeshttps://doi.org/10.1007/s00153-016-0478-7openalex-snapshot
Computable dimension for ordered fields
inferred← citeshttps://doi.org/10.1007/s10469-009-9072-yopenalex-snapshot
autostability of prime models under strong constructivizations
inferred← citeshttps://doi.org/10.1007/s10469-015-9331-zopenalex-snapshot
Index Sets of Constructive Models of Bounded Signature that are Autostable Relative to Strong Constructivizations
inferred← citeshttps://doi.org/10.1007/s10469-016-9365-xopenalex-snapshot
Index Sets of Constructive Models of Finite and Graph Signatures that are Autostable Relative to Strong Constructivizations
inferred← citeshttps://doi.org/10.1007/s10469-018-9483-8openalex-snapshot
Degrees of Autostability for Prime Boolean Algebras
inferred← citeshttps://doi.org/10.1007/s10469-019-09546-yopenalex-snapshot
Turing Degrees of Complete Formulas of Almost Prime Models
inferred← citeshttps://doi.org/10.1007/s10469-021-09642-yopenalex-snapshot
The Degree of Decidable Categoricity of a Model with Infinite Solutions for Complete Formulas
inferred← citeshttps://doi.org/10.1007/s10469-024-09746-1openalex-snapshot
Decidable Categoricity Spectra for Almost Prime Models
inferred← citeshttps://doi.org/10.1007/s10469-026-09842-4openalex-snapshot
Index Sets of Decidably Categorical Models that are Elementarily Equivalent to the Powers of Omega
inferred← citeshttps://doi.org/10.1007/s10958-015-2252-5openalex-snapshot
Index Sets of Almost Prime Constructive Models
inferred← citeshttps://doi.org/10.1007/s10958-015-2253-4openalex-snapshot
Index Sets of Constructive Models that are Autostable Under Strong Constructivizations
inferred← citeshttps://doi.org/10.1007/s10958-017-3272-0openalex-snapshot
Index Set of Linear Orderings that are Autostable Relative to Strong Constructivizations
inferred← citeshttps://doi.org/10.1007/s10958-021-05419-xopenalex-snapshot
Categoricity Spectra of Computable Structures
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90150-copenalex-snapshot
Recursive properties of relations on models
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90231-2openalex-snapshot
Stability among r.e. quotient algebras
inferred← citeshttps://doi.org/10.1016/0168-0072(94)90046-9openalex-snapshot
Inseparability in recursive copies
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.jcss.2026.103821openalex-snapshot
On computability-theoretic universality of Boolean-valued models
inferred← citeshttps://doi.org/10.1016/s0001-8708(02)00042-7openalex-snapshot
The computable dimension of ordered abelian groups
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)80003-7openalex-snapshot
Chapter 2 Elementary theories and their constructive models
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)80007-4openalex-snapshot
Chapter 6 Autostable models and algorithmic dimensions
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80010-4openalex-snapshot
Chapter 9 Constructive models of finitely axiomatizable theories
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/s0049-237x(98)80053-0openalex-snapshot
Chapter 20 Generally constructive boolean algebras
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(97)00059-6openalex-snapshot
Computable isomorphisms, degree spectra of relations, and Scott families
inferred← citeshttps://doi.org/10.1017/cbo9780511565670.009openalex-snapshot
Effective Model Theory: The Number of Models and Their Complexity
inferred← citeshttps://doi.org/10.1017/cbo9781139028592.003openalex-snapshot
Some results on ℝ-computable structures
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.2019.26openalex-snapshot
AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
inferred← citeshttps://doi.org/10.1017/s0004972700021675openalex-snapshot
Recursive properties of isomorphism types
inferred← citeshttps://doi.org/10.1017/s1446788700023302openalex-snapshot
Recursive properties of isomorphism types
inferred← citeshttps://doi.org/10.1023/a:1012553802244openalex-snapshot
Universal Numbering for Constructive I-Algebras
inferred← citeshttps://doi.org/10.1070/rm2010v065n05abeh004704openalex-snapshot
On autostability of almost prime models relative to strong constructivizations
inferred← citeshttps://doi.org/10.1090/proc/17329openalex-snapshot
A pathological punctually 1-decidable structure
inferred← citeshttps://doi.org/10.1134/s0037446615030039openalex-snapshot
The index set of Boolean algebras autostable relative to strong constructivizations
inferred← citeshttps://doi.org/10.1134/s003744661503012xopenalex-snapshot
Autostability relative to strong constructivizations of Boolean algebras with distinguished ideals
inferred← citeshttps://doi.org/10.1134/s0037446617010104openalex-snapshot
The index set of the groups autostable relative to strong constructivizations
inferred← citeshttps://doi.org/10.1134/s0037446618040018openalex-snapshot
Degrees of Autostability Relative to Strong Constructivizations of Graphs
inferred← citeshttps://doi.org/10.1134/s0081543811060071openalex-snapshot
Degrees of autostability relative to strong constructivizations
inferred← citeshttps://doi.org/10.1134/s1055134421040039openalex-snapshot
On Decidable Categoricity for Almost Prime Models of the Signature of Graphs
inferred← citeshttps://doi.org/10.1134/s106456241505004xopenalex-snapshot
Index sets of autostable relative to strong constructivizations constructive models for familiar classes
inferred← citeshttps://doi.org/10.1142/s0218196719500644openalex-snapshot
Decompositions of decidable abelian groups
inferred← citeshttps://doi.org/10.2178/bsl/1305810915openalex-snapshot
2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10
inferred← citeshttps://doi.org/10.2178/jsl/1107298515openalex-snapshot
Computable categoricity of trees of finite height
inferred← citeshttps://doi.org/10.2307/2273632openalex-snapshot
Vaught's theorem recursively revisited
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.3103/s1055134420030050openalex-snapshot
On Decidable Categoricity and Almost Prime Models
inferred← citeshttps://doi.org/10.33048/alglog.2021.60.304openalex-snapshot
The degree of decidable categoricity of a model with infinite solutions for complete formulas
inferred← citeshttps://doi.org/10.33048/semi.2020.17.076openalex-snapshot
A note on decidable categoricity and index sets
inferred← citeshttps://doi.org/10.4213/rm9373openalex-snapshot
Об автоустойчивости относительно сильных конструктивизаций почти простых моделей
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.