Abstract
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 .
Article PDF
Similar content being viewed by others
References
Ajdukiewicz, K. (1935). Die Syntaktische Konnexitat, Studia Philosophica. pp. 1–27.
Baltag, A., Moss, L., & Solecki, S. (1998). The logic of public announcements, common knowledge and private suspicions. In Proceedings of Tark‘98 (pp. 43–56). Los Altos: Morgan Kaufmann Publishers.
Baltag A., Smetts S. (2008) The logic of conditional doxastic actions forthcoming. In: Rooij R., Apt K. (eds) Texts in logic and games. Special issue on new perspectives on games and interaction. Amsterdam University Press, Amsterdam
Blackburn P., de Rijke M., Venema Y. (2002) Modal logic. Cambridge University Press, Cambridge
Busckowski W. (1986) Completeness results for lambek syntactic calculus. Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik 32: 13–28
Lambek J. (1958) The mathematics of sentence structure. American Mathematical Monthly 65: 154–170
Lambek J. (1961) On the Calculus of Syntactic Types. In: Jakobson R. (Ed.) Structure of Language and its Mathematical Aspects. American Mathematical Society, Providence, pp 166–178
Moortgat, M. (1995). Residuation in Mixed Lambek Systems, Research Transcript no. 10. Research Institute for Language and Speech (OTS), Utrect.
Sequoiah–Grayson S. (2009a) Dynamic negation and negative information. Review of symbolic Logic 2.1: 233–248
Sequoiah–Grayson, S. (2009b). Lambek calculi with 0 and test–failure in DPL. Linguistic Analysis (forthcoming).
Sequoiah–Grayson S. (2009c) A positive information logic for inferential information. Synthese 167, 2: 409–431
van Benthem, J. (2009). Logical dynamics of information and interaction (manuscript).
van Ditmarsh H., van der Hoek W., Kooi B. (2008) Dynamic epistemic logic. Springer, The Netherlands
Open Access
This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Sequoiah-Grayson, S. Epistemic closure and commutative, nonassociative residuated structures. Synthese 190, 113–128 (2013). https://doi.org/10.1007/s11229-010-9834-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11229-010-9834-z