Show Less
Open access

Tableau Methods for Propositional Logic and Term Logic

Series:

Tomasz Jarmużek

The book aims to formalise tableau methods for the logics of propositions and names. The methods described are based on Set Theory. The tableau rule was reduced to an ordered n-tuple of sets of expressions where the first element is a set of premises, and the following elements are its supersets.

Show Summary Details
Open access

Glossary

←218 | 219→

Glossary

CPLClassical Propositional Logic
Lclogical constants
Varpropositional letters
ForCPLformulas of CPL
vvaluation of propositional letters
Vvaluation of formulas
t-inconsistenttableau inconsistent set
t-consistenttableau consistent set
RCPLtableau rules for CPL
Lnname letters
ForTLformulas of TL
Ciindividual constants
Viindividual variables
Lppredicate letters
Trtransformation
TeTLtableau expressions for TL
RTLtableau rules for TL
ForS5formulas S5
TeS5tableau expressions for S5
RS5tableau rules for S5
Forformulas generally
⟨For,⊧I⟩semantically defined logic
Teintableau contradictory set
Tetableau expressions
TeAtableau auxiliary expressions
branch consequence relation
X,A,Φ⟩tableau
ForMTLformulas MTL
TeMTLtableau expressions for MTL
ForMLformulas for modal logic
TeMLtableau expressions for modal logic
←219 | 220→