This book proposes a novel theory of truth and falsity. It argues that truth is a form of reference and falsity is a form of reference failure. -/- Most of the philosophical literature on truth concentrates on certain ontological and epistemic problems. This book focuses instead on language. By utilizing the Fregean idea that sentences are singular referring expressions, the author develops novel connections between the philosophical study of truth and falsity and the huge literature in in the philosophy of (...) language on the notion of reference. The first part of the book constructs the author’s theory and argues for it in length. Part II addresses the ways in which the theory relates to, and is different from, some of the basic theories of truth. Part III takes up how to account for the truth of sentences with logical operators and quantifiers. Finally, Part IV discusses the applications and implications of the theory for longstanding problems in philosophy of language, metaphysics, and epistemology. -/- A Referential Theory of Truth and Falsity will appeal to researchers and advanced students working in philosophy of language, epistemology, metaphysics, and linguistics. -/- . (shrink)

The proof theory of many-valued systems has not been investigated to an extent comparable to the work done on axiomatizatbility of many-valued logics. Proof theory requires appropriate formalisms, such as sequent calculus, natural deduction, and tableaux for classical (and intuitionistic) logic. One particular method for systematically obtaining calculi for all finite-valued logics was invented independently by several researchers, with slight variations in design and presentation. The main aim of this report is to develop the proof theory of finite-valued first order (...) logics in a general way, and to present some of the more important results in this area. In Systems covered are the resolution calculus, sequent calculus, tableaux, and natural deduction. This report is actually a template, from which all results can be specialized to particular logics. (shrink)

Recent experiments have shown that naive speakers find borderline contradictions involving vague predicates acceptable. In Cobreros et al. we proposed a pragmatic explanation of the acceptability of borderline contradictions, building on a three-valued semantics. In a reply, Alxatib et al. show, however, that the pragmatic account predicts the wrong interpretations for some examples involving disjunction, and propose as a remedy a semantic analysis instead, based on fuzzy logic. In this paper we provide an explicit global pragmatic interpretation rule, based on (...) a somewhat richer semantics, and show that with its help the problem can be overcome in pragmatics after all. Furthermore, we use this pragmatic interpretation rule to define a new consequence-relation and discuss some of its properties. (shrink)

A general theory of logical oppositions is proposed by abstracting these from the Aristotelian background of quantified sentences. Opposition is a relation that goes beyond incompatibility (not being true together), and a question-answer semantics is devised to investigate the features of oppositions and opposites within a functional calculus. Finally, several theoretical problems about its applicability are considered.

This paper presents an algebraic approach of some many-valued generalizations of modal logic. The starting point is the definition of the [0, 1]-valued Kripke models, where [0, 1] denotes the well known MV-algebra. Two types of structures are used to define validity of formulas: the class of frames and the class of Ł n -valued frames. The latter structures are frames in which we specify in each world u the set (a subalgebra of Ł n ) of the allowed truth (...) values of the formulas in u. We apply and develop algebraic tools (namely, canonical and strong canonical extensions) to generate complete modal n + 1-valued logics and we obtain many-valued counterparts of Shalqvist canonicity result. (shrink)

The paper’s novelty is in combining two comparatively new fields of research: non-transitive logic and the proof method of correspondence analysis. To be more detailed, in this paper the latter is adapted to Weir’s non-transitive trivalent logic \({\mathbf{NC}}_{\mathbf{3}}\). As a result, for each binary extension of \({\mathbf{NC}}_{\mathbf{3}}\), we present a sound and complete Lemmon-style natural deduction system. Last, but not least, we stress the fact that Avron and his co-authors’ general method of obtaining _n_-sequent proof systems for any _n_-valent logic (...) with deterministic or non-deterministic matrices is not applicable to \({\mathbf{NC}}_{\mathbf{3}}\) and its binary extensions. (shrink)

In this paper we explain that the paraconsistent logic LP promoted by Graham Priest can only be supported by trivial dialetheists, i.e., those who believe that all sentences are dialetheias.

The Warsaw School of Logic (WSL) was the famous branch of the Lviv-Warsaw School (LWS) – the most important movement in the history of Polish philosophy. Logic made the most important field in the activities of the WSL. The aim of this work is to highlight the role and significance of the WSL in the history of logic in the 20th century.

