{
  "schema_version": 1,
  "id": "evt-1968-automath",
  "slug": "automath-language",
  "title": {
    "en": "Automath establishes a language for machine-checkable mathematics",
    "zh-CN": "Automath 建立面向机器检查数学的形式语言"
  },
  "dates": {
    "event": "1968-12-16",
    "first_public_claim": "1968-12-16",
    "paper_release": "1968-12-16",
    "artifact_release": null,
    "independently_verified": null,
    "added_to_chronicle": "2026-09-15",
    "last_updated": "2026-09-15"
  },
  "event_types": [
    "formalization",
    "infrastructure"
  ],
  "significance": {
    "tier": "H2",
    "rationale": {
      "en": "Automath was a foundational early effort to encode substantial mathematics in a formal language whose derivations could be checked mechanically, anticipating dependent-type proof assistants and large formal libraries.",
      "zh-CN": "Automath 是把大规模数学编码进可由机器检查推导的形式语言的奠基性早期尝试，预示了依赖类型证明助手与大型形式数学库。"
    }
  },
  "mathematical_novelty": {
    "type": "tooling_only"
  },
  "interfaces": [
    "formal",
    "symbolic"
  ],
  "claim": {
    "en": "N. G. de Bruijn presented Automath as a language for expressing mathematical texts in a form suitable for automatic checking; the 1968 Symposium on Automatic Demonstration provides a precise public anchor for the system's early record.",
    "zh-CN": "N. G. de Bruijn 将 Automath 提出为一种把数学文本表达成适合自动检查形式的语言；1968 年 Automatic Demonstration Symposium 为其早期公开记录提供了精确时间锚点。"
  },
  "summary": {
    "en": "Automath represented definitions, propositions and proofs in a highly explicit typed formal language so a computer could verify the correctness of derivations.",
    "zh-CN": "Automath 以高度显式的有类型形式语言表示定义、命题与证明，使计算机能够检查推导的正确性。"
  },
  "why_it_matters": {
    "en": "It helped establish the idea that whole mathematical texts—not only isolated logical formulas—could be represented and mechanically checked.",
    "zh-CN": "它推动了“完整数学文本而非孤立逻辑公式也可以形式表示并由机器检查”的理念。"
  },
  "ai_role": {
    "level": "computation_only",
    "description": {
      "en": "Computers checked formally encoded mathematical derivations; proof discovery was not the central AI role.",
      "zh-CN": "计算机负责检查形式编码的数学推导；自动发现证明并非核心 AI 角色。"
    }
  },
  "human_contribution": {
    "description": {
      "en": "De Bruijn designed the formal language and the methodology for encoding mathematical texts for mechanical checking.",
      "zh-CN": "de Bruijn 设计形式语言及把数学文本编码为可机械检查表示的方法。"
    }
  },
  "systems": [
    "automath"
  ],
  "organizations": [
    "eindhoven-university-of-technology"
  ],
  "people": [
    "nicolaas-govert-de-bruijn"
  ],
  "problems": [
    "formal-mathematical-knowledge"
  ],
  "methods": [
    "dependent-types",
    "proof-checking",
    "formalization"
  ],
  "verification": {
    "evidence_level": "E2",
    "status": "paper_released",
    "formal_assurance": "none",
    "history": [
      {
        "date": "1968-12-16",
        "status": "paper_released",
        "evidence_level": "E2",
        "note": {
          "en": "TU/e and the Automatic Demonstration proceedings establish the early Automath language and its purpose.",
          "zh-CN": "TU/e 与 Automatic Demonstration 会议文献确认了早期 Automath 语言及其目标。"
        }
      }
    ]
  },
  "sources": [
    {
      "id": "tue-automath-language-1968",
      "tier": "S1",
      "type": "paper",
      "title": "AUTOMATH, a language for mathematics",
      "url": "https://research.tue.nl/en/publications/automath-a-language-for-mathematics/",
      "primary": true,
      "published_date": null,
      "accessed_at": "2026-09-15"
    }
  ],
  "artifacts": [],
  "relationships": {
    "predecessors": [],
    "successors": [],
    "related": []
  },
  "timeline": {
    "featured": true,
    "significance": "primary"
  },
  "tags": [
    "automath",
    "formalization",
    "proof-checking",
    "formal-mathematics"
  ],
  "editorial": {
    "created_at": "2026-09-15",
    "last_reviewed": "2026-09-15",
    "reviewers": [
      "Charlie-Wang-03"
    ]
  },
  "corrections": []
}