Author:
Mummert Carl,Simpson Stephen G.
Abstract
Abstract.Let n be a positive integer. By a βn-model we mean an ω-model which is elementary with respect to formulas. We prove the following βn-model version of Gödel's Second Incompleteness Theorem. For any recursively axiomatized theory S in the language of second order arithmetic, if there exists a βn-model of S, then there exists a βn-model of S + “there is no countable βn-model of S”. We also prove a βn-model version of Löb's Theorem. As a corollary, we obtain a βn-model which is not a βn+1-model.
Publisher
Cambridge University Press (CUP)
Reference11 articles.
1. Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
2. Friedman Harvey , Subsystems of Set Theory and Analysis, Ph.D. thesis , Massachusetts Institute of Technology, 1967.
3. Subsystems of Second Order Arithmetic
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Corrigenda to “Incompleteness and jump hierarchies”;Proceedings of the American Mathematical Society;2021-04-01
2. Incompleteness and jump hierarchies;Proceedings of the American Mathematical Society;2020-07-29