Logical Consequence and Entailment

We motivate and introduce a new method of abduction, Matrix Abduction, and apply it to modelling the use of non-deductive inferences in the Talmud such as Analogy and the rule of Argumentum A Fortiori. Given a matrix with entries in {0, 1}, we allow for one or more blank squares in the matrix, say a i , j =?. The method allows us to decide whether to declare a i , j = 0 or a i , j = 1 (...) or a i , j =? undecided. This algorithmic method is then applied to modelling several legal and practical reasoning situations including the Talmudic rule of Kal-Vachomer. We add an Appendix showing that this new rule of Matrix Abduction, arising from the Talmud, can also be applied to the analysis of paradoxes in voting and judgement aggregation. In fact we have here a general method for executing non-deductive inferences. (shrink)

The main theorem says that a consequence operator is an effective part of the consequence operator for the classical prepositional calculus iff it is a consequence operator for a logic satisfying the compactness theorem, and in which every finitely axiomatizable theory is decidable.

Four consequence operators based on hypergraph satisfiability are defined. Their properties are explored and interconnections are displayed. Finally their relation to the case of the Classical Propositional Calculus is shown.

Different inferences in probabilistic logics of conditionals 'preserve' the probabilities of their premisses to different degrees. Some preserve certainty, some high probability, some positive probability, and some minimum probability. In the first case conclusions must have probability I when premisses have probability 1, though they might have probability 0 when their premisses have any lower probability. In the second case, roughly speaking, if premisses are highly probable though not certain then conclusions must also be highly probable. In the third case (...) conclusions must have positive probability when premisses do, and in the last case conclusions must be at least as probable as their least probable premisses. Precise definitions and well known examples are given for each of these properties, characteristic principles are shown to be valid and complete for deriving conclusions of each of these kinds, and simple trivalent truthtable 'tests' are described for determining which properties are possessed by any given inference. Brief comments are made on the application of these results to certain modal inferences such as "Jones may own a car, and if he does he will have a driver's license. Therefore, he may have a driver's license.". (shrink)

It is shown that many different problems have the same degree of unsolvability. Among these problems are: THE INDUCTIVE INFERENCE PROBLEM. Infer in the limit an index for a recursive function f presented as f(0), f(1), f(2),.... THE RECURSIVE INDEX PROBLEM. Decide in the limit if i is the index of a total recursive function. THE ZERO NONVARIANT PROBLEM. Decide in the limit if a recursive function f presented as f(0), f(1), f(2),... has value unequal to zero for infinitely many (...) arguments. Finally, it is shown that these unsolvable problems are strictly easier than the halting problem. (shrink)

It is usually held that what distinguishes a good inference from a bad one is that a good inference is truth-preserving. Against this view, this paper argues that a logical inference is good or bad depending not on whether it is truth-preserving or not, but whether it belongs to a logical system the addition of which makes a deductively conservative extension of the derivation relations among the atomic statements. To so argue, the paper first contends that the meaning of the (...) logical operators of classical logic is determined not by their connections to truth, but by their inferential roles. It is claimed in conclusion that there is no genuine issue over which logic, classical or intuitionistic, is the correct logic, for they are both conservative in the relevant sense. (shrink)

We show how sequent calculi for some generalized quantifiers can be obtained by generalizing the Herbrand approach to ordinary first order proof theory. Typical of the Herbrand approach, as compared to plain sequent calculus, is increased control over relations of dependence between variables. In the case of generalized quantifiers, explicit attention to relations of dependence becomes indispensible for setting up proof systems. It is shown that this can be done by turning variables into structured objects, governed by various types of (...) structural rules. These structured variables are interpreted semantically by means of a dependence relation. This relation is an analogue of the accessibility relation in modal logic. We then isolate a class of axioms for generalized quantifiers which correspond to first-order conditions on the dependence relation. (shrink)

Informational semantics were first developed as an interpretation of the model-theory of substructural (and especially relevant) logics. In this paper we argue that such a semantics is of independent value and that it should be considered as a genuine alternative explication of the notion of logical consequence alongside the traditional model-theoretical and the proof-theoretical accounts. Our starting point is the content-nonexpansion platitude which stipulates that an argument is valid iff the content of the conclusion does not exceed the combined content (...) of the premises. We show that this basic platitude can be used to characterise the extension of classical as well as non-classical consequence relations. The distinctive trait of an informational semantics is that truth-conditions are replaced by information-conditions. The latter leads to an inversion of the usual order of explanation: Considerations about logical discrimination (how finely propositions are individuated) are conceptually prior to considerations about deductive strength. Because this allows us to bypass considerations about truth, an informational semantics provides an attractive and metaphysically unencumbered account of logical consequence, non-classical logics, logical rivalry and pluralism about logical consequence. (shrink)

The semantic analysis of logical consequence must obey a set of requisites which nowadays have acquired a dogmatic status. This situation prevents the development of other varieties of this fundamental relation. In this issue we try to define what we call a naive variety of logical consequence. The main feature of this relation is the way it depends on formulas in premises and conclusion: every sentence must contribute to the acceptability of an argument in a significative way. This circumstance can (...) be of some interest for research programs demanding a logical apparatus sensitive to application context. We think of the logic LP developed by G. Priest -- Priest [1979] -- in relation to Gödel incompleteness theorems as a test for our points of view. (shrink)

