Skip to main content
Log in

Decidability of an Xstit Logic

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

This paper presents proofs of completeness and decidability of a non-temporal fragment of an Xstit logic. This shows a distinction between the non-temporal fragments of Xstit logic and regular stit logic since the latter is undecidable. The proof of decidability is via the finite model property. The finite model property is shown to hold by constructing a filtration. However, the set that is used to filter the models isn’t simply closed under subformulas, it has more complex closure conditions. The filtration set is akin to the Fischer–Ladner closure of a set used to show completeness and decidability of propositional dynamic logic.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Belnap N., Perloff M.: The way of the agent. Studia Logica 51(3/4), 463–484 (1992)

    Article  Google Scholar 

  2. Belnap N., Perloff M., Xu M.: Facing the Future: Agents and Choices in Our Indeterminist World. Oxford University Press, Oxford (2001)

    Google Scholar 

  3. Blackburn P., de Rijke M., Venema Y.: Modal Logic, No. 53, in Cambridge Tracks in Theoretical Computer Science. Cambridge University Press, Cambridge, UK (2001)

    Google Scholar 

  4. Broersen, J., A complete stit logic for knowledge and action, and some of its applications, in M. Baldoni, T. Son, M. B. van Riemsdijk, and M. Winikoff (eds.), DALT, Lecture Notes in Computer Science, Vol. 5397, Springer, Berlin, 2008, pp. 47–59.

  5. Broersen J.: Deontic epistemic stit logic distinguishing modes of mens rea. Journal of Applied Logic 9(2), 127–152 (2011)

    Article  Google Scholar 

  6. Broersen J.: Making a start with the stit logic analysis of intentional action. Journal of Philosophical Logic 40(4), 399–420 (2011)

    Article  Google Scholar 

  7. Broersen J.: Probabilistic stit logic and its decomposition. International Journal of Approximate Reasoning 54, 467–477 (2013)

    Article  Google Scholar 

  8. Broersen, J., and J.-J. C. Meyer, Action, Failure and Free Will Choice in Stit Logic, Springer, New York, 2013. Forthcoming.

  9. Emerson E.A., Halpern J.Y.: Decision procedures and expressiveness in the temporal logic of branching time. Journal of Computer and System Science 30(1), 1–24 (1985)

    Article  Google Scholar 

  10. Fine K.: Normal forms in modal logic. Notre Dame Journal of Formal Logic 26(2), 229–237 (1975)

    Article  Google Scholar 

  11. Gabbay, D. M., A. Kurucz, F. Wolter, and M. Zakharyaschev, Many-Dimentional Modal Logics: Theory and Applications, Vol. 148, Studies in Logic and The Foundations of Mathematics, Elseiver, North Holland, 2003.

  12. Herzig A., Schwarzentruber F.: Properties of logics of individual and group agency. Advances in Modal Logic 7, 133–149 (2008)

    Google Scholar 

  13. Horty J.: Agency and Deontic Logic. Oxford University Press, Oxford, UK (2001)

    Book  Google Scholar 

  14. Schwarzentruber F.: Complexity results of stit fragments. Studia Logica 100(5), 1001–1045 (2012)

    Article  Google Scholar 

  15. Wolter, F., and M. Zakharyaschev, Modal decision problems, in P. Blackburn, J. van Benthem, and F. Wolter (eds.), Handbook of Modal Logic, Vol. 3, Studies in Logic and Practical Reasoning, Chap. 7, Elsevier B.V., Amsterdam, The Netherlands, 2007, pp. 427–489.

  16. Zakharyaschev M.: Canonical formulas for k4. Part III: The finite model property. Journal of Symbolic Logic 62, 950–975 (1997)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gillman Payette.

Additional information

Presented by Heinrich Wansing

Rights and permissions

Reprints and permissions

About this article

Cite this article

Payette, G. Decidability of an Xstit Logic. Stud Logica 102, 577–607 (2014). https://doi.org/10.1007/s11225-013-9492-5

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11225-013-9492-5

Keywords

Navigation