I examine Paul Boghossian's recent attempt to argue for scepticism about logical rules. I argue that certain rule- and proof-theoretic considerations can avert such scepticism. Boghossian's 'Tonk Argument' seeks to justify the rule of tonk-introduction by using the rule itself. The argument is subjected here to more detailed proof-theoretic scrutiny than Boghossian undertook. Its sole axiom, the so-called Meaning Postulate for tonk, is shown to be false or devoid of content. It is also shown that the rules of Disquotation and (...) of Semantic Ascent cannot be derived for sentences with tonk dominant. These considerations deprive Boghossian's scepticism of its support. (shrink)

This paper is concerned with a propositional modal logic with operators for necessity, actuality and apriority. The logic is characterized by a class of relational structures defined according to ideas of epistemic two-dimensional semantics, and can therefore be seen as formalizing the relations between necessity, actuality and apriority according to epistemic two-dimensional semantics. We can ask whether this logic is correct, in the sense that its theorems are all and only the informally valid formulas. This paper gives outlines of two (...) arguments that jointly show that this is the case. The first is intended to show that the logic is informally sound, in the sense that all of its theorems are informally valid. The second is intended to show that it is informally complete, in the sense that all informal validities are among its theorems. In order to give these arguments, a number of independently interesting results concerning the logic are proven. In particular, the soundness and completeness of two proof systems with respect to the semantics is proven (Theorems 2.11 and 2.15), as well as a normal form theorem (Theorem 3.2), an elimination theorem for the actuality operator (Corollary 3.6), and the decidability of the logic (Corollary 3.7). It turns out that the logic invalidates a plausible principle concerning the interaction of apriority and necessity; consequently, a variant semantics is briefly explored on which this principle is valid. The paper concludes by assessing the implications of these results for epistemic two-dimensional semantics. (shrink)

I examine Paul Boghossian's recent attempt to argue for scepticism about logical rules. I argue that certain rule- and proof-theoretic considerations can avert such scepticism. Boghossian's 'Tonk Argument' seeks to justify the rule of tonk-introduction by using the rule itself. The argument is subjected here to more detailed proof-theoretic scrutiny than Boghossian undertook. Its sole axiom, the so-called Meaning Postulate for tonk, is shown to be false or devoid of content. It is also shown that the rules of Disquotation and (...) of Semantic Ascent cannot be derived for sentences with tonk dominant. These considerations deprive Boghossian's scepticism of its support. (shrink)

A philosophical discussion of the intuitive meaning of the formalism of modal propositional logics.

