Modal Logic for Reasoning About Uncertainty and Confusion

We consider a modal logic that can formalise statements about uncertainty and beliefs such as I think that my wallet is in the drawer rather than elsewhere or I am confused whether my appointment is on Monday or Tuesday.To do that, we expand Gdel modal logic KG with the involutive negation defined as v( , w) = 1v( , w).We provide semantics with the finite model property for our new logic that we call KG inv and show its equivalence to the standard semantics over [0, 1]-valued Kripke models.Namely, we show that is valid in the standard semantics of KG inv iff it is valid in the new semantics.Using this new semantics, we construct a constraint tableaux calculus for KG inv that allows for an explicit extraction of countermodels from complete open branches and then employ the tableaux calculus to obtain the PSPACE-completeness of the validity in KG inv .

Authors

Institutions

Publication Details

Journal
Electronic Proceedings in Theoretical Computer Science
Published
2025-11-25
DOI
https://doi.org/10.4204/eptcs.437.20
Citations
1
Primary Topic
Logic, Reasoning, and Knowledge
Type
article
Field-Weighted Citation Impact
2.48

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Modal Logic for Reasoning About Uncertainty and Confusion

Marta Bílková, Thomas Macaulay Ferguson, Daniil Kozhemiachenko
1 citations
Electronic Proceedings in Theoretical Computer Science
Logic, Reasoning, and Knowledge
2.48
article

Modal Logic for Reasoning About Uncertainty and Confusion

Marta Bílková, Thomas Macaulay Ferguson, Daniil Kozhemiachenko
article en
1 citations

Abstract

We consider a modal logic that can formalise statements about uncertainty and beliefs such as I think that my wallet is in the drawer rather than elsewhere or I am confused whether my appointment is on Monday or Tuesday.To do that, we expand Gdel modal logic KG with the involutive negation defined as v( , w) = 1v( , w).We provide semantics with the finite model property for our new logic that we call KG inv and show its equivalence to the standard semantics over [0, 1]-valued Kripke models.Namely, we show that is valid in the standard semantics of KG inv iff it is valid in the new semantics.Using this new semantics, we construct a constraint tableaux calculus for KG inv that allows for an explicit extraction of countermodels from complete open branches and then employ the tableaux calculus to obtain the PSPACE-completeness of the validity in KG inv .

Electronic Proceedings in Theoretical Computer ScienceVol. 437
Centre National de la Recherche Scientifique (FR), Rensselaer Polytechnic Institute (US), Czech Academy of Sciences (CZ), Aix-Marseille Université (FR), Laboratoire d’Informatique et Systèmes (FR)
Grantová Agentura České Republiky
Openalex Percentile: Top 8%
Logic, Reasoning, and Knowledge
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Modal Logic for Reasoning About Uncertainty and Confusion — Marta Bílková, Thomas Macaulay Ferguson, et al. · Electronic Proceedings in Theoretical Computer Science (2025) | TGRS Research Map | TGRS