Abstract
In epistemic logic we are not only interested in the propositional knowledge expressed by “knowing that” operators, but also care about other types of knowledge used in natural language. In [1], Plaza proposed the “knowing value” operators and gave the complete axiomatization for the logic of knowledge with nonrigid designators. Moreover, in [2] Halpern and colleagues holds that, when analyzing a system in terms of knowledge, not only is the current state of knowledge of the agents in the system relevant, but also how that state of knowledge changes over time. So we introduce temporal logic operators ‘next’ and ‘until’ to extend Plaza’s system. The completeness proof is highly non-trivial and we referred to the work of [2, 3].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Plaza, J.: Logics of Public Communications. Synthese, Dordrecht (2007)
Halpern, J.Y., Van Der Meyden, R., Vardi, M.Y.: Complete axiomatizations for reasoning about knowledge and time. Siam J. Comput. 33, 674–703 (2004)
Wang, Y., Fan, J.: Conditionally knowing what (2014)
Halpern, J.Y., Vardi, M.Y.: The complexity of reasoning about knowledge and time. I. Lower bounds. J. Comput. Syst. Sci. 38, 195–237 (1989)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Lin, K. (2021). Discrete Linear Temporal Logic with Knowing-Value Operator. In: Ghosh, S., Icard, T. (eds) Logic, Rationality, and Interaction. LORI 2021. Lecture Notes in Computer Science(), vol 13039. Springer, Cham. https://doi.org/10.1007/978-3-030-88708-7_11
Download citation
DOI: https://doi.org/10.1007/978-3-030-88708-7_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-88707-0
Online ISBN: 978-3-030-88708-7
eBook Packages: Religion and PhilosophyPhilosophy and Religion (R0)