Sciweavers

APAL
2010
117views more  APAL 2010»
13 years 3 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
78views more  APAL 2010»
13 years 3 months ago
Extending and interpreting Post's programme
Computability theory concerns information with a causal
S. Barry Cooper
APAL
2010
68views more  APAL 2010»
13 years 3 months ago
Cardinal characteristics and projective wellorders
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 ...
Vera Fischer, Sy-David Friedman
APAL
2010
83views more  APAL 2010»
13 years 3 months ago
Truth in generic cuts
In an earlier paper (MLQ 54, 128
Richard Kaye, Tin Lok Wong
APAL
2010
124views more  APAL 2010»
13 years 3 months ago
The effective theory of Borel equivalence relations
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...
Ekaterina B. Fokina, Sy-David Friedman, Asger T&ou...
APAL
2010
79views more  APAL 2010»
13 years 3 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
85views more  APAL 2010»
13 years 3 months ago
Elementary differences between the degrees of unsolvability and degrees of compressibility
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 ...
George Barmpalias
APAL
2010
111views more  APAL 2010»
13 years 3 months ago
Resource modalities in tensor logic
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...
Paul-André Melliès, Nicolas Tabareau
APAL
2010
115views more  APAL 2010»
13 years 3 months ago
Kripke semantics for provability logic GLP
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...
Lev D. Beklemishev
APAL
2010
75views more  APAL 2010»
13 years 3 months ago
Global singularization and the failure of SCH
We say that is
Radek Honzik