The book provides a historical and systematic exposition of the semantic theory of truth formulated by Alfred Tarski in the 1930s. This theory became famous very soon and inspired logicians and philosophers. It has two different, but interconnected aspects: formal-logical and philosophical. The book deals with both, but it is intended mostly as a philosophical monograph. It explains Tarski’s motivation and presents discussions about his ideas as well as points out various applications of the semantic theory of truth to philosophical (...) problems. (shrink)

'Reason, Causation and Compatibility with the Phenomena' strives to give answers to the philosophical problem of the interplay between realism, explanation and experience. This book is a compilation of essays that recollect significant conceptions of rival terms such as determinism and freedom, reason and appearance, power and knowledge. This title discusses the progress made in epistemology and natural philosophy, especially the steps that led from the ancient theory of atomism to the modern quantum theory, and from mathematization to analytic philosophy. (...) Moreover, it provides possible gateways from modern deadlocks of theory either through approaches to consciousness or through historical critique of intellectual authorities. This work will be of interest to those either researching or studying in colleges and universities, especially in the departments of philosophy, history of science, philosophy of science, philosophy of physics and quantum mechanics, history of ideas and culture. Greek and Latin Literature students and instructors may also find this book to be both a fascinating and valuable point of reference. (shrink)

Esta enciclopédia abrange, de uma forma introdutória mas desejavelmente rigorosa, uma diversidade de conceitos, temas, problemas, argumentos e teorias localizados numa área relativamente recente de estudos, os quais tem sido habitual qualificar como «estudos lógico-filosóficos». De uma forma apropriadamente genérica, e apesar de o território teórico abrangido ser extenso e de contornos por vezes difusos, podemos dizer que na área se investiga um conjunto de questões fundamentais acerca da natureza da linguagem, da mente, da cognição e do raciocínio humanos, bem (...) como questões acerca das conexões destes com a realidade não mental e extralinguística. A razão daquela qualificação é a seguinte: por um lado, a investigação em questão é qualificada como filosófica em virtude do elevado grau de generalidade e abstracção das questões examinadas (entre outras coisas); por outro, a investigação é qualificada como lógica em virtude de ser uma investigação logicamente disciplinada, no sentido de nela se fazer um uso intenso de conceitos, técnicas e métodos provenientes da disciplina de lógica. O agregado de tópicos que constitui a área de estudos lógico-filosóficos é já visível, pelo menos em parte, no Tractatus Logico-Philosophicus de Ludwig Wittgenstein, uma obra publicada em 1921. E uma boa maneira de ter uma ideia sinóptica do território disciplinar abrangido por esta enciclopédia, ou pelo menos de uma porção substancial dele, é extrair do Tractatus uma lista dos tópicos mais salientes aí discutidos; a lista incluirá certamente tópicos do seguinte género, muitos dos quais se podem encontrar ao longo desta enciclopédia: factos e estados de coisas; objectos; representação; crenças e estados mentais; pensamentos; a proposição; nomes próprios; valores de verdade e bivalência; quantificação; funções de verdade; verdade lógica; identidade; tautologia; o raciocínio matemático; a natureza da inferência; o cepticismo e o solipsismo; a indução; as constantes lógicas; a negação; a forma lógica; as leis da ciência; o número. (shrink)

This book provides a detailed commentary on the classic monograph by Alfred Tarski, and offers a reinterpretation and retranslation of the work using the original Polish text and the English and German translations. In the original work, Tarski presents a method for constructing definitions of truth for classical, quantificational formal languages. Furthermore, using the defined notion of truth, he demonstrates that it is possible to provide intuitively adequate definitions of the semantic notions of definability and denotation and that the notion (...) in a structure can be defined in a way that is analogous to that used to define truth. Tarski’s piece is considered to be one of the major contributions to logic, semantics, and epistemology in the 20th century. However, the author points out that some mistakes were introduced into the text when it was translated into German in 1935. As the 1956 English version of the work was translated from the German text, those discrepancies were carried over in addition to new mistakes. The author has painstakingly compared the three texts, sentence-by-sentence, highlighting the inaccurate translations, offering explanations as to how they came about, and commenting on how they have influenced the content and suggesting a correct interpretation of certain passages. Furthermore, the author thoroughly examines Tarski’s article, offering interpretations and comments on the work. (shrink)

