# Category Archives: Cactus Graphs

## Survey of Differential Logic • 5

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

## Theme One Program • Discussion 10

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

## Survey of Theme One Program • 5

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

## Survey of Animated Logical Graphs • 5

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

## Differential Logic and Dynamic Systems • Overview

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

## Survey of Differential Logic • 4

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

## Theme One Program • Exposition 8

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

## Theme One Program • Exposition 7

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

## Theme One Program • Exposition 6

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

## Theme One Program • Jets and Sharks 3

Re: Theme One Program • Jets and Sharks • (1) • (2) Example 5. Jets and Sharks (cont.) Given a representation of the Jets and Sharks universe in computer memory, we naturally want to see if the memory serves to … Continue reading