Tag Archives: Theorem Proving

Charles Sanders Peirce, George Spencer Brown, and Me • 4

Posted on August 6, 2017 by Jon Awbrey

Two things impacting my studies of Peirce and Spencer Brown over the years were my parallel studies in mathematics and computer science.  In the overlap between those areas came courses in logic, mathematical linguistics, and the theory of formal languages, … Continue reading →

Posted in Abstraction, Amphecks, Analogy, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Cybernetics, Deduction, Differential Logic, Duality, Form, Graph Theory, Inquiry, Inquiry Driven Systems, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Model Theory, Peirce, Proof Theory, Propositional Calculus, Semiotics, Sign Relational Manifolds, Sign Relations, Spencer Brown, Theorem Proving, Time, Topology | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 6 Comments

Charles Sanders Peirce, George Spencer Brown, and Me • 3

Posted on July 31, 2017 by Jon Awbrey

Re: Laws of Form There are a number of “difficulties at the beginning” that arise here.  I’ve been trying to get to the point where I can respond to James Bowery’s initial comments and also to questions about the relation … Continue reading →

Posted in Abstraction, Amphecks, Analogy, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Cybernetics, Deduction, Differential Logic, Duality, Form, Graph Theory, Inquiry, Inquiry Driven Systems, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Model Theory, Peirce, Proof Theory, Propositional Calculus, Semiotics, Sign Relational Manifolds, Sign Relations, Spencer Brown, Theorem Proving, Time, Topology | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 6 Comments

Charles Sanders Peirce, George Spencer Brown, and Me • 2

Posted on July 21, 2017 by Jon Awbrey

Re: Laws of Form I’m making an effort to present this material in a more gradual and logical order than I’ve ever managed to do before.  There are issues about the relationship between episodic and semantic memory that are giving … Continue reading →

Posted in Abstraction, Amphecks, Analogy, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Cybernetics, Deduction, Differential Logic, Duality, Form, Graph Theory, Inquiry, Inquiry Driven Systems, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Model Theory, Peirce, Proof Theory, Propositional Calculus, Semiotics, Sign Relational Manifolds, Sign Relations, Spencer Brown, Theorem Proving, Time, Topology | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 8 Comments

Charles Sanders Peirce, George Spencer Brown, and Me • 1

Posted on July 20, 2017 by Jon Awbrey

It’s almost 50 years now since I first encountered the volumes of Peirce’s Collected Papers in the math library at Michigan State, and shortly afterwards a friend called my attention to the entry for Spencer Brown’s Laws of Form in … Continue reading →

Posted in Abstraction, Amphecks, Analogy, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Cybernetics, Deduction, Differential Logic, Duality, Form, Graph Theory, Inquiry, Inquiry Driven Systems, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Model Theory, Peirce, Proof Theory, Propositional Calculus, Semiotics, Sign Relational Manifolds, Sign Relations, Spencer Brown, Theorem Proving, Time, Topology | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 6 Comments

Charles Sanders Peirce, George Spencer Brown, and Me

Posted on July 19, 2017 by Jon Awbrey

James Bowery left a comment on my blog and opened a thread in the Yahoo! group devoted to discussing the mathematics of George Spencer Brown’s Laws of Form.  I’ve been meaning to join that discussion as soon as I could work … Continue reading →

Posted in Abstraction, Amphecks, Analogy, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Cybernetics, Deduction, Differential Analytic Turing Automata, Differential Logic, Duality, Form, Graph Theory, Inquiry, Inquiry Driven Systems, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Model Theory, Proof Theory, Propositional Calculus, Semiotics, Sign Relational Manifolds, Sign Relations, Spencer Brown, Theorem Proving, Time, Topology | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 6 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

Prospects for Inquiry Driven Systems • 1

Posted on January 22, 2016 by Jon Awbrey

I finally finished retyping the bibliography to my systems engineering proposal that had gotten lost in a move between computers, so here is a link to the OEIS Wiki copy. Prospects for Inquiry Driven Systems • Bibliography This may be of … Continue reading →

Posted in Adaptive Systems, Animata, Artificial Intelligence, Automated Research Tools, C.S. Peirce, Cactus Graphs, Constraint Satisfaction Problems, Cybernetics, Differential Logic, Educational Systems Design, Inquiry, Inquiry Driven Systems, Inquiry Into Inquiry, Intelligent Systems Engineering, Learning, Logic, Logic of Science, Logical Graphs, Machine Learning, Peirce, Propositional Calculus, Reasoning, Scientific Method, Semiotics, Sign Relations, Theorem Proving | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , | 2 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