This volume is the first ever collection devoted to the field of proof-theoretic semantics. Contributions address topics including the systematics of introduction and elimination rules and proofs of normalization, the categorial characterization of deductions, the relation between Heyting's and Gentzen's approaches to meaning, knowability paradoxes, proof-theoretic foundations of set theory, Dummett's justification of logical laws, Kreisel's theory of constructions, paradoxical reasoning, and the defence of model theory. The field of proof-theoretic semantics has existed for almost 50 years, but the term (...) itself was proposed by Schroeder-Heister in the 1980s. Proof-theoretic semantics explains the meaning of linguistic expressions in general and of logical constants in particular in terms of the notion of proof. This volume emerges from presentations at the Second International Conference on Proof-Theoretic Semantics in Tübingen in 2013, where contributing authors were asked to provide a self-contained description and analysis of a significant research question in this area. The contributions are representative of the field and should be of interest to logicians, philosophers, and mathematicians alike. (shrink)

Two families of many-valued modal logics are investigated. Semantically, one family is characterized using Kripke models that allow formulas to take values in a finite many-valued logic, at each possible world. The second family generalizes this to allow the accessibility relation between worlds also to be many-valued. Gentzen sequent calculi are given for both versions, and soundness and completeness are established.

Classical fixpoint semantics for logic programs is based on the TP immediate consequence operator. The Kripke/Kleene, three-valued, semantics uses ΦP, which extends TP to Kleene’s strong three-valued logic. Both these approaches generalize to cover logic programming systems based on a wide class of logics, provided only that the underlying structure be that of a bilattice. This was presented in earlier papers. Recently well-founded semantics has become influential for classical logic programs. We show how the well-founded approach also extends naturally to (...) the same family of bilatticebased programming languages that the earlier fixpoint approaches extended to. Doing so provides a natural semantics for logic programming systems that have already been proposed, as well as for a large number that are of only theoretical interest. And finally, doing so simplifies the proofs of basic results about the well-founded semantics, by stripping away inessential details. (shrink)

Kleene’s well-known strong three-valued logic is shown to be one of a family of logics with similar mathematical properties. These logics are produced by an intuitively natural construction. The resulting logics have direct relationships with bilattices. In addition they possess mathematical features that lend themselves well to semantical constructions based on fixpoint procedures, as in logic programming.

This paper is based on Tarski’s theory of truth. The purpose of this paper is to solve the liar paradox (and its cousins) and keep both of the deductive power of classical logic and the expressive power of the word “true” in natural language. The key of this paper lies in the distinction between the predicate usage and the operator usage of the word “true”. The truth operator is primarily used for characterizing the semantics of the language. Then, we do (...) not need the hierarchy of languages. The truth predicate is mainly used for grammatical function. Tarski’s schema of the truth predicate is not necessary in this proposal. The schema of the word "true" is the schema of the truth operator. The liar paradox (and its cousins) can be solved in this way. In the appendix, I show a consistent model for both of the truth predicate and the truth operator. (shrink)

The concept of truth arguably plays a central role in many areas of philosophical theorizing. Yet, what seems to be one of the most fundamental principles governing that concept, i.e. the equivalence between P and , is inconsistent in full classical logic, as shown by the semantic paradoxes. I propose a new solution to those paradoxes, based on a principled revision of classical logic. Technically, the key idea consists in the rejection of the unrestricted validity of the structural principle of (...) contraction. I first motivate philosophically this idea with the metaphysical picture of the states-of-affairs expressed by paradoxical sentences as being distinctively . I then proceed to demonstrate that the theory of truth resulting from this metaphysical picture is, in many philosophically interesting respects, surprisingly stronger than most other theories of truth endorsing the equivalence between P and (for example, the theory vindicates the validity of the traditional laws of excluded middle and of non-contradiction, and also vindicates the traditional constraint of truth preservation on logical consequence). I conclude by proving a cutelimination theorem that shows the consistency of the theory. (shrink)

