Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revision Both sides next revision | ||
|
sav08:first-order_logic_is_undecidable [2008/04/03 12:54] vkuncak |
sav08:first-order_logic_is_undecidable [2008/04/03 12:56] vkuncak |
||
|---|---|---|---|
| Line 16: | Line 16: | ||
| Technical difficulty: no simple way to express sequences, reachability, or finiteness in first order logic. | Technical difficulty: no simple way to express sequences, reachability, or finiteness in first order logic. | ||
| + | |||
| + | Note the following equivalences: | ||
| $F$ is valid iff $M$ accepts $w$ | $F$ is valid iff $M$ accepts $w$ | ||