148 search results - page 21 / 30 » apal 2007 |
92
Voted
APAL
1999
15 years 6 days ago
1999
We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...
81
Voted
APAL
1999
15 years 6 days ago
1999
We describe a new way to construct large subdirectly irreducibles within an equational class of algebras. We use this construction to show that there are forbidden geometries of m...
APAL
2005
15 years 13 days 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 ...
98
Voted
APAL
1999
15 years 6 days ago
1999
The present paper investigates the groups of automorphisms for some lattices of modal logics. The main results are the following. The lattice of normal extensions of S4.3, NExt S4....
101
Voted
APAL
1998
15 years 7 days ago
1998
We consider the computably enumerable sets under the relation of Qreducibility. We first give several results comparing the upper semilattice of c.e. Q-degrees, RQ, ≤Q , under ...