This paper investigates how naive theories of truth fare with respect to a set of extremely plausible principles of restricted quantification. It is first shown that both nonsubstructural theories as well as certain substructural theories cannot validate all those principles. Then, pursuing further an approach to the semantic paradoxes that the author has defended elsewhere, the theory of restricted quantification available in a specific naive theory that rejects the structural property of contraction is explored. It is shown that the theory (...) validates all the principles in question, and it is argued that other prima facie plausible principles that the theory fails to validate are objectionable on independent grounds. (shrink)

A unified answer is offered to two distinct fundamental questions: whether a nonclassical solution to the semantic paradoxes should be extended to other apparently similar paradoxes and whether a nonclassical logic should be expressed in a nonclassical metalanguage. The paper starts by reviewing a budget of paradoxes involving the logical properties of validity, inconsistency, and compatibility. The author’s favored substructural approach to naive truth is then presented and it is explained how that approach can be extended in a very natural (...) way so as to solve a certain paradox of validity. However, three individually decisive reasons are later provided for thinking that no approach adopting a classical metalanguage can adequately account for all the features involved in the paradoxes of logical properties. Consequently, the paper undertakes the task to do better, and, building on the system already developed, introduces a theory in a nonclassical metalanguage that expresses an adequate logic of naive truth and of some naive logical properties. (shrink)

A new semantic paradox developed by Richard Heck and relying on very minimal logical and truth-theoretic resources is rehearsed. A theory of truth restricting the structural metarule of contraction is presented and some of the theory's relevant features are made explicit. It is then shown how the theory provides a principled solution to the paradox while preserving the extremely compelling truth-theoretic principles at stake, thus bringing out a significant advantage that the theory enjoys over virtually all other non-dialetheic theories. It (...) is finally argued that such advantage is amplified by theoretical considerations made available by the adoption of a correspondentist perspective in the philosophy of truth. (shrink)

In other works, I’ve proposed a solution to the semantic paradoxes which, at the technical level, basically relies on failure of contraction. I’ve also suggested that, at the philosophical level, contraction fails because of the instability of certain states of affairs. In this paper, I try to make good on that suggestion.

In this paper, I propose that 'true’ is polysemous, and thus ambiguous. I suggest that the semantic paradoxes both motivates taking 'true’ to be polysemous and shows that the concept truth is indefinitely extensible. In doing so, I explain that 'true’ is polysemous between the meanings corresponding to the subconcepts of the concept truth generated by such indefinite extensibility. I conclude that the proposal provides satisfying solutions to the semantic paradoxes.

It is a fundamental intuition about truth that the conditions under which a sentence is true are given by what the sentence asserts. My aim in this paper is to show that this intuition captures the concept of truth completely and correctly. This is conceptual deflationism, for it does not go beyond what is asserted by a sentence in order to define the truth status of that sentence. This paper, hence, is a defense of deflationism as a conceptual account of (...) truth. This defense is developed in four stages. In the first stage I present a distinction between two types of deflationism, conceptual and metaphysical. This is the central stage of the argument and its main conclusion is that conceptual deflationism when joined with the principle of bivalence is inconsistent with metaphysical deflationism, that is, conceptual deflationism together with bivalence entails a non-deflationary metaphysical account of truth. In the second and third stages of the argument I argue that the totality of the Tarskian biconditionals, when interpreted as definitional biconditionals, offers a description of the nature of truth. In the fourth, and final, stage of the argument I advance a positive case for conceptual deflationism. I explain how the revision theory of truth provides this sort of deflationism with its best evidence: a clear demonstration of its consistency and a compelling argument for its material adequacy. (shrink)

