Abstract
In this paper, we discuss the connections between proofs in logics with axiomatic deduction system and the deduction problems of a logic called first order universal pattern logic (UPL-1). We propose a method which can efficiently convert proofs in axiomatic logics to formula sequences in UPL-1 whereby we can check the validity of the proofs, and then a decidable proof checking approach is sketched out.
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.
