Differences
This shows you the differences between two versions of the page.
Next revision | Previous revision Last revision Both sides next revision | ||
sav08:undecidability_of_first-order_logic [2008/04/02 17:02] vkuncak created |
sav08:undecidability_of_first-order_logic [2008/04/03 11:47] vkuncak |
||
---|---|---|---|
Line 1: | Line 1: | ||
- | ====== Undecidabilityy of First-Order Logic ====== | + | ====== Undecidability of First-Order Logic ====== |
+ | |||
+ | ===== Background ===== | ||
[[Turing Machines]] | [[Turing Machines]] | ||
- | [[Halting Problem]] - diagonalization in finite case | + | ===== Result ===== |
- | [[Turing-Completeness of 2-counter Machines]] | + | [[First-Order Logic is Undecidable]] |
- | [[Undecidability of Tiling]] | + | ===== Consequences ===== |
[[Complete Recursive Axiomatizations]] | [[Complete Recursive Axiomatizations]] |