A. Tarski. Arithmetical classes and types of boolean algebras. Bull. Amer. Math. Soc., 55, 64, 1192, 1949. 11  Home/Search   Document Not in Database   Summary   Related Articles   Check

....theory of pairing functions [14] see also [11] Previous Quantifier Elimination Results. We show our decidability result using quantifier elimination. Quantifier elimination [20, Section 2. 7] is a fruitful technique that has been used to show decidability and classification of boolean algebras [40, 44], Presburger arithmetic [36] decidability of products [30, 13] 28, Chapter 12] and algebraically closed fields [43] Directly relevant to our work are quantifierelimination techniques for term algebras [28, Chapter 23] 27, 41] Several extensions of term algebras have been shown decidable ....

A. Tarski. Arithmetical classes and types of boolean algebras. Bull. Amer. Math. Soc., 55, 64, 1192, 1949. 11

....the decidability of structural subtyping, our hope is to promote the important technique of quantifier elimination, which forms the basis of our result. Quantifier elimination [22, Section 2. 7] is a fruitful technique that was used to show decidability and classification of boolean algebras [46, 51] decidability of term algebras [31, Chapter 23] 39, 30] with membership constraints [10] and with queues [43] decidability of products [35, 14] 31, Chapter 12] and algebraically closed fields [50] The complexity of the decision problem for the first order theory of structural subtyping ....

....elimination procedure to #, yielding a quantifier free formula #, and then evaluate the truth value of #. 3.2 Quantifier Elimination for Boolean Algebras This section presents a quantifier elimination procedure for finite boolean algebras. This result dates back at least to [46] see also [51, 27, 32, 6, 49], 22, Section 2.7 Exercise 3] Note that the operations union, intersection and complement are definable in the first order language of the subset relation. Therefore, quantifier elimination for the first order theory of the boolean algebra of sets is no harder than the quantifier elimination for ....

Alfred Tarski. Arithmetical classes and types of boolean algebras. Bull. Amer. Math. Soc., 55, 64, 1192, 1949. 1, 3.2

....the decidability of structural subtyping, our hope is to promote the important technique of quanti er elimination, which forms the basis of our result. Quanti er elimination [22, Section 2. 7] is a fruitful technique that was used to show decidability and classi cation of boolean algebras [46, 51] decidability of term algebras [31, Chapter 23] 39, 30] with membership constraints [10] and with queues [43] decidability of products [35, 14] 31, Chapter 12] and algebraically closed elds [50] The complexity of the decision problem for the rst order theory of structural subtyping has ....

....quanti er elimination procedure to , yielding a quanti er free formula , and then evaluate the truth value of . 3.2 Quanti er Elimination for Boolean Algebras This section presents a quanti er elimination procedure for nite boolean algebras. This result dates back at least to [46] see also [51, 27, 32, 6, 49], 22, Section 2.7 Exercise 3] Note that the operations union, intersection and complement are de nable in the rst order language of the subset relation. Therefore, quanti er elimination for the rst order theory of the boolean algebra of sets is no harder than the quanti er elimination for ....

Alfred Tarski. Arithmetical classes and types of boolean algebras. Bull. Amer. Math. Soc., 55, 64, 1192, 1949.

....be finitely decidable. By (34) we have V fin j= ffi oe , W fin j= oe for all L sentence oe. Thus V fin must be undecidable. Proving the decidability of V is much harder. Basically we use the fact that the class B of all Boolean algebras with denumerably many constant symbols is decidable [Tar49]. Let LB be the language of B. We will prove the decidability of V by constructing an effective map 7 # from the set of L sentences into the set of LB sentences in such a way that Gamma has a model in V Delta , Gamma # has a model in B Delta . 4 A Feferman Vaught Type ....

A. Tarski. Arithmetical Classes and Types of Boolean Algebras. Bull. of the American Mathematical Society, 55:64, 1949.

....(proj (S ; x 2 ; x n ) x 1 ) With Corollary 5.7 this result carries over to all Boolean algebras. 7 Related Work Our results concerning satisfiability and quantifier elimination fall between analogous results obtained for positive Boolean constraints by Boole [2] and the result of Tarski [19] that the elementary theory of Boolean algebras is decidable. Boole s results form the basis for so called Boolean unification [4, 16] used in constraint logic programming systems that allow positive Boolean constraints. To prove decidability of the elementary theory of Boolean algebras, Tarski ....

A. Tarski. Arithmetical classes and types of Boolean algebras. Bull. Amer. Math. Soc, 55(64):1192, 1949.

....literature apart from the paper by Marriott and Odersky [14] and Helm, Marriott and Odersky [8] Investigating other cases of Boolean inequality constraints that admit simple quantifier elimination remains an important topic. The decidability of elementary Boolean algebras was proven by Tarski [18] and their complexity was analyzed by Kozen [13] However, none of [13, 14, 18] considered the computational complexity of evaluating Datalog and Stratified Datalog queries. The known computational complexity results for Datalog and Stratified Datalog queries of other types of constraint databases ....

....Marriott and Odersky [8] Investigating other cases of Boolean inequality constraints that admit simple quantifier elimination remains an important topic. The decidability of elementary Boolean algebras was proven by Tarski [18] and their complexity was analyzed by Kozen [13] However, none of [13, 14, 18] considered the computational complexity of evaluating Datalog and Stratified Datalog queries. The known computational complexity results for Datalog and Stratified Datalog queries of other types of constraint databases can be found in [17] ....

A. Tarski. Arithmetical classes and types of Boolean algebras. Bulletin American Mathematical Society, 55:1192, 1949.

No context found.

A. Tarski. Arithmetical classes and types of boolean algebras. Bull. Amer. Math. Soc., 55, 64, 1192, 1949. 11

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC