Abstract
Some higher-order formulas are equivalent to formulas of first-order predicate logic or even propositional logic. In applications where formulas of higherorder predicate logic occur naturally it is very useful to determine whether the given formula is in fact equivalent to a simpler formula of first-order or prepositional logic. Typical applications where this occurs are predicate minimization by circumscription, correspondence theory in non-classical logics and simple versions of set theory. In these areas we are faced with formulas of second-order predicate logic with existentially or universally quantified predicate variables and want to simplify them by computing equivalent first-order formulas.
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.
