Sciweavers

68 search results - page 1 / 14
» Canonicity and Completeness Results for Many-Valued Modal Lo...
Sort
View
JANCL
2002
113views more  JANCL 2002»
13 years 4 months ago
Canonicity and Completeness Results for Many-Valued Modal Logics
We prove frame determination results for the family of many-valued modal logics introduced by M. Fitting in the early '90s. Each modal language of this family is based on a H...
Costas D. Koutras, Christos Nomikos, Pavlos Peppas
LFCS
1992
Springer
13 years 8 months ago
Many-Valued Non-Monotonic Modal Logics
Among non-monotonic systems of reasoning, non-monotonic modal logics, and autoepistemic logic in particular, have had considerable success. The presence of explicit modal operator...
Melvin Fitting
STACS
2009
Springer
13 years 11 months ago
Strong Completeness of Coalgebraic Modal Logics
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...
Lutz Schröder, Dirk Pattinson
JANCL
2008
170views more  JANCL 2008»
13 years 4 months ago
Algorithmic correspondence and completeness in modal logic
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
Willem Conradie, Valentin Goranko
JAPLL
2010
131views more  JAPLL 2010»
13 years 3 months ago
Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
The previously introduced algorithm SQEMA computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend SQEMA with an additional rule...
Willem Conradie, Valentin Goranko, Dimiter Vakarel...