Classical modal logic: Difference between revisions

Content deleted Content added
No edit summary
sorry, I have to revert again; Botterweg14 undid your changes using a sound argument; this needs to be discussed further on the template's talk page
 
(5 intermediate revisions by 4 users not shown)
Line 3:
In [[modal logic]], a '''classical modal logic''' '''L''' is any modal logic containing (as axiom or theorem) the [[duality (mathematics)|duality]] of the modal operators
 
:<math>\Diamond A \leftrightarrow \lnot\Box\lnot A</math>
 
that is also [[Deductive closure|closed]] under the rule
 
:<math>\frac{ A \leftrightarrow B }{\Box A\leftrightarrow \Box B}.</math>
 
Alternatively, one can give a dual definition of '''L''' by which '''L''' is classical [[if and only if]] it contains (as axiom or theorem)
 
:<math>\Box A \leftrightarrow \lnot\Diamond\lnot A</math>
 
and is closed under the rule
 
:<math>\frac{ A \leftrightarrow B }{\Diamond A\leftrightarrow \Diamond B}.</math>
 
The weakest classical system is sometimes referred to as '''E''' and is [[normal modal logic|non-normal]]. Both [[algebraic semantics (mathematical logic)|algebraic]] and [[neighborhood semantics]] characterize familiar classical modal systems that are weaker than the weakest normal modal logic '''K'''.
Line 23:
==References==
{{reflist}}
* Chellas, Brian. ''[https://books.google.com/books?hl=en&lr=&id=YupiXWV5j6cC&oi=fnd&pg=PR7&dqq=%22Modal22Classical+Logic:modal+An+Introductionlogic%22+chellas&otspg=0_wSpNFhE2&sig=E_wvBZnIl7EhESS32sa1EbCuznU#v=onepage&q=%22Classical%20modal%20logic%22&f=falsePR7 Modal Logic: An Introduction]''. Cambridge University Press, 1980.
 
{{DEFAULTSORT:Classical Modal Logic}}
[[Category:Modal logic]]
 
 
{{logic-stub}}