Sciweavers

Share
LICS
2012
IEEE
8 years 25 days ago
Countermodels from Sequent Calculi in Multi-Modal Logics
—A novel countermodel-producing decision procedure that applies to several multi-modal logics, both intuitionistic and classical, is presented. Based on backwards search in label...
Deepak Garg, Valerio Genovese, Sara Negri
CALCO
2011
Springer
235views Mathematics» more  CALCO 2011»
8 years 10 months ago
On the Fusion of Coalgebraic Logics
Fusion is arguably the simplest way to combine modal logics. For normal modal logics with Kripke semantics, many properties such as completeness and decidability are known to trans...
Fredrik Dahlqvist, Dirk Pattinson
ATAL
2011
Springer
8 years 10 months ago
Reasoning about local properties in modal logic
In modal logic, when adding a syntactic property to an axiomatisation, this property will semantically become true in all models, in all situations, under all circumstances. For i...
Hans P. van Ditmarsch, Wiebe van der Hoek, Barteld...
CORR
2011
Springer
151views Education» more  CORR 2011»
9 years 2 months ago
A New Representation Theorem for Many-valued Modal Logics
We propose a new definition of the representation theorem for many-valued logics, with modal operators as well, and define the stronger relationship between algebraic models of ...
Zoran Majkic
IGPL
2010
156views more  IGPL 2010»
9 years 9 months ago
Fusion of sequent modal logic systems labelled with truth values
Fusion is a well-known form of combining normal modal logics endowed with a Hilbert calculi and a Kripke semantics. Herein, fusion is studied over logic systems using sequent calc...
João Rasga, Karina Roggia, Cristina Sernada...
SLOGICA
1998
128views more  SLOGICA 1998»
9 years 10 months ago
Encoding Modal Logics in Logical Frameworks
We present and discuss various formalizations of Modal Logics in Logical Frameworks based on Type Theories. We consider both Hilbert- and Natural Deductionstyle proof systems for ...
Arnon Avron, Furio Honsell, Marino Miculan, Cristi...
NDJFL
2002
83views more  NDJFL 2002»
9 years 10 months ago
Shortest Axiomatizations of Implicational S4 and S5
Shortest possible axiomatizations for the implicational fragments of the modal logics S4 and S5 are reported. Among these axiomatizations is included a shortest single axiom for im...
Zachary Ernst, Branden Fitelson, Kenneth Harris, L...
MLQ
2000
88views more  MLQ 2000»
9 years 10 months ago
Logics of Complementarity in Information Systems
: Each information system (or data table) leads to a hierarchy of binary relations on the object set in a natural way; these relational systems can serve as frames for the semantic...
Ivo Düntsch, Ewa Orlowska
LOGCOM
2000
93views more  LOGCOM 2000»
9 years 10 months ago
The product of converse PDL and polymodal K
The product of two modal logics L1 and L2 is the modal logic determined by the class of frames of the form FG such that F and G validate L1 and L2, respectively. This paper proves...
Frank Wolter
FUIN
2000
115views more  FUIN 2000»
9 years 10 months ago
Constructing the Least Models for Positive Modal Logic Programs
We give algorithms to construct the least L-model for a given positive modal logic program P, where L can be one of the modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. If L...
Linh Anh Nguyen
books