81 search results - page 7 / 17 » Approximations of Modal Logic K |
TARK
2005
Springer
14 years 28 days ago
2005
Springer
Fagin, Halpern, Moses, and Vardi have proposed a framework of epistemic agents with multiple “frames of mind” (local-reasoning structures), to solve problems concerning incons...
APAL
2006
13 years 7 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...
MLQ
2002
13 years 7 months ago
2002
A modal logic is called invariant if for all automorphisms of NExt K, () = . An invariant logic is therefore uniquely determined by its surrounding in the lattice. It will be est...
IGPL
2008
13 years 7 months ago
2008
We show that IPC, K4, GL, and S4, as well as all logics inheriting their admissible rules, have independent bases of admissible rules. Key words: admissible rule, independent basi...
AIML
2008
13 years 9 months ago
2008
We generalise some results of [7, 5] and show that if L is an -modal logic (for some ordinal 3) such that (i) L contains the product logic K and (ii) the product of -many trees o...