Gödel–Rosser's Incompleteness Theorem, generalized and optimized for definable theories

DOI10.1093/logcom/exw025zbMath1444.03166arXiv1506.02790OpenAlexW2261973988WikidataQ57533031 ScholiaQ57533031MaRDI QIDQ3133168

Payam Seraji, Saeed Salehi

Publication date: 13 February 2018

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.02790

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Gödel numberings and issues of incompleteness (03F40)

Related Items (3)

CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS ⋮ GÖDEL’S SECOND INCOMPLETENESS THEOREM: HOW IT IS DERIVED AND WHAT IT DELIVERS ⋮ HIERARCHICAL INCOMPLETENESS RESULTS FOR ARITHMETICALLY DEFINABLE EXTENSIONS OF FRAGMENTS OF ARITHMETIC

This page was built for publication: Gödel–Rosser's Incompleteness Theorem, generalized and optimized for definable theories