2 search results - page 1 / 1 » A standard model of Peano arithmetic with no conservative el... |
APAL
2008
13 years 7 months ago
2008
The principal result of this paper answers a long-standing question in the model theory of arithmetic [KS, Question 7] by showing that there exists an uncountable arithmetically cl...
JSYML
2007
13 years 7 months ago
2007
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 De (A) has degree d. It follo...