Tag Archives: Sign Relations

Sign Relations, Triadic Relations, Relations • 6

Re: Ontolog Forum • Joseph Simpson Just by way of clarifying and emphasizing a few points — I use the word relation to mean a special type of mathematical object, namely, a designated subset included within a cartesian product of sets. … Continue reading

Posted in C.S. Peirce, Icon Index Symbol, Knowledge Representation, Logic, Logic of Relatives, Mathematics, Ontology, Peirce, Pragmatism, Relation Theory, Semiosis, Semiotics, Sign Relations, Triadic Relations, Triadicity | Tagged , , , , , , , , , , , , , , | 16 Comments

Sign Relations, Triadic Relations, Relations • 5

Re: Ontolog Forum • Ravi Sharma I chose those examples of triadic relations to be as simple as possible without being completely trivial but they already exemplify many features we need to keep in mind in all the more complex … Continue reading

Posted in C.S. Peirce, Icon Index Symbol, Knowledge Representation, Logic, Logic of Relatives, Mathematics, Ontology, Peirce, Pragmatism, Relation Theory, Semiosis, Semiotics, Sign Relations, Triadic Relations, Triadicity | Tagged , , , , , , , , , , , , , , | 18 Comments

Sign Relations, Triadic Relations, Relations • 4

The middle ground between relations in general and the sign relations we need to do logic, inquiry, communication, and so on is occupied by triadic relations, also called ternary or 3‑place relations. Triadic relations are some of the most pervasive … Continue reading

Posted in C.S. Peirce, Icon Index Symbol, Knowledge Representation, Logic, Logic of Relatives, Mathematics, Ontology, Peirce, Pragmatism, Relation Theory, Semiosis, Semiotics, Sign Relations, Triadic Relations, Triadicity | Tagged , , , , , , , , , , , , , , | 18 Comments

Sign Relations, Triadic Relations, Relations • 3

At the wide end of the funnel, here’s an introduction to relations in general, focusing on the discrete mathematical variety we find most useful in applications, for example, as background for relational data bases and empirical data. Relation Theory • OEIS Wiki … Continue reading

Posted in C.S. Peirce, Icon Index Symbol, Knowledge Representation, Logic, Logic of Relatives, Mathematics, Ontology, Peirce, Pragmatism, Relation Theory, Semiosis, Semiotics, Sign Relations, Triadic Relations, Triadicity | Tagged , , , , , , , , , , , , , , | 16 Comments

Sign Relations, Triadic Relations, Relations • 2

I always have trouble deciding whether to start with the genus and drive down to the species or else to start with concrete examples and follow Sisyphus up Mt. Abstraction. Soon after I made my 3rd try at grad school, this … Continue reading

Posted in C.S. Peirce, Icon Index Symbol, Knowledge Representation, Logic, Logic of Relatives, Mathematics, Ontology, Peirce, Pragmatism, Relation Theory, Semiosis, Semiotics, Sign Relations, Triadic Relations, Triadicity | Tagged , , , , , , , , , , , , , , | 16 Comments

Theme One Program • Motivation 6

Comments I made in reply to a correspondent’s questions about delimiters and tokenizing in the Learner module may be worth sharing here. As a part of my M.A. work in psychology I applied my Theme One program to samples of … 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, Sign Relations, Spencer Brown, Syntax, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 2 Comments

Theme One Program • Motivation 5

Since I’m working from decades-old memories of first inklings I thought I might peruse the web for current information about Zipf’s Law.  I see there is now something called the Zipf–Mandelbrot (and sometimes –Pareto) Law and that was interesting because … 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, Sign Relations, Spencer Brown, Syntax, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 2 Comments

Theme One Program • Motivation 4

From Zipf’s Law and the category of “things that vary inversely to frequency” I got my first brush with the idea that keeping track of usage frequencies is part and parcel of building efficient codes. In its first application the … 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, Sign Relations, Spencer Brown, Syntax, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 2 Comments

Theme One Program • Motivation 3

Sometime around 1970 John B. Eulenberg came from Stanford to direct Michigan State’s Artificial Language Lab, where I would come to spend many interesting hours hanging out all through the 70s and 80s.  Along with its research program the lab … 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, Sign Relations, Spencer Brown, Syntax, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 2 Comments

Theme One Program • Motivation 2

A side-effect of working on the Theme One program over the course of a decade was the measure of insight it gave me into the reasons why empiricists and rationalists have so much trouble understanding each other, even when those … 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, Sign Relations, Spencer Brown, Syntax, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 2 Comments