Abstract
Two small classes of first order formulae without function symbols but with identity, in prenex conjunctive normal form with all disjunctions binary, are shown to have a recursively unsolvable decision problem, whereas for another such class an algorithm is developed which solves the decision problem of that class. This solves the prefix problem for such classes of formulae except for the Godel-Kalmar-Schutte case.
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 callMore From: Archiv für mathematische Logik und Grundlagenforschung
Disclaimer: 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.