This volume examines the entire logical and philosophical production of Nikolai A. Vasil’ev, studying his life and activities as a historian and man of letters. Readers will gain a comprehensive understanding of this influential Russian logician, philosopher, psychologist, and poet. The author frames Vasil’ev’s work within its historical and cultural context. He takes into consideration both the situation of logic in Russia and the state of logic in Western Europe, from the end of the 19th century to the beginning of (...) the 20th. Following this, the book considers the attempts to develop non-Aristotelian logics or ideas that present affinities with imaginary logic. It then looks at the contribution of traditional logic in elaborating non-classical ideas. This logic allows the author to deal with incomplete objects just as imaginary logic does with contradictory ones. Both logics are objects of interesting analysis by modern researchers. (shrink)

This work proposes an understanding of deductive, default and abductive reasoning as different instances of the same phenomenon: epistemic dynamics. It discusses the main intuitions behind each one of these reasoning processes, and suggest how they can be understood as different epistemic actions that modify an agent’s knowledge and/or beliefs in a different way, making formal the discussion with the use of the dynamic epistemic logic framework. The ideas in this paper put the studied processes under the same umbrella, thus (...) highlighting their relationship and allowing a better understanding of how they interact together. (shrink)

Epistemicists claim that if it is vague whether p, it is unknowable whether p. Some contest this on epistemic grounds: vague intuitions about vague matters need not fully preclude knowledge, if those intuitions are response-dependent in some special sense of enabling vague knowledge. This paper defends the epistemicist principle that vagueness entails ignorance against such objections. I argue that not only is response-dependence an implausible characterization of actual vague matters, its mere possibility poses no threat to epistemicism and is properly (...) accounted for by the epistemicist’s own principles. (shrink)

The knowledge representation and reasoning of both humans and artificial systems often involves conditionals. A conditional connects a consequence which holds given a precondition. It can be easily recognized in natural languages with certain key words, like “if” in English. A vast amount of literature in both fields, both artificial intelligence and psychology, deals with the questions of how such conditionals can be best represented and how these conditionals can model human reasoning. On the other hand, findings in the psychology (...) of reasoning, such as those in the Suppression Task, have led to a paradigm shift from the monotonicity assumptions in human inferences towards nonmonotonic reasoning. Nonmonotonic reasoning is sensitive for information change, that is, inferences are drawn cautiously such that retraction of previous information is not required with the addition of new information. While many formalisms of nonmonotonic reasoning have been proposed in the field of Artificial Intelligence, their capability to model properties of human reasoning has not yet been extensively investigated. In this paper, we analyzed systematically from both a formal and an empirical perspective the power of formal nonmonotonic systems to model possible explicit defeaters, as in the Suppression Task, and more implicit conditional rules that trigger nonmonotonic reasoning by the keywords in such rules. The results indicated that the classical evaluation for the correctness of inferences has to be extended in the three major aspects regarding the inference system, the knowledge base, and possible assumed exceptions for the rule. (shrink)

Both I and Belnap, motivated the "Belnap-Dunn 4-valued Logic" by talk of the reasoner being simply "told true" (T) and simply "told false" (F), which leaves the options of being neither "told true" nor "told false" (N), and being both "told true" and "told false" (B). Belnap motivated these notions by consideration of unstructured databases that allow for negative information as well as positive information (even when they conflict). We now experience this on a daily basis with the Web. But (...) the 4-valued logic is deductive in nature, and its matrix is discrete: there are just four values. In this paper I investigate embedding the 4-valued logic into a context of probability. Jøsang's Subjective Logic introduced uncertainty to allow for degrees of belief, disbelief, and uncertainty. We extend this so as to allow for two kinds of uncertainty— that in which the reasoner has too little information (ignorance) and that in which the reasoner has too much information (conflicted). Jøsang's "Opinion Triangle" becomes an "Opinion Tetrahedron" and the 4-values can be seen as its vertices. I make/prove various observations concerning the relation of non-classical "probability" to non-classical logic. (shrink)

We explore the technical details and historical evolution of Charles Peirce's articulation of a truth table in 1893, against the background of his investigation into the truth-functional analysis of propositions involving implication. In 1997, John Shosky discovered, on the verso of a page of the typed transcript of Bertrand Russell's 1912 lecture on ?The Philosophy of Logical Atomism? truth table matrices. The matrix for negation is Russell's, alongside of which is the matrix for material implication in the hand of Ludwig (...) Wittgenstein. It is shown that an unpublished manuscript identified as composed by Peirce in 1893 includes a truth table matrix that is equivalent to the matrix for material implication discovered by John Shosky. An unpublished manuscript by Peirce identified as having been composed in 1883?1884 in connection with the composition of Peirce's ?On the Algebra of Logic: A Contribution to the Philosophy of Notation? that appeared in the American Journal of Mathematics in 1885 includes an example of an indirect truth table for the conditional. (shrink)

