Notes - Logic and Proof MT24, Decidable theories

Created: October 31, 2024
Updated: January 05, 2025

---

• [[Course - Logic and Proof MT24]]^U
  • [[Notes - Logic and Proof MT24, Logical theories]]^U
  • [[Notes - Logic and Proof MT24, Quantifier elimination]]^U

Flashcards

@Define what it means for a theory $T$ to be decidable.

---

$\pmb T$ has an algorithm that, given a sentence $F$, determines whether or not $F \in \pmb T$.

@Define what it means for a set to be cofinite.

---

The complement is a finite set.

---

Related posts

• [[Course - Logic and Proof MT24]]^U

  (outgoing)
• [[Notes - Logic and Proof MT24, Logical theories]]^U

  (outgoing)
• [[Notes - Logic and Proof MT24, Quantifier elimination]]^U

  (outgoing)
• [[Notes - Logic and Proof MT24, Rado graph]]^U

  (incoming)
• [[Notes - Logic and Proof MT24, Presburger arithmetic]]^U

  (incoming)
• [[Notes - Logic and Proof MT24, Decidability results for first-order logic]]^U

  (sim: 0.642)
• [[Notes - Logic and Proof MT24, Vaught's test]]^U

  (sim: 0.633)
• [[Notes - Logic MT24, Proofs in first-order logic]]^U

  (sim: 0.569)