The Laws of Thought — Interactive Mindmaps

The Laws of Thought by Tom Griffiths Book Cover

by Tom Griffiths

Tom Griffiths's The Laws of Thought reinterprets human cognition through computational principles, arguing our mental shortcuts are optimal solutions to complex problems. It offers a resource-rational framework for students and researchers in cognitive science and AI.

On Insta.page you also get an Apply This Book tool that lets you combine insights from up to 3 books to solve your specific situation.

Chapter mindmaps

Free preview: chapters 1–4 are fully interactive. Click any node to expand or collapse. Subscribe to unlock the rest.

Chapter 1: 1. Turning Aristotle into Arithmetic

Key concepts: 1. Turning Aristotle into Arithmetic

1. Turning Aristotle into Arithmetic

Leibniz's Grand Ambition: A Mathematical Mind

  • Polymath Gottfried Wilhelm Leibniz sought to describe logic with mathematical precision
  • Focused on formalizing Aristotle's syllogisms through numerical coding
  • Proposed checking logical validity via divisibility of assigned number pairs
  • Despite creative efforts, his arithmetical schemes repeatedly failed

The Aristotelian Foundation

  • Aristotle's syllogisms provided a structured starting point with defined forms
  • Syllogisms use four statement types and three terms arranged in standard Figures
  • Aristotle identified 14 valid arguments out of 192 possible combinations
  • Leibniz aimed to create a mathematical algorithm to automatically identify validity

The Dream of a Universal Language

  • Part of broader intellectual movement for a perfect, universal language
  • Thinkers like Descartes and John Wilkins designed symbolic systems to map concepts
  • Leibniz envisioned a 'universal characteristic' where numbers captured logical essence
  • Pioneered view of mind as formal system—rule-based token manipulation independent of medium

Boole's Breakthrough: Algebraic Logic

  • George Boole created an elegant algebraic system for logic unaware of Leibniz's work
  • Used symbols (x, y) to represent classes with operations like multiplication for 'and'
  • Introduced fundamental law x² = x, indicating logic of two states
  • Assigned meanings to 1 ('everything') and 0 ('nothing') in his calculus

From Boolean Algebra to Formal Systems

  • Boole's system refined into propositional logic with truth tables for connectives
  • Shifted from meaning to pure syntax using predefined inference rules
  • Enabled mechanical checks of validity through symbolic manipulation
  • Realized Leibniz's vision of reasoning as executable symbolic game

Boolean Legacy and Future Impact

  • Boole's family continued his intellectual legacy through mathematics and science
  • Boolean logic remained philosophical/mathematical tool for nearly a century
  • Potential as blueprint for actual mechanics of human mind awaited later synthesis
  • Connected structured Victorian thought to twentieth-century fields including physics

The 17th-Century Pursuit of a Universal Language

  • Descartes and Wilkins envisioned a perfect language where concepts were arranged with numerical clarity to eliminate ambiguity.
  • John Wilkins created a hierarchical tree of concepts (Genus, Difference, Species) with symbols reflecting this structure.
  • In Wilkins's system, knowing a word meant understanding its place in knowledge, making nonsensical statements obviously false.
  • Leibniz aimed for a 'universal characteristic' where numbers captured logical essence, not just hierarchical position.
  • Leibniz connected this to his mechanical calculator, believing reason reduced to arithmetic could be automated.

The Mind as a Formal System

  • Leibniz, Descartes, and Wilkins pioneered viewing the mind as a formal system of token manipulation.
  • A formal system is defined by three properties: token manipulation, digital operation, and medium independence.
  • Chess exemplifies a formal system with discrete rules, digital states, and implementation-independent logic.
  • This formalist perspective framed cognition as rule-governed symbol manipulation, foundational for cognitive science.
  • The approach contrasted with analog activities like fencing, which rely on continuous physical interpretation.