Many topics have not been covered, in most cases because I don't know quite what to say about them. Would it be possible to add a decidability predicate to the language? What about stronger connectives, like exclusion negation or Lukasiewicz implication? Would an expanded language do better at expressing its own semantics? Would it contain new and more terrible paradoxes? Can the account be supplemented with a workable notion of inherent truth (see note 36)? In what sense does stage semantics (...) lie “between” fixed point and stability semantics? In what sense, exactly, are our semantical rules inconsistent? In what sense, if any, does their inconsistency resolve the problem of the paradoxes?The ideals of strength, grounding, and closure together define an intuitively appealing conception of truth. Nothing would be gained by insisting that it was the intuitive conception of truth, and in fact recent developments make me wonder whether such a thing exists. However that may be, until the alternatives are better understood it would be foolish to attempt to decide between them. Truth gives up her secrets slowly and grudgingly, and loves to confound our presumptions. (shrink)

Stephen Read has presented an argument for the inconsistency of the concept of validity. We extend Read’s results and show that this inconsistency is but one half of a larger problem. Like the concept of truth, validity is infected with what we call semantic pathology, a condition that actually gives rise to two symptoms: inconsistency and indeterminacy. After sketching the basic ideas behind semantic pathology and explaining how it manifests both symptoms in the concept of truth, we present cases that (...) establish the indeterminacy of validity and that link this indeterminacy with the concept’s inconsistency. Our conclusion is that an adequate treatment of the semantic pathology thus revealed must deal with both of its symptoms. Further, it must extend to the occurrences of this condition elsewhere: in the concept of truth, in the other central semantic notions, and even in certain philosophical concepts outside semantics. (shrink)

This paper investigates the concept of aletheia in ancient philosophy from the pre-Socratics until Aristotle. The meaning of aletheia in archaic Greek is taken as the starting point. It is followed by remarks about the concept of truth in the Seven Sages. The author discusses this concept as it appears in views and works of philosophers and historians. A special section is devoted to the epistemological and ontological understanding of truth. On this occasion, influential views of Heidegger are examined. The (...) paper is concluded by a review of various meanings of truth in Aristotle. (shrink)

We discuss four distinct semantic consequence relations which are based on Strong Kleene theories of truth and which generalize the notion of classical consequence to 3-valued logics. Then we set up a uniform signed tableau calculus, which we show to be sound and complete with respect to each of the four semantic consequence relations. The signs employed by our calculus are,, and, which indicate a strict assertion, strict denial, tolerant assertion and tolerant denial respectively. Recently, Ripley applied the strict–tolerant account (...) of assertion and denial to develop a new approach to truth and alethic paradox, which we call the Strict–Tolerant Conceptionof Truth. The paper aims to contribute to our understanding of STCT in at least three ways. First, by developing the strict–tolerant calculus.Second, by developing a semantic version of the strict–tolerant calculus, which informs us about the assertoric possibilities relative to a fixed ground model. Third, by showing that the strict–tolerant calculus and assertoric semantics jointly suggest that STCT's claim that the strict and tolerant can be understood in terms of one another has to be reconsidered. (shrink)

Uzquiano (Analysis 70:39–44, 2010 ) showed that the Hardest Logic Puzzle Ever ( HLPE ) [in its amended form due to Rabern and Rabern (Analysis 68:105–112, 2008 )] has a solution in only two questions. Uzquiano concludes his paper by noting that his solution strategy naturally suggests a harder variation of the puzzle which, as he remarks, he does not know how to solve in two questions. Wheeler and Barahona (J Philos Logic, to appear, 2011 ) formulated a three question (...) solution to Uzquiano’s puzzle and gave an information theoretic argument to establish that a two question solution for Uzquiano’s puzzle does not exist. However, their argument crucially relies on a certain conception of what it means to answer self-referential yes–no questions truly and falsely . We propose an alternative such conception which, as we show, allows one to solve Uzquiano’s puzzle in two questions. The solution strategy adopted suggests an even harder variation of Uzquiano’s puzzle which, as we will show, can also be solved in two questions. Just as all previous solutions to versions of HLPE , our solution is presented informally. The second part of the paper investigates the prospects of formally representing solutions to HLPE by exploiting theories of truth. (shrink)

