2 search results - page 1 / 1 » A P-Time Completeness Proof for Light Logics |
94
Voted
CSL
1999
Springer
15 years 7 hour ago
1999
Springer
We explain why the original proofs of P-Time completeness for Light Affine Logic and Light Linear Logic can not work, and we fully develop a working one.
90
Voted
APAL
1999
15 years 17 hour 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...