On the public citation graph
Recursive isomorphism types of recursive Boolean algebras
0 signed · 101 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.1002/malq.19660120125openalex-snapshot
Classes of Recursively Enumerable Sets and Degrees of Unsolvability
inferredcites →https://doi.org/10.1002/malq.19770231902openalex-snapshot
Theorie Der Numerierungen III
inferredcites →https://doi.org/10.1007/bf00967504openalex-snapshot
Some properties of the constructivization of Boolean algebras
inferredcites →https://doi.org/10.1007/bf02218638openalex-snapshot
Constructivizability of superatomic Boolean algebras
inferredcites →https://doi.org/10.1007/bf02219289openalex-snapshot
Constructive models of complete solvable theories
inferredcites →https://doi.org/10.1016/0003-4843(78)90027-xopenalex-snapshot
Recursively enumerable Boolean algebras
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.2140/pjm.1978.76.169openalex-snapshot
Realizing partial orderings by classes of co-simple sets
inferredcites →https://doi.org/10.2307/1970393openalex-snapshot
The Recursively Enumerable Degrees are Dense
inferredcites →https://doi.org/10.2307/2273758openalex-snapshot
Recursive Boolean algebras with recursive atoms
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
inferredcites →https://doi.org/10.4064/fm-59-1-109-116openalex-snapshot
On the elementary theory of linear order
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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-1-4612-0325-4_14openalex-snapshot
Algorithmic Stability of Models
inferred← citeshttps://doi.org/10.1007/978-3-031-95908-0_11openalex-snapshot
On Learning Existentially Definable Subsets in a Computable Structure
inferred← citeshttps://doi.org/10.1007/978-3-642-30870-3_70openalex-snapshot
Low n Boolean Subalgebras
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/bf00739333openalex-snapshot
Recursively inconsistent algorithmic problems on 1-constructivizable relatively complemented distributive lattices
inferred← citeshttps://doi.org/10.1007/bf01054216openalex-snapshot
Nilpotent groups of finite algorithmic dimension
inferred← citeshttps://doi.org/10.1007/bf01158918openalex-snapshot
Recursive Boolean algebras with a hyperhyperimmune set of atoms
inferred← citeshttps://doi.org/10.1007/bf01979640openalex-snapshot
Lattice of recursively enumerable subalgebras of a recursive boolean algebra
inferred← citeshttps://doi.org/10.1007/bf01980735openalex-snapshot
Constructive enumeration of Boolean lattices
inferred← citeshttps://doi.org/10.1007/bf02263052openalex-snapshot
Strong constructibility of boolean algebras of elementary characteristic (1,1,0)
inferred← citeshttps://doi.org/10.1007/bf02560308openalex-snapshot
Splitting recursively enumerable subalgebras in recursive Boolean algebras
inferred← citeshttps://doi.org/10.1007/bf02671631openalex-snapshot
Constructibility of Boolean algebras of elementary characteristic (1,0,1)
inferred← citeshttps://doi.org/10.1007/bfb0076226openalex-snapshot
Generic objects in recursion theory
inferred← citeshttps://doi.org/10.1007/s00153-002-0150-2openalex-snapshot
Simple and immune relations on countable structures
inferred← citeshttps://doi.org/10.1007/s00153-008-0110-6openalex-snapshot
Degree spectra of the successor relation of computable linear orderings
inferred← citeshttps://doi.org/10.1007/s10469-013-9224-yopenalex-snapshot
Computable categoricity of the Boolean algebra $ \mathfrak{B}\left( \omega \right) $ with a distinguished automorphism
inferred← citeshttps://doi.org/10.1007/s10469-013-9233-xopenalex-snapshot
Degrees of categoricity for superatomic Boolean algebras
inferred← citeshttps://doi.org/10.1007/s10469-015-9329-6openalex-snapshot
The Branching Theorem and Computable Categoricity in the Ershov Hierarchy
inferred← citeshttps://doi.org/10.1007/s10469-017-9416-yopenalex-snapshot
Structures Computable in Polynomial Time. I
inferred← citeshttps://doi.org/10.1007/s10469-018-9465-xopenalex-snapshot
Structures Computable in Polynomial Time. II
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-018-9498-1openalex-snapshot
Categoricity for Primitive Recursive and Polynomial Boolean Algebras
inferred← citeshttps://doi.org/10.1007/s10469-018-9511-8openalex-snapshot
Computable Bi-Embeddable Categoricity
inferred← citeshttps://doi.org/10.1007/s10469-023-09698-yopenalex-snapshot
Boolean Algebras Autostable Relative to n-Decidable Presentations
inferred← citeshttps://doi.org/10.1007/s10849-022-09371-0openalex-snapshot
Computable Heyting Algebras with Distinguished Atoms and Coatoms
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-015-2629-5openalex-snapshot
2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms
inferred← citeshttps://doi.org/10.1007/s10958-021-05419-xopenalex-snapshot
Categoricity Spectra of Computable Structures
inferred← citeshttps://doi.org/10.1007/s11202-005-0074-2openalex-snapshot
The Degree Spectra of Definable Relations on Boolean Algebras
inferred← citeshttps://doi.org/10.1007/s11225-012-9411-1openalex-snapshot
Computable Isomorphisms of Boolean Algebras with Operators
inferred← citeshttps://doi.org/10.1016/0168-0072(87)90011-xopenalex-snapshot
Recursively rigid Boolean algebras
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90075-oopenalex-snapshot
Every recursive boolean algebra is isomorphic to one with incomplete atoms
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(94)90012-4openalex-snapshot
Recursive unary algebras and trees
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.2011.06.007openalex-snapshot
Computably categorical Boolean algebras enriched by ideals and atoms
inferred← citeshttps://doi.org/10.1016/j.apal.2019.01.003openalex-snapshot
Computability-theoretic categoricity and Scott families
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/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)80007-4openalex-snapshot
Chapter 6 Autostable models and algorithmic dimensions
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)00094-xopenalex-snapshot
Degree spectra of relations on structures of finite computable dimension
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.1016/s0168-0072(02)00113-6openalex-snapshot
Turing degrees of hypersimple relations on computable structures
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00010-9openalex-snapshot
Quasi-simple relations in copies of a given recursive structure
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.1016/s0168-0072(97)00068-7openalex-snapshot
Decidable Boolean algebras of low level
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/s1446788700023302openalex-snapshot
Recursive properties of isomorphism types
inferred← citeshttps://doi.org/10.1023/a:1020927703492openalex-snapshot
Partial Results in Δ03-Categoricity in Linear Orderings and Boolean Algebras
inferred← citeshttps://doi.org/10.1023/a:1023350306979openalex-snapshot
Degree Spectra of Relations on Boolean Algebras
inferred← citeshttps://doi.org/10.1023/b:allo.0000020846.55332.2fopenalex-snapshot
Relatively Hyperimmune Relations on Structures
inferred← citeshttps://doi.org/10.1023/b:allo.0000044278.96526.5dopenalex-snapshot
Autostable I-Algebras
inferred← citeshttps://doi.org/10.1090/s0002-9939-08-09248-4openalex-snapshot
On the triple jump of the set of atoms of a Boolean algebra
inferred← citeshttps://doi.org/10.1090/s0002-9939-1994-1203984-4openalex-snapshot
Every Low Boolean Algebra is Isomorphic to a Recursive One
inferred← citeshttps://doi.org/10.1090/s0002-9939-1995-1283564-6openalex-snapshot
Every ${\rm low}\sb 2$ Boolean algebra has a recursive copy
inferred← citeshttps://doi.org/10.1090/s0002-9947-1991-1005933-2openalex-snapshot
Recursive Linear Orders with Incomplete Successivities
inferred← citeshttps://doi.org/10.1090/s0002-9947-2014-06093-5openalex-snapshot
Computable categoricity for algebraic fields with splitting algorithms
inferred← citeshttps://doi.org/10.1090/s0002-9947-2014-06094-7openalex-snapshot
Categoricity properties for computable algebraic fields
inferred← citeshttps://doi.org/10.1093/logcom/exaf043openalex-snapshot
A non-computable c.e. closed subset of [0,1]
inferred← citeshttps://doi.org/10.1134/s0037446619060077openalex-snapshot
Punctual Copies of Algebraic Structures
inferred← citeshttps://doi.org/10.1134/s1064562410040071openalex-snapshot
Autostable atomic-ideal enrichments of computable Boolean algebras
inferred← citeshttps://doi.org/10.1142/s0218216518410122openalex-snapshot
Computable isomorphisms for certain classes of infinite graphs
inferred← citeshttps://doi.org/10.18500/1816-9791-2022-22-4-458-467openalex-snapshot
On a concrete characterization problem of universal graphic semiautomata
inferred← citeshttps://doi.org/10.2178/bsl/1182353917openalex-snapshot
Computability-Theoretic Complexity of Countable Structures
inferred← citeshttps://doi.org/10.2178/jsl/1107298513openalex-snapshot
The computable dimension of trees of infinite height
inferred← citeshttps://doi.org/10.2178/jsl/1107298515openalex-snapshot
Computable categoricity of trees of finite height
inferred← citeshttps://doi.org/10.2178/jsl/1190150105openalex-snapshot
Degree spectra of relations on computable structures in the presence of Δ20isomorphisms
inferred← citeshttps://doi.org/10.2178/jsl/1254748694openalex-snapshot
d-computable categoricity for algebraic fields
inferred← citeshttps://doi.org/10.2178/jsl/1309952534openalex-snapshot
Low5 Boolean Subalgebras and Computable Copies
inferred← citeshttps://doi.org/10.2307/2161917openalex-snapshot
Every Low 2 Boolean Algebra has a Recursive Copy
inferred← citeshttps://doi.org/10.2307/2273758openalex-snapshot
Recursive Boolean algebras with recursive atoms
inferred← citeshttps://doi.org/10.2307/2274966openalex-snapshot
Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))
inferred← citeshttps://doi.org/10.2307/420949openalex-snapshot
1994 Annual Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.3233/com-13017openalex-snapshot
Computably Categorical Fields via Fermat’s Last Theorem
inferred← citeshttps://doi.org/10.33048/alglog.2018.57.507openalex-snapshot
Computable bi-embeddable categoricity
inferred← citeshttps://doi.org/10.4064/fm448-5-2018openalex-snapshot
Analytic computable structure theory and $L^p$ spaces
inferred← citeshttps://doi.org/10.48550/arxiv.0805.1889openalex-snapshot
Effective categoricity of Abelian p-groups
inferred← citeshttps://doi.org/10.48550/arxiv.1111.1205openalex-snapshot
Computable Categoricity for Algebraic Fields with Splitting Algorithms
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.