Monthly Archives: June 2022

Theme One Program • Exposition 1

Theme One is a program for constructing and transforming a particular species of graph‑theoretic data structures, forms designed to support a variety of fundamental learning and reasoning tasks. The program evolved over the course of an exploration into the integration of … Continue reading

Posted in Algorithms, Animata, Artificial Intelligence, Boolean Functions, C.S. Peirce, Cactus Graphs, Cognition, Computation, Constraint Satisfaction Problems, Data Structures, Differential Logic, Equational Inference, Formal Languages, Graph Theory, Inquiry Driven Systems, Laws of Form, Learning Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Semiotics, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , | 5 Comments

Survey of Theme One Program • 4

This is a Survey of blog and wiki posts relating to the Theme One Program I worked on all through the 1980s.  The aim was to develop fundamental algorithms and data structures for integrating empirical learning with logical reasoning.  I … Continue reading

Posted in Algorithms, Animata, Artificial Intelligence, Boolean Functions, C.S. Peirce, Cactus Graphs, Cognition, Computation, Constraint Satisfaction Problems, Data Structures, Differential Logic, Equational Inference, Formal Languages, Graph Theory, Inquiry Driven Systems, Laws of Form, Learning Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Semiotics, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , | 20 Comments

Functional Logic • Inquiry and Analogy • 21

Inquiry and Analogy • Generalized Umpire Operators To get a better handle on the space of higher order propositions and continue developing our functional approach to quantification theory, we’ll need a number of specialized tools.  To begin, we define a … Continue reading

Posted in Abduction, Analogy, Argument, Aristotle, C.S. Peirce, Constraint, Deduction, Determination, Diagrammatic Reasoning, Diagrams, Differential Logic, Functional Logic, Hypothesis, Indication, Induction, Inference, Information, Inquiry, Logic, Logic of Science, Mathematics, Pragmatic Semiotic Information, Probable Reasoning, Propositional Calculus, Propositions, Reasoning, Retroduction, Semiotics, Sign Relations, Syllogism, Triadic Relations, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

Functional Logic • Inquiry and Analogy • 20

Inquiry and Analogy • Application of Higher Order Propositions to Quantification Theory Table 21 provides a thumbnail sketch of the relationships discussed in this section. Resources Logic Syllabus Boolean Function Boolean-Valued Function Logical Conjunction Minimal Negation Operator Introduction to Inquiry … Continue reading

Posted in Abduction, Analogy, Argument, Aristotle, C.S. Peirce, Constraint, Deduction, Determination, Diagrammatic Reasoning, Diagrams, Differential Logic, Functional Logic, Hypothesis, Indication, Induction, Inference, Information, Inquiry, Logic, Logic of Science, Mathematics, Pragmatic Semiotic Information, Probable Reasoning, Propositional Calculus, Propositions, Reasoning, Retroduction, Semiotics, Sign Relations, Syllogism, Triadic Relations, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment