Skip to main content
SpringerLink
Log in

Display Calculi for Logics with Relative Accessibility Relations

  • Published:
Journal of Logic, Language and Information Aims and scope Submit manuscript

Abstract

We define cut-free display calculi for knowledge logics wherean indiscernibility relation is associated to each set of agents, andwhere agents decide the membership of objects using thisindiscernibility relation. To do so, we first translate the knowledgelogics into polymodal logics axiomatised by primitive axioms and thenuse Kracht's results on properly displayable logics to define thedisplay calculi. Apart from these technical results, we argue thatDisplay Logic is a natural framework to define cut-free calculi for manyother logics with relative accessibility relations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Aumann, R., 1976, “Agreeing to disagree,” Annals of Statistics 4(3), 1236-1239.

    Google Scholar 

  • Balbiani, Ph., 1997, “Axiomatization of logics based on Kripke models with relative accessibility relations,” pp. 553-578 in Incomplete Information: Rough Set Analysis, E. Orlowska, ed., Heidelberg: Physica-Verlag.

    Google Scholar 

  • Balbiani, Ph. and Orlowska, E., 1999, “A hierarchy of modal logics with relative accessibility relations,” Journal of Applied Non-Classical Logics, Special Issue in the Memory of George Gargov, to appear.

  • Belnap, N., 1982, “Display logic,” Journal of Philosophical Logic 11, 375-417.

    Google Scholar 

  • Dawson, J. and Goré, R., 1998, “A mechanised proof system for relation algebra using display logic,” pp. 264-278 in JELIA'98, J. Dix, L. Fariñas del Cerro, and U. Furbach, eds., Lecture Notes in Artificial Intelligence, Vol. 1489, Berlin: Springer-Verlag.

    Google Scholar 

  • Demri, S., 1998, “A class of decidable information logics,” Theoretical Computer Science 195(1), 33-60.

    Google Scholar 

  • Demri, S., 1999, “A logic with relative knowledge operators,” Journal of Logic, Language and Information 8(2), 167-185.

    Google Scholar 

  • Demri, S. and Goré, R., 1998, “Cut-free display calculi for nominal tense logics,” Technical Report TR-ARP-07-98, Automated Reasoning Project, Australian National University.

  • Demri, S. and Konikowska, B., 1998, “Relative similarity logics are decidable: Reduction to FO2 with equality,” pp. 279-293 in JELIA'98, J. Dix, L. Fariñas del Cerro, and U. Furbach, eds., Lecture Notes in Artificial Intelligence, Vol. 1489, Berlin: Springer-Verlag.

    Google Scholar 

  • Fagin, R., Halpern, J., Moses, Y., and Vardi, M., 1995, Reasoning about Knowledge, Cambridge, MA: The MIT Press.

    Google Scholar 

  • Fariñas del Cerro, L. and Orłowska, E., 1985, “DAL-A logic for data analysis,” Theoretical Computer Science 36, 251-264.

    Google Scholar 

  • Gabbay, D., 1996, Labelled Deductive Systems, Oxford: Oxford University Press.

    Google Scholar 

  • Gargov, G., 1986, “Two completeness theorems in the logic for data analysis,” Technical Report 581, ICS, Polish Academy of Sciences, Warsaw, 1986.

    Google Scholar 

  • Goldblatt, R. and Thomason, S., 1975, “Axiomatic classes in propositional modal logic,” pp. 163-173 in Algebra and Logic, J. Crossley, ed., Lecture Notes in Mathematics, Vol. 450, Berlin: Springer-Verlag.

    Google Scholar 

  • rpg.

  • Goré, R., 1996, “On the completeness of classical modal display logic,” pp. 137-140 in Proof Theory of Modal Logic, H. Wansing, ed., Dordrecht: Kluwer Academic Publishers.

    Google Scholar 

  • Goré, R., 1997, “Cut-free display calculi for relation algebras,” pp. 198-210 in CSL96, D. van Dalen and M. Bezem, eds., Lecture Notes in Computer Science, Vol. 1258, Berlin: Springer-Verlag.

    Google Scholar 

  • Goré, R., 1998, “Substructural logics on display,” Logic Journal of the IGPL 6(3), 451-504.

    Google Scholar 

  • Goranko, V. and Passy, S., 1992, “Using the universal modality: gains and questions,” Journal of Logic and Computation 2(1), 5-30.

    Google Scholar 

  • Halpern, J., 1987, “Using reasoning about knowledge to analyze distributed systems,” Ann. Rev. Comput. Sci. 2, 37-68.

    Google Scholar 

  • Hemaspaandra, E., 1996, “The price of universality,” Notre Dame Journal of Formal Logic 37(2), 173-203.

    Google Scholar 

  • Hintikka, J., 1962, Knowledge and Belief, London: Cornell University Press.

    Google Scholar 

  • Humberstone, L., 1995, “The logic of non-contingency,” Notre Dame Journal of Formal Logic 36(2), 214-229.

    Google Scholar 

  • Konikowska, B., 1997a, “A logic for reasoning about relative similarity,” Studia Logica 58(1), 185-226.

    Google Scholar 

  • Konikowska, B., 1997b, “A logic for reasoning about similarity,” pp. 462-491 in Incomplete Information: Rough Set Analysis, E. Orlowska, ed., Heidelberg: Physica-Verlag.

    Google Scholar 

  • Kracht, M., 1996, “Power and weakness of the modal display calculus,” pp. 93-121 in Proof Theory of Modal Logic, H. Wansing, ed., Dordrecht: Kluwer Academic Publishers.

    Google Scholar 

  • Kuhn, S., 1995, “Minimal logic of non-contingency,” Notre Dame Journal of Formal Logic 36(2), 230-234.

    Google Scholar 

  • Lemmon, E., 1965, Beginning Logic, London: Chapman and Hall.

    Google Scholar 

  • Mints, G., 1988, “Gentzen-type and resolution rules part I: Propositional logic,” pp. 198-231 in International Conference on Computer Logic, Tallinn, P. Martin-Löf and G. Mints, eds., Lecture Notes in Computer Science, Vol. 417, Berlin: Springer-Verlag.

    Google Scholar 

  • Mints, G., 1997, “Indexed systems of sequents and cut-elimination,” Journal of Philosophical Logic 26(6), 671-696.

    Google Scholar 

  • Montgomery, H. and Routley, R., 1966, “Contingency and non-contingency bases for normal modal logics,” Logique et Analyse 9, 318-328.

    Google Scholar 

  • Orłowska, E., 1988, “Relational interpretation of modal logics,” pp. 443-471 in Algebraic Logic.Colloquia Mathematica Societatis Janos Bolyai 54, H. Andréka, D. Monk, and I. Németi, eds., Amsterdam: North Holland.

    Google Scholar 

  • Orłowska, E., 1989, “Logic for reasoning about knowledge,” Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 35, 559-568.

    Google Scholar 

  • Orłowska, E., 1991, “Relational proof systems for some AI logics,” pp. 33-47 in FAIR'91, Ph. Jorrand and J. Kelemen, eds., Lecture Notes in Artificial Intelligence, Vol. 535, Berlin: Springer-Verlag.

    Google Scholar 

  • Orłowska, E., 1992, “Relational proof system for relevant logics,” The Journal of Symbolic Logic 57(4), 1425-1440.

    Google Scholar 

  • Passy, S. and Tinchev, T., 1991 “An essay in combinatory dynamic logic,” Information and Computation 93, 263-332.

    Google Scholar 

  • Pawlak, Z., 1981, “Information systems theoretical foundations,” Information Systems 6(3), 205-218.

    Google Scholar 

  • Pawlak, Z., 1982, “Rough sets,” International Journal of Information and Computer Sciences 11, 341-356.

    Google Scholar 

  • Restall, G., 1998, “Displaying and deciding substructural logics 1: Logics with contraposition,” Journal of Philosophical Logic 27(2), 179-216.

    Google Scholar 

  • Sahlqvist, H., 1975, “Completeness and correspondence in the first and second order semantics for modal logics,” pp. 110-143 in 3rd Scandinavian Logic Symposium, S. Kanger, ed., Amsterdam: North Holland.

    Google Scholar 

  • Vakarelov, D., 1991, “Modal logics for knowledge representation systems,” Theoretical Computer Science 90, 433-456.

    Google Scholar 

  • Wansing, H., 1994, “Sequent calculi for normal modal propositional logics,” Journal of Logic and Computation 4(2), 125-142.

    Google Scholar 

  • Wansing, H., 1998a, “Translation of hypersequents into display sequents,” Logic Journal of the IGPL 6(5), 719-733.

    Google Scholar 

  • Wansing, H., 1998b, “Displaying modal logic,” Trends in Logic, Vol. 3, Dordrecht: Kluwer Academic Publishers.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire LEIBNIZ – C.N.R.S., 46 Avenue Félix Viallet, 38031, Grenoble, France

    Stéphane Demri

  2. Automated Reasoning Project and Department of Computer Science, Australian National University, Canberra, ACT, 0200, Australia

    Rajeev Goré

Authors
  1. Stéphane Demri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rajeev Goré
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Demri, S., Goré, R. Display Calculi for Logics with Relative Accessibility Relations. Journal of Logic, Language and Information 9, 213–236 (2000). https://doi.org/10.1023/A:1008341521750

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008341521750

Search

Navigation