Searching for "First-Order Definability in Modal Logic." – sorted by Relevance.
-
Resolution is a Decision Procedure for Many Propositional Modal Logics
- \Sigma iff \Pi f (\Sigma) ! \Pi f (') is a theorem in second-order logic. For first-order definable modal
- Cited by 13 (4 self) – Add To MetaCart
-
Mechanised Reasoning and Model Generation for Extended Modal Logics
- approach is generic, it can handle firstorder modal logics, undecidable (first-order definable) modal
- Cited by 5 (3 self) – Add To MetaCart
-
System Description: The Tableaux Work Bench. Can be found at: http://csl.anu.edu.au/ abate/twb
- first-order definable logic, a priori, it gives a decision procedure only for the ones that fall
- Cited by 3 (1 self) – Add To MetaCart
-
Normal Multimodal Logics With Interaction Axioms: A Tableau Calculus and Some (Un
- is first-order definable because it can be characterized by a class of Kripke structures that satisfy some
- Cited by 13 (6 self) – Add To MetaCart
-
First-order resolution methods for modal logics
- background theory is defined as expected. The standard interpretation of (first-order definable) modal logics
- Cited by 2 (2 self) – Add To MetaCart
-
15 Binary Logics, Orthologics and their Relations to Normal Modal Logics Yutaka Miyazaki
- contrast to first order definability in modal logics, where the irreflexivity of a Kripke frame can
- Add To MetaCart

