28 search results - page 4 / 6 » apal 2005 |
APAL
2005
13 years 5 months 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...
APAL
2005
13 years 5 months ago
2005
We give the precise correspondence between polarized linear logic and polarized classical logic. The properties of focalization and reversion of linear proofs are at the heart of ...
APAL
2005
13 years 5 months 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...
APAL
2005
13 years 5 months 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
13 years 5 months ago
2005
We study the minimal enumeration degree (e-degree) problem in models of fragments of Peano arithmetic (PA) and prove the following results: In any model M of 2 induction, there is ...