In this paper, we present a way to translate the metainferences of a mixed metainferential system into formulae of an extended-language system, called its associated σ-system. To do this, the σ-system will contain new operators (one for each standard), called the σ operators, which represent the notions of "belonging to a (given) standard". We first prove, in a model-theoretic way, that these translations preserve (in)validity. That is, that a metainference is valid in the base system if and only if its (...) translation is a tautology of its corresponding σ-system. We then use these results to obtain other key advantages. Most interestingly, we provide a recipe for building unlabeled sequent calculi for σ-systems. We then exemplify this with a σ-system useful for logics of the ST family, and prove soundness and completeness for it, which indirectly gives us a calculus for the metainferences of all those mixed systems. Finally, we respond to some possible objections and show how our σ-framework can shed light on the “obeying” discussion within mixed metainferential contexts. (shrink)

En este trabajo presentaré una forma de evitar los problemas más recurrentes en cierta versión del pluralismo lógico, aquella que defiende que incluso considerando un lenguaje fijo existen múltiples sistemas lógicos legítimos. Para ello, será necesario considerar los puntos de partida del programa pluralista y explicitar los problemas que de ellos surgen, principalmente el Desafío de Quine y el Problema del Colapso. Luego, propondré una modificación respecto de lo que se entiende por consecuencia lógica, para poder considerar una familia de (...) sistemas lógicos, las lógicas mixtas, que abarcan tanto a las lógicas puras como a las impuras. Finalmente, mostraré que con una interpretación razonable del formalismo se puede eludir aquellos problemas a la vez que se respeta el espíritu del programa pluralista. (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)

Logical pluralism is the view that there is more than one correct logic. Most logical pluralists think that logic is normative in the sense that you make a mistake if you accept the premisses of a valid argument but reject its conclusion. Some authors have argued that this combination is self-undermining: Suppose that L1 and L2 are correct logics that coincide except for the argument from Γ to φ, which is valid in L1 but invalid in L2. If you accept (...) all sentences in Γ, then, by normativity, you make a mistake if you reject φ. In order to avoid mistakes, you should accept φ or suspend judgment about φ. Both options are problematic for pluralism. Can pluralists avoid this worry by rejecting the normativity of logic? I argue that they cannot. All else being equal, the argument goes through even if logic is not normative. (shrink)

In this article, we will present a number of technical results concerning Classical Logic, ST and related systems. Our main contribution consists in offering a novel identity criterion for logics in general and, therefore, for Classical Logic. In particular, we will firstly generalize the ST phenomenon, thereby obtaining a recursively defined hierarchy of strict-tolerant systems. Secondly, we will prove that the logics in this hierarchy are progressively more classical, although not entirely classical. We will claim that a logic is to (...) be identified with an infinite sequence of consequence relations holding between increasingly complex relata: formulae, inferences, metainferences, and so on. As a result, the present proposal allows not only to differentiate Classical Logic from ST, but also from other systems sharing with it their valid metainferences. Finally, we show how these results have interesting consequences for some topics in the philosophical logic literature, among them for the debate around Logical Pluralism. The reason being that the discussion concerning this topic is usually carried out employing a rivalry criterion for logics that will need to be modified in light of the present investigation, according to which two logics can be non-identical even if they share the same valid inferences. (shrink)

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)

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)

_T__S_ is a logic that has no valid inferences. But, could there be a logic without valid metainferences? We will introduce _T__S_ _ω_, a logic without metainferential validities. Notwithstanding, _T__S_ _ω_ is not as empty—i.e., uninformative—as it gets, because it has many antivalidities. We will later introduce the two-standard logic [_T__S_ _ω_, _S__T_ _ω_ ], a logic without validities and antivalidities. Nevertheless, [_T__S_ _ω_, _S__T_ _ω_ ] is still informative, because it has many contingencies. The three-standard logic [ \(\mathbf {TS}_{\omega (...) }, \mathbf {ST}_{\omega }, [{\overline {\emptyset }}{\emptyset }, {\emptyset } {\overline {\emptyset }}]\) ] that we will further introduce, has no validities, no antivalidities and also no contingencies whatsoever. We will also present two more validity-empty logics. The first one has no supersatisfiabilities, unsatisfabilities and antivalidities ∗. The second one has no invalidities nor non-valid-nor-invalid (meta)inferences. All these considerations justify thinking of logics as, at least, three-standard entities, corresponding, respectively, to what someone who takes that logic as correct, accepts, rejects and suspends judgement about, just because those things are, respectively, validities, antivalidities and contingencies of that logic. Finally, we will present some consequences of this setting for the monism/pluralism/nihilism debate, and show how nihilism and monism, on one hand, and nihilism and pluralism, on the other hand, may reconcile—at least according to how Gillian Russell understands nihilism, and provide some general reasons for adopting a multi-standard approach to logics. (shrink)

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)

Logical nihilism is the view that the relation of logical consequence is empty: there are counterexamples to any putative logical law. In this paper, I argue that the nihilist threat is illusory. The nihilistic arguments do not work. Moreover, the entire project is based on a misguided interpretation of the generality of logic.