Given a 1-ary sentence operator , we describe L - another 1-ary operator - as as a left inverse of in a given logic if in that logic every formula is provably equivalent to L. Similarly R is a right inverse of if is always provably equivalent to R. We investigate the behaviour of left and right inverses for taken as the operator of various normal modal logics, paying particular attention to the conditions under which these logics are conservatively extended (...) by the addition of such inverses, as well as to the question of when, in such extensions, the inverses behave as normal modal operators in their own right. (shrink)

We investigate, for several modal logics but concentrating on KT, KD45, S4 and S5, the set of formulas B for which ${\square B}$ is provably equivalent to ${\square A}$ for a selected formula A (such as p, a sentence letter). In the exceptional case in which a modal logic is closed under the (‘cancellation’) rule taking us from ${\square C \leftrightarrow \square D}$ to ${C \leftrightarrow D}$ , there is only one formula B, to within equivalence, in this inverse image, (...) as we shall call it, of ${\square A}$ (relative to the logic concerned); for logics for which the intended reading of “ ${\square}$ ” is epistemic or doxastic, failure to be closed under this rule indicates that from the proposition expressed by a knowledge- or belief-attribution, the propositional object of the attitude in question cannot be recovered: arguably, a somewhat disconcerting situation. More generally, the inverse image of ${\square A}$ may comprise a range of non-equivalent formulas, all those provably implied by one fixed formula and provably implying another—though we shall see that for several choices of logic and of the formula A, there is not even such an ‘interval characterization’ of the inverse image (of ${\square A}$ ) to be found. (shrink)

This discussion explores the possibility of distinguishing a tighter notion of contrariety evident in the Square of Opposition, especially in its modal incarnations, than as that binary relation holding statements that cannot both be true, with or without the added rider ‘though can both be false’. More than one theorist has voiced the intuition that the paradigmatic contraries of the traditional Square are related in some such tighter way—involving the specific role played by negation in contrasting them—that distinguishes them from (...) other pairs of incompatible statements constructed from the same conceptual materials. Prominent among examples, these other nonstandard pairs are the ‘new contraries’ presented by Robert Blanché’s hexagon(s) of opposition. With special, though not exclusive, attention to these cases, we investigate whether contrariety in the distinguished sense can be captured by adding to the incompatibility condition the further demand that the pair of statements concerned can be represented as the results of applying some sentence operator to the content in its scope, for one of the pair, and, for the other, the application of that same operator to the negation of that content. For one of the two cases, a Blanché case, of nonstandard contrariety singled out for attention, the question of whether such a representation is available is settled at the end of Section 4, and then in a more satisfying way in Section 5, though for the other case, noticed by Peter Simons, the question remains open, after some tentative discussion in one subsection, 6.2, of an Appendix (Section 6). (shrink)

Sections 1 and 2 respectively raise and settle the question of whether, if an affirmative modality collapses (reduces to the null modality, that is) in a normal modal logic, then all modalities of the same length collapse in that logic, while Section 3 considers some special cases of an analogous phenomenon for congruential modal logics, closing with a general question about collapsing modalities in this broader range of logics.

The Knowability Paradox purports to show that the controversial but not patently absurd hypothesis that all truths are knowable entails the implausible conclusion that all truths are known. The notoriety of this argument owes to the negative light it appears to cast on the view that there can be no verification-transcendent truths. We argue that it is overly simplistic to formalize the views of contemporary verificationists like Dummett, Prawitz or Martin-Löf using the sort of propositional modal operators which are employed (...) in the original derivation of the Paradox. Instead we propose that the central tenet of verificationism is most accurately formulated as follows: if φ is true, then there exists a proof of φ Building on the work of Artemov (Bull Symb Log 7(1): 1-36, 2001), a system of explicit modal logic with proof quantifiers is introduced to reason about such statements. When the original reasoning of the Paradox is developed in this setting, we reach not a contradiction, but rather the conclusion that there must exist non-constructed proofs. This outcome is evaluated relative to the controversy between Dummett and Prawitz about proof existence and bivalence. (shrink)

The relevance of any logical analysis lies in its ability to solve paradoxes and trace conceptual troubles back; with this respect, the task of epistemic logic is to handle paradoxes in connection with the concept of knowledge. Epistemic logic is currently introduced as the logical analysis of crucial concepts within epistemology, namely: knowledge, belief, truth, and justification. An alternative approach will be advanced here in order to enlighten such a discourse, as centred upon the word assertion and displayed in terms (...) of utterance. Insofar as epistemic modalities express some attitudes, the intentionality of discourse will be emphasized within an illocutionary modal logic. Two large views will range over the whole study: declarative and epistemic sentences have one and the same logic (assertion logic); the plurality of languages games doesn’t entail any logical pluralism. -/- La valeur d'une analyse logique réside dans sa capacité à résoudre des paradoxes et à comprendre l'origine de nos problèmes conceptuels ; à ce titre, le rôle d'une logique épistémique est de traiter des paradoxes liés au concept de connaissance. On présente généralement la logique épistémique comme une analyse logique de concepts centraux en épistémologie : connaissance, croyance, vérité, justification. Une autre approche sera proposée ici en vue de clarifier ce genre de discours, centrée sur la notion d'assertion et décrite en termes d'énonciation. Parce que les modalités épistémiques expriment des attitudes, c'est l'intentionnalité du discours qui sera mise en valeur dans le cadre d'une logique modale illocutoire. Deux thèses transversales parcourront l'ensemble du travail : les énoncés déclaratifs et épistémiques partagent la même logique (logique assertorique) ; la pluralité des jeux de langages n'implique pas un pluralisme logique. (shrink)