Abstract
We model the information flow between different states of a single agent as that agent reasons deductively. K–axiom–based epistemic closure for explicit knowledge is rejected for even the most trivial cases of inferential reasoning on account of the fact that the closure axiom does not extend beyond a raw consequence relation.
The resource management of the database of agent states for the deductive reasoning fragment in question is covered by the logic corresponding to the non–associative Lambek Calculus with permutation, bottom, and identity: NLP 0 , 1 .
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
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sequoiah-Grayson, S. (2009). Mono-Agent Dynamics. In: He, X., Horty, J., Pacuit, E. (eds) Logic, Rationality, and Interaction. LORI 2009. Lecture Notes in Computer Science(), vol 5834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04893-7_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-04893-7_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04892-0
Online ISBN: 978-3-642-04893-7
eBook Packages: Computer ScienceComputer Science (R0)