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