George Boole's Algebraic Logic

  • Boole independently created a formal system for thought, inspired by a feud between logicians De Morgan and Hamilton.
  • He used algebraic symbols (x, y) to represent classes of things and operations like xy for intersection ('white sheep').
  • Boole introduced the law x² = x, revealing his system was fundamentally about two states (0 and 1).
  • He assigned 1 to the universal class (everything) and 0 to the empty class (nothing).
  • Boole successfully translated Aristotle's syllogisms into algebraic equations, proving validity through manipulation.

Refinement to Propositional Logic and Truth Tables

  • Later logicians refined Boole's system into propositional logic, dealing with statements as true or false.
  • Logical connectives (AND, OR, NOT, IMPLIES) are precisely defined using truth tables.
  • Truth tables provide a complete digital specification of logical operations, e.g., P ∧ Q is true only if both are true.
  • The IMPLIES operation (→) is defined as false only when the antecedent is true and consequent is false.
  • This development simplified and generalized logical analysis beyond class-based reasoning.

Truth Tables as Mechanical Validity Checks

  • Provide a semantic method to verify argument validity by examining all possible truth value combinations.
  • Can prove classic valid forms like modus ponens by showing no scenario exists where premises are true and conclusion false.
  • Offer a systematic way to check logical consistency across all possible worlds.

Syntax Over Semantics: The Power of Inference Rules

  • Moves logic from semantics (meaning/truth tables) to syntax (symbol manipulation).
  • Uses pre-verified inference rules like modus ponens as building blocks for complex derivations.
  • Enables step-by-step symbolic proofs without exhaustive truth table checks.
  • Suggests thought itself could be modeled as formal symbolic manipulation, potentially executable by a machine.

Boole's Personal Legacy and Family Impact

  • Boole's life was cut short by pneumonia at age 49, but his intellectual legacy continued through his family.
  • His widow, Mary Boole, was a pioneering writer and mathematical psychologist.
  • His five daughters achieved extraordinary success in mathematics, science, medicine, and literature.
  • Family connections include Charles Hinton (fourth-dimension visualization) and Sir Geoffrey Taylor (Manhattan Project physicist).

Boole's Conceptual Innovation: Algebra of Thought

  • Liberated logic from philosophy and language, transforming it into a precise, abstract algebra.
  • Demonstrated that valid reasoning principles could be expressed through symbolic equations like arithmetic.
  • Created a formal system where symbols represent logical classes and operations.
  • His system remained primarily a mathematical/philosophical tool for nearly a century before being applied to cognition.

Historical Through-line and Forward Outlook

  • The Hinton family legacy connects Victorian mathematical thought to 20th-century physics.
  • Boolean logic's potential for modeling mental mechanics remained untapped for decades.
  • The stage is set for the next synthesis: applying Boolean logic to human reasoning and language processes.
  • Requires 20th-century developments in psychology and linguistics to test Boole's system as a blueprint for actual thought.

Chapter 2: 2. Computing a Cognitive Revolution

Mindmap locked. Subscribe to unlock all chapters of The Laws of Thought.

Subscribe to unlock

Chapter 3: 3. Solving Problems

Key concepts: 3. Solving Problems

3. Solving Problems

The Symbolic Insight and Postwar Context

  • Herbert Simon's realization at RAND that computers could manipulate abstract symbols, not just numbers
  • Echoed Ada Lovelace's century-old idea of general-purpose computation
  • Shifted perspective from numerical calculation to symbolic processing as foundation for intelligence
  • Collaboration between Simon, Allen Newell, and Clifford Shaw began with chess as test domain

Development of the Logic Theorist

  • Program evolved from chess to mathematical logic as test domain
  • Simon's dramatic 1956 announcement: 'Over the Christmas holiday, Al Newell and I invented a thinking machine'
  • Initial demonstration used humans acting out program steps with cards
  • First automated proof produced August 9, 1956, shortly after Dartmouth AI workshop

The Core Problem: Searching Formal Systems

  • Chess, geometry, and logic all present the same fundamental challenge
  • Working within formal systems creates overwhelming 'tree' of choices
  • Each decision branches into countless possibilities requiring efficient navigation
  • Exponential branching makes exhaustive search impossible for complex problems

