favorite5Since this model is a function from the models of its subformulas, the semantic tableau is basically a method for obtaining its whole model; the whole tree is comprised of branches, and the disjunction of the open branches gives the smallest satisfiable model for the wff..
favorite11The following theorems establish the way the algorithm for solving tableaux works, giving a finite tableay for a finite set of formulas which is satisfiable if it is open, and the relationship between this method and the formation of disjunctive normal forms.
favorite9This teaching procedure makes easier the subsequent approach (and understanding) to semantics for first order logics and other topics within this field, like the formation of disjunctive normal form of propositional formulas.
favorite12According to the cross-cutting character of logic, instead of a basic course introduced as usual, we suggest a course on propositional logic in a way that, given a propositional formal language, its semantics will be defined, not only with truth tables but also in terms of set theory.
favorite59Abstract In this work we suggest the use of a set-theoretical interpretation of semantic tableaux for teaching propositional logic.