Abstract
In a narrow sense, modal logic is a logic obtained from the classical logic by endowing it with unary propositional operations intuitively corresponding to ‘it is necessary that’ and ‘it is possible that’. These operations are intensional, i.e., the truth of a formula built with the operation does not depend only on the truth of the subformula to which the operation is applied but also on a relevant state or a situation in which the truth is considered. A development of the semantics of modal logics in terms of a relational structure of states is due to Stig Kanger [Kan57] and Saul Kripke [Kri63]. Algebraic semantics of these standard modal logics is provided by Boolean algebras with normal and additive operations [JT52]. Since the origin of Kripke semantics, intensional logics have been introduced to computer science as an important tool for its formal methods.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media B.V.
About this chapter
Cite this chapter
Orłowska, E., Golińska-Pilarek, J. (2011). Dual Tableaux for Classical Modal Logics. In: Dual Tableaux: Foundations, Methodology, Case Studies. Trends in Logic, vol 33. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-0005-5_7
Download citation
DOI: https://doi.org/10.1007/978-94-007-0005-5_7
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-0004-8
Online ISBN: 978-94-007-0005-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)