In this paper, we study the method of closure games, a game-theoretic valuation method for languages of self-referential truth developed by the author. We prove two theorems which jointly establish that the method of closure games characterizes all 3- and 4-valued strong Kleene fixed points in a novel, informative manner. Among others, we also present closure games which induce the minimal and maximal intrinsic fixed point of the strong Kleene schema.

In a recent paper, Philip Kremer proposes a formal and theory-relative desideratum for theories of truth that is spelled out in terms of the notion of ‘no vicious reference’. Kremer’s Modified Gupta-Belnap Desideratum (MGBD) reads as follows: if theory of truth T dictates that there is no vicious reference in ground model M, then T should dictate that truth behaves like a classical concept in M. In this paper, we suggest an alternative desideratum (AD): if theory of truth T dictates (...) that there is no vicious reference in ground model M, then T should dictate that all T-biconditionals are (strongly) assertible in M. We illustrate that MGBD and AD are not equivalent by means of a Generalized Strong Kleene theory of truth and we argue that AD is preferable over MGBD as a desideratum for theories of truth. (shrink)

There is no consensus as to whether a Liar sentence is meaningful or not. Still, a widespread conviction with respect to Liar sentences (and other ungrounded sentences) is that, whether or not they are meaningful, they are useless . The philosophical contribution of this paper is to put this conviction into question. Using the framework of assertoric semantics , which is a semantic valuation method for languages of self-referential truth that has been developed by the author, we show that certain (...) computational problems, called query structures , can be solved more efficiently by an agent who has self-referential resources (amongst which are Liar sentences) than by an agent who has only classical resources; we establish the computational power of self-referential truth . The paper concludes with some thoughts on the implications of the established result for deflationary accounts of truth. (shrink)

