W. V. Quine famously defended two theses that have fallen rather dramatically out of fashion. The first is that intensions are “creatures of darkness” that ultimately have no place in respectable philosophical circles, owing primarily to their lack of rigorous identity conditions. However, although he was thoroughly familiar with Carnap’s foundational studies in what would become known as possible world semantics, it likely wouldn’t yet have been apparent to Quine that he was fighting a losing battle against intensions, due in (...) large measure to developments stemming from Carnap’s studies and culminating in the work of Kripke, Hintikka, and Bayart. These developments undermined Quine’s crusade against intensions on two fronts. First, in the context of possible world semantics, intensions could after all be given rigorous identity conditions by defining them (in the simplest case) as functions from worlds to appropriate extensions, a fact exploited to powerful and influential effect in logic and linguistics by the likes of Kaplan, Montague, Lewis, and Cresswell. Second, the rise of possible world semantics fueled a strong resurgence of metaphysics in contemporary analytic philosophy that saw properties and propositions widely, fruitfully, and unabashedly adopted as ontological primitives in their own right. This resurgence — happily, in my view — continues into the present day. -/- For a time, at any rate, Quine experienced somewhat better success with his second thesis: that higher-order logic is, at worst, confused and, at best, a quirky notational alternative to standard first-order logic. However, Quine notwithstanding, a great deal of recent work in formal metaphysics transpires in a higher-order logical framework in which properties and propositions fall into an infinite hierarchy of types of (at least) every finite order. Initially, the most philosophically compelling reason for embracing such a framework since Russell first proposed his simple theory of types was simply that it provides a relatively natural explanation of the paradoxes. However, since the seminal work of Prior there has been a growing trend to consider higher-order logic to be the most philosophically natural framework for metaphysical inquiry, many of the contributors to this volume being among the most important and influential advocates of this view. Indeed, this is now quite arguably the dominant view among formal metaphysicians. -/- In this paper, and against the current tide, I will argue in §1 that there are still good reasons to think that Quine’s second battle is not yet lost and that the correct framework for logic is first-order and type-free — properties and propositions, logically speaking, are just individuals among others in a single domain of quantification — and that it arises naturally out of our most basic logical and semantical intuitions. The data I will draw upon are not new and are well-known to contemporary higher-order metaphysicians. However, I will try to defend my thesis in what I believe is a novel way by suggesting that these basic intuitions ground a reasonable distinction between “pure” logic and non-logical theory, and that Russell-style semantic paradoxes of truth and exemplification arise only when we move beyond the purely logical and, hence, do not of themselves provide any strong objection to a type-free conception of properties and propositions. -/- Most of my arguments in §1 are largely independent of any specific account of the nature of properties and propositions beyond their type-freedom. However, I will in addition argue that there are good reasons to take propositions, at least, to be very fine-grained. My arguments are thus bolstered significantly if it can be shown that there are in fact well-defined examples of logics that are not only type-free but which comport with such a conception of propositions. It is the purpose of §2 to lay out a logic of this sort in some detail, drawing especially upon work by George Bealer and related work of my own. With the logic in place, it will be possible to generalize the line of argument noted above regarding Russell-style paradoxes and, in §3, apply it to two propositional paradoxes — the Prior-Kaplan paradox and the Russell-Myhill paradox — that are often taken to threaten the sort of account developed here. (shrink)

The book is about logical analysis of natural language. Since we humans communicate by means of natural language, we need a tool that helps us to understand in a precise manner how the logical and formal mechanisms of natural language work. Moreover, in the age of computers, we need to communicate both with and through computers as well. Transparent Intensional Logic is a tool that is helpful in making our communication and reasoning smooth and precise. It deals with all kinds (...) of linguistic context in a fully compositional and anti-contextual way. (shrink)

of my axiomatic theory of abstract objects.¹ The theory asserts the ex- istence not only of ordinary properties, relations, and propositions, but also of abstract individuals and abstract properties and relations. The.

The author revises the formulation of propositional modal logic by interposing a domain of structured propositions between the modal language and the models. Interpretations of the language (i.e., ways of mapping the language into the domain of propositions) are distinguished from models of the domain of propositions (i.e., ways of assigning truth values to propositions at each world), and this contrasts with the traditional formulation. Truth and logical consequence are defined, in the first instance, as properties of, and relations among, (...) propositions. (shrink)

