SearcharxivSearch

arXiv · 2405.11654

A logical perspective on intending to keep a true secret

Abstract

Logical investigations of the notion of secrecy are typically concentrated on tools for deducing whether private information is well hidden from unauthorized, direct, or indirect access attempts. This paper proposes a multi-agent, normal multi-modal logic to capture salient features of secrecy's intentions. Specifically, we focus on the intentions, beliefs, and knowledge of secret keepers and, more generally, of all the actors involved in secret-keeping scenarios. In particular, we investigate intentions underlying the keeping of a true secret, namely a secret concerning information known (and so true) by the secret keeper. The resulting characterization of intending to keep a true secret provides valuable insights into conditions ensuring or undermining secrecy depending on agents' attitudes and links between secrets and their surrounding context. We present the proposed logical system's soundness, completeness, and decidability results. Furthermore, we outline some theorems with potential applications to several fields, e.g., computer science and the social sciences.

Explore related subjects

Keep this discovery

BibTeXRIS

Alessandro Aldini, Davide Fazio, Pierluigi Graziani, Raffaele Mascella, Mirko Tagliaferri. 2024-05-19. A logical perspective on intending to keep a true secret. https://arxiv.org/abs/2405.11654

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