On the public citation graph
Constructivizability of superatomic Boolean algebras
0 signed · 47 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/bf02219840openalex-snapshot
Strongly constructive models and numerations of the Boolean algebra of recursive sets
inferredcites →https://doi.org/10.1070/rm1961v016n03abeh001120openalex-snapshot
CONSTRUCTIVE ALGEBRAS I
inferredcites →https://doi.org/10.1305/ndjfl/1093894630openalex-snapshot
A note on $\pi^1_1$ ordinals.
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
inferredcites →https://doi.org/10.4064/fm-32-1-69-86openalex-snapshot
Boolesche Ringe mit geordneter Basis
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-3-031-64309-5_17openalex-snapshot
Universal Boolean Algebras with Applications to Semantic Classes of Models
inferred← citeshttps://doi.org/10.1007/978-94-011-2080-7_3openalex-snapshot
On Superatomic Boolean algebras
inferred← citeshttps://doi.org/10.1007/bf00967504openalex-snapshot
Some properties of the constructivization of Boolean algebras
inferred← citeshttps://doi.org/10.1007/bf00967767openalex-snapshot
Constructivizations of Boolean algebras
inferred← citeshttps://doi.org/10.1007/bf00968263openalex-snapshot
Numerations of saturated and homogeneous models
inferred← citeshttps://doi.org/10.1007/bf00970117openalex-snapshot
Totally transcendental theory with a nonconstructivizable prime model
inferred← citeshttps://doi.org/10.1007/bf01669834openalex-snapshot
A totally transcendental decidable theory without constructivizable homogeneous models
inferred← citeshttps://doi.org/10.1007/bf01669839openalex-snapshot
Theories with three countable models
inferred← citeshttps://doi.org/10.1007/bf01979865openalex-snapshot
Atom-free ideals of constructive boolean algebras
inferred← citeshttps://doi.org/10.1007/bf01979868openalex-snapshot
Connection between constructivizibility and strong constructivizibility for different classes of abelian groups
inferred← citeshttps://doi.org/10.1007/bf02001360openalex-snapshot
Index sets of classes of hyper-hypersimple sets
inferred← citeshttps://doi.org/10.1007/bf02219289openalex-snapshot
Constructive models of complete solvable theories
inferred← citeshttps://doi.org/10.1007/bfb0076226openalex-snapshot
Generic objects in recursion theory
inferred← citeshttps://doi.org/10.1007/s10469-012-9199-0openalex-snapshot
Constructivizability 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-016-9381-xopenalex-snapshot
Degrees of Autostability Relative to Strong Constructivizations for Boolean Algebras
inferred← citeshttps://doi.org/10.1007/s10469-026-09846-0openalex-snapshot
Model Theory of Enriched Boolean Algebras
inferred← citeshttps://doi.org/10.1007/s10958-015-2634-8openalex-snapshot
Perfect Local Computability of Superatomic Boolean Algebras
inferred← citeshttps://doi.org/10.1007/s10958-016-2851-9openalex-snapshot
Boolean Algebras with Distinguished Endomorphisms and Generating Trees
inferred← citeshttps://doi.org/10.1007/s11202-005-0043-9openalex-snapshot
On Automorphic Tuples of Elements in Computable Models
inferred← citeshttps://doi.org/10.1016/j.apal.2021.103060openalex-snapshot
On bi-embeddable categoricity of algebraic structures
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)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)80045-1openalex-snapshot
Introduction to the handbook of recursive mathematics
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)80050-5openalex-snapshot
Chapter 17 Constructive abelian groups
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(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.1023/a:1024762419356openalex-snapshot
Computable Families of Superatomic Boolean Algebras
inferred← citeshttps://doi.org/10.1023/b:simj.0000013023.90154.bbopenalex-snapshot
On the Ershov Upper Semilattice
inferred← citeshttps://doi.org/10.1134/s0037446616060136openalex-snapshot
Finitely-axiomatizable superatomic Boolean algebras with distinguished dense subalgebra of finite width
inferred← citeshttps://doi.org/10.1134/s003744662206009xopenalex-snapshot
On Weakly Holographic Structures
inferred← citeshttps://doi.org/10.1134/s0037446625030048openalex-snapshot
On Weakly Coholographic Structures
inferred← citeshttps://doi.org/10.1134/s0081543811060071openalex-snapshot
Degrees of autostability relative to strong constructivizations
inferred← citeshttps://doi.org/10.1177/22113568261440402openalex-snapshot
Universal Boolean algebras, their ideals, and applications to semantic classes of models
inferred← citeshttps://doi.org/10.1305/ndjfl/1172787551openalex-snapshot
Computability of Homogeneous Models
inferred← citeshttps://doi.org/10.2307/2273757openalex-snapshot
Recursive isomorphism types of recursive Boolean algebras
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.