Author Archives: Jon Awbrey

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

Re: Laws of Form • James Bowery JB: I’m interested in those who have approached the notion of self‑duality from the meta‑perspective of switching perspectives between Directed Cyclic Graphs of NiNAND and NiNOR gates (Ni for N‑Inputs à la boolean … 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 , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

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

Re: Laws of Form • James Bowery JB: I’m interested in those who have approached the notion of self‑duality from the meta‑perspective of switching perspectives between Directed Cyclic Graphs of NiNAND and NiNOR gates (Ni for N‑Inputs à la boolean … 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 , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

Cactus Language • Pragmatics 16

Stricture, Strait, Constraint, Information, Complexity The ways in which strictures and straits at different levels of complexity relate to one another can be given systematic treatment by introducing the following pair of definitions. Excerpt of a Stricture The excerpt of … Continue reading

Posted in Automata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Differential Logic, Equational Inference, Formal Grammars, Formal Languages, Graph Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Propositional Calculus, Visualization | Tagged , , , , , , , , , , , , , , , , | 2 Comments

Cactus Language • Pragmatics 15

Stricture, Strait, Constraint, Information, Complexity From here it is easy to see how the concatenation of languages is related to the intersection of sets and thus to the conjunction of logical propositions.  In the upshot a cartesian product is described … Continue reading

Posted in Automata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Differential Logic, Equational Inference, Formal Grammars, Formal Languages, Graph Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Propositional Calculus, Visualization | Tagged , , , , , , , , , , , , , , , , | 2 Comments

Cactus Language • Pragmatics 14

Stricture, Strait, Constraint, Information, Complexity To give a concrete example of strictures and straits in action, let us institute a frame of discussion where the number of places in a relation is bounded at two and the variety of sets … Continue reading

Posted in Automata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Differential Logic, Equational Inference, Formal Grammars, Formal Languages, Graph Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Propositional Calculus, Visualization | Tagged , , , , , , , , , , , , , , , , | 2 Comments

Cactus Language • Pragmatics 13

Stricture, Strait, Constraint, Information, Complexity Within the framework of a particular discussion, it is customary to set a bound on the number of places and to limit the variety of sets regarded as being under active consideration and it is … Continue reading

Posted in Automata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Differential Logic, Equational Inference, Formal Grammars, Formal Languages, Graph Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Propositional Calculus, Visualization | Tagged , , , , , , , , , , , , , , , , | 2 Comments

Cactus Language • Pragmatics 12

The concatenation of the formal languages and is just a cartesian product of the sets and but the relation of cartesian products to set‑theoretic intersections and thus to logical conjunctions is not immediately clear.  One way of seeing a type … Continue reading

Posted in Automata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Differential Logic, Equational Inference, Formal Grammars, Formal Languages, Graph Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Propositional Calculus, Visualization | Tagged , , , , , , , , , , , , , , , , | 2 Comments

Cactus Language • Pragmatics 11

I am throwing together a wide variety of different operations into the bins labeled additive and multiplicative but it’s easy to observe a natural organization and even some relations approaching isomorphisms among and between the members of each class. The … Continue reading

Posted in Automata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Differential Logic, Equational Inference, Formal Grammars, Formal Languages, Graph Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Propositional Calculus, Visualization | Tagged , , , , , , , , , , , , , , , , | 2 Comments

Cactus Language • Pragmatics 10

One insight arising from Peirce’s work on the mathematics underlying logic is that the operations on sets known as complementation, intersection, and union, along with the corresponding logical operations of negation, conjunction, and disjunction, are not as fundamental as they … Continue reading

Posted in Automata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Differential Logic, Equational Inference, Formal Grammars, Formal Languages, Graph Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Propositional Calculus, Visualization | Tagged , , , , , , , , , , , , , , , , | 2 Comments

Cactus Language • Pragmatics 9

A moment’s reflection on the issue of style, giving due consideration to the received array of stylistic choices, ought to inspire at least the question:  “Are those the only choices there are?” There are abundant indications that other options, more … Continue reading

Posted in Automata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Differential Logic, Equational Inference, Formal Grammars, Formal Languages, Graph Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Propositional Calculus, Visualization | Tagged , , , , , , , , , , , , , , , , | 2 Comments