In this sequel toSelf-reference in arithmetic Iwe continue our discussion of the question: What does it mean for a sentence of arithmetic to ascribe to itself a property? We investigate how the properties of the supposedly self-referential sentences depend on the chosen coding, the formulae expressing the properties and the way a fixed point for the expressing formulae are obtained. In this second part we look at some further examples. In particular, we study sentences apparently expressing their Rosser-provability, their own${\rm{\Sigma (...) }}_n^0$-truth or their own${\rm{\Pi }}_n^0$-truth. Finally we offer an assessment of the results of both papers. (shrink)

A number of authors have objected to the application of non-classical logic to problems in philosophy on the basis that these non-classical logics are usually characterised by a classical metatheory. In many cases the problem amounts to more than just a discrepancy; the very phenomena responsible for non-classicality occur in the field of semantics as much as they do elsewhere. The phenomena of higher order vagueness and the revenge liar are just two such examples. The aim of this paper is (...) to show that a large class of non-classical logics are strong enough to formulate their own model theory in a corresponding non-classical set theory. Specifically I show that adequate definitions of validity can be given for the propositional calculus in such a way that the metatheory proves, in the specified logic, that every theorem of the propositional fragment of that logic is validated. It is shown that in some cases it may fail to be a classical matter whether a given sentence is valid or not. One surprising conclusion for non-classical accounts of vagueness is drawn: there can be no axiomatic, and therefore precise, system which is determinately sound and complete. (shrink)

In philosophical logic necessity is usually conceived as a sentential operator rather than as a predicate. An intensional sentential operator does not allow one to express quantified statements such as 'There are necessary a posteriori propositions' or 'All laws of physics are necessary' in first-order logic in a straightforward way, while they are readily formalized if necessity is formalized by a predicate. Replacing the operator conception of necessity by the predicate conception, however, causes various problems and forces one to reject (...) many philosophical accounts involving necessity that are based on the use of operator modal logic. We argue that the expressive power of the predicate account can be restored if a truth predicate is added to the language of first-order modal logic, because the predicate 'is necessary' can then be replaced by 'is necessarily true'. We prove a result showing that this substitution is technically feasible. To this end we provide partial possible-worlds semantics for the language with a predicate of necessity and perform the reduction of necessities to necessary truths. The technique applies also to many other intensional notions that have been analysed by means of modal operators. (shrink)

In Contradiction advocates and defends the view that there are true contradictions, a view that flies in the face of orthodoxy in Western philosophy since Aristotle. The book has been at the center of the controversies surrounding dialetheism ever since its first publication in 1987. This second edition of the book substantially expands upon the original in various ways, and also contains the author’s reflections on developments over the last two decades. Further aspects of dialetheism are discussed in the companion (...) volume, Doubt Truth to be a Liar, also published by Oxford University Press in 2006. (shrink)

In this essay I present a new version of the Paradox of the Knower and show that this new paradox vitiates a certain argument against epistemic closure. I then prove a theorem that relates the new paradox to epistemological scepticism. I conclude by assessing the use of the Knower in arguments against syntactical treatments of knowledge.

In “The Paradox of the Knower without Epistemic Closure”, MIND 110:319-33, 2001, I develop a version of the Knower Paradox which does not assume epistemic closure, and I use it to argue that the original Knower Paradox does not support an argument against epistemic closure. In “The Paradox of the Knower without Epistemic Closure?”, MIND 113:95-107, 2004, Gabriel Uzquiano, using his own result, argues that my rebuttal to the anti-closure argument is not successful. I respond here by arguing that in (...) order to use Uzquiano’s result in an argument against closure, one must assume an implausible skepticism about arithmetic. (shrink)

A formal theory of truth, alternative to tarski's 'orthodox' theory, based on truth-value gaps, is presented. the theory is proposed as a fairly plausible model for natural language and as one which allows rigorous definitions to be given for various intuitive concepts, such as those of 'grounded' and 'paradoxical' sentences.

Presenting a look at the human mind's capacity while criticizing artificial intelligence, the author makes suggestions about classical and quantum physics and ..

Consider the sentence 'This sentence is not true'. It seems that the sentence can be neither true nor not true, on pain of contradiction. Certain notorious paradoxes like this have bedevilled philosophical theories of truth. Tim Maudlin presents an original account of logic and semantics which deals with these paradoxes, and allows him to set out a new theory of truth-values and the norms governing claims about truth. All philosophers interested in logic and language will find Truth and Paradox a (...) stimulating read. (shrink)

This paper propounds a systematic examination of the link between the Knower Paradox and provability interpretations of modal logic. The aim of the paper is threefold: to give a streamlined presentation of the Knower Paradox and related results; to clarify the notion of a syntactical treatment of modalities; finally, to discuss the kind of solution that modal provability logic provides to the Paradox. I discuss the respective strength of different versions of the Knower Paradox, both in the framework of first-order (...) arithmetic and in that of modal logic with fixed point operators. It is shown that the notion of a syntactical treatment of modalities is ambiguous between a self-referential treatment and a metalinguistic treatment of modalities, and that these two notions are independent. I survey and compare the provability interpretations of modality respectively given by Skyrms, B. (1978, The Journal of Philosophy 75: 368–387) Anderson, C.A. (1983, The Journal of Philosophy 80: 338–355) and Solovay, R. (1976, Israel Journal of Mathematics 25: 287–304). I examine how these interpretations enable us to bypass the limitations imposed by the Knower Paradox while preserving the laws of classical logic, each time by appeal to a distinct form of hierarchy. (shrink)

