Category Archives: Propositional Equation Reasoning Systems

Minimal Negation Operators • 4

Posted on September 1, 2017 by Jon Awbrey

Note.  I’m including a more detailed definition of minimal negation operators in terms of conventional logical operations largely because readers of particular tastes have asked for it in the past.  But it can easily be skipped until one has a … Continue reading →

Posted in Amphecks, Animata, Boolean Functions, C.S. Peirce, Cactus Graphs, Differential Logic, Functional Logic, Graph Theory, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Propositional Equation Reasoning Systems, Semiotics, Venn Diagrams, Visualization | Tagged , , , , , , , , , , , , , , , , , , , | 10 Comments

Minimal Negation Operators • 3

Posted on August 30, 2017 by Jon Awbrey

It will take a few more rounds of stage-setting before we are able to entertain concrete examples of applications but the following may indicate the direction of generalization embodied in minimal negation operators. To begin, let’s observe two ways of … Continue reading →

Posted in Amphecks, Animata, Boolean Functions, C.S. Peirce, Cactus Graphs, Differential Logic, Functional Logic, Graph Theory, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Propositional Equation Reasoning Systems, Semiotics, Venn Diagrams, Visualization | Tagged , , , , , , , , , , , , , , , , , , , | 11 Comments

Minimal Negation Operators • 2

Posted on August 30, 2017 by Jon Awbrey

Re: Minimal Negation Operators • 1 The brief description of minimal negation operators given in the previous post is enough to convey the rule of their construction.  For future reference, a more formal definition is given below. Initial Definition The … Continue reading →

Posted in Amphecks, Animata, Boolean Functions, C.S. Peirce, Cactus Graphs, Differential Logic, Functional Logic, Graph Theory, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Propositional Equation Reasoning Systems, Semiotics, Venn Diagrams, Visualization | Tagged , , , , , , , , , , , , , , , , , , , | 11 Comments

Minimal Negation Operators • 1

Posted on August 27, 2017 by Jon Awbrey

To accommodate moderate levels of complexity in the application of logical graphs to practical problems our Organon requires a class of organules called “minimal negation operators”.  I outlined the history of their early development from Peirce’s alpha graphs for propositional … Continue reading →

Posted in Amphecks, Animata, Boolean Functions, C.S. Peirce, Cactus Graphs, Differential Logic, Functional Logic, Graph Theory, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Propositional Equation Reasoning Systems, Semiotics, Venn Diagrams, Visualization | Tagged , , , , , , , , , , , , , , , , , , , | 13 Comments

Animated Logical Graphs • 10

Posted on March 3, 2017 by Jon Awbrey

Re: Peirce List Discussion • Charles Pyle Let’s consider Peirce’s logical graphs at the alpha level, the abstract forms of which can be interpreted for propositional logic.  I say “can be interpreted” advisedly because the system of logical graphs itself … 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 • 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 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

Praeclarum Theorema

Posted on October 5, 2008 by Jon Awbrey

The praeclarum theorema, or splendid theorem, is a theorem of propositional calculus that was noted and named by G.W. Leibniz. Continue reading →

Posted in Abstraction, Animata, C.S. Peirce, Cactus Graphs, Deduction, Equational Inference, Form, Graph Theory, Laws of Form, Leibniz, Logic, Logical Graphs, Mathematics, Model Theory, Painted Cacti, Peirce, Praeclarum Theorema, Proof Theory, Propositional Calculus, Propositional Equation Reasoning Systems, Semiotics, Spencer Brown | Tagged , , , , , , , , , , , , , , , , , , , , , | 17 Comments