Tag Archives: Propositional Equation Reasoning Systems

Minimal Negation Operators • 4

Re: Laws Of Form Discussion • Minimal Negation Operators Defining minimal negation operators over a more conventional basis is next in order of logic, if not necessarily in order of every reader’s reading.  For what it’s worth and against the … Continue reading

Posted in Amphecks, 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, Zeroth Order Logic | Tagged , , , , , , , , , , , , , , , , , , , | Leave a comment

Minimal Negation Operators • 3

Re: Laws Of Form Discussion • Minimal Negation Operators • AM It will take a few more rounds of stage-setting before I can get to concrete examples of applications but the following should indicate the direction of generalization embodied in … Continue reading

Posted in Amphecks, 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, Zeroth Order Logic | Tagged , , , , , , , , , , , , , , , , , , , | Leave a comment

Minimal Negation Operators • 2

Re: Laws Of Form Discussion • Minimal Negation Operators 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 slightly more formal definition is given … Continue reading

Posted in Amphecks, 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, Zeroth Order Logic | Tagged , , , , , , , , , , , , , , , , , , , | Leave a comment

Minimal Negation Operators • 1

To accommodate moderate levels of complexity in the application of logical graphs our organon needs a class of organules called “minimal negation operators”. Brief Introduction A minimal negation operator is a logical connective that says “just one false” of its … Continue reading

Posted in Amphecks, 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, Zeroth Order Logic | Tagged , , , , , , , , , , , , , , , , , , , | 1 Comment

Animated Logical Graphs : 10

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 Abstraction, Amphecks, Animata, Automated Research Tools, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Complementarity, Computational Complexity, Constraint Satisfaction Problems, Diagrammatic Reasoning, Duality, Graph Theory, Interpretation, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Model Theory, Painted Cacti, Peirce, Proof Theory, Propositional Calculus, Propositional Equation Reasoning Systems, Semiotics, Spencer Brown, Theorem Proving, Visualization, Zeroth Order Logic | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

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