On the public citation graph

On the automorphism groups of homogeneous and saturated Boolean algebras

https://doi.org/10.1007/bf02488016
0 signed · 25 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.1002/malq.19690150705openalex-snapshot
On the number of ultrafilters of an infinite boolean algebra
inferredcites →https://doi.org/10.1007/bf02280808openalex-snapshot
A type-open minimal model
inferredcites →https://doi.org/10.1007/bf02485718openalex-snapshot
Automorphism groups of ultrafilters
inferredcites →https://doi.org/10.1007/bf02547967openalex-snapshot
On the automorphism groups of denumerable Boolean algebras
inferredcites →https://doi.org/10.1007/bf02760943openalex-snapshot
On the automorphism groups of countable Boolean algebras
inferredcites →https://doi.org/10.1007/bf02762670openalex-snapshot
First order theory of permutation groups
inferredcites →https://doi.org/10.1007/bf02944950openalex-snapshot
On elementary types of symmetric groups
inferredcites →https://doi.org/10.1007/bf02945104openalex-snapshot
Elementary definability of symmetry groups
inferredcites →https://doi.org/10.2140/pjm.1965.15.1145openalex-snapshot
Free complete extensions of Boolean algebras
inferredcites →https://doi.org/10.2307/2273187openalex-snapshot
On the elementary equivalence of automorphism groups of Boolean algebras; downward Skolem Löwenheim theorems and compactness of related quantifiers
inferredcites →https://doi.org/10.4153/cjm-1977-050-xopenalex-snapshot
Automorphism Groups of Denumerable Boolean Algebras

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-4613-3443-9_3openalex-snapshot
On Recovering Structures from Quotients of their Automorphism Groups
inferred← citeshttps://doi.org/10.1007/978-1-4613-3443-9_5openalex-snapshot
Locally Moving Groups and Reconstruction Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-3443-9_9openalex-snapshot
Automorphisms of Quotients of Symmetric Groups
inferred← citeshttps://doi.org/10.1007/bf01978663openalex-snapshot
Groups of recursive automorphisms of contructive boolean algebras
inferred← citeshttps://doi.org/10.1007/bf02021132openalex-snapshot
On the reconstruction of boolean algebras from their automorphism groups
inferred← citeshttps://doi.org/10.1007/bf02483101openalex-snapshot
Some questions about Boolean algebras
inferred← citeshttps://doi.org/10.1007/bf02760943openalex-snapshot
On the automorphism groups of countable Boolean algebras
inferred← citeshttps://doi.org/10.1016/j.apal.2008.06.016openalex-snapshot
Partial automorphism semigroups
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80009-8openalex-snapshot
Chapter 8 Groups of computable automorphisms
inferred← citeshttps://doi.org/10.1016/s0168-0072(98)00023-2openalex-snapshot
On distinguishing quotients of symmetric groups
inferred← citeshttps://doi.org/10.1070/rm2005v060n03abeh000847openalex-snapshot
Elementary classification and decidability of theories of derived structures
inferred← citeshttps://doi.org/10.1090/s0002-9947-1989-0988881-4openalex-snapshot
On the Reconstruction of Topological Spaces from Their Groups of Homeomorphisms
inferred← citeshttps://doi.org/10.2307/2273187openalex-snapshot
On the elementary equivalence of automorphism groups of Boolean algebras; downward Skolem Löwenheim theorems and compactness of related quantifiers
inferred← citeshttps://doi.org/10.4213/rm1428openalex-snapshot
Элементарная классификация и разрешимость теории производных структур
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.