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.

This paper provides an inferentialist motivation for a logic belonging in the connexive family, by borrowing elements from the bilateralist interpretation for Classical Logic without the Cut rule, proposed by David Ripley. The paper focuses on the relation between inferentialism and relevance, through the exploration of what we call relevant assertion and denial, showing that a connexive system emerges as a symptom of this interesting link. With the present attempt we hope to broaden the available interpretations for connexive logics, showing (...) they can be rightfully motivated in terms of certain relevantist constraints imposed on assertion and denial. (shrink)

In this paper, we evaluate Button’s claim that knot is a nasty connective. Knot’s nastiness is due to the fact that, when one extends the set \ with knot, the connective provides counterexamples to a number of classically valid operational rules in a sequent calculus proof system. We show that just as going non-transitive diminishes tonk’s nastiness, knot’s nastiness can also be reduced by dropping Reflexivity, a different structural rule. Since doing so restores all other rules in the system as (...) validity-preserving, we are inclined to conclude that there, knot is not that nasty. However, since motivating non-reflexivity is harder than motivating non-transitivity, we also acknowledge that disagreement with our conclusion is possible. (shrink)

ABSTRACTWe will present 12 different mixed metainferential consequence relations. Each one of them is specified using two different inferential Tarskian or non-Tarskian consequence relations: or. We will show that it is possible to obtain a Tarskian logic with non-Tarskian inferential logics, but also a non-Tarskian logic with Tarskian inferential logics. Moreover, we will show how some of these metainferential logics work better than the corresponding inferential rivals. Finally, we will show how these logics prove that it is not enough to (...) work with inferences as pairs of sets of formulas to obtain a contractive logic. (shrink)

I show that it is not possible to uniquely characterize classical logic when working within classical set theory. By building on recent work by Eduardo Barrio, Federico Pailos, and Damian Szmuc, I show that for every inferential level (finite and transfinite), either classical logic is not unique at that level or there exist intuitively valid inferences of that level that are not definable in modern classical set theory. The classical logician is thereby faced with a three-horned dilemma: Give up uniqueness (...) but preserve characterizability, give up characterizability and preserve uniqueness, or (potentially) preserve both but give up modern classical set theory. After proving the main result, I briefly explore this third option by developing an account of classical logic within a paraconsistent set theory. This account of classical logic ensures unique characterizability in some sense, but the non-classical set theory also produces highly non-classical meta-results about classical logic. (shrink)

The use of models to assign truth values to sentences and to counterexemplify invalid inferences is a basic feature of model theory. Yet sentences and inferences are not the only phenomena that model theory has to take care of. In particular, the development of sequent calculi raises the question of how metainferences are to be accounted for from a model-theoretic perspective. Unfortunately there is no agreement on this matter. Rather, one can find in the literature two competing model-theoretic notions of (...) metainferential validity, known as the ‘global’ notion and the ‘local’ notion. In this article, I argue that, given certain plausible considerations about metainferential validity, the global notion collapses into the local notion. (shrink)

I explore, from a proof-theoretic perspective, the hierarchy of classical and paraconsistent logics introduced by Barrio, Pailos and Szmuc in (Journal o f Philosophical Logic,49, 93-120, 2021). First, I provide sequent rules and axioms for all the logics in the hierarchy, for all inferential levels, and establish soundness and completeness results. Second, I show how to extend those systems with a corresponding hierarchy of validity predicates, each one of which is meant to capture “validity” at a different inferential level. Then, (...) I point out two potential philosophical implications of these results. (i) Since the logics in the hierarchy differ from one another on the rules, I argue that each such logic maintains its own distinct identity (contrary to arguments like the one given by Dicher and Paoli in 2019). (ii) Each validity predicate need not capture “validity” at more than one metainferential level. Hence, there are reasons to deny the thesis (put forward in Barrio, E., Rosenblatt, L. & Tajer, D. (Synthese, 2016)) that the validity predicate introduced in by Beall and Murzi in (Journal o f Philosophy,110(3), 143–165, 2013) has to express facts not only about what follows from what, but also about the metarules, etc. (shrink)

Against the backdrop of the frequent comparison of theories of truth in the literature on semantic paradoxes with regard to which inferences and metainferences are deemed valid, this paper develops a novel approach to defining a binary predicate for representing the valid inferences and metainferences of a theory within the theory itself under the assumption that the theory is defined with a classical meta-theory. The aim with the approach is to obtain a tool which facilitates the comparison between a theory (...) and its competitors within the theory itself, thereby expressing the disagreement between the theories within the theories. After discussing what we can and should require of an object-linguistic representation of a theory for that purpose, this paper proposes to restrict the representation of valid metainferences to locally valid metainferences, a requirement which turns out to be \-consistent and conservative over classical first-order arithmetic. This approach is then applied to four theories definable on strong Kleene models using a labelled nested sequent calculus. (shrink)

