Logical Consequence and Entailment

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)

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)

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)

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)

There is a natural story about what logic is that sees it as tied up with two operations: a ‘throw things into a bag’ operation and a ‘closure’ operation. In a pair of recent papers, Jc Beall has fleshed out the account of logic this leaves us with in more detail. Using Beall’s exposition as a guide, this paper points out some problems with taking the second operation to be closure in the usual sense. After pointing out these problems, I (...) then turn to fixing them in a restricted case and modulo a few simplifying assumptions. In a followup paper, the simplifications and restrictions will be removed. (shrink)

Work on the nature and scope of formal logic has focused unduly on the distinction between logical and extra-logical vocabulary; which argument forms a logical theory countenances depends not only on its stock of logical terms, but also on its range of grammatical categories and modes of composition. Furthermore, there is a sense in which logical terms are unnecessary. Alexandra Zinke has recently pointed out that propositional logic can be done without logical terms. By defining a logical-term-free language with the (...) full expressive power of first-order logic with identity, I show that this is true of logic more generally. Furthermore, having, in a logical theory, non-trivial valid forms that do not involve logical terms is not merely a technical possibility. As the case of adverbs shows, issues about the range of argument forms logic should countenance can quite naturally arise in such a way that they do not turn on whether we countenance certain terms as logical. (shrink)

This article reviews John Wood’s Truth in Fiction: Rethinking its Logic.

The many-property problem has traditionally been taken to show that the adverbial theory of perception is untenable. This paper first shows that several widely accepted views concerning the nature of perception---including both representational and non-representational views---likewise face the many-property problem. It then presents a solution to the many-property problem for these views, but goes on to show how this solution can be adapted to provide a novel, fully compositional solution to the many-property problem for adverbialism. Thus, with respect to the (...) many-property problem, adverbialism and several widely accepted views in the philosophy of perception are on a par, and the problem is solved. (shrink)

It is commonly thought that Impossibility, Incompleteness, Paraconsistency, Undecidability, Randomness, Computability, Paradox, Uncertainty and the Limits of Reason are disparate scientific physical or mathematical issues having little or nothing in common. I suggest that they are largely standard philosophical problems (i.e., language games) which were mostly resolved by Wittgenstein over 80years ago. -/- “What we are ‘tempted to say’ in such a case is, of course, not philosophy, but it is its raw material. Thus, for example, what a mathematician is (...) inclined to say about the objectivity and reality of mathematical facts, is not a philosophy of mathematics, but something for philosophical treatment.” Wittgenstein PI 234 -/- "Philosophers constantly see the method of science before their eyes and are irresistibly tempted to ask and answer questions in the way science does. This tendency is the real source of metaphysics and leads the philosopher into complete darkness." Wittgenstein -/- I provide a brief summary of some of the major findings of two of the most eminent students of behavior of modern times, Ludwig Wittgenstein and John Searle, on the logical structure of intentionality (mind, language, behavior), taking as my starting point Wittgenstein’s fundamental discovery –that all truly ‘philosophical’ problems are the same—confusions about how to use language in a particular context, and so all solutions are the same—looking at how language can be used in the context at issue so that its truth conditions (Conditions of Satisfaction or COS) are clear. The basic problem is that one can say anything, but one cannot mean (state clear COS for) any arbitrary utterance and meaning is only possible in a very specific context. -/- I dissect some writings of a few of the major commentators on these issues from a Wittgensteinian viewpoint in the framework of the modern perspective of the two systems of thought (popularized as ‘thinking fast, thinking slow’), employing a new table of intentionality and new dual systems nomenclature. I show that this is a powerful heuristic for describing the true nature of these putative scientific, physical or mathematical issues which are really best approached as standard philosophical problems of how language is to be used (language games in Wittgenstein’s terminology). -/- It is my contention that the table of intentionality (rationality, mind, thought, language, personality etc.) that features prominently here describes more or less accurately, or at least serves as an heuristic for, how we think and behave, and so it encompasses not merely philosophy and psychology, but everything else (history, literature, mathematics, politics etc.). Note especially that intentionality and rationality as I (along with Searle, Wittgenstein and others) view it, includes both conscious deliberative linguistic System 2 and unconscious automated prelinguistic System 1 actions or reflexes. (shrink)