Despite being fairly powerful, finite non-deterministic matrices are unable to characterize some logics of formal inconsistency, such as those found between mbCcl and Cila. In order to overcome this limitation, we propose here restricted non-deterministic matrices (in short, RNmatrices), which are non-deterministic algebras together with a subset of the set of valuations. This allows us to characterize not only mbCcl and Cila (which is equivalent, up to language, to da Costa's logic C_1) but the whole hierarchy of da Costa's calculi (...) C_n. This produces a novel decision procedure for these logics. Moreover, we show that the RNmatrix semantics proposed here induces naturally a labelled tableau system for each C_n, which constitutes another decision procedure for these logics. This new semantics allows us to conceive da Costa's hierarchy of C-systems as a family of (non deterministically) (n+2)-valued logics, where n is the number of "inconsistently true" truth-values and 2 is the number of "classical" or "consistent" truth-values, for every C_n. (shrink)

Dugundji proved in 1940 that most parts of standard modal systems cannot be characterized by a single finite deterministic matrix. In the eighties, Ivlev proposed a semantics of four-valued non-deterministic matrices (which he called quasi-matrices), in order to characterize a hierarchy of weak modal logics without the necessitation rule. In a previous paper, we extended some systems of Ivlev’s hierarchy, also proposing weaker six-valued systems in which the (T) axiom was replaced by the deontic (D) axiom. In this paper, we (...) propose even weaker systems, by eliminating both axioms, which are characterized by eight-valued non-deterministic matrices. In addition, we prove completeness for those new systems. It is natural to ask if a characterization by finite ordinary (deterministic) logical matrices would be possible for all those Ivlev-like systems. We will show that finite deterministic matrices do not characterize any of them. (shrink)

Nous proposons une logique épistémique quadrivalente AR4.

§§3-4 of the Begriffsschrift present Frege’s objections to a dominant if murky nineteenth-century semantic picture. I sketch a minimalist variant of the pre-Fregean picture which escapes Frege’s criticisms by positing a thin notion of semantic content which then interacts with a multiplicity of kinds of truth to account for phenomena such as modality. After exploring several ways in which we can understand the existence of multiple truth properties, I discuss the roles of pointwise and setwise truth properties in modal logic. (...) I argue that thinking of supertruth and determinate truth as setwise truth properties allows an understanding of supervaluationist approaches to vagueness which escapes both Williamson’s objections to and a needless metalinguistic orientation of traditional supervaluationism. (shrink)

Classical logic of formal provability includes Löb’s theorem, but not reflection. In contrast, intuitions about the inferential behavior of informal provability (in informal mathematics) seem to invalidate Löb’s theorem and validate reflection (after all, the intuition is, whatever mathematicians prove holds!). We employ a non-deterministic many-valued semantics and develop a modal logic T-BAT of an informal provability operator, which indeed does validate reflection and invalidates Löb’s theorem. We study its properties and its relation to known provability-related paradoxical arguments. We also (...) argue that T-BAT is a fairly sensible candidate for a formal logic of informal provability. (shrink)

Recently, in an ongoing debate about informal provability, non-deterministic logics of informal provability BAT and CABAT were developed to model the notion. CABAT logic is defined as an extension of BAT logics and itself does not have independent and decent semantics. The aim of the paper is to show that, semantically speaking, both logics are rather complex and they can be characterized by neither finitely many valued deterministic semantics nor possible word semantics including neighbourhood semantics.

The present paper wants to promote epistemic pluralism as an alternative view of non-classical logics. For this purpose, a bilateralist logic of acceptance and rejection is developed in order to make an important di erence between several concepts of epistemology, including information and justi cation. Moreover, the notion of disagreement corresponds to a set of epistemic oppositions between agents. The result is a non-standard theory of opposition for many-valued logics, rendering total and partial disagreement in terms of epistemic negation and (...) semi-negations. (shrink)

What is the fundamental insight behind truth-functionality ? When is a logic interpretable by way of a truth-functional semantics? To address such questions in a satisfactory way, a formal definition of truth-functionality from the point of view of abstract logics is clearly called for. As a matter of fact, such a definition has been available at least since the 70s, though to this day it still remains not very widely well-known. A clear distinction can be drawn between logics characterizable through: (...) (1) genuinely finite-valued truth-tabular semantics; (2) no finite-valued but only an infinite-valued truthtabular semantics; (3) no truth-tabular semantics at all. Any of those logics, however, can in principle be characterized through non-truth-functional valuation semantics, at least as soon as their associated consequence relations respect the usual tarskian postulates. So, paradoxical as that might seem at first, it turns out that truth-functional logics may be adequately characterized by non-truth-functional semantics . Now, what feature of a given logic would guarantee it to dwell in class (1) or in class (2), irrespective of its circumstantial semantic characterization? (shrink)

A simple, bivalent semantics is defined for Łukasiewicz’s 4-valued modal logic Łm4. It is shown that according to this semantics, the essential presupposition underlying Łm4 is the following: A is a theorem iff A is true conforming to both the reductionist and possibilist theses defined as follows: rt: the value of modal formulas is equivalent to the value of their respective argument iff A is true, etc.); pt: everything is possible. This presupposition highlights and explains all oddities arising in Łm4.

The book presents a thoroughly elaborated logical theory of generalized truth-values understood as subsets of some established set of truth values. After elucidating the importance of the very notion of a truth value in logic and philosophy, we examine some possible ways of generalizing this notion. The useful four-valued logic of first-degree entailment by Nuel Belnap and the notion of a bilattice constitute the basis for further generalizations. By doing so we elaborate the idea of a multilattice, and most notably, (...) a trilattice of truth values – a specific algebraic structure with information ordering and two distinct logical orderings, one for truth and another for falsity. Each logical order not only induces its own logical vocabulary, but determines also its own entailment relation. We consider both semantic and syntactic ways of formalizing these relations and construct various logical calculi. (shrink)

