Annals of Pure and Applied Logic 131 (1-3):159-175 (2005)

Authors
Yingluo Yang
Renmin University of China
Abstract
We study the minimal enumeration degree problem in models of fragments of Peano arithmetic () and prove the following results: in any model M of Σ2 induction, there is a minimal enumeration degree if and only if M is a nonstandard model. Furthermore, any cut in such a model has minimal e-degree. By contrast, this phenomenon fails in the absence of Σ2 induction. In fact, whether every Σ2 cut has minimal e-degree is independent of the Σ2 bounding principle
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1016/j.apal.2004.04.010
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 53,013
Through your library

References found in this work BETA

Partial Degrees and the Density Problem.S. B. Cooper - 1982 - Journal of Symbolic Logic 47 (4):854-859.
The Degree of a Σn Cut.C. T. Chong & K. J. Mourad - 1990 - Annals of Pure and Applied Logic 48 (3):227-235.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Minimal Truth and Interpretability.Martin Fischer - 2009 - Review of Symbolic Logic 2 (4):799-815.
A Hyperimmune Minimal Degree and an ANR 2-Minimal Degree.Mingzhong Cai - 2010 - Notre Dame Journal of Formal Logic 51 (4):443-455.
Subrecursive Degrees and Fragments of Peano Arithmetic.Lars Kristiansen - 2001 - Archive for Mathematical Logic 40 (5):365-397.
Quantum Mathematics.J. Michael Dunn - 1980 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1980:512 - 531.
The Shortest Definition of a Number in Peano Arithmetic.Dev K. Roy - 2003 - Mathematical Logic Quarterly 49 (1):83-86.
Reflection Principles in Fragments of Peano Arithmetic.Hiroakira Ono - 1987 - Mathematical Logic Quarterly 33 (4):317-333.
Models Without Indiscernibles.Fred G. Abramson & Leo A. Harrington - 1978 - Journal of Symbolic Logic 43 (3):572-600.
A Model of Peano Arithmetic with No Elementary End Extension.George Mills - 1978 - Journal of Symbolic Logic 43 (3):563-567.
On Certain Types and Models for Arithmetic.Andreas Blass - 1974 - Journal of Symbolic Logic 39 (1):151-162.
Model-Theoretic Properties Characterizing Peano Arithmetic.Richard Kaye - 1991 - Journal of Symbolic Logic 56 (3):949-963.

Analytics

Added to PP index
2014-01-16

Total views
36 ( #269,579 of 2,344,157 )

Recent downloads (6 months)
2 ( #332,321 of 2,344,157 )

How can I increase my downloads?

Downloads

My notes