David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Notre Dame Journal of Formal Logic 47 (1):1-23 (2006)
Tarski defined a way of assigning to each Boolean algebra, B, an invariant inv(B) ∈ In, where In is a set of triples from ℕ, such that two Boolean algebras have the same invariant if and only if they are elementarily equivalent. Moreover, given the invariant of a Boolean algebra, there is a computable procedure that decides its elementary theory. If we restrict our attention to dense Boolean algebras, these invariants determine the algebra up to isomorphism. In this paper we analyze the complexity of the question "Does B have invariant x?" For each x ∈ In we define a complexity class Γx that could be either Σⁿ, Πⁿ, Σⁿ ∧ Πⁿ, or Πω+1 depending on x, and we prove that the set of indices for computable Boolean algebras with invariant x is complete for the class Γx. Analogs of many of these results for computably enumerable Boolean algebras were proven in earlier works by Selivanov. In a more recent work, he showed that similar methods can be used to obtain the results for computable ones. Our methods are quite different and give new results as well. As the algebras we construct to witness hardness are all dense, we establish new similar results for the complexity of various isomorphism problems for dense Boolean algebras
|Keywords||Boolean algebras computability index sets Tarski invariants|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
Ekaterina B. Fokina (2009). Index Sets for Some Classes of Structures. Annals of Pure and Applied Logic 157 (2):139-147.
Similar books and articles
Bronisław Tembrowski (1986). Q-Ultrafilters and Normal Ultrafilters in B-Algebras. Studia Logica 45 (2):167 - 179.
Roman Wencel (2003). Definable Sets in Boolean Ordered o-Minimal Structures. II. Journal of Symbolic Logic 68 (1):35-51.
Bronisław Tembrowski (1989). B-Varieties with Normal Free Algebras. Studia Logica 48 (4):555 - 564.
Bronisław Tembrowski (1983). The Theory of Boolean Algebras with an Additional Binary Operation. Studia Logica 42 (4):389 - 405.
Misao Nagayama (1992). On Boolean Algebras and Integrally Closed Commutative Regular Rings. Journal of Symbolic Logic 57 (4):1305-1318.
Robert Bonnet & Matatyahu Rubin (1991). Elementary Embedding Between Countable Boolean Algebras. Journal of Symbolic Logic 56 (4):1212-1229.
Janusz Czelakowski (1979). Partial Boolean Algebras in a Broader Sense. Studia Logica 38 (1):1 - 16.
Nguyen Cat Ho & Helena Rasiowa (1989). Plain Semi-Post Algebras as a Poset-Based Generalization of Post Algebras and Their Representability. Studia Logica 48 (4):509 - 530.
Chrysafis Hartonas (1997). Duality for Lattice-Ordered Algebras and for Normal Algebraizable Logics. Studia Logica 58 (3):403-450.
Miklós Ferenczi (2010). Non-Standard Stochastics with a First Order Algebraization. Studia Logica 95 (3):345 - 354.
Antoni Torrens (1987). W-Algebras Which Are Boolean Products of Members of SR and CW-Algebras. Studia Logica 46 (3):265 - 274.
Daniele Mundici (1995). Averaging the Truth-Value in Łukasiewicz Logic. Studia Logica 55 (1):113 - 127.
Peter Cholak (1990). Boolean Algebras and Orbits of the Lattice of R.E. Sets Modulo the Finite Sets. Journal of Symbolic Logic 55 (2):744-760.
Ludomir Newelski & Roman Wencel (2001). Definable Sets in Boolean-Ordered o-Minimal Structures. I. Journal of Symbolic Logic 66 (4):1821-1836.
Saharon Shelah (2000). Applications of PCF Theory. Journal of Symbolic Logic 65 (4):1624-1674.
Added to index2010-08-24
Total downloads2 ( #345,621 of 1,099,003 )
Recent downloads (6 months)1 ( #287,293 of 1,099,003 )
How can I increase my downloads?