53 search results - page 1 / 11 » Frege systems for extensible modal logics |
APAL
2006
13 years 4 months ago
2006
By a well-known result of Cook and Reckhow [4, 12], all Frege systems for the Classical Propositional Calculus (CPC) are polynomially equivalent. Mints and Kojevnikov [11] have re...
ICLP
2004
Springer
13 years 10 months ago
2004
Springer
We introduce our implemented modal logic programming system MProlog. This system is written in Prolog as a module for Prolog. Codes, libraries, and most features of Prolog can be u...
CORR
2011
Springer
12 years 8 months ago
2011
Springer
Contemporary use of the term ’intension’ derives from the traditional logical Frege-Russell’s doctrine that an idea (logic formula) has both an extension and an intension. Al...
FROCOS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We investigate the extension of modal logics by bisimulation quantifiers and present a class of modal logics which is decidable when augmented with bisimulation quanti...
AAAI
1990
13 years 5 months ago
1990
Recently, conditional logics have been developed for application to problems in default reasoning. We present a uniform framework for the development and investigation of conditio...