Logical pluralism is commonly described as the view that there is more than one correct logic. It has been claimed that, in order for that view to be interesting, there has to be at least a potential for rivalry between the correct logics. This paper offers a detailed assessment of this suggestion. I argue that an interesting version of logical pluralism is hard, if not impossible, to achieve. I first outline an intuitive understanding of the notions of rivalry and correctness. (...) I then discuss a natural account of rivalry in terms of disagreement about validity claims and the argument from meaning variance that has been raised against it. I explore a more refined picture of the meaning of validity claims that makes use of the character-content distinction of classical two dimensional semantics. There are three ways in which pluralists can use that framework to argue for the view that different logics may be rivals but could nevertheless be equally correct. I argue that none of them is convincing. (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)

In this paper we present a framework for the dynamic and automatic generation of novel knowledge obtained through a process of commonsense reasoning based on typicality-based concept combination. We exploit a recently introduced extension of a Description Logic of typicality able to combine prototypical descriptions of concepts in order to generate new prototypical concepts and deal with problem like the PET FISH (Osherson and Smith, 1981; Lieto & Pozzato, 2019). Intuitively, in the context of our application of this logic, the (...) overall pipeline of our system works as follows: given a goal expressed as a set of properties, if the knowledge base does not contain a concept able to fulfill all these properties, then our system looks for two concepts to recombine in order to extend the original knowledge based satisfy the goal. (shrink)

यह आमतौर पर सोचा जाता है कि असंभवता, अपूर्णता, Paraconsistency, अनिर्णितता, Randomness, Computability, विरोधाभास, अनिश्चितता और कारण की सीमा अलग वैज्ञानिक शारीरिक या गणितीय मुद्दों में कम या कुछ भी नहीं कर रहे हैं आम. मेरा सुझाव है कि वे काफी हद तक मानक दार्शनिक समस्याओं (यानी, भाषा का खेल) जो ज्यादातर 80years पहले Wittgenstein द्वारा हल किए गए थे. -/- "क्या हम 'इस तरह के एक मामले में कहने के लिए' कर रहे हैं, ज़ाहिर है, दर्शन नहीं है, लेकिन (...) यह अपने कच्चे माल है. इस प्रकार, उदाहरण के लिए, क्या एक गणितज्ञ वस्तुपरकता और गणितीय तथ्यों की वास्तविकता के बारे में कहने के लिए इच्छुक है, गणित का दर्शन नहीं है, लेकिन दार्शनिक उपचार के लिए कुछ है। विटगेनस्टीन पीआई 234 -/- "Philosophers लगातार उनकी आँखों के सामने विज्ञान की विधि को देखने और irresistibly पूछने के लिए और जिस तरह से विज्ञान करता है में सवालों के जवाब परीक्षा कर रहे हैं. यह प्रवृत्ति तत्वमीमांसा का वास्तविक स्रोत है और दार्शनिक को पूर्ण अंधकार में ले जाती है। विटगेनस्टाइन -/- मैं आधुनिक समय के व्यवहार के सबसे प्रतिष्ठित छात्रों में से दो के प्रमुख निष्कर्षों में से कुछ का एक संक्षिप्त सारांश प्रदान करते हैं, लुडविग Wittgenstein और जॉन Searle, जानबूझकर की तार्किक संरचना पर (मन, भाषा, व्यवहार), मेरे प्रारंभिक बिंदु के रूप में ले रही Wittgenstein की मौलिक खोज - कि सभी सही मायने में 'लोकप्रिय' समस्याओं को एक ही हैं एक विशेष संदर्भ में भाषा का उपयोग करने के बारे में भ्रम, और इसलिए सभी समाधान एक ही हैं-कैसे भाषा के संदर्भ में इस मुद्दे पर इस्तेमाल किया जा सकता है पर देख इतना है कि इसकी सच्चाई शर्तें (संतोष या COS की शर्तें) स्पष्ट हैं. मूल समस्या यह है कि एक कुछ भी कह सकते हैं, लेकिन एक मतलब नहीं कर सकते (राज्य स्पष्ट COS के लिए) किसी भी मनमाने ढंग से कथन और अर्थ केवल एक बहुत ही विशिष्ट संदर्भ में संभव है. -/- मैं सोचा की दो प्रणालियों के आधुनिक परिप्रेक्ष्य के ढांचे में एक Wittgensteinian दृष्टिकोण से इन मुद्दों पर प्रमुख टिप्पणीकारों में से कुछ के कुछ लेखन विच्छेदन (के रूप में लोकप्रिय 'तेजी से सोच, धीमी गति से सोच'), की एक नई मेज रोजगार जानबूझकर और नई दोहरी प्रणाली नामकरण. मैं बताता हूँ कि यह इन putative वैज्ञानिक, शारीरिक या गणितीय मुद्दों जो वास्तव में सबसे अच्छा कैसे भाषा का इस्तेमाल किया जा रहा है के मानक दार्शनिक समस्याओं के रूप में संपर्क कर रहे हैं की सही प्रकृति का वर्णन करने के लिए एक शक्तिशाली heuristic है (Witgenstein में भाषा का खेल शब्दावली) -/- यह मेरा तर्क है कि जानबूझकर की मेज (तर्कसंगतता, मन, सोचा, भाषा, व्यक्तित्व आदि) है कि यहाँ प्रमुखता से सुविधाएँ अधिक या कम सही वर्णन करता है, या कम से कम के लिए एक heuristic के रूप में कार्य करता है, हम कैसे सोचते हैं और व्यवहार करते हैं, और इसलिए यह शामिल नहीं केवल दर्शन और मनोविज्ञान, लेकिन सब कुछ (इतिहास, साहित्य, गणित, राजनीति आदि). ध्यान दें कि विशेष रूप से जानबूझकर और तर्कसंगतता के रूप में मैं (Searle, Wittgenstein और अन्य लोगों के साथ) यह देखने के लिए, दोनों सचेत विचार विमर्श भाषाई प्रणाली 2 और बेहोश स्वचालित prelinguistic प्रणाली 1 कार्रवाई या सजगता भी शामिल है. (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)

Supervaluationism is often described as the most popular semantic treatment of indeterminacy. There???s little consensus, however, about how to fill out the bare-bones idea to include a characterization of logical consequence. The paper explores one methodology for choosing between the logics: pick a logic that norms belief as classical consequence is standardly thought to do. The main focus of the paper considers a variant of standard supervaluational, on which we can characterize degrees of determinacy. It applies the methodology above to (...) focus on degree logic. This is developed first in a basic, single-premise case; and then extended to the multipremise case, and to allow degrees of consequence. The metatheoretic properties of degree logic are set out. On the positive side, the logic is supraclassical???all classical valid sequents are degree logic valid. Strikingly, metarules such as cut and conjunction introduction fail. (shrink)

ABSTRACT: This 1974 paper builds on our 1969 paper (Corcoran-Weaver [2]). Here we present three (modal, sentential) logics which may be thought of as partial systematizations of the semantic and deductive properties of a sentence operator which expresses certain kinds of necessity. The logical truths [sc. tautologies] of these three logics coincide with one another and with those of standard formalizations of Lewis's S5. These logics, when regarded as logistic systems (cf. Corcoran [1], p. 154), are seen to be equivalent; (...) but, when regarded as consequence systems (ibid., p. 157), one diverges from the others in a fashion which suggests that two standard measures of semantic complexity may not be as closely linked as previously thought. -/- This 1974 paper uses the linear notation for natural deduction presented in [2]: each two-dimensional deduction is represented by a unique one-dimensional string of characters. Thus obviating need for two-dimensional trees, tableaux, lists, and the like—thereby facilitating electronic communication of natural deductions. The 1969 paper presents a (modal, sentential) logic which may be thought of as a partial systematization of the semantic and deductive properties of a sentence operator which expresses certain kinds of necessity. The logical truths [sc. tautologies] of this logic coincides those of standard formalizations of Lewis’s S4. Among the paper's innovations is its treatment of modal logic in the setting of natural deduction systems--as opposed to axiomatic systems. The author’s apologize for the now obsolete terminology. For example, these papers speak of “a proof of a sentence from a set of premises” where today “a deduction of a sentence from a set of premises” would be preferable. 1. Corcoran, John. 1969. Three Logical Theories, Philosophy of Science 36, 153–77. J P R -/- 2. Corcoran, John and George Weaver. 1969. Logical Consequence in Modal Logic: Natural Deduction in S5 Notre Dame Journal of Formal Logic 10, 370–84. MR0249278 (40 #2524). 3. Weaver, George and John Corcoran. 1974. Logical Consequence in Modal Logic: Some Semantic Systems for S4, Notre Dame Journal of Formal Logic 15, 370–78. MR0351765 (50 #4253). (shrink)

This essay examines the philosophical significance of Ω-logic in Zermelo-Fraenkel set theory with choice (ZFC). The dual isomorphism between algebra and coalgebra permits Boolean-valued algebraic models of ZFC to be interpreted as coalgebras. The modal profile of Ω-logical validity can then be countenanced within a coalgebraic logic, and Ω-logical validity can be defined via deterministic automata. I argue that the philosophical significance of the foregoing is two-fold. First, because the epistemic and modal profiles of Ω-logical validity correspond to those of (...) second-order logical consequence, Ω-logical validity is genuinely logical, and thus vindicates a neo-logicist conception of mathematical truth in the set-theoretic multiverse. Second, the foregoing provides a modal-computational account of the interpretation of mathematical vocabulary, adducing in favor of a realist conception of the cumulative hierarchy of sets. (shrink)

Putnam, Hilary FPhilosophy of logic. Harper Essays in Philosophy. Harper Torchbooks, No. TB 1544. Harper & Row, Publishers, New York-London, 1971. v+76 pp. The author of this book has made highly regarded contributions to mathematics, to philosophy of logic and to philosophy of science, and in this book he brings his ideas in these three areas to bear on the traditional philosophic problem of materialism versus (objective) idealism. The book assumes that contemporary science (mathematical and physical) is largely correct as (...) far as it goes, or at least that it is rational to believe in it. The main thesis of the book is that consistent acceptance of contemporary science requires the acceptance of some sort of Platonistic idealism affirming the existence of abstract, non-temporal, non-material, non-mental entities (numbers,scientific laws, mathematical formulas, etc.). The author is thus in direct opposition to the extreme materialism which had dominated philosophy of science in the first three quarters of this century. the book can be especially recommended to the scientifically literate, general reader whose acquaintance with these areas is limited to the earlier literature of when it had been assumed that empiricistic materialism was the only philosophy compatible with a scientific outlook. To this group the book presents an eye-opening challenge fulfilling the author’s intention of “shaking up preconceptions and stimulating further discussion”. (shrink)

What are the probabilities that this universe is repeated exactly the same with you in it again? Is God invented by human imagination or is the result of human intuition? The intuition that the same laws/mechanisms (evolution, stability winning probability) that have created something like the human being capable of self-awareness and controlling its surroundings, could create a being capable of controlling all what it exists? Will be the characteristics of the next universes random or tend to something? All these (...) ques-tions that with different shapes (but the same essence) have been asked by human be-ings from the beginning of times will be developed in this paper. (shrink)

The Overgeneration Argument is a prominent objection against the model-theoretic account of logical consequence for second-order languages. In previous work we have offered a reconstruction of this argument which locates its source in the conflict between the neutrality of second-order logic and its alleged entanglement with mathematics. Some cases of this conflict concern small large cardinals. In this article, we show that in these cases the conflict can be resolved by moving from a set-theoretic implementation of the model-theoretic account to (...) one which uses higher-order resources. (shrink)

Both Tarski and Gödel “prove” that provability can diverge from Truth. When we boil their claim down to its simplest possible essence it is really claiming that valid inference from true premises might not always derive a true consequence. This is obviously impossible.

Surrogacy is an encouraging management for many childless couples and can hypothetically resolve many unbearable pain that they are confronted. Initially surrogacy treatment was frowned upon, however, surrogacy is more popularly accepted now a day. But different country has different regulations on surrogacy. However, there are some degree of divergence between official discourse and actual practice of surrogacy throughout world. There are positive changes in attitude toward surrogacy has been seen for some countries as well. This editorial brief about surrogacy (...) around the world. (shrink)

Tarski "proved" that there cannot possibly be any correct formalization of the notion of truth entirely on the basis of an insufficiently expressive formal system that was incapable of recognizing and rejecting semantically incorrect expressions of language. -/- The only thing required to eliminate incompleteness, undecidability and inconsistency from formal systems is transforming the formal proofs of symbolic logic to use the sound deductive inference model.

To eliminate incompleteness, undecidability and inconsistency from formal systems we only need to convert the formal proofs to theorem consequences of symbolic logic to conform to the sound deductive inference model. -/- Within the sound deductive inference model there is a (connected sequence of valid deductions from true premises to a true conclusion) thus unlike the formal proofs of symbolic logic provability cannot diverge from truth.

If the conclusion of the Tarski Undefinability Theorem was that some artificially constrained limited notions of a formal system necessarily have undecidable sentences, then Tarski made no mistake within his assumptions. When we expand the scope of his investigation to other notions of formal systems we reach an entirely different conclusion showing that Tarski's assumptions were wrong.

The idea of rejection originated by Aristotle. The notion of rejection was introduced into formal logic by Łukasiewicz [20]. He applied it to complete syntactic characterization of deductive systems using an axiomatic method of rejection of propositions [22, 23]. The paper gives not only genesis, but also development and generalization of the notion of rejection. It also emphasizes the methodological approach to biaspectual axiomatic method of characterization of deductive systems as acceptance (asserted) systems and rejection (refutation) systems, introduced by Łukasiewicz (...) and developed by his student Słupecki, the pioneers of the method, which becomes relevant in modern approaches to logic. (shrink)

In this paper, two axiomatic theories T− and T′ are constructed, which are dual to Tarski’s theory T+ (1930) of deductive systems based on classical propositional calculus. While in Tarski’s theory T+ the primitive notion is the classical consequence function (entailment) Cn+, in the dual theory T− it is replaced by the notion of Słupecki’s rejection consequence Cn− and in the dual theory T′ it is replaced by the notion of the family Incons of inconsistent sets. The author has proved (...) that the theories T+, T−, and T′ are equivalent. (shrink)

Within the (Haskell Curry) notion of a formal system we complete Tarski's formal correctness: ∀x True(x) ↔ ⊢ x and use this finally formalized notion of Truth to refute his own Undefinability Theorem (based on the Liar Paradox), the Liar Paradox, and the (Panu Raatikainen) essence of the conclusion of the 1931 Incompleteness Theorem.

Because formal systems of symbolic logic inherently express and represent the deductive inference model formal proofs to theorem consequences can be understood to represent sound deductive inference to deductive conclusions without any need for other representations.

This is the formal YACC BNF specification for Minimal Type Theory (MTT). MTT was created by augmenting the syntax of First Order Logic (FOL) to specify Higher Order Logic (HOL) expressions using FOL syntax. Syntax is provided to enable quantifiers to specify type. FOL is a subset of MTT. The ASSIGN_ALIAS operator := enables FOL expressions to be chained together to form HOL expressions.

It is claimed hereby that, against a current view of logic as a theory of consequence, opposition is a basic logical concept that can be used to define consequence itself. This requires some substantial changes in the underlying framework, including: a non-Fregean semantics of questions and answers, instead of the usual truth-conditional semantics; an extension of opposition as a relation between any structured objects; a definition of oppositions in terms of basic negation. Objections to this claim will be reviewed.

In this paper, we argue that a distinction ought to be drawn between two ways in which a given world might be logically impossible. First, a world w might be impossible because the laws that hold at w are different from those that hold at some other world (say the actual world). Second, a world w might be impossible because the laws of logic that hold in some world (say the actual world) are violated at w. We develop a novel (...) way of modelling logical possibility that makes room for both kinds of logical impossibility. Doing so has interesting implications for the relationship between logical possibility and other kinds of possibility (for example, metaphysical possibility) and implications for the necessity or contingency of the laws of logic. (shrink)

The recent literature on Nāgārjuna’s catuṣkoṭi centres around Jay Garfield’s (2009) and Graham Priest’s (2010) interpretation. It is an open discussion to what extent their interpretation is an adequate model of the logic for the catuskoti, and the Mūla-madhyamaka-kārikā. Priest and Garfield try to make sense of the contradictions within the catuskoti by appeal to a series of lattices – orderings of truth-values, supposed to model the path to enlightenment. They use Anderson & Belnaps's (1975) framework of First Degree Entailment. (...) Cotnoir (2015) has argued that the lattices of Priest and Garfield cannot ground the logic of the catuskoti. The concern is simple: on the one hand, FDE brings with it the failure of classical principles such as modus ponens. On the other hand, we frequently encounter Nāgārjuna using classical principles in other arguments in the MMK. There is a problem of validity. If FDE is Nāgārjuna’s logic of choice, he is facing what is commonly called the classical recapture problem: how to make sense of cases where classical principles like modus pones are valid? One cannot just add principles like modus ponens as assumptions, because in the background paraconsistent logic this does not rule out their negations. In this essay, I shall explore and critically evaluate Cotnoir’s proposal. In detail, I shall reveal that his framework suffers collapse of the kotis. Furthermore, I shall argue that the Collapse Argument has been misguided from the outset. The last chapter suggests a formulation of the catuskoti in classical Boolean Algebra, extended by the notion of an external negation as an illocutionary act. I will focus on purely formal considerations, leaving doctrinal matters to the scholarly discourse – as far as this is possible. (shrink)

A prominent objection against the logicality of second-order logic is the so-called Overgeneration Argument. However, it is far from clear how this argument is to be understood. In the first part of the article, we examine the argument and locate its main source, namely, the alleged entanglement of second-order logic and mathematics. We then identify various reasons why the entanglement may be thought to be problematic. In the second part of the article, we take a metatheoretic perspective on the matter. (...) We prove a number of results establishing that the entanglement is sensitive to the kind of semantics used for second-order logic. These results provide evidence that by moving from the standard set-theoretic semantics for second-order logic to a semantics which makes use of higher-order resources, the entanglement either disappears or may no longer be in conflict with the logicality of second-order logic. (shrink)

Multialgebras (or hyperalgebras or non-deterministic algebras) have been much studied in mathematics and in computer science. In 2016 Carnielli and Coniglio introduced a class of multialgebras called swap structures, as a semantic framework for dealing with several Logics of Formal Inconsistency (or LFIs) that cannot be semantically characterized by a single finite matrix. In particular, these LFIs are not algebraizable by the standard tools of abstract algebraic logic. In this paper, the first steps towards a theory of non-deterministic algebraization of (...) logics by swap structures are given. Specifically, a formal study of swap structures for LFIs is developed, by adapting concepts of universal algebra to multialgebras in a suitable way. A decomposition theorem similar to Birkhoff's representation theorem is obtained for each class of swap structures. Moreover, when applied to the 3-valued algebraizable logics J3 and Ciore, their classes of algebraic models are retrieved, and the swap structures semantics become twist structures semantics (as independently introduced by M. Fidel and D. Vakarelov). This fact, together with the existence of a functor from the category of Boolean algebras to the category of swap structures for each LFI (which is closely connected with Kalman's functor), suggests that swap structures can be seen as non-deterministic twist structures. This opens new avenues for dealing with non-algebraizable logics by the more general methodology of multialgebraic semantics. (shrink)

Beall and Murzi :143–165, 2013) introduce an object-linguistic predicate for naïve validity, governed by intuitive principles that are inconsistent with the classical structural rules. As a consequence, they suggest that revisionary approaches to semantic paradox must be substructural. In response to Beall and Murzi, Field :1–19, 2017) has argued that naïve validity principles do not admit of a coherent reading and that, for this reason, a non-classical solution to the semantic paradoxes need not be substructural. The aim of this paper (...) is to respond to Field’s objections and to point to a coherent notion of validity which underwrites a coherent reading of Beall and Murzi’s principles: grounded validity. The notion, first introduced by Nicolai and Rossi, is a generalisation of Kripke’s notion of grounded truth, and yields an irreflexive logic. While we do not advocate the adoption of a substructural logic, we take the notion of naïve validity to be a legitimate semantic notion that points to genuine expressive limitations of fully structural revisionary approaches. (shrink)

In a recent work, Walter Carnielli and Abilio Rodrigues present an epistemically motivated interpretation of paraconsistent logic. In their view, when there is conflicting evidence with regard to a proposition A (i.e. when there is both evidence in favor of A and evidence in favor of ￢A) both A and ￢A should be accepted without thereby accepting any proposition B whatsoever. Hence, reasoning within their system intends to mirror, and thus, should be constrained by, the way in which we reason (...) about evidence. In this article we will thoroughly discuss their position and suggest some ways in which this project can be further developed. The aim of the paper is twofold. On the one hand, we will present some philosophical critiques to the specific epistemic interpretation of paraconsistent logic proposed by Carnielli & Rodrigues. First, we will contend that Carnielli & Rodrigues’s interpretation implies a thesis about what evidence rationally justifies to accept or believe, called Extreme Permissivism, which is controversial among epistemologists. Second, we will argue that what agents should do, from an epistemic point of view, when faced with conflicting evidence, is to suspend judgment. On the other hand, despite these criticisms we do not believe that the epistemological motivation put forward by Carnielli & Rodrigues is entirely wrong. In the last section, we offer an alternative way in which one might account for the epistemic rationality of accepting contradictions and, thus, for an epistemic understanding of paraconsistency, which leads us to discuss the notion of diachronic epistemic rationality. (shrink)

Many recent theories of epistemic discourse exploit an informational notion of consequence, i.e. a notion that defines entailment as preservation of support by an information state. This paper investigates how informational consequence fits with probabilistic reasoning. I raise two problems. First, all informational inferences that are not also classical inferences are, intuitively, probabilistically invalid. Second, all these inferences can be exploited, in a systematic way, to generate triviality results. The informational theorist is left with two options, both of them radical: (...) they can either deny that epistemic modal claims have probability at all, or they can move to a nonstandard probability theory. (shrink)

Recently, there has been a shift away from traditional truth-conditional accounts of meaning towards non-truth-conditional ones, e.g., expressivism, relativism and certain forms of dynamic semantics. Fueling this trend is some puzzling behavior of modal discourse. One particularly surprising manifestation of such behavior is the alleged failure of some of the most entrenched classical rules of inference; viz., modus ponens and modus tollens. These revisionary, non-truth-conditional accounts tout these failures, and the alleged tension between the behavior of modal vocabulary and classical (...) logic, as data in support of their departure from tradition, since the revisionary semantics invalidate some of these patterns. I, instead, offer a semantics for modality with the resources to accommodate the puzzling data while preserving classical logic, thus affirming the tradition that modals express ordinary truth-conditional content. My account shows that the real lesson of the apparent counterexamples is not the one the critics draw, but rather one they missed: namely, that there are linguistic mechanisms, reflected in the logical form, that affect the interpretation of modal language in a context in a systematic and precise way, which have to be captured by any adequate semantic account of the interaction between discourse context and modal vocabulary. The semantic theory I develop specifies these mechanisms and captures precisely how they affect the interpretation of modals in a context, and do so in a way that both explains the appearance of the putative counterexamples and preserves classical logic. (shrink)

