Tableaux'method for intuitionistic logic through S4-translation
(-q=>-p)=> (p => q)
The formula ((-q => -p) => (p => q)) 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 The true variables in state 2 are : p The true variables in state 3 are : p, q
examples
|
rules
|
syntax
|
info
|
home
|
download
|
basis of the method (in french)
Last Modified : 17-Dec-2021