Animated Logical Graphs • 7

Re: Ken ReganThe Shapes of Computations

There are several issues of computation shape and proof style that raise their heads already at the logical ground level of boolean functions and propositional calculus.  From what I’ve seen, there are three dimensions of variation that appear most prominent at this stage:

  • Insight Proofs vs. Routine Proofs
  • Model-Theoretic Methods vs. Proof-Theoretic Methods
  • Equational (Information-Preserving) Proofs vs.
    Implicational (Information-Reducing) Proofs

More later, after I dig up some basic examples …

This entry was posted in Amphecks, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Constraint Satisfaction Problems, Deduction, Diagrammatic Reasoning, Duality, Equational Inference, Graph Theory, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Model Theory, Painted Cacti, Peirce, Proof Theory, Propositional Calculus, Propositional Equation Reasoning Systems, Spencer Brown, Theorem Proving, Visualization and tagged , , , , , , , , , , , , , , , , , , , , , , , , , . Bookmark the permalink.