Learn More
Tarski defined a way of assigning to each boolean algebra, B, an invariant inv(B) ∈ In, where In is a set of triples from N, 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(More)
A Turing degree d is homogeneous bounding if every complete decidable (CD) theory has a d-decidable homogeneous model A, i.e., the elementary diagram D e (A) has degree d. It follows from results of Macintyre and Marker that every PA degree (i.e., every degree of a complete extension of Peano Arithmetic) is homogeneous bounding. We prove that in fact a(More)