Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Undecidability<br />
Even small extensions give undecidable subsets<br />
RDC1 cont. time RDC2 RDC3<br />
• ℓ = r, ⌈S ⌉<br />
• ¬φ, φ∨ψ, φ ⌢ ψ<br />
• S1 = S2<br />
• ¬φ, φ∨ψ, φ ⌢ ψ<br />
• ℓ = x, ⌈S ⌉<br />
• ¬φ, φ∨ψ, φ ⌢ ψ, (∃x)φ<br />
Reduce halting problem (2-counter machines) to satisfiability<br />
Tallinn, November 17- 21, Michael R. Hansen – p.15/29
Hooray! Your file is uploaded and ready to be published.
Saved successfully!
Ooh no, something went wrong!
Change language