# Monthly Archives: June 2022

## Sign Relations • Signs and Inquiry

There is a close relationship between the pragmatic theory of signs and the pragmatic theory of inquiry.  In fact, the correspondence between the two studies exhibits so many congruences and parallels it is often best to treat them as integral … Continue reading

| | 1 Comment

## Sign Relations • Definition

One of Peirce’s clearest and most complete definitions of a sign is one he gives in the context of providing a definition for logic, and so it is informative to view it in that setting. Logic will here be defined … Continue reading

## Sign Relations • Anthesis

Thus, if a sunflower, in turning towards the sun, becomes by that very act fully capable, without further condition, of reproducing a sunflower which turns in precisely corresponding ways toward the sun, and of doing so with the same reproductive … Continue reading

| | 1 Comment

## Theme One Program • Discussion 8

Re: Theme One Program • Exposition (1) (2) (3) (4) Re: Theme One Program • Discussion (7) Re: Ontolog Forum • Alex Shkotin (1) (2) Re: Logical Graphs • Animated Proofs AS: The animation is mesmerizing:  I would watch and … Continue reading

## Survey of Semiotics, Semiosis, Sign Relations • 3

This is a Survey of blog and wiki resources on the theory of signs, variously known as semeiotic or semiotics, and the actions referred to as semiosis which transform signs among themselves in relation to their objects, all as based … Continue reading

| | 1 Comment

## Theme One Program • Discussion 7

Re: Theme One Program • Exposition (1) (2) (3) (4) Re: Ontolog Forum • Alex Shkotin AS: As we both like digraphs and looking at your way of rendering, let me share my lazy way of using Graphviz on one … Continue reading

## Theme One Program • Exposition 5

Lexical, Literal, Logical Theme One puts cactus graphs to work in three distinct but related ways, called lexical, literal, and logical applications.  The three modes of operation employ three distinct but overlapping subsets of the broader species of cacti.  Accordingly we … Continue reading

## Theme One Program • Exposition 4

Parsing Logical Graphs It is possible to write a program that parses cactus expressions into reasonable facsimiles of cactus graphs as pointer structures in computer memory, making edges correspond to addresses and nodes correspond to records.  I did just that … Continue reading

## Theme One Program • Exposition 3

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

## Theme One Program • Exposition 2

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. Painted And Rooted Cacti Figure 1 shows a typical example … Continue reading