Abstract
Justification logics are propositional modal-like logics that instead of statements A is known include statements of the form A is known for reason t where the term t can represent an informal justification for A or a formal proof of A. In our present work, we introduce model-theoretic tools, namely: filtrations and a certain form of generated submodels, in the context of justification logic in order to obtain decidability results. Apart from reproving already known results in a uniform way, we also prove new results. In particular, we use our submodel construction to establish decidability for a justification logic with common knowledge for which so far no decidability proof was available.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Artemov, S.N.: Operational modal logic. Tech. Rep. MSI 95–29, Cornell University (December 1995)
Artemov, S.N.: Explicit provability and constructive semantics. Bulletin of Symbolic Logic 7(1), 1–36 (2001)
Artemov, S.N.: The logic of justification. The Review of Symbolic Logic 1(4), 477–513 (2008)
Artemov, S.N., Fitting, M.: Justification logic. In: Zalta, E.N. (ed.) The Stanford Encyclopedia of Philosophy. Fall 2011 edn. (2011), http://plato.stanford.edu/archives/fall2011/entries/logic-justification/
Artemov, S.N., Kuznets, R.: Logical omniscience as a computational complexity problem. In: Heifetz, A. (ed.) Proceedings of the Twelfth Conference on Theoretical Aspects of Rationality and Knowledge, TARK 2009, July 6-8, pp. 14–23. ACM, Stanford University (2009)
Blackburn, P., Rijke, M., Venema, Y.: Modal logic. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press (2002)
Brünnler, K., Goetschi, R., Kuznets, R.: A syntactic realization theorem for justification logics. In: Beklemishev, L.D., Goranko, V., Shehtman, V. (eds.) Advances in Modal Logic, vol. 8, pp. 39–58. College Publications (2010)
Bucheli, S., Kuznets, R., Renne, B., Sack, J., Studer, T.: Justified belief change. In: Arrazola, X., Ponte, M. (eds.) LogKCA 2010, Proceedings of the Second ILCLI International Workshop on Logic and Philosophy of Knowledge, Communication and Action, pp. 135–155. University of the Basque Country Press (2010)
Bucheli, S., Kuznets, R., Studer, T.: Justifications for common knowledge. Journal of Applied Non-Classical Logics 21(1), 35–60 (2011)
Bucheli, S., Kuznets, R., Studer, T.: Partial Realization in Dynamic Justification Logic. In: Beklemishev, L.D., de Queiroz, R. (eds.) WoLLIC 2011. LNCS, vol. 6642, pp. 35–51. Springer, Heidelberg (2011)
Fitting, M.: The logic of proofs, semantically. Annals of Pure and Applied Logic 132(1), 1–25 (2005)
Kuznets, R.: On the Complexity of Explicit Modal Logics. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol. 1862, pp. 371–383. Springer, Heidelberg (2000)
Kuznets, R.: Complexity Issues in Justification Logic. Ph.D. thesis, CUNY Graduate Center (May 2008), http://gradworks.umi.com/33/10/3310747.html
Kuznets, R.: Self-referential justifications in epistemic logic. Theory of Computing Systems 46(4), 636–661 (2010)
Lemmon, E.J., Scott, D.S.: An Introduction to Modal Logic. B. Blackwell, Oxford (1977)
Mkrtychev, A.: Models for the Logic of Proofs. In: Adian, S., Nerode, A. (eds.) LFCS 1997. LNCS, vol. 1234, pp. 266–275. Springer, Heidelberg (1997)
Pacuit, E.: A note on some explicit modal logics. In: Proceedings of the 5th Panhellenic Logic Symposium, July 25-28, pp. 117–125. University of Athens, Athens (2005)
Post, E.L.: Recursively enumerable sets of positive integers and their decision problems. Bull. Am. Math. Soc. 50, 284–316 (1944)
Segerberg, K.: An Essay in Classical Modal Logic. Uppsala,Filosofiska Föreningen Och Filosofiska Institutionen Vid Uppsala Universitet (1971)
Studer, T.: Decidability for some justification logics with negative introspection. Journal of Symbolic Logic (to appear), http://www.iam.unibe.ch/~tstuder/papers/J5_Decidability.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bucheli, S., Kuznets, R., Studer, T. (2013). Decidability for Justification Logics Revisited. In: Bezhanishvili, G., Löbner, S., Marra, V., Richter, F. (eds) Logic, Language, and Computation. TbiLLC 2011. Lecture Notes in Computer Science, vol 7758. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36976-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-36976-6_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36975-9
Online ISBN: 978-3-642-36976-6
eBook Packages: Computer ScienceComputer Science (R0)