Online research in philosophy

In this paper I rehearse two central failings of traditional possible world semantics. I then present a much more robust framework for intensional logic and semantics based liberally on the work of George Bealer in his book Quality and Concept. Certain expressive limitations of Bealer's approach, however, lead me to extend the framework in a particularly natural and useful way. This extension, in turn, brings to light associated limitations of Bealer's account of predication. In response, I develop a more general and intuitively more adequate account of the logical form of predication.

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 ideas of both higher order intensional logic, and intensional set theory. Before doing so, I’ll quickly sketch some necessary background material from quantified modal logic. Except for standard material concerning propositional modal logics, the paper is essentially self-contained.

Although there is a vast literature on whether propositional attitudes are relations to propositions, a crucial question that ought to lie at the heart of this debate is not often enough seriously addressed. This is the question of the contribution propositions make to the ways in which we benefit from having our propositional-attitude concepts, if those concepts are concepts of relations to propositions. Unless propositions can be shown to confer a benefit that no non-propositions could provide, we should probably doubt whether propositional attitudes really are relations to propositions. I believe that propositional attitudes are relations to propositions and that the role played by them in our conceptual economy cannot be played by things of any other kind, and in this paper I try to say why. This paper, in other words, offers my answer to the question posed by my title.

In his 2000 book Logical Properties Colin McGinn argues that predicates denote properties rather than sets or individuals. I support the thesis, but show that it is vulnerable to a type-incongruity objection, if properties are (modelled as) functions, unless a device for extensionalizing properties is added. Alternatively, properties may be construed as primitive intensional entities, as in George Bealer. However, I object to Bealer’s construal of predication as a primitive operation inputting two primitive entities and outputting a third primitive entity. Instead I recommend we follow Pavel Tichý in construing both predication and extensionalization as instances of the primitive operation of functional application.

In this report I motivate and develop a type-free logic with predicate quantifiers within the general ontological framework of (nonextensional) properties, relations, and propositions. In Part I, I present the major ideas of the system informally and discuss its philosophical significance, especially with regard to Russell's paradox. In Part II, I prove the soundness, consistency, and completeness of the logic.

A proper presentation of this theory [sc. of properties] would treat properties as a special kind of relation. And it would treat propositions as a special kind of relation: it would treat properties as monadic relations and propositions as 0-adic relations. But I will not attempt to discuss relations within the confines of this paper.[ii].

The modal object calculus is the system of logic which houses the (proper) axiomatic theory of abstract objects. The calculus has some rather interesting features in and of itself, independent of the proper theory. The most sophisticated, type-theoretic incarnation of the calculus can be used to analyze the intensional contexts of natural language and so constitutes an intensional logic. However, the simpler second-order version of the calculus couches a theory of fine-grained properties, relations and propositions and serves as a framework for defining situations, possible worlds, stories, and fictional characters, among other things. In the present paper, we focus on the second-order calculus. The second-order modal object calculus is so-called to distinguish it from the second-order modal predicate calculus. Though the differences are slight, the extra expressive power of the object calculus significantly enhances its ability to resolve logical and philosophical concepts and problems.

This study provides a unified theory of properties, relations, and propositions (PRPs). Two conceptions of PRPs have emerged in the history of philosophy. The author explores both of these traditional conceptions and shows how they can be captured by a single theory.

The author examines the differences between the general intensional logic defined in his recent book and Montague's intensional logic. Whereas Montague assigned extensions and intensions to expressions (and employed set theory to construct these values as certain sets), the author assigns denotations to terms and relies upon an axiomatic theory of intensional entities that covers properties, relations, propositions, worlds, and other abstract objects. It is then shown that the puzzles for Montague's analyses of modality and descriptions, propositional attitudes, and directedness towards nonexistents can be solved using the author's logic.

This is the only complete logic for properties, relations, and propositions (PRPS) that has been formulated to date. First, an intensional abstraction operation is adjoined to first-order quantifier logic, Then, a new algebraic semantic method is developed. The heuristic used is not that of possible worlds but rather that of PRPS taken at face value. Unlike the possible worlds approach to intensional logic, this approach yields a logic for intentional (psychological) matters, as well as modal matters. At the close of the paper, the origin of incompleteness in logic is investigated. The culprit is found to be the predication relation, a relation on properties and relations that is expressed in natural language by the copula.