Extensionalizing Intensional Second-Order Logic
نویسنده
چکیده
Neo-Fregean approaches to set theory, following Frege, have it that sets are the extensions of concepts, where concepts are the values of second-order variables. e idea is that, given a second-order entity X, there may be an object εX, which is the extension of X. Other writers have also claimed a similar relationship between second-order logic and set theory, where sets arise from pluralities. is paper considers two interpretations of second-order logic—as being either extensional or intensional—and whether either is more appropriate for this approach to the foundations of set theory. Although there seems to be a case for the extensional interpretation resulting from modal considerations, I show how there is no obstacle to starting with an intensional second order logic. I do so by showing how the ε operator can have the eect of ‘extensionalising’ intensional second-order entities. It is oen thought that there is a close connection between sets and the denotation of the second-order variables under various interpretations of second-order logic. Even if it is denied that second-order entities just are sets (as, for example, is famously claimed by Quine, 1970), it might be thought that sets ‘arise’ from second-order entities in some way. So, for example, Frege’s (inconsistent) set theory had it that sets are extensions of concepts (which are what his second-order variables range over). More recently, attempts to extend the neo-Fregean programme of Bob Hale and CrispinWright (Hale andWright, 2001a) to set theory have followed suit to some extent, albeit with restrictions on which concepts form sets (e.g. Boolos, 1989; Hale, 2000; Shapiro, 2003). In addition, a number of articles which are less explicitly Fregean in motivation have claimed that sets arise from the denotation of second-order variables, where second-order quantication is interpreted as plural quantication (e.g. Burgess, 2004; Linnebo, 2010). Call such an approach to set theory the abstractionist approach1. e idea is that, for a second-order entity X, there may be (though will not always be, on pain of contradiction) an object εX, which is the set of X.2 Central to an abstractionist approach to set theory 1 is is a somewhat wider use of the term ‘abstractionist’ than is common, where it is used to refer to an explicitly Fregean and neo-Fregean approach to mathematics in general. 2 is way of putting things does not do justice to the plural interpretation of second-order logic, nor, arguably, to the interpretation of second-order logic over concepts. Under the plural interpretation, it would not be right to call the denotation of X a single entity. Instead, for plural quantiers, this should read as ‘for any objects xx, there may be a set εxx, which is the set of them.’ And it may not be correct to refer to the values of second-order variables as entities on the concept reading, since
منابع مشابه
A Theoretical Basis for Intensional Logic Programming∗
Intensional Logic Programming (ILP) is a new form of logic programming based on intensional logic. The denotations of formulas of an intensional first-order language are given according to intensional interpretations and to a set of possible worlds. ILP provides users with several intensional operators which are used to express relationships between different worlds. After introducing the forma...
متن کاملMelvin Fitting Intensional Logic — Beyond First Order
Classical first-order logic can be extended in two different ways to serve as a foundation for mathematics: introduce higher orders, type theory, or introduce sets. As it happens, both approaches have natural analogs for quantified modal logics, both approaches date from the 1960’s, one is not very well-known, and the other is well-known as something else. I will present the basic semantic idea...
متن کاملHigher-Order Functional Languages and Intensional Logic
In this paper we demonstrate that a broad class of higher-order functional programs can be transformed into semantically equivalent multidimensional intensional programs that contain only nullary variable definitions. The proposed algorithm systematically eliminates userdefined functions from the source program, by appropriately introducing context-manipulation (i.e., intensional) operators. Th...
متن کاملAn Expressive First-Order Logic with Flexible Typing for Natural Language Semantics
We present Property Theory with Curry Typing (PTCT), an intensional first-order logic for natural language semantics. PTCT permits fine-grained specifications of meaning. It also supports polymorphic types and separation types. We develop an intensional number theory within PTCT in order to represent proportional generalized quantifiers like most. We use the type system and our treatment of gen...
متن کاملIntensional First-Order Logic for P2P Database Systems
The meaning of concepts and views defined over a database ontology can be considered as intensional objects which have a particular extension in a given possible world: for instance in the actual world. Thus, non invasive mapping between completely independent peer databases in a P2P systems can be naturally specified by the set of couples of views, which have the same meaning (intension), over...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 56 شماره
صفحات -
تاریخ انتشار 2015