By means of an example, shows the possibility of beliefs that are separately rational whilst together inconsistent.

Both in dealing with the semantic paradoxes and in dealing with vagueness and indeterminacy, there is some temptation to weaken classical logic: in particular, to restrict the law of excluded middle. The reasons for doing this are somewhat different in the two cases. In the case of the semantic paradoxes, a weakening of classical logic (presumably involving a restriction of excluded middle) is required if we are to preserve the naive theory of truth without inconsistency. In the case of vagueness (...) and indeterminacy, there is no worry about inconsistency; but a central intuition is that we must reject the factual status of certain sentences, and it hard to see how we can do that while claiming that the law of excluded middle applies to those sentences. So despite the different routes, we have a similar conclusion in the two cases. (shrink)

The Knower Paradox has had a brief but eventful history, and principles of epistemic closure (which say that a subject automatically knows any proposition she knows to be materially implied, or logically entailed, by a proposition she already knows) have been the subject of tremendous debate in epistemic logic and epistemology more generally, especially because the fate of standard arguments for and against skepticism seems to turn on the fate of closure. As far as I can tell, however, no one (...) working in either area has emphasized the result I emphasize in this paper: the Knower Paradox just falsifies even the most widely accepted general principles of epistemic closure. After establishing that result, I discuss five of its more important consequences. (shrink)

In the present piece we defend predicate approaches to modality, that is approaches that conceive of modal notions as predicates applicable to names of sentences or propositions, against the challenges raised by Montague’s theorem. Montague’s theorem is often taken to show that the most intuitive modal principles lead to paradox if we conceive of the modal notion as a predicate. Following Schweizer (J Philos Logic 21:1–31, 1992) and others we show this interpretation of Montague’s theorem to be unwarranted unless a (...) further non trivial assumption is made—an assumption which should not be taken as a given. We then move on to showing, elaborating on work of Gupta (J Philos Logic 11:1–60, 1982), Asher and Kamp (Properties, types, and meaning. Vol. I: foundational issues, Kluwer, Dordrecht, pp 85−158, 1989), and Schweizer (J Philos Logic 21:1–31, 1992), that the unrestricted modal principles can be upheld within the predicate approach and that the predicate approach is an adequate approach to modality from the perspective of modal operator logic. To this end we develop a possible world semantics for multiple modal predicates and show that for a wide class of multimodal operator logics we may find a suitable class of models of the predicate approach which satisfies, modulo translation, precisely the theorems of the modal operator logic at stake. (shrink)

Hao Wang was one of the few confidants of the great mathematician and logician Kurt Gödel. _A Logical Journey_ is a continuation of Wang's _Reflections on Gödel_ and also elaborates on discussions contained in _From Mathematics to Philosophy_. A decade in preparation, it contains important and unfamiliar insights into Gödel's views on a wide range of issues, from Platonism and the nature of logic, to minds and machines, the existence of God, and positivism and phenomenology. The impact of Gödel's theorem (...) on twentieth-century thought is on par with that of Einstein's theory of relativity, Heisenberg's uncertainty principle, or Keynesian economics. These previously unpublished intimate and informal conversations, however, bring to light and amplify Gödel's other major contributions to logic and philosophy. They reveal that there is much more in Gödel's philosophy of mathematics than is commonly believed, and more in his philosophy than his philosophy of mathematics. Wang writes that "it is even possible that his quite informal and loosely structured conversations with me, which I am freely using in this book, will turn out to be the fullest existing expression of the diverse components of his inadequately articulated general philosophy." The first two chapters are devoted to Gödel's life and mental development. In the chapters that follow, Wang illustrates the quest for overarching solutions and grand unifications of knowledge and action in Gödel's written speculations on God and an afterlife. He gives the background and a chronological summary of the conversations, considers Gödel's comments on philosophies and philosophers, and his attempt to demonstrate the superiority of the mind's power over brains and machines. Three chapters are tied together by what Wang perceives to be Gödel's governing ideal of philosophy: an exact theory in which mathematics and Newtonian physics serve as a model for philosophy or metaphysics. Finally, in an epilog Wang sketches his own approach to philosophy in contrast to his interpretation of Gödel's outlook. (shrink)

An attractive approach to the semantic paradoxes holds that cases of semantic pathology give rise to indeterminacy. What attitude should a rational agent have toward a proposition that it takes to be indeterminate in this sense? Orthodoxy holds that rationality requires that an agent disbelieve such a proposition. I argue that a rational agent should be such that it is indeterminate whether it believes the proposition in question. For rational agents, indeterminacy in the objects of their attitudes will filter up (...) to the attitudes themselves. (shrink)

Sections 3.16 and 3.23 of Roger Penrose's Shadows of the mind (Oxford, Oxford University Press, 1994) contain a subtle and intriguing new argument against mechanism, the thesis that the human mind can be accurately modeled by a Turing machine. The argument, based on the incompleteness theorem, is designed to meet standard objections to the original Lucas-Penrose formulations. The new argument, however, seems to invoke an unrestricted truth predicate (and an unrestricted knowability predicate). If so, its premises are inconsistent. The usual (...) ways of restricting the predicates either invalidate Penrose's reasoning or require presuppositions that the mechanist can reject. (shrink)