Logical Consequence and Entailment

In 2016 Beziau, introduce a more restricted concept of paraconsistency, namely the genuine paraconsistency. He calls genuine paraconsistent logic those logic rejecting φ, ¬φ |- ψ and |- ¬(φ ∧ ¬φ). In that paper the author analyzes, among the three-valued logics, which of these logics satisfy this property. If we consider multiple-conclusion consequence relations, the dual properties of those above mentioned are: |- φ, ¬φ, and ¬(ψ ∨ ¬ψ) |- . We call genuine paracomplete logics those rejecting the mentioned properties. (...) We present here an analysis of the three-valued genuine paracomplete logics. (shrink)

In 2016 Beziau, introduce a more restricted concept of paraconsistency, namely the genuine paraconsistency. He calls genuine paraconsistent logic those logic rejecting φ, ¬φ |- ψ and |- ¬(φ ∧ ¬φ). In that paper the author analyzes, among the three-valued logics, which of these logics satisfy this property. If we consider multiple-conclusion consequence relations, the dual properties of those above mentioned are |- φ, ¬φ and ¬(ψ ∨ ¬ψ) |-. We call genuine paracomplete logics those rejecting the mentioned properties. We (...) present here an analysis of the three-valued genuine paracomplete logics. (shrink)

Logical consequence is typically construed as a metalinguistic relation between sentences. Deflationism is an account of logic that challenges this orthodoxy. In Williamson’s recent presentation of deflationism, logic’s primary concern is with universal generalizations over absolutely everything. As well as an interesting account of logic in its own right, deflationism has also been recruited to decide between competing logics in resolving semantic paradoxes. This paper defends deflationism from its most important challenge to date, due to Ole Hjortland. It then presents (...) two new problems for the view. Hjortland’s objection is that deflationism cannot discriminate between distinct logics. I show that his example of classical logic and supervaluationism depends on equivocating about whether the language includes a “definitely” operator. Moreover, I prove a result that blocks this line of objection no matter the choice of logics. I end by criticizing deflationism on two fronts. First, it cannot do the work it has been recruited to perform. That is, it cannot help adjudicate between competing logics. This is because a theory of logic cannot be as easily separated from a theory of truth as its proponents claim. Second, deflationism currently has no adequate answer to the following challenge: what does a sentence’s universal generalization have to do with its logical truth? I argue that the most promising, stipulative response on behalf of the deflationist amounts to an unwarranted change of subject. (shrink)

Two different kinds of multiple-conclusion consequence relations taken from Shoesmith and Smiley and Galatos and Tsinakis or Nowak, called here disjunctive and conjunctive, respectively, defined on a formal language, are considered. They are transferred into a bounded lattice and a complete lattice, respectively. The properties of such abstract consequence relations are presented.

Logical consequence is typically construed as a metalinguistic relation between sentences. Deflationism is an account of logic that challenges this orthodoxy. In Williamson’s recent presentation of deflationism, logic’s primary concern is with universal generalizations over absolutely everything. As well as an interesting account of logic in its own right, deflationism has also been recruited to decide between competing logics in resolving semantic paradoxes. This paper defends deflationism from its most important challenge to date, due to Ole Hjortland. It then presents (...) two new problems for the view. Hjortland’s objection is that deflationism cannot discriminate between distinct logics. I show that his example of classical logic and supervaluationism depends on equivocating about whether the language includes a “definitely” operator. Moreover, I prove a result that blocks this line of objection no matter the choice of logics. I end by criticizing deflationism on two fronts. First, it cannot do the work it has been recruited to perform. That is, it cannot help adjudicate between competing logics. This is because a theory of logic cannot be as easily separated from a theory of truth as its proponents claim. Second, deflationism currently has no adequate answer to the following challenge: what does a sentence’s universal generalization have to do with its logical truth? I argue that the most promising, stipulative response on behalf of the deflationist amounts to an unwarranted change of subject. (shrink)

Two different kinds of multiple-conclusion consequence relations taken from Shoesmith and Smiley and Galatos and Tsinakis or Nowak, called here disjunctive and conjunctive, respectively, defined on a formal language, are considered. They are transferred into a bounded lattice and a complete lattice, respectively. The properties of such abstract consequence relations are presented.

