Sciweavers

45 search results - page 4 / 9
» apal 2010
Sort
View
APAL
2010
67views more  APAL 2010»
13 years 5 months ago
Projective mad families
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.
Sy-David Friedman, Lyubomyr Zdomskyy
APAL
2010
117views more  APAL 2010»
13 years 5 months ago
The complexity of temporal logic over the reals
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 ...
M. Reynolds
APAL
2010
93views more  APAL 2010»
13 years 5 months ago
Edge distribution and density in the characteristic sequence
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...
M. E. Malliaris
APAL
2010
79views more  APAL 2010»
13 years 5 months ago
On lovely pairs of geometric structures
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...
Alexander Berenstein, Evgueni Vassiliev
APAL
2010
97views more  APAL 2010»
13 years 5 months ago
Beyond Borel-amenability: Scales and superamenable reducibilities
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...
L. Motto Ros