Arithmetic complexity of the predicate logics of certain complete arithmetic theories

DOI10.1016/S0168-0072(01)00061-6zbMath0992.03074MaRDI QIDQ5957916

Valery Plisko

Publication date: 5 September 2002

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

arithmetic hierarchyconstructive arithmetic theoryconstructive logicpartial truth definition

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Intuitionistic mathematics (03F55)

Related Items (1)

Polynomially bounded recursive realizability

Cites Work

• Constructive formalization of the Tennenbaum theorem and its applications
• Modified realizability and predicate logic
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• SOME VARIANTS OF THE NOTION OF REALIZABILITY FOR PREDICATE FORMULAS
• On the interpretation of intuitionistic number theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Arithmetic complexity of the predicate logics of certain complete arithmetic theories