On the public citation graph

Restricted theories of constructive Boolean algebras

https://doi.org/10.1007/bf00971671
0 signed · 15 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf00967504openalex-snapshot
Some properties of the constructivization of Boolean algebras
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/bf02263052openalex-snapshot
Strong constructibility of boolean algebras of elementary characteristic (1,1,0)
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/s10958-012-1000-3openalex-snapshot
Boolean algebras of elementary characteristic (1, 0, 1) with computable set of atoms and computable ideal of atomic elements
inferred← citeshttps://doi.org/10.1007/s10958-013-1621-1openalex-snapshot
Sufficient Conditions for Decidability of Boolean Algebras
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)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/cbo9781107338579.006openalex-snapshot
Computable model theory
inferred← citeshttps://doi.org/10.1134/s0037446612010090openalex-snapshot
The minimality of certain decidability conditions for Boolean algebras
inferred← citeshttps://doi.org/10.2178/bsl/1182353917openalex-snapshot
Computability-Theoretic Complexity of Countable Structures
inferred← citeshttps://doi.org/10.2178/jsl/1190150160openalex-snapshot
Sequences of n-diagrams
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.