We present an extension of the basic revision theory of circular definitions with a unary operator, □. We present a Fitch-style proof system that is sound and complete with respect to the extended semantics. The logic of the box gives rise to a simple modal logic, and we relate provability in the extended proof system to this modal logic via a completeness theorem, using interpretations over circular definitions, analogous to Solovay’s completeness theorem forGLusing arithmetical interpretations. We adapt our proof to (...) a special class of circular definitions as well as to the first-order case. (shrink)

In truth theory one aims at general formal laws governing the attribution of truth to statements. Gupta’s and Belnap’s revision-theoretic approach provides various well-motivated theories of truth, in particular T* and T#, which tame the Liar and related paradoxes without a Tarskian hierarchy of languages. In property theory, one similarly aims at general formal laws governing the predication of properties. To avoid Russell’s paradox in this area a recourse to type theory is still popular, as testified by recent work in (...) formal metaphysics by Williamson and Hale. There is a contingent Liar that has been taken to be a problem for type theory. But this is because this Liar has been presented without an explicit recourse to a truth predicate. Thus, type theory could avoid this paradox by incorporating such a predicate and accepting an appropriate theory of truth. There is however a contingent paradox of predication that more clearly undermines the viability of type theory. It is then suggested that a type-free property theory is a better option. One can pursue it, by generalizing the revision-theoretic approach to predication, as it has been done by Orilia with his system P*, based on T*. Although Gupta and Belnap do not explicitly declare a preference for T# over T*, they show that the latter has some advantages, such as the recovery of intuitively acceptable principles concerning truth and a better reconstruction of informal arguments involving this notion. A type-free system based on T# rather than T* extends these advantages to predication and thus fares better than P* in the intended applications of property theory. (shrink)

This paper embeds a theory of proper names in a general approach to singular reference based on type‐free property theory. It is proposed that a proper name “N” is a sortal common noun whose meaning is essentially tied to the linguistic type “N”. Moreover, “N” can be singularly referring insofar as it is elliptical for a definite description of the form the “N” Following Montague, the meaning of a definite description is taken to be a property of properties. The proposed (...) theory fulfils the major desiderata stemming from Kripke's works on proper names. (shrink)

This paper embeds a theory of proper names in a general approach to singular reference based on type‐free property theory. It is proposed that a proper name “N” is a sortal common noun whose meaning is essentially tied to the linguistic type “N”. Moreover, “N” can be singularly referring insofar as it is elliptical for a definite description of the form the “N” Following Montague, the meaning of a definite description is taken to be a property of properties. The proposed (...) theory fulfils the major desiderata stemming from Kripke's works on proper names. (shrink)

Gupta's and Belnap's Revision Theory of Truth defends the legitimacy of circular definitions. Circularity, however, forces us to reconsider our conception of meaning. A readjustment of some standard theses about meaning is here proposed, by relying on a novel version of the sense-reference distinction.

States of affairs involving a non-symmetric relation such as loving are said to have a relational order, something that distinguishes, for instance, Romeo’s loving Juliet from Juliet’s loving Romeo. Relational order can be properly understood by appealing to o-roles, i.e., ontological counterparts of what linguists call thematic roles, e.g., agent, patient, instrument, and the like. This move allows us to meet the appropriate desiderata for a theory of relational order. In contrast, the main theories that try to do without o-roles, (...) proposed by philosophers such as Russell, Hochberg, and Fine, are in trouble with one or another of these desiderata. After discussing some alternatives, it is proposed that o-roles are best viewed as very generic properties characterizable as ways in which objects jointly exemplify a relation. This makes for exemplification relations understood as complex entities having o-roles as building blocks. (shrink)

According to the received view, descriptivism is a dead end in an attempt to account for singular reference by proper names, indexicals and possibly even incomplete descriptions, for they require referentialism. In contrast to this, I argue for an application of the former to all kinds of singular terms, indexicals in particular, by relying on a view of incomplete descriptions as elliptical in a pragmatic sense. I thus provide a general analysis of singular reference. The proposed approach is in line (...) with the classical theory of propositions, except for admitting “private” ones with subjective mental entities as constituents. On the other hand, there is no commitment to singular Russellian propositions with ordinary objects as constituents and in general to meanings that cannot be “in the mind”. (shrink)

Logic appears to be normative for rational belief. The thesis of the normativity of logic holds that indeed logic has such a normative status. Gilbert Harman has questioned it, thereby giving rise to what has been called “Harman's skeptical challenge”. MacFarlane has clarified that in order to answer this challenge and support the normativity of logic, one needs a “bridge principle” that appropriately connects logical entailments and norms for belief, as well as relevant desiderata for the evaluation of candidate bridge (...) principles. Steinberger has identified a list of desiderata, on the basis of which he has proposed his own bridge principle and shown the inadequacy of previous proposals. This paper argues that Steinberger's list is in need of revision and his principle is unsatisfactory, and then puts forward a revised list of desiderata and a new bridge principle in support of the normativity of logic. (shrink)

We argue that distinct conditionals—conditionals that are governed by different logics—are needed to formalize the rules of Truth Introduction and Truth Elimination. We show that revision theory, when enriched with the new conditionals, yields an attractive theory of truth. We go on to compare this theory with one recently proposed by Hartry Field.

The purpose of this note is to acknowledge a gap in a previous paper, "The complexity of revision," and to provide a corrected version of the argument.

There is significant interest in type-free systems that allow flexible self-application. Such systems are of interest in property theory, natural language semantics, the theory of truth, theoretical computer science, the theory of classes, and category theory. While there are a variety of proposed type-free systems, there is a particularly natural type-free system that we believe is prototypical: the logic of recursive algorithms. Algorithmic logic is the study of basic statements concerning algorithms and the algorithmic rules of inference between such statements. (...) As shown in [1], the threat of paradoxes, such as the Curry paradox, requires care in implementing rules of inference in this context. As in any type-free logic, some traditional rules will fail. The first part of the paper develops a rich collection of inference rules that do not lead to paradox. The second part identifies traditional rules of logic that are paradoxical in algorithmic logic, and so should be viewed with suspicion in type-free logic generally. (shrink)

2020 update of the entry "Properties".