1391 search results - page 55 / 279 » Completeness of Neighbourhood Logic |
APAL
2010
13 years 9 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...
TABLEAUX
2009
Springer
14 years 3 months ago
2009
Springer
We see cut-free sequent systems for the basic normal modal logics formed by any combination the axioms d, t, b, 4, 5. These systems are modular in the sense that each axiom has a c...
ICLP
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. We extend Clark’s definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generaliz...
LICS
1990
IEEE
14 years 1 months ago
1990
IEEE
Reasoning about permissions and obligations sometimes requires to distinguish more than one level of permission: certain actions are preferable to others, or one has more confiden...
TPHOL
2009
IEEE
14 years 3 months ago
2009
IEEE
ion and equality to base types but retains lambda abstractions and higher-order variables. We show that this fragment enjoys the characteristic properties of first-order logic: co...