Some properties of the syntactic p-recursion categories generated by consistent, recursively enumerable extensions of Peano arithmetic.

DOI10.2307/2274707zbMath0745.03037OpenAlexW2113945089MaRDI QIDQ3984439

Robert A. Di Paola, Franco Montagna

Publication date: 27 June 1992

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274707

zbMATH Keywords

dominical categoriesformal provability\(p\)-recursion categoriesgeneralized first Gödel incompleteness theoremrecursively enumerable extensions of Peano arithmetic

Mathematics Subject Classification ID

Special categories (18B99) Abstract and axiomatic computability and recursion theory (03D75) Proof theory and constructive mathematics (03F99)

Related Items

Obituary: Franco Montagna (1948--2015) ⋮ More existence theorems for recursion categories. ⋮ Introduction to Turing categories ⋮ Aspects of Categorical Recursion Theory

Cites Work

• On certain lattices of degrees of interpretability
• An existence theorem for recursion categories