APAL
2010
13 years 5 months ago
2010
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...
APAL
2010
13 years 5 months ago
2010
This paper provides a sound and complete proof system for a language Le+Y that adds to Dynamic Epistemic Logic (DEL) a discrete previous-time operator as well as single symbol for...
APAL
2010
13 years 5 months ago
2010
Let C() denote the class of all cardinal sequences of length associated with compact scattered spaces. Also put C() = {f C() : f(0) = = min[f() : < ]}. If is a cardinal an...
APAL
2010
13 years 5 months ago
2010
We investigate computability theoretic and topological properties of spaces of orders on computable orderable groups. A left order on a group G is a linear order of the domain of ...
APAL
2010
13 years 5 months ago
2010
We obtain very strong coloring theorems at successors of singular cardinals from failures of certain instances of simultaneous reflection of stationary sets. In particular, the sim...
APAL
2010
13 years 5 months ago
2010
It is shown that every locally countable upper semi-lattice of cardinality continuum can be embedded into the Turing degrees, assuming Martin's Axiom.
APAL
2010
13 years 5 months ago
2010
Abstract. We develop a general algebraic and proof-theoretic study of substructural logics that may lack associativity, along with other structural rules. Our study extends existin...
14
Voted
APAL
2010
13 years 5 months ago
2010
We upgrade the light Dialectica interpretation [6] by adding two more light universal quantifiers, which are both semi-computational and semi-uniform and complement each other. An...
APAL
2010
13 years 5 months ago
2010
A real x is 1 1-Kurtz random (1 1-Kurtz random) if it is in no closed null 1 1 set (1 1 set). We show that there is a cone of 1 1-Kurtz random hyperdegrees. We characterize lowness...
APAL
2010
13 years 5 months ago
2010
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...