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:56] vkuncak |
sav08:first-order_logic_is_undecidable [2008/04/03 12:56] vkuncak |
||
---|---|---|---|
Line 17: | Line 17: | ||
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: | + | Note the following equivalent statements of our target condition: |
$F$ is valid iff $M$ accepts $w$ | $F$ is valid iff $M$ accepts $w$ |