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 uses, and these applications make use of three distinct but overlapping subsets of the broader species of cacti.  Thus we may find ourselves speaking of expressions, graphs, or files of lexical, literal, or logical types, depending on our focus and point of view at a given moment.

Logical cacti are the most inclusive class, encompassing the whole species of structures described above, and so we have already seen a typical example of a logical cactus, in its avatars as an abstract graph, a pointer structure, and a string of characters suitable for storage in an external text file.

But being a logical cactus is not just a matter of syntactic form — it means being subject to meaningful interpretations as a sign of a logical proposition.  From a logical perspective we expect our cactus expressions to express something, to represent a proposition that can be true or false of something.

For present purposes it will speed things along to skip the discussion of lexical and literal cacti and jump right to the logical and semantic interpretation of cactus graphs.  Readers seeking immediate enlightenment about the details may peruse the outline of notes given below.  My next post in this series will take up the discussion at Note 13.


This entry was posted in Algorithms, Animata, Artificial Intelligence, Boolean Functions, C.S. Peirce, Cactus Graphs, Computation, Computational Complexity, Cybernetics, Data Structures, Differential Logic, Form, Formal Languages, Graph Theory, Inquiry, Inquiry Driven Systems, Intelligent Systems, Laws of Form, Learning, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Pragmatics, Programming, Propositional Calculus, Propositional Equation Reasoning Systems, Reasoning, Semantics, Semiotics, Spencer Brown, Syntax, Theorem Proving and tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , . Bookmark the permalink.

1 Response to Theme One • A Program Of Inquiry : 10

  1. Pingback: Survey of Theme One Program • 2 | Inquiry Into Inquiry

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.