Skip to content
Logo EPFL, École polytechnique fédérale de Lausanne
  • About
  • Education
  • Research
  • Innovation
  • Schools
  • Campus
Show / hide the search form
Hide the search form
  • EN
Menu
  2. IC
  3. Laboratories
  4. LARA

LARA

Undecidability of First-Order Logic

Background

Turing Machines

Result

First-Order Logic is Undecidable

Consequences

Complete Recursive Axiomatizations

  • Laboratories
    • Back: Laboratories
    • LARA
      • Back: LARA
      • About
      • News
      • IMPRO
      • Publications
      • Software
      • Teaching
      • Collaboration
      • Funding

In the same section

  • LARA
    • About
    • News
    • IMPRO
    • Publications
    • Software
    • Teaching
    • Collaboration
    • Funding
- Login
Accessibility Legals

© 2026 EPFL, all rights reserved

Trace: • nicg-four • vepar_set_theory • correctness_of_a_g_reasoning • first-order_logic_is_undecidable • review_of_fixpoints_in_semantics • substitution_theorems_for_propositional_logic • e.3_liaison_and_interaction_with_other_research_programmes • e.1_coordination_and_organisation • definition_of_boolean_algebra_with_presburger_arithmetic • undecidability_of_first-order_logic
sav08/undecidability_of_first-order_logic.txt · Last modified: 2008/04/03 13:53 by vkuncak