The aim of this article is to discuss the extent to which certain substructural logics are related through the phenomenon of duality. Roughly speaking, metainferences are inferences between collect...

The aim of this article is to study the notion of derivability and its semantic counterpart in the context of non-transitive and non-reflexive substructural logics. For this purpose we focus on the study cases of the logics _S__T_ and _T__S_. In this respect, we show that this notion doesn’t coincide, in general, with a nowadays broadly used semantic approach towards metainferential validity: the notion of local validity. Following this, and building on some previous work by Humberstone, we prove that in (...) these systems derivability can be characterized in terms of a notion we call absolute global validity. However, arriving at these results doesn’t lead us to disregard local validity. First, because we discuss the conditions under which local, and also global validity, can be expected to coincide with derivability. Secondly, because we show how taking into account certain families of valuations can be useful to describe derivability for different calculi used to present _S__T_ and _T__S_. (shrink)

In this paper, I present two presumed alternative definitions of metavalidity for metainferences: Local and Global. I defend the latter, first, by arguing that it is not too weak with respect to metainference-cases, and that local metavalidity is in fact too strong with respect to types. Second, I show that although regarding metainference-schemas Local metavalidity is always stable, Global metavalidity is also stable when the language satisfies reasonable expressibility criteria.

In this article, our aim is to take a step towards a full understanding of the notion of paraconsistency in the context of metainferential logics. Following the work initiated by Barrio et al. [2018], we will consider a metainferential logic to be paraconsistent whenever the metainferential version of Explosion is invalid. However, our contribution consists in modifying the definition of meta-Explosion by extending the standard framework and introducing a negation for inferences and metainferences. From this new perspective, Tarskian paraconsistent logics (...) such as LP will not turn out to be metainferentially paraconsistent, in contrast to, for instance, non-transitive logics like ST. Finally, we will end up by defining a logic which is metainferentially paraconsistent at every level, and discussing whether this logic is uniform through translations. (shrink)

Most literature on vagueness deals with the phenomenon as applied to predicates. On the contrary, even the idea of vague connectives seems to be taken as an oxymoron. The goal of this article is to propose an understanding of vague logical connectives based on vague quantifiers. The main idea is that the phenomenon of vagueness translates to connectives in terms of the property of Abnormality. I also argue that Prior’s Tonk can, according to this approach, be considered a vague connective. (...) In order to do so, I provide a sound and complete interpretation for it, based on Strict-Tolerant semantics, in which Tonk has a non-normal truth-table. (shrink)

Thought: A Journal of Philosophy, EarlyView.

Cook (forthcoming) presents a paradox which he says is not circular. I see no reasons to doubt the non-circularity claim, but I do have some concerns regarding its paradoxicality. My point will be that his proposal succeeds in offering a formalization, but fails in providing a formal paradox, at least of the same type and strength as the Liar. Cook (en prensa) presenta una paradoja que según él no es circular. No veo motivos para cuestionar la pretensión de no circularidad, (...) pero sí me resulta algo problemática la cuestión de su paradojicidad. El punto que intentaré defender será que la propuesta de Cook es exitosa en ofrecer una formalización, pero fracasa en proveer una paradoja formal, al menos del mismo tipo y fuerza que el mentiroso. (shrink)

In this paper we present two new approaches for dealing with semantic paradoxes and soritical predicates based on fuzzy logic. We show that both of them have conceptual advantages over the more traditional Łukasiewicz approach, and that the second one even avoids standard proofs of ω-nconsistency.

In this paper, we present a simple overview of the main non classical logics proposed for dealing with the Sorites paradox, that is, weakly paracomplete logics, weakly paraconsistent, and type 1 fuzzy logics. We note some of their advantages and problems and we suggest that the problems can be at least partially overcome by adopting a solution which relies on interval based type 2 fuzzy logics.

Adopting a non-classical logic may not imply resigning the classical theories that have proven their worth. Nevertheless, the project of classical recapture poses some challenges, some of them specific to paraconsistent approaches. In this article, we analyse the consequences of introducing a recovery operator to subvaluationist logic. We argue that the classical recovery can indeed be carried out in a subvaluationist setting, but that doing so amounts to committing to a hierarchy of recaptures.