Repository | Journal | Volume | Articles
(2013) Synthese 190 (1).
Epistemic closure and commutative, nonassociative residuated structures
Sebastian Sequoiah-Grayson
pp. 113-128
K-axiom-based epistemic closure for explicit knowledge is rejected for even the most trivial cases of deductive inferential reasoning on account of the fact that the closure axiom does not extend beyond a raw consequence relation. The recognition that deductive inference concerns interaction as much as it concerns consequence allows for perspectives from logics of multi-agent information flow to be refocused onto mono-agent deductive reasoning. Instead of modeling the information flow between different agents in a communicative or announcement setting, we model the information flow between different states of a single agent as that agent reasons deductively. The resource management of the database of agent states for the deductive reasoning fragment in question is covered by the residuated structure that encodes the nonassociative Lambek Calculus with permutation, bottom, and identity: NLP 01 .
Publication details
DOI: 10.1007/s11229-010-9834-z
Full citation:
Sequoiah-Grayson, S. (2013). Epistemic closure and commutative, nonassociative residuated structures. Synthese 190 (1), pp. 113-128.
This document is unfortunately not available for download at the moment.