Tag Archives: Form

Survey of Definition and Determination • 2

In the early 1990s, “in the middle of life’s journey” as the saying goes, I returned to grad school in a systems engineering program with the idea of taking a more systems-theoretic approach to my development of Peircean themes, from … Continue reading

Posted in C.S. Peirce, Comprehension, Constraint, Definition, Determination, Extension, Form, Indication, Information = Comprehension × Extension, Inquiry, Intension, Logic, Logic of Science, Mathematics, Peirce, Semiotics, Structure | Tagged , , , , , , , , , , , , , , , , | Leave a comment

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. In one of the projects I submitted toward a Master’s in psychology I used the Theme One program to … 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 with 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

Theme One Program • Motivation 1

The main idea behind the Theme One program is the efficient use of graph-theoretic data structures for the tasks of “learning” and “reasoning”. I am thinking of learning in the sense of learning about an environment, in essence, gaining information about … 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

Charles Sanders Peirce, George Spencer Brown, and Me • 16

Re: Conceptual Graphs • Gary Zhu GZ: I’m quite confused on why people are interested in Laws of Form. What is LOF trying to do? Is it just rewriting logic or is there something more fundamental. e.g. a universal algebraic … Continue reading

Posted in Abstraction, Amphecks, Analogy, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Cybernetics, Deduction, Differential Logic, Duality, Form, Graph Theory, Inquiry, Inquiry Driven Systems, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Model Theory, Peirce, Proof Theory, Propositional Calculus, Semiotics, Sign Relational Manifolds, Sign Relations, Spencer Brown, Theorem Proving, Time, Topology | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 2 Comments

Charles Sanders Peirce, George Spencer Brown, and Me • 15

Re: C.S. Peirce, Spencer Brown, and Me • 11 Re: Ontolog Forum • Michael DeBellis MDB: I’ve just started taking Peirce seriously in the last year or so and some of his more complex ideas still aren’t completely clear to … Continue reading

Posted in Abstraction, Amphecks, Analogy, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Cybernetics, Deduction, Differential Logic, Duality, Form, Graph Theory, Inquiry, Inquiry Driven Systems, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Model Theory, Peirce, Proof Theory, Propositional Calculus, Semiotics, Sign Relational Manifolds, Sign Relations, Spencer Brown, Theorem Proving, Time, Topology | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 3 Comments

Charles Sanders Peirce, George Spencer Brown, and Me • 14

Re: C.S. Peirce, Spencer Brown, and Me • 11 Re: Laws of Form • Dirk Baecker DB: Watzlawick’s request for a pragmatic calculus of communication up to now was never appropriately answered.  W. Barnett Pearce and Vernon E. Cronen (Communication, … Continue reading

Posted in Abstraction, Amphecks, Analogy, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Cybernetics, Deduction, Differential Logic, Duality, Form, Graph Theory, Inquiry, Inquiry Driven Systems, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Model Theory, Peirce, Proof Theory, Propositional Calculus, Semiotics, Sign Relational Manifolds, Sign Relations, Spencer Brown, Theorem Proving, Time, Topology | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 3 Comments