scientific article; zbMATH DE number 4135915
The authors call \(A=<E;\vee,\&,\supset,\neg,\square >\) a topo-Boolean algebra, where \(\vee\), \&, \(\supset\), \(\neg\) are Boolean operations and \(\square\) is an operation defined by \(\square \alpha \leq \alpha\) (\(\alpha\leq \beta\) means \(\alpha =\alpha \&\beta)\), \(\square \square \alpha =\square \alpha\), \(\square (\alpha \&\beta)=\square \alpha \&\square \beta\) and \(\square 1=1=\neg 0\) for all \(\alpha\),\(\beta\in E\). A modal formula F is called to be valid in a topo-Boolean algebra A if the operation defined by the formula F identically equals 1. For any topo-Boolean algebra A, define \(LA=\{F:\) F valid in \(A\}\). If \(A_ 1\), \(A_ 2\) are topo-Boolean algebras defined by the following pictures respectively: \[ \begin{matrix}1\bullet \\ | \\ 0\bullet \end{matrix} \qquad\qquad \begin{matrix} && 1\bullet \\ & \diagup && \diagdown \\ \rho\bullet &&&& \bullet\sigma \\ & \diagdown && \diagup \\ && 0\bullet \end{matrix} \] then \(S4\subseteq PM4\subseteq LA_ 2\subseteq LA_ 1\). This article reports some of the authors' studies on completeness of systems of formulas in the logic \(LA_ 2\).
- Completeness criteria for expressibility in a 4-valued extension of provability logic
- scientific article; zbMATH DE number 1918664
- Modal extension of ideal paraconsistent four-valued logic and its subsystem
- scientific article; zbMATH DE number 6316274
- A new four-valued approach to modal logic
- Relational semantics for the paraconsistent and paracomplete 4-valued logic PŁ4
- On axiomatization of Łukasiewicz's four-valued modal logic
- Lattices of four-valued modal logics
- Existence of an algorithm for recognition of the completeness with respect to expressibility in modal pre-tabular logic EM4
- Formulas in modal logic S4
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3469085)