Tag Archives: Logical Graphs

Alpha Now, Omega Later • 6

Posted on December 6, 2013 by Jon Awbrey

Re: Alpha Now, Omega Later • Theorems From Physics? • Isomorphism Is Where It’s At In the late 1970s a number of problems in combinatorics and graph theory that I really wanted to know the answers to had driven me … Continue reading →

Posted in C.S. Peirce, Differential Logic, Dynamical Systems, Equational Inference, Laws of Form, Logic, Logical Graphs, Mathematics, Propositional Calculus, Semiotics, Sign Relations, Spencer Brown | Tagged , , , , , , , , , , , | 5 Comments

Alpha Now, Omega Later • 5

Posted on December 4, 2013 by Jon Awbrey

Re: R.J. Lipton and K.W. Regan • Isomorphism Is Where It’s At “Are there more good cases of isomorphism to study?” Just off the top of my head, a couple of examples come to mind. Sign Relations.  In computational settings, … Continue reading →

Posted in C.S. Peirce, Differential Logic, Dynamical Systems, Equational Inference, Laws of Form, Logic, Logical Graphs, Mathematics, Propositional Calculus, Semiotics, Sign Relations, Spencer Brown | Tagged , , , , , , , , , , , | 6 Comments

Alpha Now, Omega Later • 4

Posted on December 3, 2013 by Jon Awbrey

Re: Cristopher Moore on Theorems From Physics? It is critically important to distinguish between the objective landscape, the boolean functions as mathematical objects, and the syntactic landscape, the particular formal language we are using as a propositional calculus to denote … Continue reading →

Posted in C.S. Peirce, Differential Logic, Dynamical Systems, Equational Inference, Laws of Form, Logic, Logical Graphs, Mathematics, Propositional Calculus, Semiotics, Sign Relations, Spencer Brown | Tagged , , , , , , , , , , , | 6 Comments

Alpha Now, Omega Later • 3

Posted on December 2, 2013 by Jon Awbrey

Re: R.J. Lipton and K.W. Regan • Theorems From Physics? Bits of Synchronicity … What kind of information process is scientific inquiry? What kinds of information process are involved in the various types of inference — abductive, deductive, inductive — … Continue reading →

Posted in C.S. Peirce, Differential Logic, Dynamical Systems, Equational Inference, Laws of Form, Logic, Logical Graphs, Mathematics, Propositional Calculus, Semiotics, Sign Relations, Spencer Brown | Tagged , , , , , , , , , , , | 6 Comments

Alpha Now, Omega Later • 2

Posted on November 30, 2013 by Jon Awbrey

It’s been a while since I threaded this thread — and then there were all the delightful distractions of the holiday convergence — so let me refresh my memory as to what drew me back to these environs. I’m still … Continue reading →

Posted in C.S. Peirce, Differential Logic, Dynamical Systems, Equational Inference, Laws of Form, Logic, Logical Graphs, Mathematics, Propositional Calculus, Semiotics, Sign Relations, Spencer Brown | Tagged , , , , , , , , , , , | 6 Comments

Alpha Now, Omega Later • 1

Posted on November 16, 2013 by Jon Awbrey

I am still in the middle of trying to catch up on some long put-off work but recent discussions of logical graphs and physics and the like on the Peirce List have bestirred me from my grindstone long enough to … Continue reading →

Posted in C.S. Peirce, Differential Logic, Dynamical Systems, Equational Inference, Laws of Form, Logic, Logical Graphs, Mathematics, Propositional Calculus, Semiotics, Sign Relations, Spencer Brown | Tagged , , , , , , , , , , , | 8 Comments

Differential Analytic Turing Automata • Discussion 1

Posted on October 14, 2013 by Jon Awbrey

Re: R.J. Lipton and K.W. Regan • Proving Cook’s Theorem Synchronicity Rules❢ I just started reworking an old exposition of mine on Cook’s Theorem, where I borrowed the Parity Function example from Wilf (1986), Algorithms and Complexity, and translated it … 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 , , , , , , , , , , , | 2 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