Are there any disjunctive properties—features of things such as being either red or round, or Nelson Goodman’s infamous example of being grue? As esoteric as the question may seem at first, central issues about the metaphysics of properties hinge upon its answer, such as whether reductive views about special science properties can handle the phenomenon of multiple realizability. A familiar argument for a negative answer is that disjunctive properties fail to guarantee that their instances are similar in some genuine respect. (...) In this paper, I respond to a novel, sophisticated version of this argument developed in recent work by Paul Audi. Along the way, I develop two new accounts of what it is for a property to be disjunctive—which rely on important recent work on the nature of essence and analysis—and clarify what one is committed to in believing that there are any disjunctive properties at all. (shrink)

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. (shrink)

The aim of this paper is to relate the debate about the status of S4 and S5 as modal logics for metaphysical modality to the debate about the identity of propositions. The necessary truth of the characteristic axioms of S4 and S5 (when interpreted in terms of metaphysical modality) is derived from a view about the identity of propositions, the view that necessarily equivalent propositions are identical.

Propositions represent the entities from which they are formed. This fact has puzzled philosophers and some have put forward radical proposals in order to explain it. This paper develops a primitivist account of the representational properties of propositions that centers on the operation of application. As we will see, this theory wins out over its competitors on grounds of strength, systematicity and unifying power.

Recently, Indrek Reiland proposed a new version of the act-type theory of propositions (ATT) in which predication is still committal. However, the Frege-Geach problem can be addressed without resorting to Peter Hanks's cancellation manoeuvre. In this article, I argue that if we take predication as a committal act, we will then have to tackle another problem: non-committal representational acts. I argue that Reiland still needs a notion of cancellation to deal with the latter problem. On this account, he cannot avoid (...) the major flaw he attributes to Hanks's version. (shrink)

We started from the fact that type theory, in the way it was implemented in IL, makes it costly to deal with nominalization processes. We have also argued that the type hierarchy as such doesn't play any real role in a grammar; the classification it provides for different semantic objects is already contained, in some sense, in the categorial structure of the grammar itself. So, on the basis of a theory of properties (Cocchiarella's HST*) we have tried to build a (...) language (IL*) whose syntax does not contain any explicit typing of expressions. Some of the consequences that this move brings about in the overall organization of the grammar can be summarized as follows:it allows for a simple treatment of infinitives, gerunds, factives and, in general, all those phenomena which might be analyzed as cases of nominalization;it provides a simpler and more constrained semantics than IL, since IL* doesn't go beyond second order, and its non-modal basis is axiomatizable;it suggests that the role of logical form in a theory of grammar could be that of a family of theories of semantic objects;it eliminates the extrinsic limitations of a type hierarchy on the choice of the system of syntactic categories.I think that it is interesting to notice how having an explicit semantic framework helps to provide a sense in which it is legitimate to regard the syntax of a language as ‘autonomous’. (shrink)

In a lengthy review article, C. Anthony Anderson criticizes the approach to property theory developed in Quality and Concept (1982). That approach is first-order, type-free, and broadly Russellian. Anderson favors Alonzo Church’s higher-order, type-theoretic, broadly Fregean approach. His worries concern the way in which the theory of intensional entities is developed. It is shown that the worries can be handled within the approach developed in the book but they remain serious obstacles for the Church approach. The discussion focuses on: (1) (...) the fine-grained/coarse-grained distinction, (2) proper names and definite descriptions, (3) the paradox of analysis and Mates’ puzzle, and (4) the logical, semantical, and intentional paradoxes. (shrink)

Recent work in philosophy of language has raised significant problems for the traditional theory of propositions, engendering serious skepticism about its general workability. These problems are, I believe, tied to fundamental misconceptions about how the theory should be developed. The goal of this paper is to show how to develop the traditional theory in a way which solves the problems and puts this skepticism to rest. The problems fall into two groups. The first has to do with reductionism, specifically attempts (...) to reduce propositions to extensional entities-either extensional functions or sets. The second group concerns problems of fine grained content-both traditional 'Cicero'/'Tully' puzzles and recent variations on them which confront scientific essentialism. After characterizing the problems, I outline a non-reductionist approach-the algebraic approach-which avoids the problems associated with reductionism. I then go on to show how the theory can incorporate non-Platonic (as well as Platonic) modes of presentation. When these are implemented nondescriptively, they yield the sort of fine-grained distinctions which have been eluding us. The paper closes by applying the theory to a cluster of remaining puzzles, including a pair of new puzzles facing scientific essentialism. (shrink)

