Strong constructivizability of Boolean algebras of elementary characteristic \((\infty, 0, 0)\) (Q2342305): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10469-014-9276-7
+Normal rank
@@ Property / OpenAlex ID @@
+W1978577692
@@ Property / OpenAlex ID: W1978577692 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4895321
@@ Property / cites work: Q4895321 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3994998
@@ Property / cites work: Q3994998 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5596792
@@ Property / cites work: Q5596792 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4133973
@@ Property / cites work: Q4133973 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4067090
@@ Property / cites work: Q4067090 / rank @@
+Normal rank
@@ Property / cites work @@
+Strongly constructive Boolean algebras
@@ Property / cites work: Strongly constructive Boolean algebras / rank @@
+Normal rank
@@ Property / cites work @@
+Q4242213
@@ Property / cites work: Q4242213 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4664637
@@ Property / cites work: Q4664637 / rank @@
+Normal rank
@@ Property / cites work @@
+Boolean algebras of elementary characteristic (1, 0, 1) with computable set of atoms and computable ideal of atomic elements
+Normal rank
@@ Property / cites work @@
+Q2895849
@@ Property / cites work: Q2895849 / rank @@
+Normal rank
@@ Property / cites work @@
+Boolean algebras of elementary characteristic \((1, 0, 1)\) whose set of atoms and Ershov-Tarski ideal are computable
+Normal rank
@@ Property / cites work @@
+The minimality of certain decidability conditions for Boolean algebras
+Normal rank
@@ Property / cites work @@
+The existence of strongly computable representations in the class of Boolean algebras
+Normal rank