Articles
'Strongly Millian Second-Order Modal Logics' | Link
The Review of Symbolic Logic (September 2017), 10(3): 397-454.
The Review of Symbolic Logic (September 2017), 10(3): 397-454.
Abstract
The most common first- and second-order modal logics either have as theorems every instance of the Barcan and Converse Barcan formulae and of their second-order analogues, or else fail to capture the actual truth of every theorem of classical first- and second-order logic. In this paper we characterise and motivate sound and complete first- and second-order modal logics that successfully capture the actual truth of every theorem of classical first- and second-order logic and yet do not possess controversial instances of the Barcan and Converse Barcan formulae as theorems, nor of their second-order analogues. What makes possible these results is an understanding of the individual constants and predicates of the target languages as strongly Millian expressions, where a strongly Millian expression is one that has an actually existing entity as its semantic value. For this reason these logics are called 'strongly Millian'. It is shown that the strength of the strongly Millian second-order modal logics here characterised afford the means to resist an argument by Timothy Williamson for the truth of the claim that necessarily, every property necessarily exists.
The most common first- and second-order modal logics either have as theorems every instance of the Barcan and Converse Barcan formulae and of their second-order analogues, or else fail to capture the actual truth of every theorem of classical first- and second-order logic. In this paper we characterise and motivate sound and complete first- and second-order modal logics that successfully capture the actual truth of every theorem of classical first- and second-order logic and yet do not possess controversial instances of the Barcan and Converse Barcan formulae as theorems, nor of their second-order analogues. What makes possible these results is an understanding of the individual constants and predicates of the target languages as strongly Millian expressions, where a strongly Millian expression is one that has an actually existing entity as its semantic value. For this reason these logics are called 'strongly Millian'. It is shown that the strength of the strongly Millian second-order modal logics here characterised afford the means to resist an argument by Timothy Williamson for the truth of the claim that necessarily, every property necessarily exists.
'General-Elimination Stability' | Link
(with Stephen Read)
Studia Logica (April 2017), 105(2):361-405
(with Stephen Read)
Studia Logica (April 2017), 105(2):361-405
Abstract
General-elimination harmony articulates Gentzen's idea that the elimination-rules are justified if they infer from an assertion no more than can already be inferred from the grounds for making it. Dummett described the rules as not only harmonious but stable if the E-rules allow one to infer no more and no less than the I-rules justify. Pfenning and Davies call the rules locally complete if the E-rules are strong enough to allow one to infer the original judgement. A method is given of generating harmonious general-elimination rules from a collection of I-rules. We show that the general-elimination rules satisfy Pfenning and Davies' test for local completeness, but question whether that is enough to show that they are stable. Alternative conditions for stability are considered, including equivalence between the introduction- and elimination-meanings of a connective, and recovery of the grounds for assertion, finally generalizing the notion of local completeness to capture Dummett's notion of stability satisfactorily. We show that the general-elimination rules meet the last of these conditions, and so are indeed not only harmonious but also stable.
General-elimination harmony articulates Gentzen's idea that the elimination-rules are justified if they infer from an assertion no more than can already be inferred from the grounds for making it. Dummett described the rules as not only harmonious but stable if the E-rules allow one to infer no more and no less than the I-rules justify. Pfenning and Davies call the rules locally complete if the E-rules are strong enough to allow one to infer the original judgement. A method is given of generating harmonious general-elimination rules from a collection of I-rules. We show that the general-elimination rules satisfy Pfenning and Davies' test for local completeness, but question whether that is enough to show that they are stable. Alternative conditions for stability are considered, including equivalence between the introduction- and elimination-meanings of a connective, and recovery of the grounds for assertion, finally generalizing the notion of local completeness to capture Dummett's notion of stability satisfactorily. We show that the general-elimination rules meet the last of these conditions, and so are indeed not only harmonious but also stable.
'Knowing Who: How Perspectives and Contexts Interact' | Link
(with Maria Aloni)
Epistemology, Context and Formalism (2014), Ed. F. Lihoreau and M. Rebuschi
(with Maria Aloni)
Epistemology, Context and Formalism (2014), Ed. F. Lihoreau and M. Rebuschi
Abstract
In this article we investigate how conceptual perspectives and context interact in the determination of the truth of sentences in which 'knowing-wh' constructions occur.
In this article we investigate how conceptual perspectives and context interact in the determination of the truth of sentences in which 'knowing-wh' constructions occur.
Encyclopedia Entries
'Possible Worlds' | Link
Online Companion to Problems of Analytic Philosophy (2013), Ed. J. Branquinho and R. Santos
Online Companion to Problems of Analytic Philosophy (2013), Ed. J. Branquinho and R. Santos
Abstract
Possible worlds' semantics for modal logic has proven to be theoretically useful. But talk of possible worlds is puzzling. After all, what are possible worlds? This essay provides an overview of two of the main theories on the nature of possible worlds, namely, Lewis's Extreme Realism and Plantinga and Stalnaker's Moderate Realism. The essay also explores the merits and shortcomings of both theories.
Possible worlds' semantics for modal logic has proven to be theoretically useful. But talk of possible worlds is puzzling. After all, what are possible worlds? This essay provides an overview of two of the main theories on the nature of possible worlds, namely, Lewis's Extreme Realism and Plantinga and Stalnaker's Moderate Realism. The essay also explores the merits and shortcomings of both theories.