451 search results - page 10 / 91 » Relationless Completeness and Separations |
145
click to vote
WADS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
101
click to vote
CCA
2009
Springer
15 years 6 months ago
2009
Springer
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...
115
click to vote
LFCS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. In order to verify programs with pointer variables, we introduce a temporal logic LTLmem whose underlying assertion language is the quantifier-free fragment of separatio...
EJC
2007
14 years 12 months ago
2007
We sharpen a result of Hansel on separating set systems. We also extend a theorem of Spencer on completely separating systems by proving an analogue of Hansel’s result.
MSS
2008
IEEE
14 years 12 months ago
2008
IEEE
Topological separability is crucial for the utility representation of a complete preference relation. When preferences are incomplete, this axiom has suitably de...ned counterpart...