In this work, we propose a definition of logical consequence based on the relation between the quantity of information present in a particular set of formulae and a particular formula. As a starting point, we use Shannon‟s quantitative notion of information, founded on the concepts of logarithmic function and probability value. We first consider some of the basic elements of an axiomatic probability theory, and then construct a probabilistic semantics for languages of classical propositional logic. We define the quantity of (...) information for the formulae of these languages and introduce the concept of informational logical consequence, identifying some important results, among them: certain arguments that have traditionally been considered valid, such as modus ponens, are not valid from the informational perspective; the logic underlying informational logical consequence is not classical, and is at the least paraconsistent sensu lato; informational logical consequence is not a Tarskian logical consequence. (shrink)

This is a title on the foundations of defeasible logic, which explores the formal properties of everyday reasoning patterns whereby people jump to conclusions, reserving the right to retract them in the light of further information. Although technical in nature the book contains sections that outline basic issues by means of intuitive and simple examples. This book is primarily targeted at philosophers interested in the foundations of defeasible logic, logicians, and specialists in artificial intelligence and theoretical computer science.

Using conjunction as an example, I show a technical and philosophical problem when trying to conciliate the currently prevailing views on the meaning of logical connectives: the inferientialist (also called 'syntactic') one based on introduction and elimination rules, and the representationalist (also called 'semantic') one given through truth tables. Mostly I show that the widespread strategy of using the truth theoretical definition of logical consequence to collapse both definitions must be rejected by inferentialists. An important consequence of my argument is (...) that there are different notions of conjunction at play in standard first order logic, and that the technical and philosophical connections between them are far from well established. (shrink)

The theory of logical consequence is central in modern logic and its applications. However, it is mostly dispersed in an abundance of often difficultly accessible papers, and rarely treated with applications in mind. This book collects the most fundamental aspects of this theory and offers the reader the basics of its applications in computer science, artificial intelligence, and cognitive science, to name but the most important fields where this notion finds its many applications.

The theory of logical consequence is central in modern logic and its applications. However, it is mostly dispersed in an abundance of often difficultly accessible papers, and rarely treated with applications in mind. This book collects the most fundamental aspects of this theory and offers the reader the basics of its applications in computer science, artificial intelligence, and cognitive science, to name but the most important fields where this notion finds its many applications.

The theory of logical consequence is central in modern logic and its applications. However, it is mostly dispersed in an abundance of often difficultly accessible papers, and rarely treated with applications in mind. This book collects the most fundamental aspects of this theory and offers the reader the basics of its applications in computer science, artificial intelligence, and cognitive science, to name but the most important fields where this notion finds its many applications.

The theory of logical consequence is central in modern logic and its applications. However, it is mostly dispersed in an abundance of often difficultly accessible papers, and rarely treated with applications in mind. This book collects the most fundamental aspects of this theory and offers the reader the basics of its applications in computer science, artificial intelligence, and cognitive science, to name but the most important fields where this notion finds its many applications.

The theory of logical consequence is central in modern logic and its applications. However, it is mostly dispersed in an abundance of often difficultly accessible papers, and rarely treated with applications in mind. This book collects the most fundamental aspects of this theory and offers the reader the basics of its applications in computer science, artificial intelligence, and cognitive science, to name but the most important fields where this notion finds its many applications.

The theory of logical consequence is central in modern logic and its applications. However, it is mostly dispersed in an abundance of often difficultly accessible papers, and rarely treated with applications in mind. This book collects the most fundamental aspects of this theory and offers the reader the basics of its applications in computer science, artificial intelligence, and cognitive science, to name but the most important fields where this notion finds its many applications.

The theory of logical consequence is central in modern logic and its applications. However, it is mostly dispersed in an abundance of often difficultly accessible papers, and rarely treated with applications in mind. This book collects the most fundamental aspects of this theory and offers the reader the basics of its applications in computer science, artificial intelligence, and cognitive science, to name but the most important fields where this notion finds its many applications.

A number of authors have objected to the application of non-classical logic to problems in philosophy on the basis that these non-classical logics are usually characterised by a classical metatheory. In many cases the problem amounts to more than just a discrepancy; the very phenomena responsible for non-classicality occur in the field of semantics as much as they do elsewhere. The phenomena of higher order vagueness and the revenge liar are just two such examples. The aim of this paper is (...) to show that a large class of non-classical logics are strong enough to formulate their own model theory in a corresponding non-classical set theory. Specifically I show that adequate definitions of validity can be given for the propositional calculus in such a way that the metatheory proves, in the specified logic, that every theorem of the propositional fragment of that logic is validated. It is shown that in some cases it may fail to be a classical matter whether a given sentence is valid or not. One surprising conclusion for non-classical accounts of vagueness is drawn: there can be no axiomatic, and therefore precise, system which is determinately sound and complete. (shrink)