In the original publication of the article, in Definition 4, the sixth line which reads as.

On a bilateralist reading, sequents are interpreted as statements to the effect that, given the assertion of the antecedent it is incoherent to deny the succedent. This interpretation goes against its own ecumenical ambitions, endowing Cut with a meaning very close to that of tertium non datur and thus rendering it intuitionistically unpalatable. This paper explores a top-down route for arguing that, even intuitionistically, a prohibition to deny is as strong as a licence to assert.

In recent years, some theorists have argued that the clogics are not only defined by their inferences, but also by their metainferences. In this sense, logics that coincide in their inferences, but not in their metainferences were considered to be different. In this vein, some metainferential logics have been developed, as logics with metainferences of any level, built as hierarchies over known logics, such as \, and \. What is distinctive of these metainferential logics is that they are mixed, i.e. (...) the standard for the premises and the conclusion is not necessarily the same. However, so far, all of these systems have been presented following a semantical standpoint, in terms of valuations based on the Strong Kleene truth-tables. In this article, we provide sound and complete sequent-calculi for the valid inferences and the invalid inferences of the logics \ and \, and introduce an algorithm that allows obtaining sound and complete sequent-calculi for the global validities and the global invalidities of any metainferential logic of any level. (shrink)

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)

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...

This article is concerned with an exploration of a family of systems—called immune logics—that arise from certain dualizations of the well-known family of infectious logics. The distinctive feature of the semantic of infectious logics is the presence of a certain “infectious” semantic value, by which two different though equivalent things are meant. On the one hand, it is meant that these values are zero elements for all the operations in the underlying algebraic structure. On the other hand, it is meant (...) that these values behave in a value-in-value-out fashion for all the operations in the underlying algebraic structure. Thus, in a rather informal manner, we will refer to immune logics as those systems whose underlying semantics count with a certain “immune” semantic value behaving in a way that is somewhat dual to that of the infectious values. In a more formal manner, carrying out this dualization will prove to be not as straightforward as one could imagine, since the two characterizations of infectiousness discussed above lead to two different outcomes when one tries to conduct them. We explore these alternatives and provide technical results regarding them, and the various logical systems defined using such semantics. (shrink)

In a recent paper, Barrio, Tajer and Rosenblatt establish a correspondence between metainferences holding in the strict-tolerant logic of transparent truth ST+ and inferences holding in the logic of paradox LP+. They argue that LP+ is ST+’s external logic and they question whether ST+’s solution to the semantic paradoxes is fundamentally different from LP+’s. Here we establish that by parity of reasoning, ST+ can be related to LP+’s dual logic K3+. We clarify the distinction between internal and external logic and (...) argue that while ST+’s nonclassicality can be granted, its self-dual character does not tie it to LP+ more closely than to K3+. (shrink)

Substructural approaches to paradoxes have attracted much attention from the philosophical community in the last decade. In this paper we focus on two substructural logics, named ST and TS, along with two structural cousins, LP and K3. It is well known that LP and K3 are duals in the sense that an inference is valid in one logic just in case the contrapositive is valid in the other logic. As a consequence of this duality, theories based on either logic are (...) tightly connected since many of the arguments for and objections against one theory reappear in the other theory in dual form. The target of the paper is making explicit in exactly what way, if any, ST and TS are dual to one another. The connection will allow us to gain a more fine-grained understanding of these logics and of the theories based on them. In particular, we will obtain new insights on two questions concerning ST which are being intensively discussed in the current literature: whether ST preserves classical logic and whether it is LP in sheep’s clothing. Explaining in what way ST and TS are duals requires comparing these logics at a metainferential level. We provide to this end a uniform proof theory to decide on valid metainferences for each of the four logics. This proof procedure allows us to show in a very simple way how different properties of inferences (unsatisfiability, supersatisfiability and antivalidity) that behave in very different ways for each logic can be captured in terms of the validity of a metainference. (shrink)

The main idea that we want to defend in this paper is that the question of what a logic is should be addressed differently when structural properties enter the game. In particular, we want to support the idea according to which it is not enough to identify the set of valid inferences to characterize a logic. In other words, we will argue that two logical theories could identify the same set of validities, but not be the same logic.

It is widely accepted that classical logic is trivialized in the presence of a transparent truth-predicate. In this paper, we will explain why this point of view must be given up. The hierarchy of metainferential logics defined in Barrio et al. and Pailos recovers classical logic, either in the sense that every classical inferential validity is valid at some point in the hierarchy ), or because a logic of a transfinite level defined in terms of the hierarchy shares its validities (...) with classical logic. Each of these logics is consistent with transparent truth—as is shown in Pailos —, and this suggests that, contrary to standard opinions, transparent truth is after all consistent with classical logic. However, Scambler presents a major challenge to this approach. He argues that this hierarchy cannot be identified with classical logic in any way, because it recovers no classical antivalidities. We embrace Scambler’s challenge and develop a new logic based on these hierarchies. This logic recovers both every classical validity and every classical antivalidity. Moreover, we will follow the same strategy and show that contingencies need also be taken into account, and that none of the logics so far presented is enough to capture classical contingencies. Then, we will develop a multi-standard approach to elaborate a new logic that captures not only every classical validity, but also every classical antivalidity and contingency. As a€truth-predicate can be added to this logic, this result can be interpreted as showing that, despite the claims that are extremely widely accepted, classical logic does not trivialize in the context of transparent truth. (shrink)

