SearcharxivSearch

arXiv · 2412.13537

Models for the common knowledge logic

Abstract

In this paper, we discuss models of the common knowledge logic. The common knowledge logic is a multi-modal logic that includes the modal operators $\mathsf{K}_{i}$ ($i\in\mathcal{I}$, where $\mathcal{I}$ is a finite set of agents) and $\mathsf{C}$ in the language. The intended meanings of $\mathsf{K}_{i}\phi$ ($i\in\mathcal{I}$) and $\mathsf{C}\phi$ are ''the agent $i$ knows $\phi$'' ($i\in\mathcal{I}$) and ''$\phi$ is common knowledge among $\mathcal{I}$'', respectively. Semantically, this can be expressed as follows: $\mathsf{C}\phi$ is true if and only if all of $\phi$, $\mathsf{E}\phi$, $\mathsf{E}^{2}\phi$, $\mathsf{E}^{3}\phi,\ldots$ are true, where $\mathsf{E}\phi=\bigwedge_{i\in\mathcal{I}}\mathsf{K}_{i}\phi$. A Kripke frame that satisfies the condition is $\langle W,R_{\mathsf{K}_{i}} (i\in\mathcal{I}), R_{\mathsf{C}}\rangle$, where $R_{\mathsf{C}}$ is the reflexive and transitive closure of $R_{\mathsf{E}}=\bigcup_{i\in\mathcal{I}}R_{\mathsf{K}_{i}}$. We refer to such Kripke frames as CKL-frames. An algebra that satisfies the condition is a modal algebra with modal operators $\mathrm{K}_{i}$ ($i\in\mathcal{I}$) and $\mathrm{C}$, which satisfies that $\mathrm{C}x\leq x$, $\mathrm{C} x\leq\mathrm{E}\mathrm{C} x$, and $\mathrm{C} x$ is the greatest lower bound of the set $\{\mathrm{E}^{n} x\mid n\in\omega\}$, where $\mathrm{E} x=\bigwedge_{i\in\mathcal{I}} \mathrm{K}_{i} x$. We refer to such modal algebras as CKL-algebras. In this paper, we show that the class of CKL-frames is modally definable, whereas the class of CKL-algebras is not. That is, the class of CKL-algebras does not form a variety, and there exists a modal algebra in which the common knowledge logic is valid, but $\mathrm{C}x$ is not the greatest lower bound of the set $\{\mathrm{E}^{n} x\mid n\in\omega\}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yoshihito Tanaka. 2024-12-18. Models for the common knowledge logic. https://arxiv.org/abs/2412.13537

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO