Tag Archives: Logical Graphs

Survey of Theme One Program • 3

This is a Survey of blog and wiki posts relating to the Theme One Program I worked on all through the 1980s.  The aim was to develop fundamental algorithms and data structures for integrating empirical learning with logical reasoning.  I … Continue reading

Posted in Algorithms, Animata, Artificial Intelligence, Boolean Functions, C.S. Peirce, Cactus Graphs, Cognition, Computation, Constraint Satisfaction Problems, Data Structures, Differential Logic, Equational Inference, Formal Languages, Graph Theory, Inquiry Driven Systems, Laws of Form, Learning Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Semiotics, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , | 42 Comments

Animated Logical Graphs • 38

Re: Richard J. Lipton • Logical Complexity Of Proofs Three examples of propositional proofs in logical graphs using equational inference rules can be found at the following location. Propositional Equation Reasoning Systems • Exemplary Proofs Animated proofs of the three … Continue reading

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 | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , | 13 Comments

Survey of Animated Logical Graphs • 3

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, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Computational Complexity, Constraint Satisfaction Problems, Differential Logic, 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 | Tagged , , , , , , , , , , , , , , , , , , , , , , , , | 26 Comments

Animated Logical Graphs • 37

Re: Richard J. Lipton • Logical Complexity Of Proofs Another dimension of proof style has to do with how much information is kept or lost as the argument develops.  For the moment let’s focus on classical deductive reasoning at the … Continue reading

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 | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , | 13 Comments

Animated Logical Graphs • 36

Re: Richard J. Lipton • Logical Complexity Of Proofs Dear Dick, You asked, “Is this measure, the logical flow of a proof, of any interest?” I was not sure how you define the measure of flow in a proof — … Continue reading

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 | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , | 13 Comments

Animated Logical Graphs • 35

Re: Richard J. Lipton • Logical Complexity Of Proofs The smoothest way I know to do propositional calculus is by using minimal negation operators as primitives, parsing propositional formulas into (painted and rooted) cactus graphs, and using the appropriate extension … Continue reading

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 | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , | 13 Comments

Animated Logical Graphs • 34

Re: Ontolog Forum • John Sowa Re: Peirce List • John Sowa Dear John, I can’t imagine why anyone would bother with Peirce’s logic if it’s just Frege and Russell in a different syntax, which has been the opinion I … Continue reading

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 | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , | 8 Comments

Differential Analytic Turing Automata • Discussion 2

Re: Scott Aaronson • The Busy Beaver Frontier Dear Scott, This discussion inspired me to go back and look at some of the work I did in the late 80s when I was trying to understand Cook’s Theorem.  One of … Continue reading

Posted in Algorithms, Boolean Functions, C.S. Peirce, Cactus Graphs, Computational Complexity, Differential Analytic Turing Automata, Differential Logic, Logic, Logical Graphs, Peirce, Propositional Calculus, Turing Machines | Tagged , , , , , , , , , , , | Leave a comment

Differential Logic, Dynamic Systems, Tangent Functors • Discussion 9

Re: FB | Systems Sciences • Kenneth Lloyd Dear Kenneth, Mulling over recent discussions put me in a pensive frame of mind and my thoughts led me back to my first encounter with category theory.  I came across the term … Continue reading

Posted in Amphecks, Boolean Functions, C.S. Peirce, Cactus Graphs, Category Theory, Cybernetics, Differential Analytic Turing Automata, Differential Calculus, Differential Logic, Discrete Dynamical Systems, Dynamical Systems, Graph Theory, Hill Climbing, Hologrammautomaton, Information Theory, Inquiry Driven Systems, Intelligent Systems, Knowledge Representation, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Propositional Equation Reasoning Systems, Spencer Brown, Systems, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 8 Comments

Differential Logic, Dynamic Systems, Tangent Functors • Comment 1

Re: Differential Logic, Dynamic Systems, Tangent Functors • 1 Seeing as how quasi-neural models and the recurring issues of symbolic vs. connectionist paradigms have come round again, I thought I might revisit work I began initially in that context, investigating … Continue reading

Posted in Amphecks, Animata, Boolean Functions, C.S. Peirce, Cactus Graphs, Category Theory, Cybernetics, Differential Calculus, Differential Logic, Discrete Dynamical Systems, Dynamical Systems, Graph Theory, Information & Control, Inquiry Driven Systems, Intelligent Systems, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Propositional Calculus, Propositional Equation Reasoning Systems, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , | 7 Comments