Arguments are given against the thesis that properties and propositional functions are identical. The first shows that the familiar extensional treatment of propositional functions -- that, for all x, if f(x) = g(x), then f = g -- must be abandoned. Second, given the usual assumptions of propositional-function semantics, various propositional functions (e.g., constant functions) are shown not to be properties. Third, novel examples are given to show that, if properties were identified with propositional functions, crucial fine-grained intensional distinctions would (...) be lost. (shrink)

This paper begins with a brief summary of the Self-consciousness Argument, developed in the author’s paper “Self-consciousness.” (This argument is designed to refute the extant versions of functionalism -- American functionalism, Australian functionalism, and language-of-thought functionalism.) After this summary is given, two thesis are defended. The first is that the Self-consciousness Argument is not guilty of a Fregean equivocation regarding embedded occurrences of mental predicates, as has been suggested by many commentators, including Mark McCullagh. The second thesis is that the (...) Self-consciousness Argument cannot be avoided by weakening the psychological theory upon which Ramsified functional definitions are based. Specifically, it does no good to excise psychological principles involving embedded mental predicates. Why? Because functional definitions based on the resulting sparse theories are exposed to an interesting new family of counterexamples. (shrink)

Higher-order theories of properties, relations, and propositions are known to be essentially incomplete relative to their standard notions of validity. It turns out that the first-order theory of PRPs that results when first-order logic is supplemented with a generalized intensional abstraction operation is complete. The construction involves the development of an intensional algebraic semantic method that does not appeal to possible worlds, but rather takes PRPs as primitive entities. This allows for a satisfactory treatment of both the modalities and the (...) propositional attitudes, and it suggests a general strategy for developing a comprehensive treatment of intensional logic. (shrink)

The paper begins with an argument against eliminativism with respect to the propositional attitudes. There follows an argument that concepts are sui generis ante rem entities. A nonreductionist view of concepts and propositions is then sketched. This provides the background for a theory of concept possession, which forms the bulk of the paper. The central idea is that concept possession is to be analyzed in terms of a certain kind of pattern of reliability in one’s intuitions regarding the behavior of (...) the concept. The challenge is to find an analysis that is at once noncircular and fully general. Environmentalism, anti-individualism, holism, analyticity, etc. provide additional hurdles. The paper closes with a discussion of the theory’s implications for the Wittgenstein-Kripke puzzle about rule-following and the Benacerraf problem concerning mathematical knowledge. (shrink)

Online collection of papers by Devitt, Dretske, Guarino, Hochberg, Jackson, Petitot, Searle, Tye, Varzi and other leading thinkers on philosophy and the foundations of cognitive Science. Topics dealt with include: Wittgenstein and Cognitive Science, Content and Object, Logic and Foundations, Language and Linguistics, and Ontology and Mereology.

An overview of hyperintensionality is provided. Hyperintensional languages have expressions with meanings that are more fine-grained than necessary equivalence. That is, the expressions may necessarily co-apply and yet be distinct in meaning. Adequately accounting for theories cast in hyperintensional languages is important in the philosophy of language; the philosophy of mind; metaphysics; and elsewhere. This entry presents a number of areas in which hyperintensionality is important; a range of approaches to theorising about hyperintensional matters; and a range of debates that (...) attention to hyperintensional constructions has generated. (shrink)

A satisfactory solution to the problem of consciousness would take the form of a simple yet fully general model that specifies the precise conditions under which any given state of consciousness occurs. Science has uncovered numerous correlations between consciousness and neural activity, but it has not yet come anywhere close to this. We are still looking for the Newtonian laws of consciousness. -/- One of the main difficulties with consciousness is that we lack a language in which to formulate illuminating (...) generalizations about it. Philosophers and scientists talk about "what it’s like", sensations, feelings, and perceptual states such as seeing and hearing. This language does not allow a precise articulation of the internal structures of conscious states and their inter-relations. It is inadequate to capture relations of the kind we are looking for between conscious states and physical states. -/- In this thesis I refine and defend a theory of consciousness which promises to solve this regimentation problem: the representational theory of consciousness. I argue that the representational theory can solve the regimentation problem and smooth out other important obstacles to a fruitful study of consciousness. I also make a case for the theory independently of its payoffs, and I discuss the leading opposing theories at some length. (shrink)

