Stratified Counterpossible Logic

This paper presents two logic systems, SCP and its extension SCP1, to distinguish between different types of impossibility.The semantics use a stratified structure that partitions worlds into logic-normal worlds (N) and anti-logic worlds (I).By defining a metaphysical accessibility relation within N, the systems separate metaphysical impossibility from logical contradiction.This allows for logical reasoning to be maintained even when dealing with metaphysical impossibilities.To address the challenge of vacuism, SCP1 implements a non-empty constraint on the selection function, ensuring that counterpossibles with impossible antecedents are not trivially true but depend on the connection between the antecedent and the consequent.We provide proofs for the soundness, completeness, and decidability of both systems.Finally, we indicate the possibility of applying this stratified approach to other modal domains, such as deontic or epistemic logic.

Authors

Institutions

Publication Details

Journal
Electronic Proceedings in Theoretical Computer Science
Published
2026-06-28
DOI
https://doi.org/10.4204/eptcs.447.28
Primary Topic
Philosophy and Theoretical Science
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Stratified Counterpossible Logic

Xuefeng Wen, Chen Huang
Electronic Proceedings in Theoretical Computer Science
Philosophy and Theoretical Science
article

Stratified Counterpossible Logic

Xuefeng Wen, Chen Huang
article en

Abstract

This paper presents two logic systems, SCP and its extension SCP1, to distinguish between different types of impossibility.The semantics use a stratified structure that partitions worlds into logic-normal worlds (N) and anti-logic worlds (I).By defining a metaphysical accessibility relation within N, the systems separate metaphysical impossibility from logical contradiction.This allows for logical reasoning to be maintained even when dealing with metaphysical impossibilities.To address the challenge of vacuism, SCP1 implements a non-empty constraint on the selection function, ensuring that counterpossibles with impossible antecedents are not trivially true but depend on the connection between the antecedent and the consequent.We provide proofs for the soundness, completeness, and decidability of both systems.Finally, we indicate the possibility of applying this stratified approach to other modal domains, such as deontic or epistemic logic.

Electronic Proceedings in Theoretical Computer ScienceVol. 447
Sun Yat-sen University (CN)
Reduced inequalities
Openalex Percentile: Top 5%
Philosophy and Theoretical Science
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.

Stratified Counterpossible Logic — Xuefeng Wen, Chen Huang · Electronic Proceedings in Theoretical Computer Science (2026) | TGRS Research Map | TGRS