SearcharxivSearch

arXiv · 2603.09569

Ignorance with(out) Grasping

Abstract

In this work, we argue that ignorance can be inherently understood as a hyperintensional notion. When faced with two logically or necessarily equivalent propositions, an agent may be ignorant of one while not of the other. To capture formally this intuition, we employ a topic-sensitive semantics, enabling the modeling of an agent's attitude toward the content of a proposition. Within this framework, we reevaluate three existing logical systems, usually characterized by standard Kripke semantics, to account for three forms of ignorance: ignorance whether, ignorance as unknown truth, and disbelieving ignorance. For each form, we present a sound and complete system. To highlight the advantage of this approach, we apply it to address the problem of logical omniscience rephrased in terms of ignorance. The resulting framework considers an agent's capacity to grasp the content of a proposition, bridging the gap between standard relational settings for ignorance representation and natural intuitions about the role of content in forming one's ignorance.

Explore related subjects

Keep this discovery

BibTeXRIS

Ekaterina Kubyshkina, Mattia Petrolo. 2026-03-10. Ignorance with(out) Grasping. https://arxiv.org/abs/2603.09569

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