Abstract
Two arithmetic constructive theories based on Dialectica interpretation are introduced and studied in the paper. For an arithmetic formula A let AD be its Dialectica interpretation in the language of arithmetic in all finite types. The translation (AD)° of AD back into the language of first-order arithmetic using the system HRO of hereditary recursive operations is considered. The theories T1 and T2 consist of arithmetic sentences A such that (AD)° is true in the standard model and provable in the intuitionistic arithmetic respectively. Using the author's recent results on the arithmetic complexity of the predicate logics of constructive arithmetic theories it is proved that the logic of T1 is not recursively enumerable and the logic of T2 is II2-complete.
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.
