Search arXivSearch

arXiv · 2512.22477

A Representation of Explicit Knowledge and Epistemic Indistinguishability in a Logic of Awareness

Abstract

The logic of awareness, first proposed by Fagin and Halpern, addressed the problem of logical omniscience by introducing the notion of awareness and distinguishing explicit knowledge from implicit knowledge. In their framework, explicit knowledge was defined as the conjunction of implicit knowledge and awareness, each of which was represented by modal operators. Their definition, however, may derive undesirable propositions that cannot be considered explicit knowledge when Modus Ponens is applied within implicit knowledge. Hence, focusing on indistinguishability among possible worlds, dependent on awareness, we refine the definition of explicit knowledge. In our semantics, we require that the aware implicit knowledge is not necessarily explicit knowledge, though explicit knowledge must be aware as well as implicit. We employ an example of elementary geometry, where different students may or may not reach the final answer, depending on whether they are aware of learned mathematical facts. Thereafter, we formally present the syntax and the semantics of our language, named Awareness-Based Indistinguishability Logic ($\mathrm{AIL}$). We prove that $\mathrm{AIL}$ has more expressive power than the logic of Fagin and Halpern, and show that the latter is embeddable in $\mathrm{AIL}$. Furthermore, we provide an axiomatic system of $\mathrm{AIL}$ and prove its soundness and completeness.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yudai Kubono, Satoshi Tojo. 2025-12-27. A Representation of Explicit Knowledge and Epistemic Indistinguishability in a Logic of Awareness. https://arxiv.org/abs/2512.22477

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

KEEP EXPLORING

Related papers

Deciding Predicate Logical Theories of Real-Valued Functions

The notion of a real-valued function is central to mathematics, computer science, and many other scientific fields. Despite this importance, there are hardly any positive results on decision procedures for predicate logical theories that reason about real-valued functions. This paper defines a first-order predicate language for reasoning about multi-dimensional smooth real-valued functions and their derivatives, and demonstrates that - despite the obvious undecidability barriers - certain positive decidability results for such a language are indeed possible.

cs.LO

Structural Liveness of Conservative Petri Nets

We show that the EXPSPACE-hardness result for structural liveness of Petri nets [Jancar and Purser, 2019] holds even for a simple subclass of conservative nets. As our main result, we prove that for structurally live conservative nets, the values of the minimal live markings are at most doubly exponential in the size of the net. This implies the EXPSPACE-completeness of structural liveness for conservative Petri nets. The result also applies to structurally bounded Petri nets, whereas the complexity of the general case remains open. As a proof ingredient of independent interest, we present an extension of known results on the bounds of minimal integer solutions to Boolean combinations of linear equalities, inequalities, and divisibility constraints.

cs.LO

Verifying Numerical Methods with Isabelle/HOL

Modern machine learning pipelines and ODE solvers are built on numerical algorithms. Reliable numerical methods are thus a prerequisite for trustworthy machine learning and cyber-physical systems. We evaluate a framework designed for verifying imperative programs and the Isabelle proof assistant as tools for proving the total correctness of four numerical algorithms: the bisection method, the fixed-point method, the perceptron, and the gradient descent algorithm. Our verifications required subtle extensions and generalisations to Isabelle's version of Taylor's theorem and higher-order derivatives. Finally, we reflect on the framework's automation, friendly syntax, and on further requirements to turn it into a verification tool for numerical methods.

cs.LO