Category Archives: Painted Cacti

Logic Syllabus • Discussion 1

Posted on June 2, 2023 by Jon Awbrey

Re: Logic Syllabus Re: Laws of Form • John Mingers JM: In a previous post you mentioned the minimal negation operator.  Is there also the converse of this, i.e. an operator which is true when exactly one of its arguments … 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 , , , , , , , , , , , , , , , , , , , | 1 Comment

Survey of Differential Logic • 5

Posted on April 25, 2023 by Jon Awbrey

This is a Survey of work in progress on Differential Logic, resources under development toward a more systematic treatment. Differential logic is the component of logic whose object is the description of variation — the aspects of change, difference, distribution, … Continue reading →

Posted in Amphecks, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Category Theory, Change, Cybernetics, Differential Analytic Turing Automata, Differential Calculus, Differential Logic, Discrete Dynamics, Equational Inference, Frankl Conjecture, Functional Logic, Gradient Descent, Graph Theory, Hologrammautomaton, Indicator Functions, Inquiry Driven Systems, Leibniz, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Surveys, Time, Topology, Visualization, Zeroth Order Logic | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | Leave a comment

Theme One Program • Discussion 10

Posted on April 17, 2023 by Jon Awbrey

Re: Mathstodon • Seamus Bradley SB: I thought of a programming language where every function can only return one type:  the return type.  The return type is just a wrapper around a struct that contains the actual return value, but … Continue reading →

Posted in Algorithms, Animata, Artificial Intelligence, Boolean Functions, C.S. Peirce, Cactus Graphs, Cognition, Computation, Constraint Satisfaction Problems, Data Structures, Differential Logic, Equational Inference, Formal Languages, Graph Theory, Inquiry Driven Systems, Laws of Form, Learning Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Semiotics, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

Survey of Theme One Program • 5

Posted on March 30, 2023 by Jon Awbrey

This is a Survey of blog and wiki posts relating to the Theme One Program I worked on all through the 1980s.  The aim was to develop fundamental algorithms and data structures for integrating empirical learning with logical reasoning.  I … Continue reading →

Posted in Algorithms, Animata, Artificial Intelligence, Boolean Functions, C.S. Peirce, Cactus Graphs, Cognition, Computation, Constraint Satisfaction Problems, Data Structures, Differential Logic, Equational Inference, Formal Languages, Graph Theory, Inquiry Driven Systems, Laws of Form, Learning Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Semiotics, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , | 4 Comments

Survey of Animated Logical Graphs • 5

Posted on March 28, 2023 by Jon Awbrey

This is a Survey of blog and wiki posts on Logical Graphs, encompassing several families of graph-theoretic structures originally developed by Charles S. Peirce as graphical formal languages or visual styles of syntax amenable to interpretation for logical applications. Beginnings Logical Graphs … Continue reading →

Posted in Amphecks, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Computational Complexity, Constraint Satisfaction Problems, Differential Logic, 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 , , , , , , , , , , , , , , , , , , , , , , , , | Leave a comment

Differential Logic and Dynamic Systems • Overview

Posted on March 4, 2023 by Jon Awbrey

In modeling intelligent systems, whether we are trying to understand a natural system or engineer an artificial system, there has long been a tension or trade‑off between dynamic paradigms and symbolic paradigms.  Dynamic models take their cue from physics, using … Continue reading →

Posted in Amphecks, Boolean Functions, C.S. Peirce, Cactus Graphs, Category Theory, Change, Computational Complexity, Cybernetics, Differential Analytic Turing Automata, Differential Calculus, Differential Logic, Discrete Dynamics, Dynamical Systems, Equational Inference, Functional Logic, Gradient Descent, Graph Theory, Group Theory, Hologrammautomaton, Indicator Functions, Logic, Logical Graphs, Mathematical Models, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Propositional Equation Reasoning Systems, Time, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 2 Comments

Survey of Differential Logic • 4

Posted on November 20, 2022 by Jon Awbrey

This is a Survey of blog and wiki posts on Differential Logic, material I plan to develop toward a more compact and systematic account. Elements Differential Propositional Calculus Part 1 • Part 2 • Appendices • References Differential Logic • … Continue reading →

Posted in Amphecks, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Category Theory, Change, Cybernetics, Differential Analytic Turing Automata, Differential Calculus, Differential Logic, Discrete Dynamics, Equational Inference, Frankl Conjecture, Functional Logic, Gradient Descent, Graph Theory, Hologrammautomaton, Indicator Functions, Inquiry Driven Systems, Leibniz, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Surveys, Time, Topology, Visualization, Zeroth Order Logic | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | Leave a comment

Theme One Program • Exposition 8

Posted on October 8, 2022 by Jon Awbrey

Transformation Rules and Equivalence Classes The abstract character of the cactus language relative to its logical interpretations makes it possible to give abstract rules of equivalence for transforming cacti among themselves and partitioning the space of cacti into formal equivalence … Continue reading →

Posted in Algorithms, Animata, Artificial Intelligence, Boolean Functions, C.S. Peirce, Cactus Graphs, Cognition, Computation, Constraint Satisfaction Problems, Data Structures, Differential Logic, Equational Inference, Formal Languages, Graph Theory, Inquiry Driven Systems, Laws of Form, Learning Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Semiotics, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , | 2 Comments

Theme One Program • Exposition 7

Posted on September 30, 2022 by Jon Awbrey

Mathematical Structure and Logical Interpretation The main things to take away from the previous post are the following two ideas, one syntactic and one semantic. The compositional structures of cactus graphs and cactus expressions are constructed from two kinds of connective operations. … Continue reading →

Posted in Algorithms, Animata, Artificial Intelligence, Boolean Functions, C.S. Peirce, Cactus Graphs, Cognition, Computation, Constraint Satisfaction Problems, Data Structures, Differential Logic, Equational Inference, Formal Languages, Graph Theory, Inquiry Driven Systems, Laws of Form, Learning Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Semiotics, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , | 2 Comments

Theme One Program • Exposition 6

Posted on September 29, 2022 by Jon Awbrey

Quickly recapping the discussion so far, we started with a data structure called an idea‑form flag and adopted it as a building block for constructing a species of graph-theoretic data structures called painted and rooted cacti.  We showed how to code … Continue reading →

Posted in Algorithms, Animata, Artificial Intelligence, Boolean Functions, C.S. Peirce, Cactus Graphs, Cognition, Computation, Constraint Satisfaction Problems, Data Structures, Differential Logic, Equational Inference, Formal Languages, Graph Theory, Inquiry Driven Systems, Laws of Form, Learning Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Semiotics, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , | 3 Comments