Tag Archives: Inquiry Driven Systems

Differential Logic • 4

Differential Expansions of Propositions Bird’s Eye View An efficient calculus for the realm of logic represented by boolean functions and elementary propositions makes it feasible to compute the finite differences and the differentials of those functions and propositions. For example, … Continue reading

Posted in Amphecks, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Change, Cybernetics, Differential Calculus, Differential Logic, Discrete Dynamics, Equational Inference, Functional Logic, Gradient Descent, Graph Theory, Inquiry Driven Systems, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Propositional Calculus, Time, Zeroth Order Logic | Tagged , , , , , , , , , , , , , , , , , , , , , , | 6 Comments

Differential Logic • 3

Cactus Language for Propositional Logic Table 1 shows the cactus graphs, the corresponding cactus expressions, their logical meanings under the so‑called existential interpretation, and their translations into conventional notations for a sample of basic propositional forms. Table 1. Syntax and … Continue reading

Posted in Amphecks, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Change, Cybernetics, Differential Calculus, Differential Logic, Discrete Dynamics, Equational Inference, Functional Logic, Gradient Descent, Graph Theory, Inquiry Driven Systems, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Propositional Calculus, Time, Zeroth Order Logic | Tagged , , , , , , , , , , , , , , , , , , , , , , | 4 Comments

Differential Logic • 2

Cactus Language for Propositional Logic The development of differential logic is facilitated by having a moderately efficient calculus in place at the level of boolean-valued functions and elementary logical propositions.  One very efficient calculus on both conceptual and computational grounds … Continue reading

Posted in Amphecks, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Change, Cybernetics, Differential Calculus, Differential Logic, Discrete Dynamics, Equational Inference, Functional Logic, Gradient Descent, Graph Theory, Inquiry Driven Systems, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Propositional Calculus, Time, Zeroth Order Logic | Tagged , , , , , , , , , , , , , , , , , , , , , , | 4 Comments

Differential Logic • 1

Introduction Differential logic is the component of logic whose object is the description of variation — focusing on the aspects of change, difference, distribution, and diversity — in universes of discourse subject to logical description.  A definition that broad naturally … Continue reading

Posted in Amphecks, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Change, Cybernetics, Differential Calculus, Differential Logic, Discrete Dynamics, Equational Inference, Functional Logic, Gradient Descent, Graph Theory, Inquiry Driven Systems, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Propositional Calculus, Time, Zeroth Order Logic | Tagged , , , , , , , , , , , , , , , , , , , , , , | 4 Comments

Constraints and Indications • 2

Re: Constraints and Indications • 1 Re: Ontolog Forum • Joseph Simpson Coping with collaboration, communication, context, integration, interoperability, perspective, purpose, and the reality of the information dimension demands a transition from conceptual environments bounded by dyadic relations to those … Continue reading

Posted in Adaptive Systems, Artificial Intelligence, Ashby, C.S. Peirce, Constraint, Control, Cybernetics, Determination, Error-Controlled Regulation, Feedback, Indication, Indicator Functions, Information, Inquiry, Inquiry Driven Systems, Intelligent Systems, Intentionality, Learning Theory, Semiotic Information, Semiotics, Systems Theory, Uncertainty | Tagged , , , , , , , , , , , , , , , , , , , , , | Leave a comment

Constraints and Indications • 1

Re: Peirce List • Kaina Stoicheia and the Symbol Grounding Problem Re: Jerry Chandler • Christophe Menant • Jon Awbrey • Christophe Menant The system‑theoretic concept of constraint is one that unifies a manifold of other notions — definition, determination, … Continue reading

Posted in Adaptive Systems, Artificial Intelligence, Ashby, C.S. Peirce, Constraint, Control, Cybernetics, Determination, Error-Controlled Regulation, Feedback, Indication, Indicator Functions, Information, Inquiry, Inquiry Driven Systems, Intelligent Systems, Intentionality, Learning Theory, Semiotic Information, Semiotics, Systems Theory, Uncertainty | Tagged , , , , , , , , , , , , , , , , , , , , , | 1 Comment

Theme One Program • Jets and Sharks 3

Re: Theme One Program • Jets and Sharks • (1) • (2) Example 5. Jets and Sharks (cont.) Given a representation of the Jets and Sharks universe in computer memory, we naturally want to see if the memory serves to … 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

Theme One Program • Jets and Sharks 2

Example 5. Jets and Sharks (cont.) As we saw last time, Theme One reads the text file shown below and constructs a cactus graph data structure in computer memory.  The cactus graph represents a single logical formula in propositional calculus and … 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 , , , , , , , , , , , , , , , , , , , , , , , , , , | 4 Comments

Theme One Program • Jets and Sharks 1

It is easy to spend a long time on the rudiments of learning and logic before getting down to practical applications — but I think we’ve circled square one long enough to expand our scope and see what the category … 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

Theme One Program • Exposition 9

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 , , , , , , , , , , , , , , , , , , , , , , , , , , | 3 Comments