Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
sav08:lecture12 [2008/04/02 17:01] vkuncak |
sav08:lecture12 [2008/04/02 17:21] vkuncak |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ====== Equality, Decidable FOL Classes, Universal Class and Its Use ====== | + | ====== Equality, Undecidable and Decidable FOL Classes ====== |
| Continuation of [[lecture11]]. | Continuation of [[lecture11]]. | ||
| Line 15: | Line 15: | ||
| [[Finite Models imply Decidability]] | [[Finite Models imply Decidability]] | ||
| - | [[Turing Machines]] | + | [[Classical Decision Problem]] |
| - | [[Halting Problem]] - diagonalization in finite case | + | ===== Decidable Forall-Exists Class and its Use ===== |
| - | [[Turing-Completeness of 2-counter Machines]] | + | [[Forall-Exists Class Definition]] |
| - | [[Undecidability of Tiling]] | + | [[Deciding Forall-Exists Class]] |
| - | + | ||
| - | [[Complete Recursive Axiomatizations]] | + | |
| - | + | ||
| - | [[Goedel's Theorem]] | + | |
| - | + | ||
| - | [[Classical Decision Problem]] | + | |
| - | ===== Universal Class ===== | + | [[Deciding a Language of Sets and Relations]] |
| - | Motivation: analysis of containers. Set language. Reduction to universal class. Finite models for universal class. | + | [[Verifying Programs with Global Containers]] |