Steretic logic SL0: finite pasts, reduction to PCTL*, decidability and completeness

Steretic logic treats a structured absence in a network, a void, as informative. Its preliminary calculus SL0 combines Ockhamist branching time with a network vocabulary (links, three states of a node, exogenous and impossible links) and two frame conditions: a non-exogenous link can appear only where the pair has at least k common neighbours (privation), and only between active nodes (step). The paper has four parts. First, we show that the original definition of SL0 models has a gap: without a finite-past condition the theorem on islands fails, and we give a counterexample of order type omega+omega; one added sentence closes the gap. Second, for a finite set of nodes we reduce validity in SL0 to validity in PCTL* relativised to a single formula. Third, as corollaries, SL0 is decidable, its satisfiability lies between EXPTIME and 2EXPTIME, and adding four axiom schemes to Reynolds' axiomatisation of PCTL* yields a sound and complete axiomatisation. Fourth, we prove two structural theorems of the frame conditions (a doubling bound on the distance bridged by endogenous growth in h steps, which is sharp, and the finiteness of endogenous time without losses or input from outside), and we formalise the informal notions of fusion and exit as an extension SL1 with exact bounds on what an exit can carry away. The novelty of SL0 lies in its vocabulary and laws, not in a new modality; the metatheory follows from known results, so each claim can be checked against the literature.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24334770
Primary Topic
Logic, Reasoning, and Knowledge
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Steretic logic SL0: finite pasts, reduction to PCTL*, decidability and completeness

Oleksandr Krol
Zenodo (CERN European Organization for Nuclear Research)
Logic, Reasoning, and Knowledge
preprint

Steretic logic SL0: finite pasts, reduction to PCTL*, decidability and completeness

Oleksandr Krol
preprint en

Abstract

Steretic logic treats a structured absence in a network, a void, as informative. Its preliminary calculus SL0 combines Ockhamist branching time with a network vocabulary (links, three states of a node, exogenous and impossible links) and two frame conditions: a non-exogenous link can appear only where the pair has at least k common neighbours (privation), and only between active nodes (step). The paper has four parts. First, we show that the original definition of SL0 models has a gap: without a finite-past condition the theorem on islands fails, and we give a counterexample of order type omega+omega; one added sentence closes the gap. Second, for a finite set of nodes we reduce validity in SL0 to validity in PCTL* relativised to a single formula. Third, as corollaries, SL0 is decidable, its satisfiability lies between EXPTIME and 2EXPTIME, and adding four axiom schemes to Reynolds' axiomatisation of PCTL* yields a sound and complete axiomatisation. Fourth, we prove two structural theorems of the frame conditions (a doubling bound on the distance bridged by endogenous growth in h steps, which is sharp, and the finiteness of endogenous time without losses or input from outside), and we formalise the informal notions of fusion and exit as an extension SL1 with exact bounds on what an exit can carry away. The novelty of SL0 lies in its vocabulary and laws, not in a new modality; the metatheory follows from known results, so each claim can be checked against the literature.

Zenodo (CERN European Organization for Nuclear Research)
Logic, Reasoning, and Knowledge
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.

Laika access coming soon