From Classical to Normal Modal Logics ?
نویسندگان
چکیده
Classical modal logics generally neither possess the neces-sitation rule nor the K-axiom. Their semantics being in terms of minimal models, several specialisations of these have been given such as augmented minimal models, models with queer worlds or models with inaccessible worlds. In this paper we exhibit exact translations from these families into normal multi-modal logics. Such translations allow to reuse the proof systems that have been developed for the latter.
منابع مشابه
A Tableau Compiled Labelled Deductive System for Hybrid Logic
Compiled Labelled Deductive Systems (CLDS) provide a uniform logical framework where families of different logics can be given a uniform proof system and semantics. A variety of applications of this framework have been proposed so far ranging from extensions of classical logics (e.g. normal modal logics and multi-modal logics) to non-classical logics such as resource and substructural loogics. ...
متن کاملTHE LATTICE OF BELNAPIAN MODAL LOGICS: Special Extensions and Counterparts
Let K be the least normal modal logic and BK its Belnapian version, which enriches K with ‘strong negation’. We carry out a systematic study of the lattice of logics containing BK based on: • introducing the classes (or rather sublattices) of so-called explosive, complete and classical Belnapian modal logics; • assigning to every normal modal logic three special conservative extensions in these...
متن کاملCoinductive models and normal forms for modal logics (or how we learned to stop worrying and love coinduction)
We present a coinductive definition of models for modal logics and show that it provides a homogeneous framework in which it is possible to include different modal languages ranging from classical modalities to operators from hybrid and memory logics. Moreover, results that had to be proved separately for each different language –but whose proofs were known to be mere routine– now can be proved...
متن کاملLabelled Model Modal Logic
1 Introduction There is no agreement among researchers in the area of automated deduction about which features (besides computational efficiency) a suitable theorem proving system for non-classical (in particular modal) logics should have. In our opinion, such a system should (A) avoid ad hoc manipulation of the modal formulas; (B) provide a simple and uniform treatment of a wide variety of mod...
متن کاملSubstructural epistemic logics
In many common epistemic scenarios, the warrant provided by the body of evidence available to an agent does not seem to be closed under classical consequence. It may be the case that evidence gathered during a criminal investigation provides inconsistent information without thereby supporting the existence of extraterrestrials. It may be the case that an agent has gathered enough evidence to se...
متن کامل