Category Archives: Minimal Negation Operators

Animated Logical Graphs • 9

Posted on May 24, 2015 by Jon Awbrey

Re: Ken Regan • The Shapes of Computations The insight 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, but … 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 , , , , , , , , , , , , , , , , , , , , , , , , , | 11 Comments

Animated Logical Graphs • 8

Posted on May 23, 2015 by Jon Awbrey

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, 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 , , , , , , , , , , , , , , , , , , , , , , , , , | 12 Comments

Animated Logical Graphs • 7

Posted on May 22, 2015 by Jon Awbrey

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, 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 , , , , , , , , , , , , , , , , , , , , , , , , , | 12 Comments

Survey of Theme One Program • 1

Posted on May 18, 2015 by Jon Awbrey

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 to support an integrated learning and reasoning interface, … 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 , , , , , , , , , , , , , , , , , , , , , , , , , , | Leave a comment

Survey of Differential Logic • 1

Posted on May 11, 2015 by Jon Awbrey

This is a Survey of blog and wiki posts on Differential Logic, material I plan to develop toward a more compact and systematic account. Elements Differential Logic • Introduction Differential Propositional Calculus • Part 1 • Part 2 Differential Logic … Continue reading →

Posted in Amphecks, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Category Theory, Change, Cybernetics, Differential Analytic Turing Automata, Differential Calculus, Differential Logic, Discrete Dynamics, Equational Inference, Frankl Conjecture, Functional Logic, Gradient Descent, Graph Theory, Hologrammautomaton, Indicator Functions, Inquiry Driven Systems, Leibniz, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Surveys, Time, Topology, Visualization, Zeroth Order Logic | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

Survey of Animated Logical Graphs • 1

Posted on May 10, 2015 by Jon Awbrey

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 Abstraction, Amphecks, Animata, Boole, Boolean Algebra, Boolean Functions, C.S. Peirce, 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 , , , , , , , , , , , , , , , , , , , , , , , , , | 2 Comments

All Process, No Paradox • 6

Posted on January 22, 2014 by Jon Awbrey

Re: R.J. Lipton • Anti-Social Networks Re: Lou Kauffman • Iterants, Imaginaries, Matrices Comments I made elsewhere about computer science and (anti-)social networks have a connection with the work in progress on this thread, so it may steal a march … Continue reading →

Posted in Algorithms, Amphecks, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Cybernetics, Differential Logic, Graph Theory, Laws of Form, Logic, Logical Graphs, Lou Kauffman, Mathematics, Minimal Negation Operators, Painted Cacti, Paradox, Peirce, Process Thinking, Propositional Calculus, Spencer Brown, Systems, Time | Tagged , , , , , , , , , , , , , , , , , , , , , , | 10 Comments

The Lambda Point • 1

Posted on August 1, 2013 by Jon Awbrey

A note on the title.  From long ago discussions with Harvey Davis, one of my math professors at Michigan State.  I remember telling him of my interest in the place where algebra, geometry, and logic meet, and he quipped, “Ah … Continue reading →

Posted in Algebra, Amphecks, Boolean Algebra, C.S. Peirce, Cactus Graphs, Geometry, Graph Theory, Lambda Point, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Peirce, Propositional Calculus, Topology | Tagged , , , , , , , , , , , , , , | Leave a comment

How To Succeed In Proof Business Without Really Trying

Posted on July 15, 2013 by Jon Awbrey

Re: R.J. Lipton • Surely You Are Joking? Comment 1 Even at the mailroom entry point of propositional calculus, there is a qualitative difference between insight proofs and routine proofs.  Human beings can do either sort, as a rule, but … Continue reading →

Posted in Algorithms, Animata, Artificial Intelligence, Automatic Theorem Proving, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Computational Complexity, Graph Theory, Logic, Logical Graphs, Minimal Negation Operators, Model Theory, Peirce, Praeclarum Theorema, Proof Theory, Propositional Calculus, Visualization | Tagged , , , , , , , , , , , , , , , , , , | 7 Comments

Special Classes of Propositions

Posted on May 31, 2013 by Jon Awbrey

Adapted from Differential Propositional Calculus • Special Classes of Propositions A basic proposition, coordinate proposition, or simple proposition in the universe of discourse is one of the propositions in the set Among the propositions in are several families of propositions … Continue reading →

Posted in Boolean Functions, Computational Complexity, Differential Logic, Equational Inference, Functional Logic, Indication, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Propositional Calculus, Visualization | Tagged , , , , , , , , , , , | 2 Comments