Epistemic and doxastic logic with restrictions
Main Article Content
Keywords
multi–modal logic, possible worlds embedded, epistemic logic, doxastic logic, logical omniscience.
Abstract
Are presented as extensions of classical propositional calculus hierarchies of deductive systems LDR–n and LER–n with n > 1. LER–n is the epistemic logic with restrictions, LDR–n is the doxastic logic with restrictions. The systems LER–1 and LDR–1 are the classical propositional calculus. System LER–(n + 1) can be seen as the result of applying the rule: if X is theorem of LER–n then +X is theorem of LER–(n + 1). Systems also restricts the validity of the axioms +(X → Y ) → (+X → +Y ) and +X → X, in terms of depth (complexity with respect to the operator +) of X and Y , and also includes restricted versions of the axioms of positive and negative introspection. LER system results from the union of LER–n systems, and can be seen as the S5 modal logic system with different types of restrictions. Changing +X → X by +X →∼+∼X are built LDR–n and the LDR systems. LDR can be seen as the KD45 modal logic system with different types of restrictions. The systems are characterized with a embedded worlds semantics, with which the ‘omniscience logical problem’ is limited.
MSC: 03B42, 03B45
Downloads
References
[2] Saul A. Kripke. Semantical analysis of modal logic. Zeitschrift f¨ur mathematische Logik und Grundlagen der Mathematik, ISSN 0044–3050, 9, 1963.
[3] Jaakko Hintikka. Impossible possible worlds vindicated. Journal of Philosophical Logic, ISSN 0022–3611, 4(3), 475–484 (1975).
[4] Kwang Mong Sim. Epistemic logic and logical omniscience: a survey. International journal of intelligent systems, ISSN 0884–8173, 12, 57–81 (1997).
[5] Max J. Cresswell. Logics and languages, ISBN 0416769500. Egmont Childrens Books, 1973.
[6] Nicholas Rescher and Robert Brandon. The logic of inconsistency, ISBN 0631115811. Rowman and Littlefield, 1979.
[7] Hector J. Levesque. A logic of implicit and explicit belief , En Proceedings of National Conference on Artificial Intelligence, ISBN 978–0865760806, 198–202 (1984).
[8] Ross Anderson and Nuel Belnap. Entailment: The Logic of Relevance and Necessity, ISBN 978–0691071923. Princeton University Press, 1, 1990.
[9] Gerhard Lakemeyer. Tractable meta–reasoning in propositional logics of belief. En Proceedings of the 10th international joint conference on Artificial intelligence, 1, 402–408 (1987).
[10] Ronald Fagin and Joseph Halpern. Belief, awareness and limited reasoning. Artificial Intelligence, ISSN 0004–3702, 34(1), 1987.
[11] Marco Schaerf and Marco Cadoli. Tractable reasoning via approximation. Artificial Intelligence, ISSN 0004–3702, 74(2), 249–310 (1995).
[12] Marcelo Finger and Renata Wassermann. Logics for approximate reasoning: Approximating classical logic “from above”. En Brazilian Symposium on Artificial Intelligence, ISBN 3–540–00124–7, 2507, 21–30 (2002).
[13] Guilherme Rabelloa and Marcelo Finger. Approximations of Modal Logics: K and beyond. Annals of Pure and Applied Logic, ISSN 0168–0072, 152, 2008.
[14] Kurt Konolige. A Deduction Model of belief (Research notes in artificial intelligence), ISBN 0934613087. Morgan Kaufmann Publishers Inc, San Francisco, CA, USA , 1986.
[15] Dov Gabbay and John Woods. Handbook of the History of Logic, 7, Logic and the Modalities in the Twentieth Century, ISBN 9780444516220. Elsevier, 2006.
[16] Manuel Sierra. Sistemas multi–modales de profundidad restringida. Ingeniería y Ciencia, ISSN 1794–9165, 4(8), 175–202 (2008).
[17] Walter Carnielli and Claudio Pizzi. Modalities and multimodalities, ISBN 9781402085895. Springer, 2008.
[18] Leon Henkin. The completeness of the first order functional calculus. The journal of symbolic logic, ISSN 0022–4812, 14(3), 159–166 (1949).
[19] David Kaplan. Review: Saul A. Kripke, Semantical Analysis of Modal Logic I. Normal Modal Propositional Calculi . The journal of symbolic logic, ISSN 0022– 4812, 31(1), 120–122 (1966).
[20] Brian F. Chellas.Modal logic: an introduction, ISBN 978–0521295154.Cambridge University Press, Cambridge, 1980.