Hugh MacColl is commonly seen as a pioneer of modal and many-valued logic, given his introduction of modalities that go beyond plain truth and falsehood. But a closer examination shows that such a legacy is debatable and should take into account the way in which these modalities proceeded. We argue that, while MacColl devised a modal logic in the broad sense of the word, he did not give rise to a many-valued logic in the strict sense. Rather, his logic is (...) similar to a “non-Fregean logic”: an algebraic logic that partitions the semantic classes of truth and falsehood into subclasses but does not extend the range of truth-values. (shrink)

In this paper we consider the class of truth-functional modal many-valued logics with the complete lattice of truth-values. The conjunction and disjunction logic operators correspond to the meet and join operators of the lattices, while the negation is independently introduced as a hierarchy of antitonic operators which invert bottom and top elements. The non-constructive logic implication will be defined for a subclass of modular lattices, while the constructive implication for distributive lattices (Heyting algebras) is based on relative pseudo-complements as in (...) intuitionistic logic. We show that the complete lattices are intrinsically modal, with banal identity modal operator. We define the autoreferential set-based representation for the class of modal algebras, and show that the autoreferential Kripke-style semantics for this class of modal algebras is based on the set of possible worlds equal to the complete lattice of algebraic truth-values. The philosophical assumption is based on the consideration that each possible world represents a level of credibility, so that only propositions with the right logic value (i.e., level of credibility) can be accepted by this world, then we connect it with paraconsistent properties and LFI logics. The bottom truth value in this complete lattice corresponds to the trivial world in which each formula is satisfied, that is, to the world with explosive inconsistency. The top truth value corresponds to the world with classical logics, while all intermediate possible worlds represent the different levels of paraconsistent logics. (shrink)

I argue that a compulsive seeking for just one sense of consistency is hazardous to rationality, and that observing the subtle distinctions of reasonableness between individual and groups may suggest wider, structuralistic notions of consistency, even relevant to re-assessing Gödei's Second Incompleteness Theorem and to science as a whole.

This paper is dedicated to extending and adapting to modal logic the approach of fractional semantics to classical logic. This is a multi-valued semantics governed by pure proof-theoretic considerations, whose truth-values are the rational numbers in the closed interval $[0,1]$. Focusing on the modal logic K, the proposed methodology relies on three key components: bilateral sequent calculus, invertibility of the logical rules, and stability (proof-invariance). We show that our semantic analysis of K affords an informational refinement with respect to the (...) standard Kripkean semantics (a new proof of Dugundji’s theorem is a case in point) and it raises the prospect of a proof-theoretic semantics for modal logic. (shrink)

Trying to overcome Dugundji’s result on uncharacterisability of modal logics by finite logical matrices, Kearns and Ivlev proposed, independently, a characterisation of some modal systems by means of four-valued multivalued truth-functions , as an alternative to Kripke semantics. This constitutes an antecedent of the non-deterministic matrices introduced by Avron and Lev . In this paper we propose a reconstruction of Kearns’s and Ivlev’s results in a uniform way, obtaining an extension to another modal systems. The first part of the paper (...) is devoted to four-valued Nmatrices, including Kearns’s and Ivlev’s. Besides proving with full details Kearns’s results for T, S4 and S5, we also obtain a characterisation of the system B by four-valued Nmatrices with level valuations. Concerning Ivlev’s results, two new modal systems are introduced and char.. (shrink)

In 1940 Dugundji proved that no system between S1 and S5 can be characterized by finite matrices. Dugundji’s result forced the development of alternative semantics, in particular Kripke’s relational semantics. The success of this semantics allowed the creation of a huge family of modal systems. With few adaptations, this semantics can characterize almost the totality of the modal systems developed in the last five decades. This semantics however has some limits. Two results of incompleteness showed that not every modal logic (...) can be characterized by Kripke frames. Besides, the creation of non-classical modal logics puts the problem of characterization of finite matrices very far away from the original scope of Dugundji’s result. In this sense, we will show how to update Dugundji’s result in order to make precise the scope and the limits of many-valued matrices as semantic of modal systems. A brief comparison with the useful Chagrov and Zakharyaschev’s criterion of tabularity for modal logics is provided. (shrink)

