3353 search results - page 159 / 671 » Laver and set theory |
156
click to vote
DC
2000
15 years 6 months ago
2000
ms, to use abstraction mappings to prove probabilistic properties, and to apply random walk theory in a distributed computational setting. We apply all of these techniques to analy...
134
click to vote
APAL
1999
15 years 6 months ago
1999
We provide here the first steps toward a Classification Theory of Elementary Classes with no maximal models, plus some mild set theoretical assumptions, when the class is categori...
128
click to vote
JSYML
2002
15 years 6 months ago
2002
A nonstandard set theory ZFC is proposed that axiomatizes the nonstandard embedding . Besides the usual principles of nonstandard analysis, all axioms of ZFC except regularity are...
147
click to vote
NA
2007
15 years 6 months ago
2007
GC-sets are subsets T of Rd of cardinality dim Πn for which, for each τ ∈ T, there are n hyperplanes whose union contains all of T except for τ, thus making interpolation to a...
186
click to vote
CONCUR
2009
Springer
15 years 4 months ago
2009
Springer
Convergence is often the key liveness property for distributed systems that interact with physical processes. Techniques for proving convergence (asymptotic stability) have been ex...