The paper is a critique of the widespread conception of logic as a neutral arbiter between metaphysical theories, one that makes no `substantive’ claims of its own (David Kaplan and John Etchemendy are two recent examples). A familiar observation is that virtually every putatively fundamental principle of logic has been challenged over the last century on broadly metaphysical grounds (however mistaken), with a consequent proliferation of alternative logics. However, this apparent contentiousness of logic is often treated as though it were (...) neutralized by the possibility of studying all these alternative logics within an agreed metalogical framework, typically that of first-order logic with set theory. In effect, metalogic is given the role of neutral arbiter. The paper will consider a variety of examples in which deep logical disputes re-emerge at the meta-level. One case is quantified modal logic, where some varieties of actualism require a modal meta-language (as opposed to the usual non-modal language of possible worlds model theory) in order not to make their denial of the Barcan formula self-defeating. Similarly, on some views the intended model theory for second-order logic can only be given in a second-order metalanguage—this may be needed to avoid versions of Russell’s paradox when the first-order quantifiers are read as absolutely unrestricted. It can be shown that the phenomenon of higher-order vagueness eventually forces fuzzy logical treatments of vagueness to use a fuzzy metalanguage, with consequent repercussions for what first-order principles are validated. The difficulty of proving the completeness of first-order intuitionistic logic on its intended interpretation by intuitionistically rather than just classically valid means is a more familiar example. These case studies will be discussed in some detail to reveal a variety of ways in which even metalogic is metaphysically contested, substantial and non-neutral. (shrink)

Kripke [1975] gives a formal theory of truth based on Kleene's strong evaluation scheme. It is probably the most important and influential that has yet been given—at least since Tarski. However, it has been argued that this theory has a problem with generalized quantifiers such as All—that is, All ϕs are ψ—or Most. Specifically, it has been argued that such quantifiers preclude the existence of just the sort of language that Kripke aims to deliver—one that contains its own truth predicate. (...) In this paper I solve the problem by showing how Kleene's strong scheme, and Kripke's theory based on it, can in a natural way be extended to accommodate the full range of generalized quantifiers. (shrink)

Are there ‘self-referential’ propositions? That is, propositions that say of themselves that they have a certain property, such as that of being false. There can seem reason to doubt that there are. At the same time, there are a number of reasons why it matters. For suppose that there are indeed no such propositions. One might then hope that while paradoxes such as the Liar show that many plausible principles about sentences must be given up, no such fate will befall (...) principles about propositions. But the existence of self-referential propositions would dash such hopes. Further, the existence of such propositions would also seem to challenge the widespread claim that Liar sentences fail to express propositions. The aim of this paper is thus to settle the question–at least given an assumption. In particular, I argue that if propositions are structured, then self-referential propositions exist. (shrink)

This paper addresses the question: given some theory T that we accept, is there some natural, generally applicable way of extending T to a theory S that can prove a range of things about what it itself (i.e. S) can prove, including a range of things about what it cannot prove, such as claims to the effect that it cannot prove certain particular sentences (e.g. 0 = 1), or the claim that it is consistent? Typical characterizations of Gödel’s second incompleteness (...) theorem, and its significance, would lead us to believe that the answer is ‘no’. But the present paper explores a positive answer. The general approach is to follow the lead of recent (and not so recent) approaches to truth and the Liar paradox. (shrink)

The notion of a proposition is central to philosophy. But it is subject to paradoxes. A natural response is a hierarchical account and, ever since Russell proposed his theory of types in 1908, this has been the strategy of choice. But in this paper I raise a problem for such accounts. While this does not seem to have been recognized before, it would seem to render existing such accounts inadequate. The main purpose of the paper, however, is to provide a (...) new hierarchical account that solves the problem. (shrink)

Metaphysically possible worlds have many uses. Epistemically possible worlds promise to be similarly useful, especially in connection with propositions and propositional attitudes. However, I argue that there is a serious threat to the natural accounts of epistemically possible worlds, from a version of Russell’s paradox. I contrast this threat with David Kaplan’s problem for metaphysical possible world semantics: Kaplan’s problem can be straightforwardly rebutted, the problems I raise cannot. I argue that although there may be coherent accounts of epistemically possible (...) worlds with fruitful applications, any such an account must fundamentally compromise the basic idea behind epistemic possibility. (shrink)

We show that the set of ultimately true sentences in Hartry Field's Revenge-immune solution model to the semantic paradoxes is recursively isomorphic to the set of stably true sentences obtained in Hans Herzberger's revision sequence starting from the null hypothesis. We further remark that this shows that a substantial subsystem of second-order number theory is needed to establish the semantic values of sentences in Field's relative consistency proof of his theory over the ground model of the standard natural numbers: -CA0 (...) (second-order number theory with a -comprehension axiom scheme) is insufficient. We briefly consider his claim to have produced a solution to the semantic paradoxes by introducing this conditional. We remark that the notion of a operator can be introduced in other settings. (shrink)

We consider notions of truth and logical validity defined in various recent constructions of Hartry Field. We try to explicate his notion of determinate truth by clarifying the path-dependent hierarchies of his determinateness operator.

We show how in the hierarchies${F_\alpha }$of Fieldian truth sets, and Herzberger’s${H_\alpha }$revision sequence starting from any hypothesis for${F_0}$ that essentially each${H_\alpha }$ carries within it a history of the whole prior revision process.As applications we provide a precise representation for, and a calculation of the length of, possiblepath independent determinateness hierarchiesof Field’s construction with a binary conditional operator. We demonstrate the existence of generalized liar sentences, that can be considered as diagonalizing past the determinateness hierarchies definable in Field’s recent (...) models. The ‘defectiveness’ of such diagonal sentences necessarily cannot be classified by any of the determinateness predicates of the model. They are ‘ineffable liars’. We may consider them a response to the claim of Field that ‘the conditional can be used to show that the theory is not subject to “revenge problems”.’. (shrink)

We look at various notions of a class of definability operations that generalise inductive operations, and are characterised as “revision operations”. More particularly we: (i) characterise the revision theoretically definable subsets of a countable acceptable structure; (ii) show that the categorical truth set of Belnap and Gupta’s theory of truth over arithmetic using \emph{fully varied revision} sequences yields a complete \Pi13 set of integers; (iii) the set of \emph{stably categorical} sentences using their revision operator ψ is similarly \Pi13 and which (...) is complete in Gödel’s universe of constructible sets L; (iv) give an alternative account of a theory of truth—realistic variance that simplifies full variance, whilst at the same time arriving at Kripkean fixed points. (shrink)

We represent truth sets for a variety of the well known semantic theories of truth as those sets consisting of all sentences for which a player has a winning strategy in an infinite two person game. The classifications of the games considered here are simple, those over the natural model of arithmetic being all within the arithmetical class of $\Sum_{3}^{0}$.

There has been much debate recently as to whether the notion of truth, as applied to one's home language, is metaphysically neutral, the interesting metaphysical questions arising elsewhere (in relation to such notions as mind-independence or objectivity or existence). ' On one side, the minimalists, as they have come to be known, favour deflationary accounts of truth such as the redundancy or disquotational theories and conclude that the notion of truth is applicable to declarative sentences in general - at least (...) where there are fairly definite standards of appropriateness for the assertion or denial of such sentences - irrespective of the metaphysical commitments of the propositions the sentences express. Opponents have criticized the minimalist account of truth or denied that it follows from this account that truth is metaphysically neutral. My sympathies in this debate lie with the minimalist but I wish to focus on a serious problem for the minimalist - that posed by the Liar paradox. This problem has featured very little in the recent debate but seems to me to yield the strongest objection to minimalism. I develop the objection in the next section, in §2 sketching what I feel to be the minimalist's best response, namely developing the position not in terms of Tarskian classical biconditionals but rather in terms of the naive rules for truth. It emerges, then, that the minimalist will be forced to repudiate classical logic. The last section, §3, deals with objections to the strategy of §2. (shrink)

The conditional probability of h given e is commonly claimed to be equal to the probability that h would have if e were learned. Here I contend that this general claim about conditional probabilities is false. I present a counter-example that involves probabilities of probabilities, a second that involves probabilities of possible future actions, and a third that involves probabilities of indicative conditionals. In addition, I briefly defend these counter-examples against charges that the probabilities they involve are illegitimate.

ABSTRACTDo truth tables—the ordinary sort that we use in teaching and explaining basic propositional logic—require an assumption of consistency for their construction? In this essay we show that truth tables can be built in a consistency-independent paraconsistent setting, without any appeal to classical logic. This is evidence for a more general claim—that when we write down the orthodox semantic clauses for a logic, whatever logic we presuppose in the background will be the logic that appears in the foreground. Rather than (...) any one logic being privileged, then, on this count partisans across the logical spectrum are in relatively similar dialectical positions. (shrink)

A historically popular response to the liar paradox (“this sentence is false”) is to say that the liar sentence is meaningless (or semantically defective, or malfunctions, or…). Unfortunately, like all other supposed solutions to the liar, this approach faces a revenge challenge. Consider the revenge liar sentence, “this sentence is either meaningless or false”. If it is true, then it is either meaningless or false, so not true. And if it is not true, then it can’t be either meaningless or (...) false, so it must be true. Either way, we are back in a paradox. This paper provides a detailed and exhaustive discussion of the options for responding to revenge on behalf of “meaningless” theories. Though I attempt to discuss all of the options fairly, I will ultimately opt for one specific response and discuss some of its challenges. Various technical and logical matters will be discussed throughout the paper, but my focus will be philosophical, throughout. My overall conclusion is that the “meaningless” strategy is at least as well off in the face of revenge as any other approach to the liar and related paradoxes. (shrink)

We present an account of semantics that is not construed as a mapping of language to the world but rather as a mapping between individual meaning spaces. The meanings of linguistic entities are established via a “meeting of minds.” The concepts in the minds of communicating individuals are modeled as convex regions in conceptual spaces. We outline a mathematical framework, based on fixpoints in continuous mappings between conceptual spaces, that can be used to model such a semantics. If concepts are (...) convex, it will in general be possible for interactors to agree on joint meaning even if they start out from different representational spaces. Language is discrete, while mental representations tend to be continuous—posing a seeming paradox. We show that the convexity assumption allows us to address this problem. Using examples, we further show that our approach helps explain the semantic processes involved in the composition of expressions. (shrink)