This paper considers some issues to do with valuational presentations of consequence relations, and the Galois connections between spaces of valuations and spaces of consequence relations. Some of what we present is known, and some even well-known; but much is new. The aim is a systematic overview of a range of results applicable to nonreflexive and nontransitive logics, as well as more familiar logics. We conclude by considering some connectives suggested by this approach.

Suszko’s problem is the problem of finding the minimal number of truth values needed to semantically characterize a syntactic consequence relation. Suszko proved that every Tarskian consequence relation can be characterized using only two truth values. Malinowski showed that this number can equal three if some of Tarski’s structural constraints are relaxed. By so doing, Malinowski introduced a case of so-called mixed consequence, allowing the notion of a designated value to vary between the premises and the conclusions of an argument. (...) In this article we give a more systematic perspective on Suszko’s problem and on mixed consequence. First, we prove general representation theorems relating structural properties of a consequence relation to their semantic interpretation, uncovering the semantic counterpart of substitution-invariance, and establishing that mixed consequence is fundamentally the semantic counterpart of the structural property of monotonicity. We use those theorems to derive maximum-rank results proved recently in a different setting by French and Ripley, as well as by Blasio, Marcos, and Wansing, for logics with various structural properties. We strengthen these results into exact rank results for nonpermeable logics. We discuss the underlying notion of rank, and the associated reduction proposed independently by Scott and Suszko. As emphasized by Suszko, that reduction fails to preserve compositionality in general, meaning that the resulting semantics is no longer truth-functional. We propose a modification of that notion of reduction, allowing us to prove that over compact logics with what we call regular connectives, rank results are maintained even if we request the preservation of truth-functionality and additional semantic properties. (shrink)

The book discusses the central notion of logic: the concept of logical consequence. It shows that the classical definition of consequence as truth preservation in all models must be restricted to all admissible models. The challenge for the philosophy of logic is therefore to supplement the definition with a criterion for admissible models. -/- The problem of logical constants, so prominent in the current debate, constitutes but a special case of this much more general demarcation problem. The book explores the (...) various dimensions of the problem of admissible models and argues that standard responses are unwarranted. As a result, it develops a new vision of logic, suggesting in particular that logic is deeply imbued with metaphysics. (shrink)

Shapiro argues that, if we are deflationists about truth, we should be deflationists about logical consequence. Like the truth predicate, he claims, the logical consequence predicate is merely a device of generalisation and more substantial characterisation, e.g. proof- or model-theoretic, is mistaken. I reject his analogy between truth and logical consequence and argue that, by appreciating how the logical consequence predicate is used as well as the goals of proof theory and model theory, we can be deflationists about truth but (...) not logical consequence. (shrink)

In Barrio et al. Barrio Pailos and Szmuc prove that there are systems of logic that agree with classical logic up to any finite meta-inferential level, and disagree with it thereafter. This article presents a generalized sense of meta-inference that extends into the transfinite, and proves analogous results to all transfinite orders.

Accounts of logical independence which coincide when applied in the case of classical logic diverge elsewhere, raising the question of what a satisfactory all-purpose account of logical independence might look like. ‘All-purpose’ here means: working satisfactorily as applied across different logics, taken as consequence relations. Principal candidate characterizations of independence relative to a consequence relation are that there the consequence relation concerned is determined by only by classes of valuations providing for all possible truth-value combinations for the formulas whose independence (...) is at issue, and that the consequence relation ‘says’ nothing special about how those formulas are related that it does not say about arbitrary formulas. Each of these proposals returns counterintuitive verdicts in certain cases—the truth-value inspired approach classifying certain cases one would like to describe as involving failures of independence as being cases of independence, and the de Jongh approach counting some intuitively independent pairs of formulas as not being independent after all. In final section, a modification of the latter approach is tentatively sketched to correct for these misclassifications. The attention is on conceptual clarification throughout, rather than the provision of technical results. Proofs, as well as further elaborations, are lodged in the ‘longer notes’ in a final Appendix. (shrink)