Following a result by De Rijke for modal logic, it is shown that the basic weak entailment model-theoretic language with absurdity is the maximal model-theoretic language having the finite occurrence property, preservation under relevant directed bisimulations and the finite depth property. This can be seen as a generalized preservation theorem characterizing propositional weak entailment formulas among formulas of other model-theoretic languages.

In this paper I argue against the commonly received view that Kripke's formal Possible World Semantics (PWS) reflects the adoption of a metaphysical interpretation of the modal operators. I consider in detail Kripke's three main innovations vis-à-vis Carnap's PWS: a new view of the worlds, variable domains of quantification, and the adoption of a notion of universal validity. I argue that all these changes are driven by the natural technical development of the model theory and its related notion of validity: (...) they are dictated by merely formal considerations, not interpretive concerns. I conclude that Kripke's model theoretic semantics does not induce a metaphysical reading of necessity, and is formally adequate independently of the specific interpretation of the modal operators. (shrink)

The new Bayesian paradigm in the psychology of reasoning aims to integrate the study of human reasoning, decision making, and rationality. It is supported by two findings. One, most people judge the probability of the indicative conditional, P(if A then B), to be the conditional probability, P(B|A), as implied by the Ramsey test. Two, they judge if A then B to be void when A is false. Their three-valued response table used to be called ‘defective’, but should be termed the (...) de Finetti table. We show how to study general de Finetti truth tables for negations, conjunctions, disjunctions, and conditionals. (shrink)

En este trabajo, me propongo discutir la plausibilidad de la tesis de que es posible captar las características modales del concepto intuitivo de consecuencia a través de un concepto de consecuencia definido generalizando sobre interpretaciones. Desde mi perspectiva, las argumentaciones que han ofrecido aquellos que, como Ray, quieren salvar el salto de lo general a lo modal, mostrando que hay suficientes interpretaciones como para representar las características modales de la noción preteórica de consecuencia, poseen un mismo tipo de limitación. La (...) misma es producto de la imposibilidad de contar con una interpretación de los cuantificadores suficientemente general como para abarcar sin restricción contextual alguna, la totalidad de las interpretaciones. Al mismo tiempo, sostengo que estos problemas están emparentados con los límites expresivos propios de la estrategia que intenta ofrecer una teoría matemática precisa del concepto de interpretación por medio de algún tipo de cuantificación sobre estructuras (sean estas conjuntistas o no). Por eso, tales límites expresivos no tienen que ver especialmente con los rasgos modales propiamente dichos del concepto de consecuencia, sino con la cuantificación irrestricta que el análisis requeriría para ser adecuado. (shrink)

It is widely accepted that a theory of truth for arithmetic should be consistent, but -consistency is a highly desirable feature for such theories. The point has already been made for first-order languages, though the evidence is not entirely conclusive. We show that in the second-order case the consequence of adopting -inconsistent theories of truth are considered: the revision theory of nearly stable truth T # and the classical theory of symmetric truth FS. Briefly, we present some conceptual problems with (...) ω-inconsistent theories, and demonstrate some technical results that support our criticisms of such theories. (shrink)

In the present commentary, I argue that Foster has attacked an uncharitable reconstruction of Etchemendy's argument against Tarski's account of the logical properties. I provide an alternative, more charitable reconstruction of that argument that withstands Foster's objections.

John Etchemendy (1990) has argued that Tarski's definition of logical consequence fails as an adequate philosophical analysis. Since then, Greg Ray (1996) has defended Tarski's analysis against Etchemendy's criticisms. Here, I'll argue that--even given Ray's defense of Tarski's definition--we may nevertheless lay claim to the conditional conclusion that 'if' Tarski intended a conceptual analysis of logical consequence, 'then' it fails as such. Secondly, I'll give some reasons to think that Tarski 'did' intend a conceptual analysis of logical consequence.

According to a prevalent view among philosophers formal logic is the philosopher’s main tool to assess the validity of arguments, i.e. the philosopher’s ars iudicandi. By drawing on a famous dispute between Russell and Strawson over the validity of a certain kind of argument – of arguments whose premises feature definite descriptions – this paper casts doubt on the accuracy of the ars iudicandi conception. Rather than settling the question whether the contentious arguments are valid or not, Russell and Strawson, (...) upon discussing the proper logical analysis of definite descriptions, merely contrast converse informal validity assessments rendered explicit by nonequivalent logical for-malizations. (shrink)

According to the standard opinions in the literature, blocking the unacceptable consequences of the notorious slingshot argument requires imposing constraints on the metaphysics of facts or on theories of definite descriptions (or class abstracts). This paper argues that both of these well-known strategies to rebut the slingshot overshoot the mark. The slingshot, first and foremost, raises the question as to the adequate logical formalization of statements about facts, i.e. of factual contexts. It will be shown that a rigorous application of (...) Quine’s maxim of shallow analysis to formalizations of factual contexts paves the way for an account of formalizing such contexts which blocks the slingshot without ramifications for theories of facts or definite descriptions. (shrink)