Relative Categoricity and Abstraction Principles
نویسندگان
چکیده
Many recent writers in the philosophy of mathematics have put great weight on the relative categoricity of the traditional axiomatizations of our foundational theories of arithmetic and set theory ([Par90], [Par08] §49, [McG97], [Lav99], [VW14]). Another great enterprise in contemporary philosophy of mathematics has been Wright’s and Hale’s project of founding mathematics on abstraction principles ([HW01], [Coo07]). In [Wal12], it was noted that one traditional abstraction principle, namely Hume’s Principle, had a certain relative categoricity property, which here we term natural relative categoricity. In this paper, we show that most other abstraction principles are not naturally relatively categorical, so that there is in fact a large amount of incompatibility between these two recent trends in contemporary philosophy of mathematics. To better understand the precise demands of relative categoricity in the context of abstraction principles, we compare and contrast these constraints to (i) stability-like acceptability criteria on abstraction principles (cf. [Coo12]), (ii) the Tarski-Sher logicality requirements on abstraction principles studied by Antonelli [Ant10b] and Fine [Fin02], and (iii) supervaluational ideas coming out of Hodes’ work [Hod84, Hod90, Hod91]. ∗Department of Logic and Philosophy of Science, 5100 Social Science Plaza, University of California, Irvine, Irvine, CA 92697-5100, U.S.A., [email protected] or [email protected] †Department of Philosophy, Northwestern University, 1860 Campus Drive, Evanston, Illinois 60208-2214, U.S.A., [email protected] 1 ar X iv :1 40 9. 34 83 v2 [ m at h. L O ] 2 4 Ja n 20 15
منابع مشابه
Computable Categoricity versus Relative Computable Categoricity
We study the notion of computable categoricity of computable structures, comparing it especially to the notion of relative computable categoricity and its relativizations. We show that every 1-decidable computably categorical structure is relatively ∆2-categorical. We study the complexity of various index sets associated with computable categoricity and relative computable categoricity. We also...
متن کاملOn Computable Categoricity
We study the notion of computable categoricity of computable structures, comparing it especially to the notion of relative computable categoricity and its relativizations. In particular, we show that every 1-decidable computably categorical structure is relatively ∆2-categorical, but that there is a computably categorical structure that is not even relatively arithmetically categorical. We also...
متن کاملCategoricity Properties for Computable Algebraic Fields
We examine categoricity issues for computable algebraic fields. Such fields behave nicely for computable dimension: we show that they cannot have finite computable dimension greater than 1. However, they behave less nicely with regard to relative computable categoricity: we give a structural criterion for relative computable categoricity of these fields, and use it to construct a field that is ...
متن کاملAbelian p-groups and the Halting problem
We investigate which effectively presented abelian p-groups are isomorphic relative to the halting problem. The standard approach to this and similar questions uses the notion of ∆2-categoricity (to be defined). We partially reduce the description of ∆ 0 2-categorical p-groups of Ulm type 1 to the analogous problem for equivalence structures. Using this reduction, we solve to a problem left ope...
متن کاملDegrees That Are Not Degrees of Categoricity
A computable structure A is x-computably categorical for some Turing degree x, if for every computable structure B ∼= A there is an isomorphism f : B → A with f ≤T x. A degree x is a degree of categoricity if there is a computable structure A such that A is x-computably categorical, and for all y, if A is y-computably categorical then x ≤T y. We construct a Σ2 set whose degree is not a degree o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Rew. Symb. Logic
دوره 8 شماره
صفحات -
تاریخ انتشار 2015