Category Archives: Minimal Negation Operators

Theme One • A Program Of Inquiry 17

Posted on December 7, 2018 by Jon Awbrey

The move is all over but the unpacking, and the time looks ripe to pick up the following thread from last spring.  Here, by way of a quick refresher, are a few Tables from earlier discussions. Theme One • A … 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 , , , , , , , , , , , , , , , , , , , , , , , , , , | 7 Comments

Differential Logic, Dynamic Systems, Tangent Functors • Discussion 2

Posted on October 5, 2018 by Jon Awbrey

Re: Cybernetic Communications • SU One thing that interests me here is the relation between narratives and navigation.  Navigation has to do with how we move through actual state spaces while narratives are the tales we tell about past adventures … Continue reading →

Posted in Amphecks, Boolean Functions, C.S. Peirce, Cactus Graphs, Category Theory, Cybernetics, Differential Analytic Turing Automata, Differential Calculus, Differential Logic, Discrete Dynamical Systems, Dynamical Systems, Graph Theory, Hill Climbing, Hologrammautomaton, Information Theory, Inquiry Driven Systems, Intelligent Systems, Knowledge Representation, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Propositional Equation Reasoning Systems, Spencer Brown, Systems, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 11 Comments

Differential Logic, Dynamic Systems, Tangent Functors • Discussion 1

Posted on October 1, 2018 by Jon Awbrey

Re: Cybernetics • Stuart Umpleby Susan and I just returned from our annual dramatic immersion in Stratford Ontario and the last play we saw was a playfully dramatic rendition of Milton’s Paradise Lost. That and the spectacular immorality play currently … Continue reading →

Posted in Amphecks, Boolean Functions, C.S. Peirce, Cactus Graphs, Category Theory, Cybernetics, Differential Analytic Turing Automata, Differential Calculus, Differential Logic, Discrete Dynamical Systems, Dynamical Systems, Graph Theory, Hill Climbing, Hologrammautomaton, Information Theory, Inquiry Driven Systems, Intelligent Systems, Knowledge Representation, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Propositional Equation Reasoning Systems, Spencer Brown, Systems, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 8 Comments

Differential Logic, Dynamic Systems, Tangent Functors • 1

Posted on September 5, 2018 by Jon Awbrey

People interested in category theory as applied to systems may wish to check out the following article, reporting work I carried out while engaged in a systems engineering program at Oakland University. The problem addressed is a longstanding one, that … Continue reading →

Posted in Amphecks, Boolean Functions, C.S. Peirce, Cactus Graphs, Category Theory, Cybernetics, Differential Analytic Turing Automata, Differential Calculus, Differential Logic, Discrete Dynamical Systems, Dynamical Systems, Graph Theory, Hill Climbing, Hologrammautomaton, Information Theory, Inquiry Driven Systems, Intelligent Systems, Knowledge Representation, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Propositional Equation Reasoning Systems, Spencer Brown, Systems, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 14 Comments

Theme One Program • Discussion 4

Posted on June 28, 2018 by Jon Awbrey

Re: Systems Science • Joseph Simpson Let me step back and talk about the research intention driving this work. In a very real sense everything I’ve been doing along this line of inquiry for the last fifty years falls within … 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 , , , , , , , , , , , , , , , , , , , , , , , , , , | 6 Comments

Theme One Program • Discussion 3

Posted on June 26, 2018 by Jon Awbrey

What I’m doing this summer … Eighteen years living in the same place and we blissfully forgot what it takes to pack up a house and find a new one.  Thankfully most of the renovation work is done but it’s … 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 , , , , , , , , , , , , , , , , , , , , , , , , , , | 6 Comments

Theme One Program • Discussion 2

Posted on June 11, 2018 by Jon Awbrey

Re: Systems Science • Joseph Simpson Warfield gets it right about the relationship between object languages and metalanguages.  Something about the prefix meta- has contributed to a not uncommon misconception that metalanguages are formalized to a higher degree than the … 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 , , , , , , , , , , , , , , , , , , , , , , , , , , | 6 Comments

Theme One Program • Exposition 3

Posted on June 10, 2018 by Jon Awbrey

Coding Logical Graphs My earliest experiments coding logical graphs as dynamic “pointer” data structures taught me that conceptual and computational efficiencies of a critical sort could be achieved by generalizing their abstract graphs from trees to the variety graph theorists … 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 2

Posted on June 9, 2018 by Jon Awbrey

The previous post described the elementary data structure used to represent nodes of graphs in the Theme One program.  This post describes the specific family of graphs employed by the program. Figure 1 shows a typical example of a painted … 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 1

Posted on June 8, 2018 by Jon Awbrey

Theme One is a program for building and transforming a particular species of graph-theoretic data structures, forms designed to support a variety of fundamental learning and reasoning tasks. The program evolved over the course of an exploration into the integration … 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