Tag Archives: Automata

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

Inquiry Into Inquiry • Discussion 9

Re: Pragmatic Maxim Re: Academia.edu • Milo Gardner MG: Do you agree that Peirce was limited to bivalent logic? Taking classical logic as a basis for reasoning is no more limiting than taking Dedekind cuts as a basis for constructing … Continue reading

Posted in Automata, C.S. Peirce, Category Theory, Compositionality, Formal Languages, Inference, Information, Information Fusion, Initiative, Inquiry, Logic, Relation Theory, Semiotics, Triadic Relation Irreducibility, Visualization | Tagged , , , , , , , , , , , , , , | 5 Comments

Inquiry Into Inquiry • Discussion 8

Re: Inquiry Into Inquiry • Discussion 7 Re: Academia.edu • Milo Gardner MG: Peirce sensed that bivalent syntax was superceded by trivalent syntax, but never resolved that nagging question. The main thing is not a question of syntax but a … Continue reading

Posted in Automata, C.S. Peirce, Category Theory, Compositionality, Formal Languages, Inference, Information, Information Fusion, Initiative, Inquiry, Logic, Relation Theory, Semiotics, Triadic Relation Irreducibility, Visualization | Tagged , , , , , , , , , , , , , , | 5 Comments

Inquiry Into Inquiry • Discussion 7

Dan Everett has prompted a number of discussions on Facebook recently which touch on core issues in Peirce’s thought — but threads ravel on and fray so quickly in that medium one rarely gets a chance to fill out the … Continue reading

Posted in Automata, C.S. Peirce, Category Theory, Compositionality, Formal Languages, Inference, Information, Information Fusion, Initiative, Inquiry, Logic, Relation Theory, Semiotics, Triadic Relation Irreducibility, Visualization | Tagged , , , , , , , , , , , , , , | 5 Comments

Problems In Philosophy • 12

Re: R.J. Lipton and K.W. Regan • The Night Of The Ethical Algorithm Re: K.W. Regan • The Election Night Time Warp Re: Ontolog Forum • John Sowa JFS: C.S. Peirce made a very clear and sharp distinction between formal … Continue reading

Posted in Aesthetics, Algorithms, Animata, Automata, Beauty, C.S. Peirce, Ethics, Inquiry, Justice, Logic, Model Theory, Normative Science, Peirce, Philosophy, Pragmatism, Problem Solving, Proof Theory, Summum Bonum, Truth, Virtue | Tagged , , , , , , , , , , , , , , , , , , , | 1 Comment

Problems In Philosophy • 11

Re: Problems In Philosophy 9 • Richard Saunders RS: BTW I’m not sure I really see a distinction between descriptive and normative (prescriptive?) science except in the set of aims, goals, etc. that are entertained.  It might be useful to try … Continue reading

Posted in Aesthetics, Algorithms, Animata, Automata, Beauty, C.S. Peirce, Ethics, Inquiry, Justice, Logic, Model Theory, Normative Science, Peirce, Philosophy, Pragmatism, Problem Solving, Proof Theory, Summum Bonum, Truth, Virtue | Tagged , , , , , , , , , , , , , , , , , , , | 1 Comment

Problems In Philosophy • 10

Re: Ontolog Forum • David Whitten DW: Why does classical tradition or any tradition consider logic to be a normative science? Dear David, A science is called that because it deals in knowledge (Latin scientia).  Knowing what is the case … Continue reading

Posted in Aesthetics, Algorithms, Animata, Automata, Beauty, C.S. Peirce, Ethics, Inquiry, Justice, Logic, Model Theory, Normative Science, Peirce, Philosophy, Pragmatism, Problem Solving, Proof Theory, Summum Bonum, Truth, Virtue | Tagged , , , , , , , , , , , , , , , , , , , | 2 Comments