Every Berman’s variety \ which is the subvariety of Ockham algebras defined by the equation \ and \) determines a finitary substitution invariant consequence relation \. A sequent system \ is introduced as an axiomatization of the consequence relation \. The system \ is characterized by a single finite frame \ under the frame semantics given for the formal language. By the duality between frames and algebras, \ can be viewed as a \-valued logic as it is characterized by a (...) distributive lattice of \ elements with a unary operator. Moreover, a structural-rule-free, cut-free and terminating sequent system \ is established for \. The Craig interpolation property of \ is shown proof-theoretically utilizing \. (shrink)

The essential structure of proofs is proposed as the basis for a measure of complexity of formulas in FOL. The motivating idea was the recognition that distinct theorems can have the same derivation modulo some non essential details. Hence the difficulty in proving them is identical and so their complexity should be the same. We propose a notion of complexity of formulas capturing this property. With this purpose, we introduce the notions of schema calculus, schema derivation and description complexity of (...) a schema formula. Based on these concepts we prove general robustness results that relate the complexity of introducing a logical constructor with the complexity of the component schema formulas as well as the complexity of a schema formula across different schema calculi. (shrink)

In this paper, we study logical systems which represent entailment relations of two kinds. We extend the approach of finding ‘exactly true’ and ‘non-falsity’ versions of four-valued logics that emerged in series of recent works [Pietz & Rivieccio (2013). Nothing but the truth. Journal of Philosophical Logic, 42(1), 125–135; Shramko (2019). Dual-Belnap logic and anything but falsehood. Journal of Logics and their Applications, 6, 413–433; Shramko et al. (2017). First-degree entailment and its relatives. Studia Logica, 105(6), 1291–1317] to the case (...) of infectious logics, namely to the case of Deutsch's logic Sfde introduced in Deutsch [Relevant analytic entailment. The Relevance Logic Newsletter, 2(1), 26–44; The completeness of S. Studia Logica, 38(2), 137–147]. The particular systems obtained in this way are Setl and Snfl. We present them in the form of sequent calculi and prove corresponding soundness and completeness theorems. We illuminate the connection between Setl, Snfl and two well-known systems, strong Kleene three-valued logic K3 and Priest's Logic of Paradox LP. This connection allows us to investigate the characterisation of the entailment relations associated with Setl and Snfl as well as to introduce the notion of ‘infectious analogue’ of a certain logic. We also study implicative extensions of Setl and Snfl and prove soundness and completeness theorems for them as well. (shrink)

Logical consequence in first-order predicate logic is defined substitutionally in set theory augmented with a primitive satisfaction predicate: an argument is defined to be logically valid if and only if there is no substitution instance with true premises and a false conclusion. Substitution instances are permitted to contain parameters. Variants of this definition of logical consequence are given: logical validity can be defined with or without identity as a logical constant, and quantifiers can be relativized in substitution instances or not. (...) It is shown that the resulting notions of logical consequence are extensionally equivalent to versions of first-order provability and model-theoretic consequence. Every model-theoretic interpretation has a substitutional counterpart, but not vice versa. In particular, in contrast to the model-theoretic account, there is a trivial intended interpretation on the substitutional account, namely, the homophonic interpretation that does not substitute anything. Applications to free logic, and theories and languages other than set theory are sketched. (shrink)

A very natural and philosophically important subclassical logic is FDE. This account of logical consequence can be seen as going beyond the standard two-valued account to a four-valued account. A natural question arises: What account of logical consequence arises from considering further combinations of such values? A partial answer was given by Priest in 2014; Shramko and Wansing had also given a partial result some years earlier, although in a different context. In this note we generalize Priest’s result to show (...) that even if one considers ordinal-many combinations of the previous values, for any ordinal, the resulting consequence relation remains FDE. (shrink)

Three leading philosopher-logicians present a clear and concise overview of formal theories of truth, explaining key logical techniques. Truth is as central topic in philosophy: formal theories study the connections between truth and logic, including the intriguing challenges presented by paradoxes like the Liar.

We are pluralists about logical consequence [1]. We hold that there is more than one sense in which arguments may be deductively valid, that these senses are equally good, and equally deserving of the name deductive validity. Our pluralism starts with our analysis of consequence. This analysis of consequence is not idiosyncratic. We agree with Richard Jeffrey, and with many other philosophers of logic about how logical consequence is to be defined. To quote Jeffrey.

In this study, we prove the completeness and cut-elimination theorems for a first-order extension F4CC of Arieli, Avron, and Zamansky’s ideal paraconsistent four-valued logic known as 4CC. These theorems are proved using Schütte’s method, which can simultaneously prove completeness and cut-elimination.

