Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

PSPACE complexity of modal logic KD45\(_{n}\)

From MaRDI portal
Publication:946142
Jump to:navigation, search

DOI10.1007/S10986-008-9006-8zbMath1149.03018OpenAlexW2074133487MaRDI QIDQ946142

A. Birštunas

Publication date: 22 September 2008

Published in: Lithuanian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10986-008-9006-8


zbMATH Keywords

complexitysequent calculusPSPACEloop-check freemulti-modal logic KD45\(_{n}\)


Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Complexity of proofs (03F20)





Cites Work

  • Efficient loop-check for KD45 logic
  • A guide to completeness and complexity for modal logics of knowledge and belief
  • Single step tableaux for modal logics. Computational properties, complexity and methodology
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: PSPACE complexity of modal logic KD45\(_{n}\)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:946142&oldid=12917266"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 18:06.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki