45 search results - page 4 / 9 » apal 2010 |
APAL
2010
15 years 18 hour ago
2010
Using almost disjoint coding we prove the consistency of the existence of a 1 2 definable -mad family of infinite subsets of (resp. functions from to ) together with b = 2 = 2.
APAL
2010
15 years 18 hour ago
2010
It is shown that the decision problem for the temporal logic with until and since connectives over real-numbers time is PSPACE-complete. This is the most practically useful dense ...
APAL
2010
15 years 18 hour ago
2010
The characteristic sequence of hypergraphs Pn : n < associated to a formula (x; y), introduced in [5], is defined by Pn(y1, . . . yn) = (x) in (x; yi). We continue the study o...
APAL
2010
15 years 18 hour ago
2010
We study the theory of lovely pairs of geometric structures, in particular o-minimal structures. We characterize "linear" theories in terms of properties of the correspon...
APAL
2010
15 years 18 hour ago
2010
We analyze the degree-structure induced by large reducibilities under the Axiom of Determinacy. This generalizes the analysis of Borel reducibilities given in [1], [6] and [5] e.g...