A calculus for classical propositional sequents is introduced that consists of a restricted version of the cut rule and local variants of the logical rules. Employed in the style of proof search, this calculus explodes a given sequent into its elementary structural sequents—the topmost sequents in a derivation thus constructed—which do not contain any logical constants. Some of the properties exhibited by the collection of elementary structural sequents in relation to the sequent they are derived from, uniqueness and unique representation (...) of formula occurrences, will be discussed in detail. Based on these properties it is suggested that a collection of elementary structural sequents constitutes the purely structural representation of the sequent from which it is obtained. (shrink)

We prove a generalization of Maehara’s lemma to show that the extensions of classical and intuitionistic first-order logic with a special type of geometric axioms, called singular geometric axioms, have Craig’s interpolation property. As a corollary, we obtain a direct proof of interpolation for first-order logic with identity, as well as interpolation for several mathematical theories, including the theory of equivalence relations, partial and linear orders, and various intuitionistic order theories such as apartness and positive partial and linear orders.

In this multi-disciplinary investigation we show how an evidence-based perspective of quantification---in terms of algorithmic verifiability and algorithmic computability---admits evidence-based definitions of well-definedness and effective computability, which yield two unarguably constructive interpretations of the first-order Peano Arithmetic PA---over the structure N of the natural numbers---that are complementary, not contradictory. The first yields the weak, standard, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically verifiable Tarskian truth values to the formulas of PA under the interpretation. (...) The second yields a strong, finitary, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically computable Tarskian truth values to the formulas of PA under the interpretation. We situate our investigation within a broad analysis of quantification vis a vis: * Hilbert's epsilon-calculus * Goedel's omega-consistency * The Law of the Excluded Middle * Hilbert's omega-Rule * An Algorithmic omega-Rule * Gentzen's Rule of Infinite Induction * Rosser's Rule C * Markov's Principle * The Church-Turing Thesis * Aristotle's particularisation * Wittgenstein's perspective of constructive mathematics * An evidence-based perspective of quantification. By showing how these are formally inter-related, we highlight the fragility of both the persisting, theistic, classical/Platonic interpretation of quantification grounded in Hilbert's epsilon-calculus; and the persisting, atheistic, constructive/Intuitionistic interpretation of quantification rooted in Brouwer's belief that the Law of the Excluded Middle is non-finitary. We then consider some consequences for mathematics, mathematics education, philosophy, and the natural sciences, of an agnostic, evidence-based, finitary interpretation of quantification that challenges classical paradigms in all these disciplines. (shrink)

Popper’s original definition of truthlikeness relied on a central insight: that truthlikeness combines truth and information, in the sense that a proposition is closer to the truth the more true consequences and the less false consequences it entails. As intuitively compelling as this definition may be, it is untenable, as proved long ago; still, one can arguably rely on Popper’s intuition to provide an adequate account of truthlikeness. To this aim, we mobilize some classical work on partial entailment in defining (...) a new measure of truthlikeness which satisfies a number of desiderata. The resulting account has some interesting and surprising connections with other accounts on the market, thus shedding new light on current attempts of systematizing different approaches to verisimilitude. (shrink)

Unlike standard modal logics, many dynamic epistemic logics are not closed under uniform substitution. A distinction therefore arises between the logic and its substitution core, the set of formulas all of whose substitution instances are valid. The classic example of a non-uniform dynamic epistemic logic is Public Announcement Logic (PAL), and a well-known open problem is to axiomatize the substitution core of PAL. In this paper we solve this problem for PAL over the class of all relational models with infinitely (...) many agents, PAL-K_omega, as well as standard extensions thereof, e.g., PAL-T_omega, PAL-S4_omega, and PAL-S5_omega. We introduce a new Uniform Public Announcement Logic (UPAL), prove completeness of a deductive system with respect to UPAL semantics, and show that this system axiomatizes the substitution core of PAL. (shrink)

This paper explains the importance of classifying argumentation schemes, and outlines how schemes are being used in current research in artificial intelligence and computational linguistics on argument mining. It provides a survey of the literature on scheme classification. What are so far generally taken to represent a set of the most widely useful defeasible argumentation schemes are surveyed and explained systematically, including some that are difficult to classify. A new classification system covering these centrally important schemes is built.

