95 search results - page 1 / 19 » On Notions of Completeness Weaker than Kripke Completeness |
AIML
2004
13 years 6 months ago
2004
We are going to show that the standard notion of Kripke completeness is the strongest one among many provably distinct algebraically motivated completeness properties, some of whic...
APAL
2010
13 years 5 months ago
2010
We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cut-free completeness. We discuss the meaning of the new notion and its a...
ECCC
2002
13 years 4 months ago
2002
We prove that if for some > 0, NP contains a set that is DTIME(2n )-bi-immune, then NP contains a set that is 2-Turing complete for NP (hence 3-truth-table complete) but not 1-t...
CCS
2009
ACM
13 years 2 months ago
2009
ACM
Privacy of RFID systems is receiving increasing attention in the RFID community. Basically, there are two kinds of RFID privacy notions: one based on the indistinguishability of t...
TABLEAUX
2007
Springer
13 years 11 months ago
2007
Springer
Subintuitionistic logics are a class of logics defined by using Kripke models with more general conditions than those for intuitionistic logic. In this paper we study predicate lo...