148 search results - page 9 / 30 » apal 2007 |
136
click to vote
APAL
2006
15 years 4 months ago
2006
Abstract. We show that the identity bounded Turing degrees of computably enumerable sets are not dense.
128
click to vote
APAL
2006
15 years 4 months ago
2006
Given any subset A of 1 there is a proper partial order which forces that the predicate x A and the predicate x 1\A can be expressed by ZFC
118
click to vote
APAL
2006
15 years 4 months ago
2006
ence in Finitary Abstract Elementary Classes Tapani Hyttinen and Meeri Kes
121
click to vote
APAL
2004
15 years 4 months ago
2004
Gaifman's normal form theorem showed that every first order sentence of quantifier rank n is equivalent to a Boolean combination of "scattered local sentences", whe...
112
click to vote
APAL
2004
15 years 4 months ago
2004
We investigate the initial segment complexity of random reals. Let K( ) denote pre