The conventional notion of a formal system is adapted to conform to the sound deductive inference model operating on finite strings. Finite strings stipulated to have the semantic value of Boolean true provide the sound deductive premises. Truth preserving finite string transformation rules provide the valid deductive inference. Sound deductive conclusions are the result of these finite string transformation rules.

Logical pluralism is the view that there is more than one correct logic. This very general characterization gives rise to a whole family of positions. I argue that not all of them are stable. The main argument in the paper is inspired by considerations known as the “collapse problem”, and it aims at the most popular form of logical pluralism advocated by JC Beall and Greg Restall. I argue that there is a more general argument available that challenges all variants (...) of logical pluralism that meet the following three conditions: that there are at least two correct logical systems characterized in terms of different consequence relations, that there is some sort of rivalry among the correct logics, and that logical consequence is normative. The hypothesis I argue for amounts to conditional claim: If a position satisfies all these conditions, then that position is unstable in the sense that it collapses into competing positions. (shrink)

This paper is about the underlying logical principles of scientific theories. In particular, it concerns ex contradictione quodlibet the principle that anything follows from a contradiction. ECQ is valid according to classical logic, but invalid according to paraconsistent logics. Some advocates of paraconsistency claim that there are ‘real’ inconsistent theories that do not erupt with completely indiscriminate, absurd commitments. They take this as evidence in favor of paraconsistency. Michael calls this the non-triviality strategy. He argues that this strategy fails in (...) its purpose. I will show that Michael's criticism significantly over-reaches. The fundamental problem is that he places more of a burden on the advocate of paraconsistency than on the advocate of classical logic. The weaknesses in Michael's argument are symptomatic of this preferential treatment of one viewpoint in the debate over another. He does, however, make important observations that allow us to clarify some of the complexities involved in giving a logical reconstruction of a theory. I will argue that there are abductive arguments deserving of further consideration for the claim that paraconsistent logic offers the best explanation of the practice of inconsistent science. In this sense, the debate is still very much open. (shrink)

This paper scrutinizes the debate over logical pluralism. I hope to make this debate more tractable by addressing the question of motivating data: what would count as strong evidence in favor of logical pluralism? Any research program should be able to answer this question, but when faced with this task, many logical pluralists fall back on brute intuitions. This sets logical pluralism on a weak foundation and makes it seem as if nothing pressing is at stake in the debate. The (...) present paper aims to improve this situation by looking at a promising case study and drawing general lessons about the kind of evidence that would support logical pluralism. I argue that the best motivation for logical pluralism will ultimately be rooted in certain kinds of performative data. (shrink)

Unlike standard modal logics, many dynamic epistemic logics are not closed under uniform substitution. A distinction therefore arises between the logic and its substitu- tion core, the set of formulas all of whose substitution instances are valid. The classic example of a non-uniform dynamic epistemic logic is Public Announcement Logic (PAL), and a well-known open problem is to axiomatize the substitution core of PAL. In this paper we solve this problem for PAL over the class of all relational models with (...) infinitely many agents, PAL-Kω , as well as standard extensions thereof, e.g., PAL-Tω , PAL-S4ω, and PAL-S5ω. We introduce a new Uniform Public Announcement Logic (UPAL), prove completeness of a deductive system with respect to UPAL semantics, and show that this system axiomatizes the substitution core of PAL. (shrink)

This paper discusses Fara's so-called 'Paradox of Higher-Order Vagueness' concerning supervaluationism. In the paper I argue that supervaluationism is not committed to global validity, as it is largely assumed in the literature, but to a weaker notion of logical consequence I call 'regional validity'. Then I show that the supervaluationist might solve Fara's paradox making use of this weaker notion of logical consequence. The paper is discussed by Delia Fara in the same volume.

The paper investigates the epistemological and communicative competences the experts need to use and communicate evidence in the reasoning process leading to diagnosis. The diagnosis and diagnosis communication are presented as intertwined processes that should be jointly addressed in medical consultations, to empower patients’ compliance in illness management. The paper presents defeasible reasoning as specific to the diagnostic praxis, showing how this type of reasoning threatens effective diagnosis communication and entails that we should understand diagnostic evidence as defeasible as well. (...) It argues that metaphors might be effective communicative devices to let the patients understand the relevant defeasors in the diagnostic reasoning process, helping to improve effective diagnosis communication, and also encouraging a change in patients’ beliefs and attitudes on their own experience of illness and illness’ management. (shrink)

