Abstract
The logic of single-conclusion ( functional) proofs ( FLP ) is introduced. It combines the verification property of proofs with the single valuedness of proof predicate and describes the operations on proofs induced by modus ponens rule and proof checking. It is proved that FLP is decidable, sound and complete with respect to arithmetical proof interpretations based on single-valued proof predicates. The application to arithmetical inference rules specification and PA -admissibility testing is considered. We show that the provability in FLP gives the complete admissibility test for the rules which can be specified by schemes in FLP -language. The test is supplied with the ground proof extraction algorithm which eliminates the admissible rules from a PA -proof by utilizing the information from the corresponding FLP -proofs.
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.
