APAL
2006
13 years 11 months ago
2006
This paper studies the complexity of behavior of multi-agent systems. Behavior properties are formulated using classical temporal logic languages and are checked with respect to t...
APAL
2006
13 years 11 months ago
2006
APAL
2006
13 years 11 months ago
2006
We present a technique for destroying stationary subsets of P+ using partial square sequences. We combine this method with Gitik's poset for changing the cofinality of a cardi...
APAL
2006
13 years 11 months ago
2006
Abstract. We show that the identity bounded Turing degrees of computably enumerable sets are not dense.
APAL
2006
13 years 11 months ago
2006
If a locale is presented by a "flat site", it is shown how its frame can be presented by generators and relations as a dcpo. A necessary and sufficient condition is deri...
APAL
2006
13 years 11 months ago
2006
This paper uses the locale theory approach to topology. Two descriptions are given of all locale limits, the first description using suplattice constructions and the second prefra...
APAL
2006
13 years 11 months ago
2006
For a long time people have been trying to develop probability theory starting from `finite' events rather than collections of infinite events. In this way one can find natura...
APAL
2006
13 years 11 months ago
2006
Parameterized complexity has, so far, been largely con ned to consideration of computational problems as decision or search problems. However, it is becoming evident that the param...
APAL
2006
13 years 11 months ago
2006
APAL
2006
13 years 11 months ago
2006
