Defines four FEL variants with evaluation-tree semantics and complete axiomatizations, plus three-valued extensions where the strongest matches Bochvar's strict logic.
We have to prove that mfe(˜Fβ ∨q (P ∧q Q)) = mfe(˜Fβ ∨q (Q∧q P )), where β∈ As o satisfies{β} = α (P ∧q Q)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Fully Evaluated Left-Sequential Logics
Defines four FEL variants with evaluation-tree semantics and complete axiomatizations, plus three-valued extensions where the strongest matches Bochvar's strict logic.