This paper is a guide to the main ideas and innovations in Robert Stalnaker's "Indicative Conditionals". The paper is for a volume of essays on twenty-one classics of formal semantics edited by Louise McNally, Yael Sharvit and Zoltàn Gendler Szabò.

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

This paper discusses a dualization of Fitting's notion of a "cut-down" operation on a bilattice, rendering a "track-down" operation, later used to represent the idea that a consistent opinion cannot arise from a set including an inconsistent opinion. The logic of track-down operations on bilattices is proved equivalent to the logic d_Sfde, dual to Deutsch's system S_fde. Furthermore, track-down operations are employed to provide an epistemic interpretation for paraconsistent weak Kleene logic. Finally, two logics of sequential combinations of cut-and track-down (...) operations allow settling positively the question of whether bilattice-based semantics are available for subsystems of S_fde. (shrink)

In a recent paper we have defined an analytic tableau calculus PL_16 for a functionally complete extension of Shramko and Wansing's logic based on the trilattice SIXTEEN_3. This calculus makes it possible to define syntactic entailment relations that capture central semantic relations of the logic---such as the relations |=_t, |=_f, and |=_i that each correspond to a lattice order in SIXTEEN_3; and |=, the intersection of |=_t and |=_f,. -/- It turns out that our method of characterising these semantic relations---as (...) intersections of auxiliary relations that can be captured with the help of a single calculus---lends itself well to proving interpolation. All entailment relations just mentioned have the interpolation property, not only when they are defined with respect to a functionally complete language, but also in a range of cases where less expressive languages are considered. For example, we will show that |=, when restricted to L_{tf}, the language originally considered by Shramko and Wansing, enjoys interpolation. This answers a question that was recently posed by M. Takano. (shrink)

