A complete labelled sequent calculus is developed for inquisitive first-order modal logic by extending prior work, with proofs of strong completeness, rule invertibility, and cut admissibility.
Supervenient and yet not deducible
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Stochastic supervenience is formalized via Markov kernels mapping base states to distributions over macro configurations, recovering deterministic supervenience as the Dirac delta limit case.
citing papers explorer
-
Labelled Sequents for Inquisitive First-Order Modal Logic
A complete labelled sequent calculus is developed for inquisitive first-order modal logic by extending prior work, with proofs of strong completeness, rule invertibility, and cut admissibility.
-
What is Stochastic Supervenience?
Stochastic supervenience is formalized via Markov kernels mapping base states to distributions over macro configurations, recovering deterministic supervenience as the Dirac delta limit case.