On the public citation graph
Recursive Boolean algebras with recursive atoms
0 signed · 54 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.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/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.1112/plms/s3-28.1.1openalex-snapshot
Iterated Quotients of the Lattice of Recursively Enumerable Sets
inferredcites →https://doi.org/10.2307/1970393openalex-snapshot
The Recursively Enumerable Degrees are Dense
inferredcites →https://doi.org/10.2307/2273757openalex-snapshot
Recursive isomorphism types of recursive Boolean algebras
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
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_14openalex-snapshot
Algorithmic Stability of Models
inferred← citeshttps://doi.org/10.1007/978-3-319-58741-7_8openalex-snapshot
Eliminating Unbounded Search in Computable Algebra
inferred← citeshttps://doi.org/10.1007/bf00971303openalex-snapshot
Automorphisms of constructivizations of Boolean algebras
inferred← citeshttps://doi.org/10.1007/bf01979010openalex-snapshot
Algorithmic properties of branching models
inferred← citeshttps://doi.org/10.1007/bf01979865openalex-snapshot
Atom-free ideals of constructive boolean algebras
inferred← citeshttps://doi.org/10.1007/bf01980735openalex-snapshot
Constructive enumeration of Boolean lattices
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-024-00940-7openalex-snapshot
Punctually presented structures II: comparing 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.1016/0168-0072(84)90028-9openalex-snapshot
Recursive linear orders with recursive successivities
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(94)90012-4openalex-snapshot
Recursive unary algebras and trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.01.029openalex-snapshot
Algebraic structures computable without delay
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)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(97)00068-7openalex-snapshot
Decidable Boolean algebras of low level
inferred← citeshttps://doi.org/10.1017/9781108525749.004openalex-snapshot
Existentially-Atomic Models
inferred← citeshttps://doi.org/10.1017/9781108525749.007openalex-snapshot
Comparing Structures and Classes of Structures
inferred← citeshttps://doi.org/10.1017/9781108525749.008openalex-snapshot
Finite-Injury Constructions
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-9947-1991-1005933-2openalex-snapshot
Recursive Linear Orders with Incomplete Successivities
inferred← citeshttps://doi.org/10.1134/s0037446619060077openalex-snapshot
Punctual Copies of Algebraic Structures
inferred← citeshttps://doi.org/10.1134/s1995080221040089openalex-snapshot
Punctual Dimension of Algebraic Structures in Certain Classes
inferred← citeshttps://doi.org/10.2307/2273757openalex-snapshot
Recursive isomorphism types of recursive Boolean algebras
inferred← citeshttps://doi.org/10.26686/wgtn.25808320openalex-snapshot
Effective Presentations of Mathematical Structures
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.