略过内容 略过页脚

Laws of Propositional Logic Calculator

Please note that the letters “W” and “F” denote the constant values truth and falsehood and the lowercase letter “v” indicates disjunction. You can use all other letters of the English alphabet as propositional variables, with capital letters preferred. Task to be accomplished Detailed truth table (with intermediate outcomes) Truth table (final results only) Quine-McCluskey optimization Atomic negations Elimination of conditions Disjunctive normal form (DNF) Canonical DNF (CDNF) Conjunctive normal form (CNF) Canonical CNF (CCNF) Optimize expression (symbolic) Optimize expression (symbolic and semantic – slow) Polish notation Graphic expression tree Text expression tree Graphic alpha tree (Peirce) Textual Alpha tree (Peirce) Graphic term font (Frege) Tautology control Prove the claim Algorithms can optionally generate a trace of the search operation. Select “HTML Trace” to see the search process: Read here the search methods used by the algorithms. To embed this widget in a publication, install tungsten| Alpha Widget Shortcode plugin and copy and paste the above shortcode into the HTML source code. For more information about syntax, see the syntax help. A single appropriate set of values is sufficient as a solution: the solver`s algorithms stop and do not try to find additional solutions. Some solver algorithms produce the appropriate values, but others do not produce or produce a partial quantity. You can choose and try several solver algorithms: the “DPLL better” is the best solver among the options. Read the differences between the algorithms here. Note that you can check if a formula F is still true by trying to solve the formula -F denied: if -F is always false, F must always be true. It can also happen that the formula is wrong for all possible values of the variables: if this is the case, the solver`s algorithms report this after exhausting the search options. For example, (a->b) & a & b is always wrong.

For formula syntax entry, solvers first convert the formula to a normal form of clause: for some types of formulas, this conversion step can produce a huge result, but in most cases it is a sensible simplification before the actual search.