The modal logic of the countable random frame
The modal logic \(\text{ML}_r\) of the countable random frame, which is contained in and ``approximates the modal logic of almost sure frame validity (valid with asymptotic probability 1 in a randomly chosen finite frame), is studied. A sound and complete (canonical) axiomatization of \(\text{ML}_r\) is given and it is shown that the logic is not finitely axiomatizable but has the finite frame property via filtration, and that the finite models are easily recognizable, which establishes an EXPSPACE upper bound for the complexity of its satisfiability. Special modally definable properties expressing non-existence of certain partitions, called kernel partitions in random frames, are discussed. It is shown that there are modal formulas corresponding to simple partitions of this kind, which are almost surely valid in the finite, yet fail in the countable random frame.
- The modal logic of almost sure frame validities in the finite
- Frame-validity games and absolute minimality of modal axioms
- scientific article; zbMATH DE number 6290331 (Why is no real title available?)
- Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
- Modal logics of almost-sure validities in some classes of Euclidean and transitive frames
- Asymptotic truth-value laws in many-valued logics
- Modal logics of almost sure validities and zero-one laws in Horn classes
This page was built for publication: The modal logic of the countable random frame
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1407589)