Prezentujemy dwa formalne narzędzia służące do modelowania rozumowań, za pomocą których rozwiązywane są szczególnego rodzaju problemy abdukcyjne. Pierwszy model, osadzony w formalizmie logiki pytań, bazuje na pojęciu słabej implikacji erotetycznej. Drugi model wykorzystuje relacje zawężania i odsiewania definiowane za po-mocą logiki pytań, semantyki sytuacyjnej i pojęcia relewancjiwątku. Na przykładzie analizy rozgrywek w grę Takie Życie pokazujemy, że oba modele adekwatnie charakteryzują dane empiryczne.

We present a procedure which allows us to recover classical and nonclassical logical structures as concrete logics associated with physical theories expressed by means of classical languages. This procedure consists in choosing, for a given theory ${{\mathcal{T}}}$ and classical language ${{\fancyscript{L}}}$ expressing ${{\mathcal{T}}, }$ an observative sublanguage L of ${{\fancyscript{L}}}$ with a notion of truth as correspondence, introducing in L a derived and theory-dependent notion of C-truth (true with certainty), defining a physical preorder $\prec$ induced by C-truth, and finally selecting (...) a set of sentences ϕ V that are verifiable (or testable) according to ${{\mathcal{T}}, }$ on which a weak complementation ⊥ is induced by ${{\mathcal{T}}. }$ The triple $(\phi_{V},\prec,^{\perp})$ is then the desired concrete logic. By applying this procedure we recover a classical logic and a standard quantum logic as concrete logics associated with classical and quantum mechanics, respectively. The latter result is obtained in a purely formal way, but it can be provided with a physical meaning by adopting a recent interpretation of quantum mechanics that reinterprets quantum probabilities as conditional on detection rather than absolute. Hence quantum logic can be considered as a mathematical structure formalizing the properties of the notion of verification in quantum physics. This conclusion supports the general idea that some nonclassical logics can coexist without conflicting with classical logic (global pluralism) because they formalize metalinguistic notions that do not coincide with the notion of truth as correspondence but are not alternative to it either. (shrink)

In the literature on vagueness one finds two very different kinds of degree theory. The dominant kind of account of gradable adjectives in formal semantics and linguistics is built on an underlying framework involving bivalence and classical logic: its degrees are not degrees of truth. On the other hand, fuzzy logic based theories of vagueness—largely absent from the formal semantics literature but playing a significant role in both the philosophical literature on vagueness and in the contemporary logic literature—are logically nonclassical (...) and give a central role to the idea of degrees of truth. Each kind of degree theory has a strength: the classical kind allows for rich and subtle analyses of the comparative form of gradable adjectives and of various types of gradable precise adjectives, while the fuzzy kind yields a compelling solution to the sorites paradox. This paper argues that the fuzzy kind of theory can match the benefits of the classical kind and hence that the burden is on the latter to match the advantages of the former. In particular, we develop a new version of the fuzzy logic approach that—unlike existing fuzzy theories—yields a compelling analysis of the comparative as well as an adequate account of gradable precise predicates, while still retaining the advantage of genuinely solving the sorites paradox. (shrink)

This work proposes an understanding of deductive, default and abductive reasoning as different instances of the same phenomenon: epistemic dynamics. It discusses the main intuitions behind each one of these reasoning processes, and suggest how they can be understood as different epistemic actions that modify an agent’s knowledge and/or beliefs in a different way, making formal the discussion with the use of the dynamic epistemic logic framework. The ideas in this paper put the studied processes under the same umbrella, thus (...) highlighting their relationship and allowing a better understanding of how they interact together. (shrink)

A survey is given of three-valued paraconsistent propositionallogics connected with Jaśkowski’s criterion for constructing paraconsistentlogics. Several problems are raised and four new matrix three-valued paraconsistent logics are suggested.

This paper is a contribution to Mathematical fuzzy logic, in particular to the algebraic study of t-norm based fuzzy logics. In the general framework of propositional core and Δ-core fuzzy logics we consider three properties of completeness with respect to any semantics of linearly ordered algebras. Useful algebraic characterizations of these completeness properties are obtained and their relations are studied. Moreover, we concentrate on five kinds of distinguished semantics for these logics–namely the class of algebras defined over the real unit (...) interval, the rational unit interval, the hyperreals , the strict hyperreals and finite chains, respectively–and we survey the known completeness methods and results for prominent logics. We also obtain new interesting relations between the real, rational and hyperreal semantics, and good characterizations for the completeness with respect to the semantics of finite chains. Finally, all completeness properties and distinguished semantics are also considered for the first-order versions of the logics where a number of new results are proved. (shrink)