148 search results - page 19 / 30 » apal 2007 |
APAL
2005
15 years 13 days ago
2005
We prove that S4 is complete with respect to Boolean combinations of countable unions of convex subsets of the real line, thus strengthening a 1944 result of McKinsey and Tarski (...
87
Voted
APAL
2005
15 years 13 days ago
2005
We prove a full completeness theorem for multiplicative-additive linear logic (i.e. MALL) using a double gluing construction applied to Ehrhard's -autonomous category of hype...
APAL
2005
15 years 13 days ago
2005
We investigate operators which take a set X to a set relatively computably enumerable in and above X by studying which such sets X can be so mapped into the Turing degree of K. We...
69
Voted
APAL
2005
15 years 13 days ago
2005
Let A [] be a maximal almost disjoint family and assume P is a forcing notion. Say A is P-indestructible if A is still maximal in any P-generic extension. We investigate P-indest...
49
Voted
APAL
2005
15 years 13 days ago
2005
Abstract. We construct a computable vector space with the trivial computable automorphism group, but with the dependence relations as complicated as possible, measured by their Tur...