In this paper we consider the construction of a LAK system of temporal-epistemic logic which is used to formally describe algorithmic knowledge. We propose an axiom system of LAK and discuss the basic properties of this logic.
[1] K. Binmore, Shin H. S.,(1992,pp. 141-154), Algorithmic knowledge and game theory, Knowledge, belief, and strategic interaction (C. Bicchieri and M.-L. Dalla-Chiara, eds.), Cambridge University Press.
[2] R. Fagin, J. Y. Halpern, Y.Moses, and M. Y.Vardi., (1995), Reasoning about Knowledge., Cambridge, Mass., MIT Press.
[3] J. Y. Halpern, Moses Y., Vardi M. Y., (1994, pp. 255-266) Algorithmic know- ledge, Theoretical Aspects of Reasoning about Knowledge: Proc. Fifth Confer- ence (R. Fagin, ed.), Morgan Kaufman.
[4] D. N. Ho, (1998, pp. 275-279 ), On the epistemic foundations of agent theories. In M. P. Singh, A. S. Rao, and M. J. Wooldridge, editors,Intelligent Agents IV. Proceedings of ATAL-97, volume 1365 of LNAI, Springer Verlag,
[5] D. N. Ho, Knowledge, Logical Omniscience, and Resource-bounded Reasoning, Institute for Information Systems, University of Luebeck, http://citeseerx.ist. psu.edu/viewdoc/downloaddoi=10.1.1.66.4838rep=rep1type=pdf
[6] A. Moreno, (2000), Modelling rational inquiry in non-ideal agents. Ph.d.thesis, Tarragona, Universitat Politecnica de Catalunya.
[7] D. Surowik, (2013), Logic, Knowledge and Time (in Polish), Bialystok Univer- sity.