Undecidability problem.
#6038
Replies: 1 comment
-
|
For uninterpreted domains there is a complete classification: https://web.eecs.umich.edu/~gurevich/Books/CDP.html |
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
When solving SMT problems using uninterpreted functions and quantifiers over (bounded) real domains, is there a way to determine whether the solver is in an "undecidable fragment" of SMT solving?
Beta Was this translation helpful? Give feedback.
All reactions