Decidability of quantum modal logic

Abstract The decidability of a logical system refers to the existence of an algorithm that can determine whether any given formula in that system is a theorem. In this paper, Harrop’s lemma is used to prove the decidability of quantum modal logic.

Authors

Institutions

Publication Details

Journal
Logic Journal of IGPL
Published
2025-03-16
DOI
https://doi.org/10.1093/jigpal/jzaf010
Primary Topic
Advanced Algebra and Logic
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Decidability of quantum modal logic

Kenji Tokuo
Logic Journal of IGPL
Advanced Algebra and Logic
article

Decidability of quantum modal logic

Kenji Tokuo
article en

Abstract

Abstract The decidability of a logical system refers to the existence of an algorithm that can determine whether any given formula in that system is a theorem. In this paper, Harrop’s lemma is used to prove the decidability of quantum modal logic.

Logic Journal of IGPLVol. 33(3)
National Institute of Technology, Oita College (JP)
Reduced inequalities
Openalex Percentile: Top 94%
Advanced Algebra and Logic
DOIOpen Access PDFOpenAlex
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.

Decidability of quantum modal logic — Kenji Tokuo · Logic Journal of IGPL (2025) | TGRS Research Map | TGRS