Proposition 5.122 of Wittgenstein’s Tractatus has been the source of much puzzlement among interpreters, so much so that no fully satisfactory account is yet available. This is unfortunate, if only because the containment account of logical consequence has a venerable tradition behind it. Pasquale Frascolla’s interpretation of proposition 5.122 is based on a valid argument and one true premise. However, the argument explains sense containment only in an indirect way, leaving some crucial questions unanswered. Besides, Frascolla does not address the (...) issue of how to make sense containment notationally perspicuous, an essential theme in Wittgenstein’s reflections. In this paper, we elaborate on Frascolla’s account by looking at the issue through the Tractarian notion of logical space. Our analysis shows that, for containment to be fully appreciated, one should adopt a negative perspective on the notion of sense, in line with the exclusionary theory of conceptual content, as labelled by Ian Rumfitt. Besides this, we introduce and discuss two methods—one envisaged by Wittgenstein himself—for making sense containment notationally perspicuous. (shrink)

In this paper we provide a proof theoretical investigation of logical argumentation, where arguments are represented by sequents, conflicts between arguments are represented by sequent elimination rules, and deductions are made by dynamic proof systems extending standard sequent calculi. The idea is to imitate argumentative movements in which certain claims are introduced or withdrawn in the presence of counter-claims. This is done by a dynamic evaluation of sequences of sequents, in which the latter are considered ‘derived’ or ‘not derived’ according (...) to the content of the sequence. We show that decisive conclusions of such a process correspond to well-accepted consequences of the underlying argumentation framework. The outcome is therefore a general and modular proof-theoretical approach for paraconsistent and non-monotonic reasoning with argumentation systems. (shrink)

McGee (1985) argued that modus ponens was invalid for the natural language conditional ‘If. . . then. . . ’. Many subsequent responses have argued that, while McGee’s examples show that modus ponens fails to preserve truth, they do not show that modus ponens fails to preserve rational full acceptance, and thus modus ponens may still be valid in the latter informational sense. I show that when we turn our attention from indicative conditionals (the focus of most of the literature (...) to date) to subjunctive conditionals, we find that modus ponens does not preserve either truth or rational full acceptance, and thus is not valid in either sense. In concluding I briefly consider how we can account for these facts. (shrink)

Colwyn Williamson (Notre Dame J. Formal Log. 13:497–500, 1972) develops a comparison between propositional and syllogistic logic. He outlines an interpretation of the traditional square of opposition in terms of propositional logic, that is, the statements corresponding to the corners of the traditional square can be represented with propositional logic operators. His goal is to present a twofold square that preserves the truth conditions of the relationships between the formulas, and define other set of formulas that complete the traditional square (...) to outline an octagon of opposition. We present two octahedra inspired in these squares. The octahedra hold the relations of the traditional square of opposition and also keep (and with some restrictions, extend) the equipollence and immediate inference rules. (shrink)

In this paper, I address a key argument in favour of logical expressivism, the view that knowing a logical principle such as Modus Ponens is not a cognitive state but a pro-attitude towards drawing certain types of conclusions from certain types of premises. The argument is that logical expressivism is the only view that can take us out of Lewis Carroll's Regress – which suggests that elementary deductive reasoning is impossible. I show that the argument does not hold scrutiny and (...) that logical cognitivism can be vindicated. In the course of the discussion, I draw substantially on a comparison with a similar argument in meta-ethics, for moral expressivism. (shrink)

I address a type of circularity threat that arises for the view that we employ general basic logical principles in deductive reasoning. This type of threat has been used to argue that whatever knowing such principles is, it cannot be a fully cognitive or propositional state, otherwise deductive reasoning would not be possible. I look at two versions of the circularity threat and answer them in a way that both challenges the view that we need to apply general logical principles (...) in deductive reasoning and defuses the threat to a cognitivist account of knowing basic logical principles. (shrink)

Complete French translation of Gottlob Frege's Begriffsschrift.