Category Archives: Spencer Brown

Animated Logical Graphs : 9

Re: Ken Regan • The Shapes of Computations The insight that it takes to find a succinct axiom set for a theoretical domain falls under the heading of abductive or retroductive reasoning, a knack as yet refractory to computational attack, … Continue reading

Posted in Amphecks, Animata, Automated Research Tools, Boolean Algebra, Boolean Functions, Cactus Graphs, Computational Complexity, Constraint Satisfaction Problems, Diagrammatic Reasoning, Graph Theory, Inquiry Driven Education, 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 | Tagged , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

Animated Logical Graphs : 8

Re: Ken Regan • The Shapes of Computations The most striking example of a “Primitive Insight Proof” (PIP❢) known to me is the Dawes–Utting proof of the Double Negation Theorem from the CSP–GSB axioms for propositional logic. There is a … Continue reading

Posted in Amphecks, Animata, Automated Research Tools, Boolean Algebra, Boolean Functions, Cactus Graphs, Computational Complexity, Constraint Satisfaction Problems, Diagrammatic Reasoning, Graph Theory, Inquiry Driven Education, 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 | Tagged , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

Animated Logical Graphs : 7

Re: Ken Regan • The 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 … Continue reading

Posted in Amphecks, Animata, Automated Research Tools, Boolean Algebra, Boolean Functions, Cactus Graphs, Computational Complexity, Constraint Satisfaction Problems, Diagrammatic Reasoning, Graph Theory, Inquiry Driven Education, 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 | Tagged , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

Survey of Animated Logical Graphs • 1

This is one of several Survey posts I’ll be drafting from time to time, starting with minimal stubs and collecting links to the better variations on persistent themes I’ve worked on over the years.  After that I’ll look to organizing … Continue reading

Posted in Amphecks, Animata, Boole, Boolean Algebra, Boolean Functions, Cactus Graphs, Computational Complexity, Constraint Satisfaction Problems, Equational Inference, Graph Theory, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Propositional Equation Reasoning Systems, Spencer Brown, Surveys, Theorem Proving, Visualization, Zeroth Order Logic | Tagged , , , , , , , , , , , , , , , , , , , , , , , | Leave a comment

Animated Logical Graphs : 6

Re: Peirce List Discussion • Jim Willgoose At root we are dealing with a genre of very abstract formal systems.  They have grammars that determine their well-formed expressions and rules that determine the permissible transformations among expressions, but they lack … Continue reading

Posted in Amphecks, Analogy, Animata, Automated Research Tools, Boolean Algebra, Boolean Functions, Cactus Graphs, Constraint Satisfaction Problems, Deduction, Diagrammatic Reasoning, Duality, Form, Graph Theory, Iconicity, Laws of Form, Leibniz, Logic, Logical Graphs, Mathematics, Model Theory, Peirce, Peirce's Law, Praeclarum Theorema, Pragmatism, Proof Theory, Propositional Calculus, Semiotics, Spencer Brown, Theorem Proving, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

Animated Logical Graphs : 5

Re: Peirce List Discussion • Howard Pattee A computational problem is defined as a set of problem instances with specified properties.  An algorithm solves a problem if it computes the correct answer to every problem instance in that set. The … Continue reading

Posted in Amphecks, Analogy, Animata, Automated Research Tools, Boolean Algebra, Boolean Functions, Cactus Graphs, Constraint Satisfaction Problems, Deduction, Diagrammatic Reasoning, Duality, Form, Graph Theory, Iconicity, Laws of Form, Leibniz, Logic, Logical Graphs, Mathematics, Model Theory, Peirce, Peirce's Law, Praeclarum Theorema, Pragmatism, Proof Theory, Propositional Calculus, Semiotics, Spencer Brown, Theorem Proving, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

Animated Logical Graphs : 4

Re: Peirce List Discussion • Helmut Raulien Although it’s fair to say that most of my university coursework leaned to the theoretical side of things, I did cobble together a respectable enough background in computing, statistics, and industrial-organizational styles of … Continue reading

Posted in Amphecks, Analogy, Animata, Automated Research Tools, Boolean Algebra, Boolean Functions, Cactus Graphs, Constraint Satisfaction Problems, Deduction, Diagrammatic Reasoning, Duality, Form, Graph Theory, Iconicity, Laws of Form, Leibniz, Logic, Logical Graphs, Mathematics, Model Theory, Peirce, Peirce's Law, Praeclarum Theorema, Pragmatism, Proof Theory, Propositional Calculus, Semiotics, Spencer Brown, Theorem Proving, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment