Julien Murzi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Julien Murzi has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Lorenzo Rossi
University of Turin
5 shared publications - Massimiliano Carrara
Università degli Studi di Padova
2 shared publications - Brett Topey
University of Salzburg
1 shared publication - Florian Steinberger
Munich Center for Mathematical Philosophy, Ludwig-Maximilians Universität, Munich, Germany
1 shared publication Jc Beall
1 shared publicationJournal of Philosophy Inc.
1 shared publication
Latest Publications
- Open Access
- 12 November 2021
- Published by Springer Nature in Journal of Philosophical Logic
- Vol. 51 (1) , 201-218
Non-reflexivity and Revenge
We present a revenge argument for non-reflexive theories of semantic notions – theories which restrict the rule of assumption, or (equivalently) initial sequents of the form φ ⊩ φ. Our strategy follows the general template articulated in Murzi and Rossi [21]: we proceed via the definition of a notion of paradoxicality for non-reflexive theories which in turn breeds paradoxes that standard non-reflexive theories are unable to block.
- 12 November 2021
- Published by Springer Nature in Journal of Philosophical Logic
- Vol. 51 (1) , 201-218
Open AccessNon-reflexivity and Revenge
We present a revenge argument for non-reflexive theories of semantic notions – theories which restrict the rule of assumption, or (equivalently) initial sequents of the form φ ⊩ φ. Our strategy follows the general template articulated in Murzi and Rossi [21]: we proceed via the definition of a notion of paradoxicality for non-reflexive theories which in turn breeds paradoxes that standard non-reflexive theories are unable to block.
- Open Access
- 28 May 2021
- Published by Springer Nature in Philosophical Studies
- Vol. 178 (10) , 3391-3420
Categoricity by convention
On a widespread naturalist view, the meanings of mathematical terms are determined, and can only be determined, by the way we use mathematical language—in particular, by the basic mathematical principles we’re disposed to accept. But it’s mysterious how this can be so, since, as is well known, minimally strong first-order theories are non-categorical and so are compatible with countless non-isomorphic interpretations. As for second-order theories: though they typically enjoy categoricity results—for instance, Dedekind’s categoricity theorem for second-order and Zermelo’s quasi-categoricity theorem for second-order —these results require full second-order logic. So appealing to these results seems only to push the problem back, since the principles of second-order logic are themselves non-categorical: those principles are compatible with restricted interpretations of the second-order quantifiers on which Dedekind’s and Zermelo’s results are no longer available. In this paper, we provide a naturalist-friendly, non-revisionary solution to an analogous but seemingly more basic problem—Carnap’s Categoricity Problem for propositional and first-order logic—and show that our solution generalizes, giving us full second-order logic and thereby securing the categoricity or quasi-categoricity of second-order mathematical theories. Briefly, the first-order quantifiers have their intended interpretation, we claim, because we’re disposed to follow the quantifier rules in an open-ended way. As we show, given this open-endedness, the interpretation of the quantifiers must be permutation-invariant and so, by a theorem recently proved by Bonnay and Westerståhl, must be the standard interpretation. Analogously for the second-order case: we prove, by generalizing Bonnay and Westerståhl’s theorem, that the permutation invariance of the interpretation of the second-order quantifiers, guaranteed once again by the open-endedness of our inferential dispositions, suffices to yield full second-order logic.
- 28 May 2021
- Published by Springer Nature in Philosophical Studies
- Vol. 178 (10) , 3391-3420
Open AccessCategoricity by convention
On a widespread naturalist view, the meanings of mathematical terms are determined, and can only be determined, by the way we use mathematical language—in particular, by the basic mathematical principles we’re disposed to accept. But it’s mysterious how this can be so, since, as is well known, minimally strong first-order theories are non-categorical and so are compatible with countless non-isomorphic interpretations. As for second-order theories: though they typically enjoy categoricity results—for instance, Dedekind’s categoricity theorem for second-order and Zermelo’s quasi-categoricity theorem for second-order —these results require full second-order logic. So appealing to these results seems only to push the problem back, since the principles of second-order logic are themselves non-categorical: those principles are compatible with restricted interpretations of the second-order quantifiers on which Dedekind’s and Zermelo’s results are no longer available. In this paper, we provide a naturalist-friendly, non-revisionary solution to an analogous but seemingly more basic problem—Carnap’s Categoricity Problem for propositional and first-order logic—and show that our solution generalizes, giving us full second-order logic and thereby securing the categoricity or quasi-categoricity of second-order mathematical theories. Briefly, the first-order quantifiers have their intended interpretation, we claim, because we’re disposed to follow the quantifier rules in an open-ended way. As we show, given this open-endedness, the interpretation of the quantifiers must be permutation-invariant and so, by a theorem recently proved by Bonnay and Westerståhl, must be the standard interpretation. Analogously for the second-order case: we prove, by generalizing Bonnay and Westerståhl’s theorem, that the permutation invariance of the interpretation of the second-order quantifiers, guaranteed once again by the open-endedness of our inferential dispositions, suffices to yield full second-order logic.
- Open Access
- 30 March 2021
- Published by Taylor & Francis
- p. 88-114
The Expressive Power of Contextualist Truth
The truth predicate is often argued to be naïve, in the sense that a sentence φ and its truth ascription ‘φ is true’ are in some sense equivalent (in all non-opaque contexts). A relatively weak form of naïveté requires the truth predicate to obey introduction and elimination rules to the effect that φ and ‘φ is true’ are interderivable (from possibly open assumptions). It has been forcefully argued that naïveté is required in order to account for crucial and non-eliminable uses of the truth predicate, notably blind ascriptions (such as ‘Everything Lois says is true’), infinitary generalizations (such as ‘All theorems of Peano Arithmetic are true’), and their combinations (Field, 2008; Beall, 2009; Horsten, 2012). Call this argument the Argument for Naïveté. Since naïveté is incompatible with classical logic (given a modicum of syntax theory), the argument can be taken to establish that, in order to fulfill its expressive role, the truth predicate requires a suitable non-classical logic. This chapter analyses the Argument for Naïveté, and argues that it is fundamentally misguided. It is then shown that some contextualist theories of truth, despite being fully classical, feature expressively adequate, contextshifting versions of the naïve truth introduction and elimination rules that are strong enough to validate arguments involving blind ascriptions and infinitary generalizations and yet weak enough to avoid paradox-driven triviality.
- 30 March 2021
- Published by Taylor & Francis
- p. 88-114
Open AccessThe Expressive Power of Contextualist Truth
The truth predicate is often argued to be naïve, in the sense that a sentence φ and its truth ascription ‘φ is true’ are in some sense equivalent (in all non-opaque contexts). A relatively weak form of naïveté requires the truth predicate to obey introduction and elimination rules to the effect that φ and ‘φ is true’ are interderivable (from possibly open assumptions). It has been forcefully argued that naïveté is required in order to account for crucial and non-eliminable uses of the truth predicate, notably blind ascriptions (such as ‘Everything Lois says is true’), infinitary generalizations (such as ‘All theorems of Peano Arithmetic are true’), and their combinations (Field, 2008; Beall, 2009; Horsten, 2012). Call this argument the Argument for Naïveté. Since naïveté is incompatible with classical logic (given a modicum of syntax theory), the argument can be taken to establish that, in order to fulfill its expressive role, the truth predicate requires a suitable non-classical logic. This chapter analyses the Argument for Naïveté, and argues that it is fundamentally misguided. It is then shown that some contextualist theories of truth, despite being fully classical, feature expressively adequate, contextshifting versions of the naïve truth introduction and elimination rules that are strong enough to validate arguments involving blind ascriptions and infinitary generalizations and yet weak enough to avoid paradox-driven triviality.
- Open Access
- 16 February 2021
- Published by Philosophy Documentation Center in Thought: A Journal of Philosophy
- Vol. 10 (1) , 4-18
Surprise, surprise: KK is innocent
The Surprise Exam Paradox is well‐known: a teacher announces that there will be a surprise exam the following week; the students argue by an intuitively sound reasoning that this is impossible; and yet they can be surprised by the teacher. We suggest that a solution can be found scattered in the literature, in part anticipated by Wright and Sudbury, informally developed by Sorensen, and more recently discussed, and dismissed, by Williamson. In a nutshell, the solution consists in realising that the teacher's announcement is a blindspot that can only be known if the week is at least 2 days long. Along the way, we criticise Williamson's own treatment of the paradox. In Williamson's view, the Surprise is similar to the Paradox of the Glimpse and, because of their similarities, both these paradoxes ought to receive a uniform treatment—one that involves locating an illicit application of the KK Principle. We argue that there's no deep analogy between the Surprise and the Glimpse and that, even if there were, the Surprise reasoning reaches a paradoxical conclusion before the KK Principle is used. Rather, in both the Surprise and the Glimpse, the blame should be put on other epistemic principles—respectively, a knowledge retention and a margin for error principle.
- 16 February 2021
- Published by Philosophy Documentation Center in Thought: A Journal of Philosophy
- Vol. 10 (1) , 4-18
Open AccessSurprise, surprise: KK is innocent
The Surprise Exam Paradox is well‐known: a teacher announces that there will be a surprise exam the following week; the students argue by an intuitively sound reasoning that this is impossible; and yet they can be surprised by the teacher. We suggest that a solution can be found scattered in the literature, in part anticipated by Wright and Sudbury, informally developed by Sorensen, and more recently discussed, and dismissed, by Williamson. In a nutshell, the solution consists in realising that the teacher's announcement is a blindspot that can only be known if the week is at least 2 days long. Along the way, we criticise Williamson's own treatment of the paradox. In Williamson's view, the Surprise is similar to the Paradox of the Glimpse and, because of their similarities, both these paradoxes ought to receive a uniform treatment—one that involves locating an illicit application of the KK Principle. We argue that there's no deep analogy between the Surprise and the Glimpse and that, even if there were, the Surprise reasoning reaches a paradoxical conclusion before the KK Principle is used. Rather, in both the Surprise and the Glimpse, the blame should be put on other epistemic principles—respectively, a knowledge retention and a margin for error principle.
- Open Access
- 14 October 2019
- Published by Taylor & Francis in Australasian Journal of Philosophy
- Vol. 98 (1) , 153-177
Generalized Revenge
Since Saul Kripke’s influential work in the 1970s, the revisionary approach to semantic paradox—the idea that semantic paradoxes must be solved by weakening classical logic—has been increasingly popular. In this paper, we present a new revenge argument to the effect that the main revisionary approaches breed new paradoxes that they are unable to block.
- 14 October 2019
- Published by Taylor & Francis in Australasian Journal of Philosophy
- Vol. 98 (1) , 153-177
Open AccessGeneralized Revenge
Since Saul Kripke’s influential work in the 1970s, the revisionary approach to semantic paradox—the idea that semantic paradoxes must be solved by weakening classical logic—has been increasingly popular. In this paper, we present a new revenge argument to the effect that the main revisionary approaches breed new paradoxes that they are unable to block.
- Open Access
- 15 November 2018
- Published by Springer Nature in Erkenntnis
- Vol. 85 (4) , 905-917
Non-contractability and Revenge
It is often argued that fully structural theories of truth and related notions are incapable of expressing a nonstratified notion of defectiveness. We argue that recently much-discussed non-contractive theories suffer from the same expressive limitation, provided they identify the defective sentences with the sentences that yield triviality if they are assumed to satisfy structural contraction.
- 15 November 2018
- Published by Springer Nature in Erkenntnis
- Vol. 85 (4) , 905-917
Open AccessNon-contractability and Revenge
It is often argued that fully structural theories of truth and related notions are incapable of expressing a nonstratified notion of defectiveness. We argue that recently much-discussed non-contractive theories suffer from the same expressive limitation, provided they identify the defective sentences with the sentences that yield triviality if they are assumed to satisfy structural contraction.
- Open Access
- 14 November 2018
- Published by Springer Nature in Philosophical Studies
- Vol. 177 (2) , 535-549
Conservative deflationism?
Deflationists argue that ‘true’ is merely a logico-linguistic device for expressing blind ascriptions and infinite generalisations. For this reason, some authors have argued that deflationary truth must be conservative, i.e. that a deflationary theory of truth for a theory S (that interprets a sufficient amount of mathematics, or syntax) must not entail sentences in S’s language that are not already entailed by S. However, it has been forcefully argued that any adequate theory of truth for S must be non-conservative and that, for this reason, truth cannot be deflationary (Shapiro in J Philos XCVI(10):493–521, 1998; Ketland in Mind 108(429):69–94, 1999). We consider two defences of conservative deflationism, respectively proposed by Waxman (Mind 126(502):429–463, 2017) and Tennant (Mind 111(443):551–582, 2002), and argue that they are both unsuccessful. In Waxman’s hands, deflationists are committed either to a non-purely expressive notion of truth, or to a conception of mathematics that does not allow them to justifiably exclude non-conservative theories of truth. Tennant’s conservative deflationism fares no better: if deflationist truth must be conservative over arithmetic, it can be shown to collapse into a non-conservative variety of deflationism.
- 14 November 2018
- Published by Springer Nature in Philosophical Studies
- Vol. 177 (2) , 535-549
Open AccessConservative deflationism?
Deflationists argue that ‘true’ is merely a logico-linguistic device for expressing blind ascriptions and infinite generalisations. For this reason, some authors have argued that deflationary truth must be conservative, i.e. that a deflationary theory of truth for a theory S (that interprets a sufficient amount of mathematics, or syntax) must not entail sentences in S’s language that are not already entailed by S. However, it has been forcefully argued that any adequate theory of truth for S must be non-conservative and that, for this reason, truth cannot be deflationary (Shapiro in J Philos XCVI(10):493–521, 1998; Ketland in Mind 108(429):69–94, 1999). We consider two defences of conservative deflationism, respectively proposed by Waxman (Mind 126(502):429–463, 2017) and Tennant (Mind 111(443):551–582, 2002), and argue that they are both unsuccessful. In Waxman’s hands, deflationists are committed either to a non-purely expressive notion of truth, or to a conception of mathematics that does not allow them to justifiably exclude non-conservative theories of truth. Tennant’s conservative deflationism fares no better: if deflationist truth must be conservative over arithmetic, it can be shown to collapse into a non-conservative variety of deflationism.
- Open Access
- 30 July 2018
- Published by Springer Nature in Erkenntnis
- Vol. 85 (2) , 391-415
Classical Harmony and Separability
According to logical inferentialists, the meanings of logical expressions are fully determined by the rules for their correct use. Two key proof-theoretic requirements on admissible logical rules, harmony and separability, directly stem from this thesis—requirements, however, that standard single-conclusion and assertion-based formalizations of classical logic provably fail to satisfy (Dummett in The logical basis of metaphysics, Harvard University Press, Harvard, MA, 1991; Prawitz in Theoria, 43:1–40, 1977; Tennant in The taming of the true, Oxford University Press, Oxford, 1997; Humberstone and Makinson in Mind 120(480):1035–1051, 2011). On the plausible assumption that our logical practice is both single-conclusion and assertion-based, it seemingly follows that classical logic, unlike intuitionistic logic, can’t be accounted for in inferentialist terms. In this paper, I challenge orthodoxy and introduce an assertion-based and single-conclusion formalization of classical propositional logic that is both harmonious and separable. In the framework I propose, classicality emerges as a structural feature of the logic.
- 30 July 2018
- Published by Springer Nature in Erkenntnis
- Vol. 85 (2) , 391-415
Open AccessClassical Harmony and Separability
According to logical inferentialists, the meanings of logical expressions are fully determined by the rules for their correct use. Two key proof-theoretic requirements on admissible logical rules, harmony and separability, directly stem from this thesis—requirements, however, that standard single-conclusion and assertion-based formalizations of classical logic provably fail to satisfy (Dummett in The logical basis of metaphysics, Harvard University Press, Harvard, MA, 1991; Prawitz in Theoria, 43:1–40, 1977; Tennant in The taming of the true, Oxford University Press, Oxford, 1997; Humberstone and Makinson in Mind 120(480):1035–1051, 2011). On the plausible assumption that our logical practice is both single-conclusion and assertion-based, it seemingly follows that classical logic, unlike intuitionistic logic, can’t be accounted for in inferentialist terms. In this paper, I challenge orthodoxy and introduce an assertion-based and single-conclusion formalization of classical propositional logic that is both harmonious and separable. In the framework I propose, classicality emerges as a structural feature of the logic.
- Open Access
- 27 September 2017
- Published by Springer Nature in Synthese
- Vol. 199 (S3) , 819-841
Naïve validity
Beall and Murzi (J Philos 110(3):143–165, 2013) introduce an object-linguistic predicate for naïve validity, governed by intuitive principles that are inconsistent with the classical structural rules (over sufficiently expressive base theories). As a consequence, they suggest that revisionary approaches to semantic paradox must be substructural. In response to Beall and Murzi, Field (Notre Dame J Form Log 58(1):1–19, 2017) has argued that naïve validity principles do not admit of a coherent reading and that, for this reason, a non-classical solution to the semantic paradoxes need not be substructural. The aim of this paper is to respond to Field’s objections and to point to a coherent notion of validity which underwrites a coherent reading of Beall and Murzi’s principles: grounded validity. The notion, first introduced by Nicolai and Rossi (J Philos Log. doi:10.1007/s10992-017-9438-x, 2017), is a generalisation of Kripke’s notion of grounded truth (J Philos 72:690–716, 1975), and yields an irreflexive logic. While we do not advocate the adoption of a substructural logic (nor, more generally, of a revisionary approach to semantic paradox), we take the notion of naïve validity to be a legitimate semantic notion that points to genuine expressive limitations of fully structural revisionary approaches.
- 27 September 2017
- Published by Springer Nature in Synthese
- Vol. 199 (S3) , 819-841
Open AccessNaïve validity
Beall and Murzi (J Philos 110(3):143–165, 2013) introduce an object-linguistic predicate for naïve validity, governed by intuitive principles that are inconsistent with the classical structural rules (over sufficiently expressive base theories). As a consequence, they suggest that revisionary approaches to semantic paradox must be substructural. In response to Beall and Murzi, Field (Notre Dame J Form Log 58(1):1–19, 2017) has argued that naïve validity principles do not admit of a coherent reading and that, for this reason, a non-classical solution to the semantic paradoxes need not be substructural. The aim of this paper is to respond to Field’s objections and to point to a coherent notion of validity which underwrites a coherent reading of Beall and Murzi’s principles: grounded validity. The notion, first introduced by Nicolai and Rossi (J Philos Log. doi:10.1007/s10992-017-9438-x, 2017), is a generalisation of Kripke’s notion of grounded truth (J Philos 72:690–716, 1975), and yields an irreflexive logic. While we do not advocate the adoption of a substructural logic (nor, more generally, of a revisionary approach to semantic paradox), we take the notion of naïve validity to be a legitimate semantic notion that points to genuine expressive limitations of fully structural revisionary approaches.
- 19 January 2017
- Published by Oxford University Press (OUP) in Mind
Maximally Consistent Sets of Instances of Naive Comprehension
Paul Horwich (1990) once suggested restricting the T-schema to the maximally consistent set of its instances. But Vann McGee (1992) proved that there are multiple incompatible such sets, none of which, given minimal assumptions, is recursively axiomatizable. The analogous view for set theory—that Naive Comprehension should be restricted according to consistency maxims—has recently been defended by Laurence Goldstein (2006, 2013). It can be traced back to W. V. Quine (1951), who held that Naive Comprehension embodies the only really intuitive conception of set and should be restricted as little as possible. The view might even have been held by Ernst Zermelo (1908), who, according to Penelope Maddy (1988), subscribed to a ‘one step back from disaster’ rule of thumb: if a natural principle leads to contradiction, the principle should be weakened just enough to block the contradiction. We prove a generalization of McGee’s Theorem, and use it to show that the situation for set theory is the same as that for truth: there are multiple incompatible sets of instances of Naive Comprehension, none of which, given minimal assumptions, is recursively axiomatizable. This shows that the view adumbrated by Goldstein, Quine, and perhaps Zermelo, is untenable.
- 19 January 2017
- Published by Oxford University Press (OUP) in Mind
Maximally Consistent Sets of Instances of Naive Comprehension
Paul Horwich (1990) once suggested restricting the T-schema to the maximally consistent set of its instances. But Vann McGee (1992) proved that there are multiple incompatible such sets, none of which, given minimal assumptions, is recursively axiomatizable. The analogous view for set theory—that Naive Comprehension should be restricted according to consistency maxims—has recently been defended by Laurence Goldstein (2006, 2013). It can be traced back to W. V. Quine (1951), who held that Naive Comprehension embodies the only really intuitive conception of set and should be restricted as little as possible. The view might even have been held by Ernst Zermelo (1908), who, according to Penelope Maddy (1988), subscribed to a ‘one step back from disaster’ rule of thumb: if a natural principle leads to contradiction, the principle should be weakened just enough to block the contradiction. We prove a generalization of McGee’s Theorem, and use it to show that the situation for set theory is the same as that for truth: there are multiple incompatible sets of instances of Naive Comprehension, none of which, given minimal assumptions, is recursively axiomatizable. This shows that the view adumbrated by Goldstein, Quine, and perhaps Zermelo, is untenable.