Tag Archives: Animata

In the Way of Inquiry • Obstacles

Upon this first, and in one sense this sole, rule of reason, that in order to learn you must desire to learn, and in so desiring not be satisfied with what you already incline to think, there follows one corollary … Continue reading

Posted in Animata, C.S. Peirce, Inquiry, Inquiry Driven Systems, Inquiry Into Inquiry, Intelligent Systems, Semiotics | Tagged , , , , , , | Leave a comment

In the Way of Inquiry • Recircus

I must lie down where all the ladders start In the foul rag and bone shop of the heart. — W.B. Yeats I have in mind circling back to a point in my project on Inquiry Driven Systems, namely, the chapter … Continue reading

Posted in Animata, C.S. Peirce, Inquiry, Inquiry Driven Systems, Inquiry Into Inquiry, Intelligent Systems, Semiotics | Tagged , , , , , , | Leave a comment

Zeroth Law Of Semiotics • Discussion 4

Re: Zeroth Law Of Semiotics • All Liar, No Paradox Re: FB | Pattern Languages for Systemic Transformation • Esteban Trev JA: A statement asserts that a statement is a statement that is false. The statement violates an axiom of … Continue reading

Posted in Animata, C.S. Peirce, Denotation, Information = Comprehension × Extension, Liar Paradox, Logic, Logical Graphs, Mathematics, Nominalism, Pragmatic Maxim, Semiositis, Semiotics, Sign Relations, Zeroth Law Of Semiotics | Tagged , , , , , , , , , , , , , | 2 Comments

Zeroth Law Of Semiotics • Discussion 3

Re: Zeroth Law Of Semiotics • All Liar, No Paradox Re: FB | Charles S. Peirce Society • Kent Olson KO: The liar paradox is a self-referential paradox, yes? I think Russell answered these. Dear Kent, Russell had no inkling … Continue reading

Posted in Animata, C.S. Peirce, Denotation, Information = Comprehension × Extension, Liar Paradox, Logic, Logical Graphs, Mathematics, Nominalism, Pragmatic Maxim, Semiositis, Semiotics, Sign Relations, Zeroth Law Of Semiotics | Tagged , , , , , , , , , , , , , | 2 Comments

Survey of Differential Logic • 4

This is a Survey of blog and wiki posts on Differential Logic, material I plan to develop toward a more compact and systematic account. Elements Differential Propositional Calculus Part 1 • Part 2 • Appendices • References Differential Logic • … Continue reading

Posted in Amphecks, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Category Theory, Change, Cybernetics, Differential Analytic Turing Automata, Differential Calculus, Differential Logic, Discrete Dynamics, Equational Inference, Frankl Conjecture, Functional Logic, Gradient Descent, Graph Theory, Hologrammautomaton, Indicator Functions, Inquiry Driven Systems, Leibniz, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Surveys, Time, Topology, Visualization, Zeroth Order Logic | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | Leave a comment

Zeroth Law Of Semiotics • Discussion 2

Re: All Liar, No Paradox • Zeroth Law Of Semiotics Re: FB | Charles S. Peirce Society • Joseph Harry Paradoxes star among my first loves in logic.  So enamored was I with tricks of the mind’s eye I remember … Continue reading

Posted in Animata, C.S. Peirce, Denotation, Information = Comprehension × Extension, Liar Paradox, Logic, Logical Graphs, Mathematics, Nominalism, Pragmatic Maxim, Semiositis, Semiotics, Sign Relations, Zeroth Law Of Semiotics | Tagged , , , , , , , , , , , , , | 2 Comments

Abduction, Deduction, Induction, Analogy, Inquiry • 31

Re: Scott Aaronson • Explanation-Gödel and Plausibility-Gödel Scott Aaronson asks a question arising from Gödel’s First Incompleteness Theorem, namely, what are its consequences for the differential values of explanation, plausibility, and proof?  I add the following thoughts. A general heuristic … Continue reading

Posted in Abduction, Analogy, Animata, Aristotle, Artificial Intelligence, C.S. Peirce, Deduction, Induction, Inquiry, Inquiry Driven Systems, Intelligent Systems Engineering, Logic, Mathematics, Scientific Method, Semiotics, Visualization | Tagged , , , , , , , , , , , , , , , | 2 Comments

Theme One Program • Exposition 8

Transformation Rules and Equivalence Classes The abstract character of the cactus language relative to its logical interpretations makes it possible to give abstract rules of equivalence for transforming cacti among themselves and partitioning the space of cacti into formal equivalence … 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 , , , , , , , , , , , , , , , , , , , , , , , , , , | 2 Comments

Theme One Program • Exposition 7

Mathematical Structure and Logical Interpretation The main things to take away from the previous post are the following two ideas, one syntactic and one semantic. The compositional structures of cactus graphs and cactus expressions are constructed from two kinds of connective operations. … 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 , , , , , , , , , , , , , , , , , , , , , , , , , , | 2 Comments

Theme One Program • Exposition 6

Quickly recapping the discussion so far, we started with a data structure called an idea‑form flag and adopted it as a building block for constructing a species of graph-theoretic data structures called painted and rooted cacti.  We showed how to code … 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 , , , , , , , , , , , , , , , , , , , , , , , , , , | 3 Comments