On the public citation graph
Some properties of the constructivization of Boolean algebras
0 signed · 68 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/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.1007/bf02219840openalex-snapshot
Strongly constructive models and numerations of the Boolean algebra of recursive sets
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
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_1openalex-snapshot
The Work of Anil Nerode: A Retrospective
inferred← citeshttps://doi.org/10.1007/978-1-4612-0325-4_19openalex-snapshot
n-Recursive Linear Orders without (n+1)-Recursive Copies
inferred← citeshttps://doi.org/10.1007/978-1-4612-0325-4_24openalex-snapshot
Polynomial Time Categoricity and Linear Orderings
inferred← citeshttps://doi.org/10.1007/978-3-662-02897-1_1openalex-snapshot
Two-Dimensional Manifolds of Bounded Curvature
inferred← citeshttps://doi.org/10.1007/bf00970117openalex-snapshot
Totally transcendental theory with a nonconstructivizable prime model
inferred← citeshttps://doi.org/10.1007/bf00970310openalex-snapshot
Universal recursively enumerable Boolean algebras
inferred← citeshttps://doi.org/10.1007/bf00970918openalex-snapshot
Arithmetic Hierarchy and ideals of enumerated Boolean algebras
inferred← citeshttps://doi.org/10.1007/bf00971671openalex-snapshot
Restricted theories of constructive Boolean algebras
inferred← citeshttps://doi.org/10.1007/bf01158918openalex-snapshot
Recursive Boolean algebras with a hyperhyperimmune set of atoms
inferred← citeshttps://doi.org/10.1007/bf01669456openalex-snapshot
The quantity of nonautoequivalent constructivizations
inferred← citeshttps://doi.org/10.1007/bf01979640openalex-snapshot
Lattice of recursively enumerable subalgebras of a recursive boolean algebra
inferred← citeshttps://doi.org/10.1007/bf01979865openalex-snapshot
Atom-free ideals of constructive boolean algebras
inferred← citeshttps://doi.org/10.1007/bf01980636openalex-snapshot
Turing machine computations in finitely axiomatizable theories
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/bf02263053openalex-snapshot
Effectively infinite classes of weak constructivizations of models
inferred← citeshttps://doi.org/10.1007/s10469-005-0001-4openalex-snapshot
Strongly constructive Boolean algebras
inferred← citeshttps://doi.org/10.1007/s10469-014-9276-7openalex-snapshot
Strong Constructivizability of Boolean Algebras of Elementary Characteristic (∞, 0, 0)
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/s10958-013-1621-1openalex-snapshot
Sufficient Conditions for Decidability of Boolean Algebras
inferred← citeshttps://doi.org/10.1007/s10958-014-2148-9openalex-snapshot
Δ 2 0 -Categoricity of Boolean Algebras
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(91)90008-aopenalex-snapshot
Polynomial-time versus recursive models
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90001-topenalex-snapshot
Countable thin Π01 classes
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)80010-4openalex-snapshot
Chapter 9 Constructive models of finitely axiomatizable theories
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80011-6openalex-snapshot
Chapter 10 Complexity theoretic model theory and algebra
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/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-1981-0624937-1openalex-snapshot
Recursively Categorical Linear Orderings
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/s0037446612010090openalex-snapshot
The minimality of certain decidability conditions for Boolean algebras
inferred← citeshttps://doi.org/10.1134/s1064562412040084openalex-snapshot
The existence of strongly computable representations in the class of Boolean algebras
inferred← citeshttps://doi.org/10.1134/s1995080221040089openalex-snapshot
Punctual Dimension of Algebraic Structures in Certain Classes
inferred← citeshttps://doi.org/10.1142/s0219061302000163openalex-snapshot
THE LINDENBAUM ALGEBRA OF THE THEORY OF THE CLASS OF ALL FINITE MODELS
inferred← citeshttps://doi.org/10.2307/2273757openalex-snapshot
Recursive isomorphism types of recursive Boolean algebras
inferred← citeshttps://doi.org/10.2307/2273758openalex-snapshot
Recursive Boolean algebras with recursive atoms
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.