---
schemaVersion: 1
id: agent-brief:formal-logic-to-computation
articleId: article:formal-logic-to-computation
slug: formal-logic-to-computation
title: 'Agent Brief for "From Formal Logic to Computation: The Mathematical Road to AI"'
tokenBudget: 1200
status: published
updated: 2026-06-20
---

## Thesis

Modern computing and AI became thinkable partly because humans developed formal symbol systems, logic, computability, switching circuits, information theory, and feedback concepts. This article traces those bridges without claiming that logic alone caused AI or that any single inventor created computation.

## Audience

- Curious general readers who want a historical map of computing ideas.
- Students learning formal logic, computability, or AI history.
- Builders who need language for why symbols, procedures, and signals matter.
- Future agents that need a compact, source-backed entry point.

## Claims

- `claim-001`: Algebraic and symbolic treatments of logic helped make reasoning inspectable and manipulable as formal symbol systems.
- `claim-003`: The formalist ambition around mathematical foundations and decision procedures created the problem setting in which computability could be made precise.
- `claim-004`: Gödel’s incompleteness theorems showed that consistent formal systems strong enough for arithmetic have intrinsic limits, complicating the dream of complete formal foundations.
- `claim-005`: Church, Turing, and Post offered different formalizations of effective procedure, helping turn computation into a mathematical subject before modern computers were common.
- `claim-006`: The Church-Turing thesis concerns effective methods and is often misunderstood when treated as a claim about all physical machines or minds.
- `claim-007`: Shannon’s switching-circuit work connected Boolean algebra to relay and switching circuit design, helping make logic part of digital engineering.
- `claim-008`: Shannon’s communication theory provided a mathematical treatment of messages, channels, noise, and information, but it is not a theory of semantic meaning.
- `claim-009`: Cybernetics supplied a language of feedback, control, and communication for thinking about machines and organisms, but feedback alone is not intelligence.

## Source Families

- Primary historical works: Boole (1854), Frege (1879), Whitehead and Russell (1910), Hilbert (1900), Turing (1936-1937), Post (1936), Shannon (1938, 1948), Wiener (1948), von Neumann (1945).
- Public encyclopedia context: Stanford Encyclopedia of Philosophy entries on Leibniz’s logic influence, Frege, Gödel, Church, and the Church-Turing thesis.
- Museum and public-scan support: Computer History Museum digital-logic overview; public scans of Principia Mathematica and Shannon’s communication theory paper.

## Agent Involvement

This article was drafted from the Aura Knowledge meta work package by an AI agent under human direction. The human author retains final judgment over thesis, source selection, wording, and conclusions.

## Recommended Queries

- Which claims in this article are interpretive bridges rather than narrow historical facts?
- What evidence would weaken the claim that computability models are idealized?
- How should this article avoid implying a straight line from formal logic to modern AI?
- Which sources support the distinction between Shannon information and semantic meaning?
- What are the main analogy limits stated in the article body?

## Known Limits

- This is a seed article: historical depth is selective, not exhaustive.
- Stored-program architecture and engineering history are mentioned only briefly; the article does not replace a hardware-history source.
- Source evidence packets contain brief snippets; future revisions should expand direct quotations where copyright and access allow.
- Related series articles (`before-machines`, `birth-of-ai`, `long-human-road-to-ai`) are not yet present in this worktree.