On the public citation graph

Strongly constructive models and numerations of the Boolean algebra of recursive sets

https://doi.org/10.1007/bf02219840
0 signed · 34 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.1070/rm1961v016n03abeh001120openalex-snapshot
CONSTRUCTIVE ALGEBRAS I

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-0-387-69245-6_3openalex-snapshot
Computability and Computable Models
inferred← citeshttps://doi.org/10.1007/bf00967009openalex-snapshot
Enumerations of simple models
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/bf00969170openalex-snapshot
Theory of Abelian groups with constructive models
inferred← citeshttps://doi.org/10.1007/bf00970310openalex-snapshot
Universal recursively enumerable Boolean algebras
inferred← citeshttps://doi.org/10.1007/bf00971303openalex-snapshot
Automorphisms of constructivizations of Boolean algebras
inferred← citeshttps://doi.org/10.1007/bf00971671openalex-snapshot
Restricted theories of constructive Boolean algebras
inferred← citeshttps://doi.org/10.1007/bf01149926openalex-snapshot
Non-self-equivalent constructivization of atomic Boolean algebras
inferred← citeshttps://doi.org/10.1007/bf01158175openalex-snapshot
Constructive boolean algebras with almost-identical automorphisms
inferred← citeshttps://doi.org/10.1007/bf01669323openalex-snapshot
Problem of the number of non-self-equivalent constructivizations
inferred← citeshttps://doi.org/10.1007/bf01978663openalex-snapshot
Groups of recursive automorphisms of contructive 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/bf02218589openalex-snapshot
On complete theories with a finite number of denumerable models
inferred← citeshttps://doi.org/10.1007/bf02218638openalex-snapshot
Constructivizability of superatomic Boolean algebras
inferred← citeshttps://doi.org/10.1007/bf02218698openalex-snapshot
Strongly constructive model without elementary submodels and extensions
inferred← citeshttps://doi.org/10.1007/bf02219289openalex-snapshot
Constructive models of complete solvable theories
inferred← citeshttps://doi.org/10.1007/bfb0039696openalex-snapshot
Theory of domains and nearby
inferred← citeshttps://doi.org/10.1007/s10469-015-9331-zopenalex-snapshot
Index Sets of Constructive Models of Bounded Signature that are Autostable Relative to Strong Constructivizations
inferred← citeshttps://doi.org/10.1007/s10958-015-2253-4openalex-snapshot
Index Sets of Constructive Models that are Autostable Under Strong Constructivizations
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)80006-2openalex-snapshot
Chapter 5 Σ-Definability of algebraic structures
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)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.1017/cbo9781107338579.006openalex-snapshot
Computable model theory
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.1305/ndjfl/1093634407openalex-snapshot
Constructive ultraproducts and isomorphisms of recursively saturated ultrapowers.
inferred← citeshttps://doi.org/10.33048/semi.2020.17.011openalex-snapshot
A. D. Taimanov and model theory in Kazakhstan
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.