# Tag Archives: Boolean Functions

## Theme One • A Program Of Inquiry : 12

Re: Laws Of Form Discussions • (1) • (2) • (3) Re: Peirce List Discussions • (1) • (2) • (3) Logical Cacti (cont.) The main things to take away from the previous post are the following two ideas, one syntactic … Continue reading

## Theme One • A Program Of Inquiry : 11

Re: Laws Of Form Discussions • (1) • (2) • (3) Re: Peirce List Discussions • (1) • (2) The portions of exposition just skipped over covered with the use of cactus graphs in the program’s learning module to learn … Continue reading

## Theme One Program • Discussion 1

Re: Laws Of Form Discussion • AM AM:  Why do you need XOR in your inquiry system? Clearly we need a way to represent exclusive disjunction, along with its dual, logical equivalence, in any calculus capable of covering propositional logic, … Continue reading

## Theme One • A Program Of Inquiry : 10

Re: Laws Of Form Discussions • (1) • (2) • (3) Re: Peirce List Discussions • (1) • (2) Lexical, Literal, Logical Theme One puts cactus graphs to work in three distinct but related ways, called lexical, literal, and logical … Continue reading

## Theme One • A Program Of Inquiry : 9

Re: Laws Of Form Discussions • (1) • (2) • (3) Re: Peirce List Discussions • (1) • (2) We have seen how to take an abstract logical graph of a sort a person might have in mind to represent … Continue reading

## Theme One • A Program Of Inquiry : 8

Re: Laws Of Form Discussions • (1) • (2) • (3) Re: Peirce List Discussions • (1) • (2) Coding Logical Graphs My earliest experiments with coding logical graphs as pointer data structures taught me that conceptual and computational efficiencies … Continue reading

## Theme One • A Program Of Inquiry : 7

Re: Laws Of Form Discussions • (1) • (2) • (3) Re: Peirce List Discussions • (1) • (2) Discussion arose in the Laws Of Form Group about computational explorations of George Spencer Brown’s calculus of indications. Readers of Peirce are generally … Continue reading