This paper extends Fitting's epistemic interpretation of some Kleene logics, to also account for Paraconsistent Weak Kleene logic. To achieve this goal, a dualization of Fitting's "cut-down" operator is discussed, rendering a "track-down" operator later used to represent the idea that no consistent opinion can arise from a set including an inconsistent opinion. It is shown that, if some reasonable assumptions are made, the truth-functions of Paraconsistent Weak Kleene coincide with certain operations defined in this track-down fashion. Finally, further reflections (...) on conjunction and disjunction in the weak Kleene logics accompany this paper, particularly concerning their relation with containment logics. These considerations motivate a special approach to defining sound and complete Gentzen-style sequent calculi for some of their four-valued generalizations. (shrink)

In this paper I consider two paradoxes that arise in connection with the concept of demonstrability, or absolute provability. I assume—for the sake of the argument—that there is an intuitive notion of demonstrability, which should not be conflated with the concept of formal deducibility in a (formal) system or the relativized concept of provability from certain axioms. Demonstrability is an epistemic concept: the rough idea is that a sentence is demonstrable if it is provable from knowable basic (“self-evident”) premises by (...) means of simple logical steps. A statement that is demonstrable is also knowable and a statement that is actually demonstrated is known to be true. By casting doubt upon apparently central principles governing the concept of demonstrability, the paradoxes of demonstrability presented here tend to undermine the concept itself—or at least our understanding of it. As long as we cannot find a diagnosis and a cure for the paradoxes, it seems that the coherence of the concepts of demonstrability and demonstrable knowledge are put in question. There are of course ways of putting the paradoxes in quarantine, for example by imposing a hierarchy of languages a` la Tarski, or a ramified hierarchy of propositions and propositional functions a` la Russell. These measures, however, helpful as they may be in avoiding contradictions, do not seem to solve the underlying conceptual problems. Although structurally similar to the semantic paradoxes, the paradoxes discussed in this paper involve epistemic notions: “demonstrability”, “knowability”, “knowledge”... These notions are “factive” (e.g., if A is demonstrable, then A is true), but similar paradoxes arise in connection with “nonfactive” notions like “believes”, “says”, “asserts”.3 There is no consensus in the literature concerning the analysis of the notions involved—often referred to as “propositional attitudes”—or concerning the treatment of the paradoxes they give rise to. (shrink)