Decidable Formulas Of Intuitionistic Primitive Recursive Arithmetic

Reports on Mathematical Logic 36 (1):55-61 (2002)
Download Edit this record How to cite View on PhilPapers
By formalizing some classical facts about provably total functions of intuitionistic primitive recursive arithmetic (iPRA), we prove that the set of decidable formulas of iPRA and of iΣ1+ (intuitionistic Σ1-induction in the language of PRA) coincides with the set of its provably ∆1-formulas and coincides with the set of its provably atomic formulas. By the same methods, we shall give another proof of a theorem of Marković and De Jongh: the decidable formulas of HA are its provably ∆1-formulas.
No keywords specified (fix it)
PhilPapers/Archive ID
Upload history
Archival date: 2021-02-22
View other versions
Added to PP index

Total views
30 ( #66,218 of 69,010 )

Recent downloads (6 months)
11 ( #54,165 of 69,010 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.