IntroductionCurry’s paradox is well known.See, e.g., Priest , ch. 6. It comes in both set theoretic and semantic versions. Here we will concentrate on the semantic versions. Historically, these have deployed the notion of truth. Those who wish to endorse an unrestricted T-schema have mainly endorsed a logic which rejects the principle of Absorption, \\models A\rightarrow B\). High profile logics of this kind are certain relevant logics; these have semantics which show how and why this principle is not valid. Of (...) more recent times, paradoxes which are clearly in the same family have been appearing; but these concern the notion of validity itself. The standard semantics of relevant logics seem powerless to address these. But they can. This note shows how. The upshot can be seen as a return to the roots of relevant logic, in a sense to become clear.BackgroundThe Usual Curry ParadoxesLet us start with a couple of standard forms of the paradox. I .. (shrink)

Certain instances of contraction are provable in Zardini’s system $\mathbf {IK}^\omega $ which causes triviality once a truth predicate and suitable fixed points are available.

Theories where truth is a naive concept fall under the following dilemma: either the theory is subject to Curry’s Paradox, which engenders triviality, or the theory is not trivial but the resulting conditional is too weak. In this paper we explore a number of theories which arguably do not fall under this dilemma. In these theories the conditional is characterized in terms of non-deterministic matrices. These non-deterministic theories are similar to infinitely-valued Łukasiewicz logic in that they are consistent and their (...) conditionals are quite strong. The difference is the following: while Łukasiewicz logic is \-inconsistent, the non-deterministic theories might turn out to be \-consistent. (shrink)

Although formal analysis provides us with interesting tools for treating Curry’s paradox, it certainly does not exhaust every possible reading of it. Thus, we suggest that this paradox should be analysed with non-formal tools coming from pragmatics. In this way, using Grice’s logic of conversation, we will see that Curry’s sentence can be reinterpreted as a peculiar conditional sentence implying its own consequent.

I show that the logic $\textsf {TJK}^{d+}$, one of the strongest logics currently known to support the naive theory of truth, is obtained from the Kripke semantics for constant domain intuitionistic logic by dropping the requirement that the accessibility relation is reflexive and only allowing reflexive worlds to serve as counterexamples to logical consequence. In addition, I provide a simplified natural deduction system for $\textsf {TJK}^{d+}$, in which a restricted form of conditional proof is used to establish conditionals.

This paper presents a range of new triviality proofs pertaining to naïve truth theory formulated in paraconsistent relevant logics. It is shown that excluded middle together with various permutation principles such as A → (B → C)⊩B → (A → C) trivialize naïve truth theory. The paper also provides some new triviality proofs which utilize the axioms ((A → B)∧ (B → C)) → (A → C) and (A → ¬A) → ¬A, the fusion connective and the Ackermann constant. An (...) overview over various ways to formulate Leibniz’s law in non-classical logics and two new triviality proofs for naïve set theory are also provided. (shrink)

Our main goal is to investigate whether the infinitary rules for the quantifiers endorsed by Elia Zardini in a recent paper are plausible. First, we will argue that they are problematic in several ways, especially due to their infinitary features. Secondly, we will show that even if these worries are somehow dealt with, there is another serious issue with them. They produce a truth-theoretic paradox that does not involve the structural rules of contraction.

A theory of truth is usually demanded to be consistent, but -consistency is less frequently requested. Recently, Yatabe has argued in favour of -inconsistent first-order theories of truth, minimising their odd consequences. In view of this fact, in this paper, we present five arguments against -inconsistent theories of truth. In order to bring out this point, we will focus on two very well-known -inconsistent theories of truth: the classical theory of symmetric truth FS and the non-classical theory of naïve truth (...) based on ᴌukasiewicz infinitely valued logic: PAᴌT. (shrink)

In this paper a logic for reasoning disquotationally about truth is presented and shown to have a standard model. This work improves on Hartry Field's recent results establishing consistency and omega-consistency of truth-theories with strong conditional logics. A novel method utilising the Banach fixed point theorem for contracting functions on complete metric spaces is invoked, and the resulting logic is shown to validate a number of principles which existing revision theoretic methods have heretofore failed to provide.