Abstract
The class of all quantifier-free formulas constructed from atomic formulas of the form (x+y= z),(x=1), and (x¦y) is considered, where the predicate symbol “¦” is interpreted as the divisibility relation on nonnegative integers. The decidability isproved of the set of all formulas of this form which are true for at least one choice of values for the variables. This result is equivalent to the decidability of the universal theory of natural numbers with addition and divisibility.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
