Tag Archives: Minimal Negation Operators

Animated Logical Graphs • 1

For Your Musement … Here are some animations I made up to illustrate several different styles of proof in an extended topological variant of Peirce’s Alpha Graphs for propositional logic. Proof Animations Double Negation Peirce’s Law Praeclarum Theorema Two‑Thirds Majority … Continue reading

Posted in Abstraction, Amphecks, Analogy, Animata, Automated Research Tools, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Deduction, Differential Logic, Duality, Form, Graph Theory, Iconicity, Laws of Form, Leibniz, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Model Theory, Peirce's Law, Praeclarum Theorema, Proof Theory, Propositional Calculus, Propositional Logic, Semiotics, Spencer Brown, Theorem Proving, Topology, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 12 Comments

All Process, No Paradox • 6

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

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

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

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

Finding a Needle in a Cactus Patch

Re: R.J. Lipton • Sex, Lies, And Quantum Computers Don’t know much about quantum computation, but my ventures in graphical syntaxes for propositional calculus did turn up a logical operator whose evaluation process reminded me a little of the themes … Continue reading

Posted in Boolean Functions, C.S. Peirce, Cactus Graphs, Computational Complexity, Graph Theory, Logic, Logical Graphs, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Quantum Computing, Semiotics | Tagged , , , , , , , , , , , , | 4 Comments