Category Archives: Semiotics

Theme One Motivation • 3

Re: Laws Of Form Discussion • JB All through the 70s and 80s I spent many interesting hours hanging out in John Eulenberg’s Artificial Language Lab at Michigan State.  The lab did a lot of work on augmentative communication technology … Continue reading

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 | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | Leave a comment

Theme One Motivation • 2

Re: Sys Sci Group Discussion • (1) Re: Ontolog Forum Discussion • (1) Re: Laws Of Form Discussions • (1) • (2) • (3) A side-effect of working on the Theme One program over the course of a decade was … Continue reading

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 | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | Leave a comment

Theme One Motivation • 1

Re: Sys Sci Group Discussion • (1) Re: Ontolog Forum Discussion • (1) Re: Laws Of Form Discussions • (1) • (2) • (3) The main idea behind the Theme One program is the efficient use of graph-theoretic data structures … Continue reading

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 | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | Leave a comment

Sign Relations, Triadic Relations, Relations • 1

Re: Ontolog Forum Discussion Re: Peirce List Discussion To understand how signs work in Peirce’s theory of triadic sign relations, also known as “semiotics”, we have to understand, in order of increasing generality, sign relations, triadic relations, and relations in … Continue reading

Posted in C.S. Peirce, Inquiry Driven Systems, Knowledge Representation, Logic, Logic of Relatives, Mathematics, Ontology, Peirce, Pragmatism, Relation Theory, Semiosis, Semiotics, Sign Relations, Triadic Relations | Tagged , , , , , , , , , , , , , | Leave a comment

Theme One • A Program Of Inquiry : 15

Re: Laws Of Form Discussions • (1) • (2) • (3) Re: Peirce List Discussions • (1) • (2) • (3) • (4) Re: Ontolog Forum Discussion • (1) An unexpected benefit of cleaning out our basement and putting our … Continue reading

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 | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

Theme One • A Program Of Inquiry : 14

Re: Ontolog Forum Discussion As an alternative to piling generalities on generalities, not that there’s anything wrong with that, it also helps to look at issues as they arise in concrete applications. One of the most concrete applications I ever … Continue reading

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 | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

Definition and Determination : 17

Re: Ontolog Forum Discussion • Richard McCullough RM:  We clearly have some differences in the “definition” of “definition”. I suppose it all depends on the sorts of things one wants to define, something we might call the context of application.  … Continue reading

Posted in C.S. Peirce, Category Theory, Comprehension, Constraint, Definition, Determination, Extension, Form, Geometry, Graph Theory, Group Theory, Information, Inquiry, Inquiry Driven Systems, Logic, Logic of Relatives, Logical Graphs, Mathematics, Ontology, Peirce, Relation Theory, Semiotics, Sign Relations, Structure, Theorem Proving, Topology | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , | Leave a comment