Neste artigo, discutimos em que sentido a verdade é considerada como um objeto matemático na lógica proposicional. Depois de esclarecer como este conceito é usado na lógica clássica, através das noções de tabela de verdade, de função de verdade, de bivaloração, examinamos algumas generalizações desse conceito nas lógicas não clássicas: semânticas matriciais multi-valoradas com três ou quatro valores, semântica bivalente não veritativa, semânticas dos mundos possiveis de Kripke. DOI:10.5007/1808-1711.2010v14n1p31.

This book explores the interplay between logic and science, describing new trends, new issues and potential research developments.

Dugundji proved in 1940 that most parts of standard modal systems cannot be characterized by a single finite deterministic matrix. In the eighties, Ivlev proposed a semantics of four-valued non-deterministic matrices, in order to characterize a hierarchy of weak modal logics without the necessitation rule. In a previous paper, we extended some systems of Ivlev’s hierarchy, also proposing weaker six-valued systems in which the axiom was replaced by the deontic axiom. In this paper, we propose even weaker systems, by eliminating (...) both axioms, which are characterized by eight-valued non-deterministic matrices. In addition, we prove completeness for those new systems. It is natural to ask if a characterization by finite ordinary logical matrices would be possible for all those Ivlev-like systems. We will show that finite deterministic matrices do not characterize any of them. (shrink)

An algebraic type of structure is shown forth which is such that if it is a characteristic matrix for a logic, then that logic satisfies Meyer's weak variable sharing property. As a corollary, it is shown that RM and all its odd-valued extensions \(\mathbf{RM}_{2n\mathord{-}1}\) satisfy the weak variable sharing property. It is also shown that a proof to the effect that the "fuzzy" version of the relevant logic R satisfies the property is incorrect.

A 4-valued framework is proposed to distinguish intuitionistically valid formulas within classical validities.

We assemble material from the literature on matrix methodology for sentential logic—without claiming to present any new logical results—in order to show that Gödel once made (or at least, is quoted as having made) an uncharacteristically ill-considered remark in this area.

The aim of this paper is to give the first steps towards the formal study of swap structures, which are non-deterministic matrices (Nmatrices) defined over tuples of 0–1 truth values generalizing the notion of twist structures. To do this, a precise notion of clauses which axiomatize bivaluation semantics is proposed. From this specification, a swap structure is naturally induced. This formalization allows to define the combination by fibring of two given logics described by swap structures generated by clauses in a (...) very simple way, by gathering together the formal specifications of both swap structures. We provide simple sufficient conditions to guarantee the preservation by fibring of soundness and completeness w.r.t. Hilbert calculi naturally defined from the clauses, as well as to prove that the fibring is a conservative expansion of both logics. As application examples of this technique, the combination by fibring of some non-normal Ivlev-like modal logics with paraconsistent logics in the class of logics of formal inconsistency (LFIs) are obtained, producing so several paraconsistent modal logics, each of them decidable by a single 6-valued Nmatrix. As expected, the fibring (union) of the respective Hilbert calculi provides a sound and complete axiomatization of the combined logics. More than this, the fibring is the least conservative expansion of the given logics. This technique opens interesting perspectives for combining logics characterized by finite Nmatrices represented by swap structures. (shrink)

In a previous article we introduced the concept of restricted Nmatrices (in short, RNmatrices), which generalize non-deterministic (in short, Nmatrices) in the following sense: a RNmatrix is a Nmatrix together with a subset of valuations over it, from which the consequence relation is defined. Within this semantical framework we have characterized each paraconsistent logic Cn in the hierarchy of da Costa by means of a (n+2)-valued RNmatrix, which also provides a relatively simple decision procedure for each calculus (recalling that C1 (...) cannot be characterized by a single finite Nmatrix). In this paper we extend such RNmatrices for Cn by means of what we call restricted swap-structures over arbitrary Boolean algebras, obtaining so a class of non-deterministic semantical structures which characterizes da Costa's systems. We give a brief algebraic and combinatorial description of the elements of the underlying RNmatrices. Finally, by presenting a notion of category of RNmatrices, we show that the category of RNmatrices for Cn is in fact isomorphic to the category of non-trivial Boolean algebras. (shrink)