Interdisciplinary Collaboration and Heuristics

  • Newell brought physics background and inspiration from George Pélya's heuristic strategies
  • Simon contributed logic training under Rudolf Carnap and familiarity with Principia Mathematica
  • Shaw provided essential programming expertise on the JOHNNIAC computer
  • Diverse backgrounds enabled blending of heuristics with technical implementation

Evolution to General Problem Solving

  • Logic Theorist evolved into General Problem Solver (GPS) using means-ends analysis
  • Human thought modeled through production systems (if-then rules)
  • Physical symbol system hypothesis: intelligence emerges from physical machines manipulating symbols
  • Dual missions emerged: cognitive science (simulating minds) and AI (building intelligent systems)

Limits and Social Dimensions of Intelligence

  • Rule-based approaches can mimic conversation but stumble on nuance
  • Complex behavior often emerges from simple rules in intricate environments
  • Intelligence is fundamentally social, exemplified by Newell and Simon's partnership
  • Human flourishing depends on collaborative problem-solving and guidance

Logic Theorist: Bridging Heuristics and Computation

  • Combined Polya's heuristics with the logical system of Principia Mathematica
  • Used strategies like working backward and analogy to guide search through inference trees
  • Developed a new list-based information-processing language to manage search effectively
  • Successfully proved theorems and found a more elegant proof than the original

General Problem Solver and Means-Ends Analysis

  • Means-ends analysis identified as a dominant human heuristic: reducing differences between current state and goal
  • GPS was designed to apply this heuristic across multiple domains like logic and algebra
  • Analysis of complex puzzles revealed GPS limitations in modeling human sub-goal setting
  • Led to the development of the production system architecture

Production Systems: Foundation for Cognitive Modeling

  • Architecture based on 'if-then' rules where conditions trigger specific actions
  • Proved powerful for modeling both simple computations and complex human reasoning
  • Became the foundation for Newell and Simon's work on human cognition
  • Could model sophisticated, goal-directed steps in problem-solving

Physical Symbol System Hypothesis

  • Intelligence arises from physical machines that produce and manipulate symbol structures
  • Hypothesis: Such systems are necessary and sufficient for general intelligent action
  • Necessity claim: Any intelligent system will be a physical symbol system
  • Sufficiency claim: Building such a system is all that's needed to achieve intelligence

Testing the Hypothesis: AI and Cognitive Science

  • Cognitive science uses physical symbol systems to simulate human thought processes
  • AI researchers build systems to exhibit intelligent behavior through rules and symbols
  • Inspired ambitious projects like encoding common sense knowledge with millions of rules
  • Revealed both the potential and challenges of capturing human tacit knowledge

Rule-Based Chatbots and the Turing Test

  • Practical application of rule-based systems in conversational agents
  • Eugene Goostman demonstrated both capabilities and limitations of rule-based approaches
  • Could handle common queries but failed on deeper, more nuanced questions
  • Showed the illusion of intelligence through environmental interaction rather than deep understanding

Simplicity in Complex Environments

  • Simon's ant parable: complex behavior emerges from simple rules interacting with complex environments
  • Environmental complexity shapes actions more than intricate internal mechanisms
  • Chatbots appear intelligent because humans provide rich input to simple response rules
  • Reframes AI challenge as understanding basic mechanisms in intricate settings

Social and Collaborative Dimensions of Intelligence

  • Newell and Simon's partnership exemplified heuristic of combining complementary minds
  • Human intelligence thrives on connection, not just problem-solving
  • Creating environments for mutual guidance and support enhances creativity
  • Social collaboration plays crucial role in breaking down complex tasks

Chapter 4: 4. Language as a Formal System

Key concepts: 4. Language as a Formal System

4. Language as a Formal System

Chomsky's Formative Years and Core Insight

  • Disillusionment with behaviorist, cataloguing methods of structural linguistics
  • Mentorship under Zellig Harris and influence of logic/philosophy studies
  • Key insight: Language as a formal system of rules that generates sentences
  • Shift from 'discovery procedures' to generative approach in his master's thesis on Hebrew

