# Monthly Archives: August 2017

## Minimal Negation Operators • 3

It will take a few more rounds of stage-setting before we are able to entertain concrete examples of applications but the following may indicate the direction of generalization embodied in minimal negation operators. To begin, let’s observe two ways of … Continue reading

## Minimal Negation Operators • 2

Re: Minimal Negation Operators • 1 The brief description of minimal negation operators given in the previous post is enough to convey the rule of their construction.  For future reference, a more formal definition is given below. Initial Definition The … Continue reading

## Minimal Negation Operators • 1

To accommodate moderate levels of complexity in the application of logical graphs to practical problems our Organon requires a class of organules called “minimal negation operators”.  I outlined the history of their early development from Peirce’s alpha graphs for propositional … Continue reading

## Charles Sanders Peirce, George Spencer Brown, and Me • 10

With any formal system it is easy to spend a long time roughing out primitives and reviewing first principles before getting on to practical applications, and logical graphs are no different in that respect.  But the promise of clearer and more … Continue reading

## Charles Sanders Peirce, George Spencer Brown, and Me • 9

Re: Boundary Logic A wider field of investigation opens up at this point, spanning the diversity of interactions among languages we use, and systems of signs in general, to the thoughts ever streaming through our heads, to the universes we … Continue reading

## Charles Sanders Peirce, George Spencer Brown, and Me • 8

Re: Boundary Logic For me, the heart of the matter is “what is the purpose of logic and what is the purpose of mathematics and what is their relationship?” There are semiotic situations which appear to violate the initial conditions … Continue reading

## Charles Sanders Peirce, George Spencer Brown, and Me • 7

A statement that implies both and is called a false statement, and anyone can prove anything at all from a false statement, as we all too frequently observe on the political front these days. There is however a reasonable way … Continue reading

## Charles Sanders Peirce, George Spencer Brown, and Me • 6

The formal system of logical graphs is defined by a foursome of formal equations, called initials when regarded purely formally, in abstraction from potential interpretations, and called axioms when interpreted as logical equivalences.  There are two arithmetic initials and two … Continue reading

## Charles Sanders Peirce, George Spencer Brown, and Me • 5

Here are blog and wiki versions of an article I wrote on Peirce’s Law, an axiom or theorem (depending on your choice of logical basis) which distinguishes classical from intuitionistic propositional calculus.  Aside from its pivotal logical status it affords … Continue reading

## Charles Sanders Peirce, George Spencer Brown, and Me • 4

Two things that had a big impact on my studies of Peirce and Spencer Brown over the years were my parallel studies in mathematics and computer science.  In the overlap between those areas came courses in logic, mathematical linguistics, and … Continue reading