Category Archives: Formal Grammars

Cactus Language • Overview 4

Depending on whether a formal language is called by the type of sign it enlists or the type of object its signs denote, a cactus language may be called a sentential calculus or a propositional calculus, respectively. When the syntactic … Continue reading

Posted in Automata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Differential Logic, Equational Inference, Formal Grammars, Formal Languages, Graph Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Propositional Calculus, Visualization | Tagged , , , , , , , , , , , , , , , , | 3 Comments

Cactus Language • Overview 3

In the development of Cactus Language to date the following two species of graphs have been instrumental. Painted And Rooted Cacti (PARCAI). Painted And Rooted Conifers (PARCOI). It suffices to begin with the first class of data structures, developing their … Continue reading

Posted in Automata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Differential Logic, Equational Inference, Formal Grammars, Formal Languages, Graph Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Propositional Calculus, Visualization | Tagged , , , , , , , , , , , , , , , , | 3 Comments

Cactus Language • Overview 2

In order to facilitate the use of propositions as indicator functions it helps to acquire a flexible notation for referring to propositions in that light, for interpreting sentences in a corresponding role, and for negotiating the requirements of mutual sense … Continue reading

Posted in Automata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Differential Logic, Equational Inference, Formal Grammars, Formal Languages, Graph Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Propositional Calculus, Visualization | Tagged , , , , , , , , , , , , , , , , | 4 Comments

Cactus Language • Overview 1

Thus, what looks to us like a sphere of scientific knowledge more accurately should be represented as the inside of a highly irregular and spiky object, like a pincushion or porcupine, with very sharp extensions in certain directions, and virtually … Continue reading

Posted in Automata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Differential Logic, Equational Inference, Formal Grammars, Formal Languages, Graph Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Propositional Calculus, Visualization | Tagged , , , , , , , , , , , , , , , , | 4 Comments

Infinite Uses → Finite Means

The idea that a language is based on a system of rules determining the interpretation of its infinitely many sentences is by no means novel.  Well over a century ago, it was expressed with reasonable clarity by Wilhelm von Humboldt in … Continue reading

Posted in Automata, Chomsky, Descartes, Finite Means, Formal Grammars, Formal Languages, Foundations of Mathematics, Infinite Use, Innate Ideas, Linguistics, Pigeonhole Principle, Recursion, Syntax, Wilhelm von Humboldt | Tagged , , , , , , , , , , , , , | Leave a comment