Critique of the Statistical Model of Language

  • Information theory (e.g., Shannon) treated language as statistical word-sequence prediction
  • Aligned with behaviorist psychology: learning as associative strengthening of word links
  • Chomsky's counterexample: 'Colorless green ideas sleep furiously' demonstrates grammaticality independent of word co-occurrence probability
  • Shows statistical models cannot account for grammaticality of novel combinations

Formal Grammar as a Mathematical Framework

  • Grammar defined as a formal device specifying all valid sentences
  • Three progressively powerful models: finite-state, phrase-structure, and transformational grammar
  • Transformational grammar: kernel sentences + transformational rules generate surface complexity
  • Establishes the Chomsky hierarchy classifying formal languages by generative power

Explaining Fundamental Cognitive Traits of Language

  • Productivity: Ability to create infinite novel sentences
  • Hierarchical organization: Sentences have nested phrase structure, not linear chains
  • Compositionality: Meaning built from parts according to rules
  • Human languages likely at least mildly context-sensitive within the Chomsky hierarchy

The Innateness Hypothesis and Poverty of the Stimulus

  • Puzzle: How children learn complex rules effortlessly from limited data
  • Poverty of the stimulus argument: Input is insufficient for inductive learning alone
  • Logical problem of language acquisition: Learners cannot rule out all incorrect hypotheses
  • Solution: Innate knowledge—a biologically endowed 'language organ' (modern solution to Plato's problem)

Three Models for Language Description

  • Chomsky defined language as a set of sentences from a finite alphabet and grammar as a formal rule system generating those sentences.
  • Finite-State Grammars were shown inadequate for English due to inability to handle long-distance dependencies like nested sentences.
  • Phrase-Structure Grammars introduced hierarchical rewrite rules that capture grammatical structure independent of word meaning.
  • Transformational Grammar added transformation rules to relate different sentence types (declarative/question, active/passive).

Transformations and Kernel Sentences

  • Transformations manipulate deep structure 'kernel' sentences generated by phrase structure rules.
  • This division simplified linguistic analysis by separating core sentence generation from surface variation.
  • The approach aimed to reduce language's complexity to manageable proportions for study.
  • Transformations explained how a limited set of basic structures could produce immense sentence variety.

The Chomsky Hierarchy

  • Chomsky organized formal languages into a hierarchy: finite-state ⊂ context-free ⊂ context-sensitive.
  • Context-free grammars apply rules regardless of surrounding symbols, while context-sensitive grammars require specific contexts.
  • Research placed human languages as at least mildly context-sensitive, based on structures like cross-serial dependencies.
  • The hierarchy provided a framework for comparing the expressive power of different grammatical models.

Impact of Formal Systems on Cognitive Science

  • Chomsky's approach shifted linguistics from description to modeling the cognitive system generating language.
  • Formal systems explained key cognitive features: productivity, hierarchy, and compositionality.
  • The framework influenced diverse fields including music theory, moral reasoning, and computer science.
  • It created a unified intellectual foundation with Newell and Simon's work, but raised the challenge of language acquisition.

The Poverty of the Stimulus and Innate Knowledge

  • Children acquire complex grammar rapidly from limited, messy input, suggesting innate knowledge.
  • Chomsky's argument is a modern answer to 'Plato's problem' of how we know so much from limited experience.
  • The 'language organ' is posited as a biologically endowed faculty that grows in the mind.
  • The logical problem of language acquisition shows positive examples alone cannot rule out incorrect grammars.
  • Modern AI's success in learning from data invites re-examination of the argument's practical difficulty.

Key Takeaways of Generative Grammar

  • Chomsky's model used phrase structure grammar for kernel sentences and transformational rules for complex structures.
  • The Chomsky hierarchy classifies languages by generative power, with human languages considered mildly context-sensitive.
  • Formal systems explain the productivity, hierarchy, and compositionality of human language.
  • The poverty of the stimulus argument posits innate knowledge is necessary for language acquisition.
  • The logical problem of acquisition highlights a theoretical learning challenge, reevaluated in light of AI.

Continue exploring The Laws of Thought