LARA

This is an old revision of the document!

Equality, Decidable FOL Classes, Universal Class and Its Use

Continuation of lecture11.

More on Equality

Herbrand Universe for Equality

Proof Rule for Equality

Undecidable and Decidable Classes of FOL Formulas

Undecidability of First-Order Logic

Finite Models imply Decidability

Turing Machines

Halting Problem - diagonalization in finite case

Turing-Completeness of 2-counter Machines

Undecidability of Tiling

Complete Recursive Axiomatizations

Goedel's Theorem

Classical Decision Problem

Universal Class

Motivation: analysis of containers. Set language. Reduction to universal class. Finite models for universal class.