Tableaux'method for intuitionistic logic through S4-translation
-(p.q)=>-p+-q
The formula (-(p . q) => (-p + -q)) is not valid Formula's counter-model Number of states = 6 Initial state = 1 The accessibility relation is the reflexive and transitive closure of the following relation : 1 -> 2 2 -> 3 , 5 , 4 3 -> 4 5 -> 6 No variable is true in state 1 No variable is true in state 2 The true variables in state 3 are : q The true variables in state 4 are : q The true variables in state 5 are : p The true variables in state 6 are : p
examples
|
rules
|
syntax
|
info
|
home
|
download
|
basis of the method (in french)
Last Modified : 17-Dec-2021