When discussing Logical Pluralism several critics argue that such an open-minded position is untenable. The key to this conclusion is that, given a number of widely accepted assumptions, the pluralist view collapses into Logical Monism. In this paper we show that the arguments usually employed to arrive at this conclusion do not work. The main reason for this is the existence of certain substructural logics which have the same set of valid inferences as Classical Logic—although they are, in a clear (...) sense, non-identical to it. We argue that this phenomenon can be generalized, given the existence of logics which coincide with Classical Logic regarding a number of metainferential levels—although they are, again, clearly different systems. We claim this highlights the need to arrive at a more refined version of the Collapse Argument, which we discuss at the end of the paper. (shrink)

In this paper we discuss the extent to which the very existence of substructural logics puts the Tarskian conception of logical systems in jeopardy. In order to do this, we highlight the importance of the presence of different levels of entailment in a given logic, looking not only at inferences between collections of formulae but also at inferences between collections of inferences—and more. We discuss appropriate refinements or modifications of the usual Tarskian identity criterion for logical systems, and propose an (...) alternative of our own. After that, we consider a number of objections to our account and evaluate a substantially different approach to the same problem. (shrink)

Anti-exceptionalism about logic states that logical theories have no special epistemological status. Such theories are continuous with scientific theories. Contemporary anti-exceptionalists include the semantic paradoxes as a part of the elements to accept a logical theory. Exploring the Buenos Aires Plan, the recent development of the metainferential hierarchy of ST\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbf {ST}}$$\end{document}-logics shows that there are multiple options to deal with such paradoxes. There is a whole ST\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} (...) \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbf {ST}}$$\end{document}-based hierarchy, of which LP\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbf {LP}}$$\end{document} and ST\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbf {ST}}$$\end{document} themselves are only the first steps. This means that the logics in this hierarchy are also options to analyze the inferential patterns allowed in a language that contains its own truth predicate. This paper explores these responses analyzing some reasons to go beyond the first steps. We show that LP\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbf {LP}}$$\end{document}, ST\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbf {ST}}$$\end{document} and the logics of the ST\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbf {ST}}$$\end{document}-hierarchy offer different diagnoses for the same evidence: the inferences and metainferences the agents endorse in the presence of the truth-predicate. But even if the data are not enough to adopt one of these logics, there are other elements to evaluate the revision of classical logic. Which is the best explanation for the logical principles to deal with semantic paradoxes? How close should we be to classical logic? And mainly, how could a logic obey the validities it contains? From an anti-exceptionalist perspective, we argue that ST\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbf {ST}}$$\end{document}-metainferential logics in general—and STTω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbf {STT}}_{\omega }$$\end{document} in particular—are the best available options to explain the inferential principles involved with the notion of truth. (shrink)

In some recent articles, Cobreros, Egré, Ripley, & van Rooij have defended the idea that abandoning transitivity may lead to a solution to the trouble caused by semantic paradoxes. For that purpose, they develop the Strict-Tolerant approach, which leads them to entertain a nontransitive theory of truth, where the structural rule of Cut is not generally valid. However, that Cut fails in general in the target theory of truth does not mean that there are not certain safe instances of Cut (...) involving semantic notions. In this article we intend to meet the challenge of answering how to regain all the safe instances of Cut, in the language of the theory, making essential use of a unary recovery operator. To fulfill this goal, we will work within the so-called Goodship Project, which suggests that in order to have nontrivial naïve theories it is sufficient to formulate the corresponding self-referential sentences with suitable biconditionals. Nevertheless, a secondary aim of this article is to propose a novel way to carry this project out, showing that the biconditionals in question can be totally classical. In the context of this article, these biconditionals will be essentially used in expressing the self-referential sentences and, thus, as a collateral result of our work we will prove that none of the recoveries expected of the target theory can be nontrivially achieved if self-reference is expressed through identities. (shrink)

For semantic inferentialists, the basic semantic concept is validity. An inferentialist theory of meaning should offer an account of the meaning of "valid." If one tries to add a validity predicate to one's object language, however, one runs into problems like the v-Curry paradox. In previous work, I presented a validity predicate for a non-transitive logic that can adequately capture its own meta-inferences. Unfortunately, in that system, one cannot show of any inference that it is invalid. Here I extend the (...) system so that it can capture invalidities. (shrink)