Countably-categorical Boolean algebras with distinguished ideals (Q1104315): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graded and filtered rings and modules / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Small programming exercises 12 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decidability of Second-Order Theories and Automata on Infinite Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5612472 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5802110 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 16:42, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Countably-categorical Boolean algebras with distinguished ideals |
scientific article |
Statements
Countably-categorical Boolean algebras with distinguished ideals (English)
0 references
1987
0 references
The Boolean algebras B with distinguished ideals are the algebraic systems \(<A,\cap,\cup,-,0,1,J_ 0,...,J_ m>\) where \(J_{\ell}\) \((\ell \leq m<\infty)\) are unary predicates defining ideals of (the Boolean algebras) \(<A,\cap,\cup,-,0,1>.\) From \textit{Yu. L. Ershov}'s paper [Algebra Logika, Sem. 3, No.3, 17-38 (1964; Zbl 0199.031)] it follows that for \(m=0\) Th(B) is decidable in, at least, the two following cases: 1) \(B|_{J_ 0}\) is finite, 2) there exists \(\sup \{x| \quad B\vDash J_ 0(x)\}\) and B is atomic. As is known for \(m=0\) there exists B such that Th(B) is undecidable. In the reviewed paper all countable Boolean algebras with distinguished ideals having countably-categorical elementary theory are described. From this description it follows that all countably-categorical elementary theories of Boolean algebras with distinguished ideals are finitely axiomatizable, decidable and, consequently, their countable models are strongly constructivizable.
0 references
countable categoricity
0 references
finite axiomatizability
0 references
decidability
0 references
strong constructivizability
0 references
Boolean algebras with distinguished ideals
0 references