Commonplace syntactic constructions in natural language seem to generate ontological commitments to a dazzling array of metaphysical categories - aggregations, sets, ordered n-tuples, possible worlds, intensional entities, ideal objects, species, intensive and extensive quantities, stuffs, situations, states, courses of events, nonexistent objects, intentional and discourse objects, general objects, plural objects, variable objects, arbitrary objects, vague kinds and concepts, fuzzy sets, and so forth. But just because a syntactic construction in some natural language appears to invoke a new category of entity, (...) are we theoreticians epistemically justified in holding that there are such entities? This would hardly seem sufficient. To be epistemically justified, the ontology to which we theoreticians are committed must pass strict standards: the entities must be of the sort required by our best comprehensive theory of the world. The thesis of this paper is that fine-grained type-free intensional entities are like this. If the thesis is right, these entities have a special objective status perhaps not possessed by some of the other ontological categories associated with special syntactic constructions in natural language. In fact, it is plausible to hold that fine-grained type-free intensional entities provide the proper minimal framework for constructing logical and linguistic theories. In this paper my strategy will be to survey the competing conceptions of fine-grained type-free intensionality and to present arguments in support of one of them. Following this narrowing down process, I will go on to the indicated epistemological considerations. (shrink)

The purpose of this paper is to lay out the algebraic approach to propositions and then to show how it can be implemented in new solutions to Frege's puzzle and a variety of related puzzles about content.

Table of Formal and Descriptivists Ontologists (PDF - from Bernard Bolzano to present time) Ontologists of the 19th and 20th Centuries (a selection of critical judgments about some of the greatest philosophers of the recent past) Living Ontologists (a list of authors with an interest in ontology, with synthetic bibliographies).

This paper introduces a new method of interpreting complex relation terms in a second-order quantified modal language. We develop a completely general second-order modal language with two kinds of complex terms: one kind for denoting individuals and one kind for denoting n-place relations. Several issues arise in connection with previous, algebraic methods for interpreting the relation terms. The new method of interpreting these terms described here addresses those issues while establishing an interesting connection between λ and ε calculi. The resulting (...) semantics provides a precise understanding of the theory of relations. (shrink)

Revised and reprinted; originally in Dov Gabbay & Franz Guenthner (eds.), Handbook of Philosophical Logic, Volume IV. Kluwer 133-251. -- Two sorts of property theory are distinguished, those dealing with intensional contexts property abstracts (infinitive and gerundive phrases) and proposition abstracts (‘that’-clauses) and those dealing with predication (or instantiation) relations. The first is deemed to be epistemologically more primary, for “the argument from intensional logic” is perhaps the best argument for the existence of properties. This argument is presented in the (...) course of discussing generality, quantifying-in, learnability, referential semantics, nominalism, conceptualism, realism, type-freedom, the first-order/higher-order controversy, names, indexicals, descriptions, Mates’ puzzle, and the paradox of analysis. Two first-order intensional logics are then formulated. Finally, fixed-point type-free theories of predication are discussed, especially their relation to the question whether properties may be identified with propositional functions. (shrink)

This dissertation addresses a variety of foundational issues pertaining to the notion of algorithm employed in mathematics and computer science. In these settings, an algorithm is taken to be an effective mathematical procedure for solving a previously stated mathematical problem. Procedures of this sort comprise the notional subject matter of the subfield of computer science known as algorithmic analysis. In this context, algorithms are referred to via proper names of which computational properties are directly predicated )). Moreover, many formal results (...) are traditionally stated by explicitly quantifying over algorithms. These observations motivate the view that algorithms are themselves abstract mathematical objects -- a view I refer to as algorithmic realism. The status of this view is clearly related to that of Church's Thesis -- i.e. the claim that a function is computable by an algorithm just in case it is partial recursive. But whereas Church's Thesis is widely accepted on the basis of several well-known mathematical analyses of algorithmic computability, there is presently no consensus on how we can uniformly identify individual algorithms with mathematical objects. In the first chapter of this work, I attempt to illustrate the theoretical significance of algorithmic realism. I suggest that this view is not only of foundational significance to computer science, but also worth highlighting due to the role algorithms play in the fixation of mathematical knowledge and their relationship to intensional entities such as propositions and properties. Chapter Two presents a formal framework for reducing computational discourse to mathematical discourse modeled on contemporary discussion of mathematical nominalism. Chapter Three is centered on a case study intended to illustrate the technical exigencies involved with defending algorithmic realism. Chapter Four explores various ways in which algorithms might be identified with models of computation. And finally, Chapter Five argues that no such identification can uniformly satisfy all statements of algorithmic identity and non-identity affirmed by computational practice. I suggest that the technical crux of algorithmic realism lies in the necessity of reducing recursive specifications of algorithms to iterative models of computation in a manner which preserves algorithmic identity. (shrink)