APAL
2010
13 years 11 months 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
13 years 11 months ago
2010
Computability theory concerns information with a causal
APAL
2010
13 years 11 months ago
2010
Using countable support iterations of S -proper posets, we show that the existence of a 1 3 definable wellorder of the reals is consistent with each of the following: d < c, b ...
APAL
2010
13 years 11 months ago
2010
In an earlier paper (MLQ 54, 128
APAL
2010
13 years 11 months ago
2010
The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver ([19]) and Harrington-K...
APAL
2010
13 years 11 months 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
13 years 11 months ago
2010
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
APAL
2010
13 years 11 months ago
2010
The description of resources in game semantics has never achieved the simplicity and precision of linear logic, because of the misleading conception that linear logic is more prim...
APAL
2010
13 years 11 months ago
2010
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
APAL
2010
13 years 11 months ago
2010
We say that is