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.

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

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)

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)

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)

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)

This article identifies problems with regard to providing criteria that regulate the matching of logical formulae and natural language. We then take on to solve these problems by defining a necessary and sufficient criterion of adequate formalization. On the basis of this criterion we argue that logic should not be seen as an ars iudicandi capable of evaluating the validity or invalidity of informal arguments, but as an ars explicandi that renders transparent the formal structure of informal reasoning.

The aim of this paper is to show what sorts of logics are required by externalist and internalist accounts of the meanings of natural kind nouns. These logics give us a new perspective from which to evaluate the respective positions in the externalist-internalist debate about the meanings of such nouns. The two main claims of the paper are the following: first, that adequate logics for internalism and externalism about natural kind nouns are second-order logics; second, that an internalist second-order logic (...) is a free logic—a second order logic free of existential commitments for natural kind nouns, while an externalist second-order logic is not free of existential commitments for natural kind nouns—it is existentially committed. (shrink)

The logic RM and its basic fragments (always with implication) are considered here as entire consequence relations, rather than as sets of theorems. A new observation made here is that the disjunction of RM is definable in terms of its other positive propositional connectives, unlike that of R. The basic fragments of RM therefore fall naturally into two classes, according to whether disjunction is or is not definable. In the equivalent quasivariety semantics of these fragments, which consist of subreducts of (...) Sugihara algebras, this corresponds to a distinction between strong and weak congruence properties. The distinction is explored here. A result of Avron is used to provide a local deduction-detachment theorem for the fragments without disjunction. Together with results of Sobociski, Parks and Meyer (which concern theorems only), this leads to axiomatizations of these entire fragments — not merely their theorems. These axiomatizations then form the basis of a proof that all of the basic fragments of RM with implication are finitely axiomatized consequence relations. (shrink)

Free Semantics is based on normalized natural deduction for the weak relevant logic DW and its near neighbours. This is motivated by the fact that in the determination of validity in truth-functional semantics, natural deduction is normally used. Due to normalization, the logic is decidable and hence the semantics can also be used to construct counter-models for invalid formulae. The logic DW is motivated as an entailment logic just weaker than the logic MC of meaning containment. DW is the logic (...) focussed upon, but the results extend to MC. The semantics is called ‘free semantics’ since it is disjunctively and existentially free in that no disjunctive or existential witnesses are produced, unlike in truth-functional semantics. Such ‘witnesses’ are only assumed in generality and are not necessarily actual. The paper sets up the free semantics in a truth-functional style and gives a natural deduction interpetation of the meta-logical connectives. We then set out a familiar tableau-style system, but based on natural deduction proof rather than truth-functional semantics. A proof of soundness and completeness is given for a reductio system, which is a transform of the tableau system. The reductio system has positive and negative rules in place of the elimination and introduction rules of Brady’s normalized natural deduction system for DW. The elimination-introduction turning points become closures of threads of proof, which are at the points of contradiction for the reductio system. (shrink)

Describes the received theory of necessary and sufficient conditions, explains some standard objections to it, and lays out alternative ways of thinking about conditions and conditionals.

The standard deduction theorem or introduction rule for implication, for classical logic is also valid for intuitionistic logic, but just as with predicate logic, other rules of inference have to be restricted if the theorem is to hold for weaker implicational logics.In this paper we look in detail at special cases of the Gentzen rule for and show that various subsets of these in effect constitute deduction theorems determining all the theorems of many well known as well as not well (...) known implicational logics. In particular systems of rules are given which are equivalent to the relevance logics E,R, T, P-W and P-W-I. (shrink)

After a brief promenade on the several notions of translations that appear in the literature, we concentrate on three paradigms of translations between logics: ( conservative ) translations , transfers and contextual translations . Though independent, such approaches are here compared and assessed against questions about the meaning of a translation and about comparative strength and extensibility of a logic with respect to another.

We present a framework that provides a logic for science by generalizing the notion of logical (Tarskian) consequence. This framework will introduce hierarchies of logical consequences, the first level of each of which is identified with deduction. We argue for identification of the second level of the hierarchies with inductive inference. The notion of induction presented here has some resonance with Popper's notion of scientific discovery by refutation. Our framework rests on the assumption of a restricted class of structures in (...) contrast to the permissibility of classical first-order logic. We make a distinction between deductive and inductive inference via the notions of compactness and weak compactness. Connections with the arithmetical hierarchy and formal learning theory are explored. For the latter, we argue against the identification of inductive inference with the notion of learnable in the limit. Several results highlighting desirable properties of these hierarchies of generalized logical consequence are also presented. (shrink)

Though it is standardly assumed that supervaluationism applied to vagueness is committed to global validity, Achille Varzi (2007) argues that the supervaluationist should take seriously the idea of adopting local validity instead. Varzi’s motivation for the adoption of local validity is largely based on two objections against the global notion: that it brings some counterexamples to classically valid rules of inference and that it is inconsistent with unrestricted higher-order vagueness. In this discussion I review these objections and point out ways (...) to address them not considered in Varzi’s paper. (shrink)

It is often assumed that the supervaluationist theory of vagueness is committed to a global notion of logical consequence, in contrast with the local notion characteristic of modal logics. There are, at least, two problems related to the global notion of consequence. First, it brings some counterexamples to classically valid patterns of inference. Second, it is subject to an objection related to higher-order vagueness . This paper explores a third notion of logical consequence, and discusses its adequacy for the supervaluationist (...) theory. The paper proceeds in two steps. In the first step, the paper provides a deductive notion of consequence for global validity using the tableaux method. In the second step, the paper provides a notion of logical consequence which is an alternative to global validity, and discusses i) whether it is acceptable to the supervaluationist and ii) whether it plays a better role in a theory of vagueness in the face of the problems related to the global notion. (shrink)

. In this paper we address the question of recovering a logic system by combining two or more fragments of it. We show that, in general, by fibring two or more fragments of a given logic the resulting logic is weaker than the original one, because some meta-properties of the connectives are lost after the combination process. In order to overcome this problem, the categories Mcon and Seq of multiple-conclusion consequence relations and sequent calculi, respectively, are introduced. The main feature (...) of these categories is the preservation, by morphisms, of meta-properties of the consequence relations, which allows, in several cases, to recover a logic by fibring of its fragments. The fibring in this categories is called meta−fibring. Several examples of well-known logics which can be recovered by meta-fibring its fragments (in opposition to fibring in the usual categories) are given. Finally, a general semantics for objects in Seq (and, in particular, for objects in Mcon) is proposed, obtaining a category of logic systems called Log. A general theorem of preservation of completeness by fibring in Log is also obtained. (shrink)

This paper develops the first deontic logic in the context of paraconsistent logics.

The first known statements of the deduction theorems for the first-order predicate calculus and the classical sentential logic are due to Herbrand [8] and Tarski [14], respectively. The present paper contains an analysis of closure spaces associated with those sentential logics which admit various deduction theorems. For purely algebraic reasons it is convenient to view deduction theorems in a more general form: given a sentential logic C (identified with a structural consequence operation) in a sentential language I, a quite arbitrary (...) set P of formulas of I built up with at most two distinct sentential variables p and q is called a uniform deduction theorem scheme for C if it satisfies the following condition: for every set X of formulas of I and for any formulas and , C(X{{a}}) iff P(, ) AC(X). [P(, ) denotes the set of formulas which result by the simultaneous substitution of for p and for q in all formulas in P]. The above definition encompasses many particular formulations of theorems considered in the literature to be deduction theorems. Theorem 1.3 gives necessary and sufficient conditions for a logic to have a uniform deduction theorem scheme. Then, given a sentential logic C with a uniform deduction theorem scheme, the lattices of deductive filters on the algebras A similar to the language of C are investigated. It is shown that the join-semilattice of finitely generated (= compact) deductive filters on each algebra A is dually Brouwerian. (shrink)

We propose a new schema for the deduction theorem and prove that the deductive system S of a prepositional logic L fulfills the proposed schema if and only if there exists a finite set A(p, q) of propositional formulae involving only prepositional letters p and q such that A(p, p) L and p, A(p, q) s q.

This book presents novel formalizations of three of the most important medieval logical theories: supposition, consequence and obligations. In an additional fourth part, an in-depth analysis of the concept of formalization is presented - a crucial concept in the current logical panorama, which as such receives surprisingly little attention.Although formalizations of medieval logical theories have been proposed earlier in the literature, the formalizations presented here are all based on innovative vantage points: supposition theories as algorithmic hermeneutics, theories of consequence analyzed (...) with tools borrowed from model-theory and two-dimensional semantics, and obligations as logical games. For this reason, this is perhaps the first time that these medieval logical theories are made fully accessible to the modern philosopher and logician who wishes to obtain a better grasp of them, but who has always been held back by the lack of appropriate ‘translations' into modern terms.Moreover, the book offers a reflection on the very nature of logic, a reflection that is prompted by the comparisons between medieval and modern logic, their similarities and dissimilarities. It is thus a contribution not only to the history of logic, but also to the philosophy of logic, the philosophy of language and semantics.The analysis of medieval logic is also relevant for the modern philosopher and logician in that, being the unifying methodology used across all disciplines at that time, logic really provided unity to science. It thus presents a unified model of scientific investigation, where logic plays the aggregating role. (shrink)

On the basis of passages from John Buridan's Summula Suppositionibus and Sophismata, E. Karger has reconstructed what could be called the ?Buridanian theory of inferential relations between doubly quantified propositions?, presented in her 1993 article ?A theory of immediate inference contained in Buridan's logic?. In the reconstruction, she focused on the syntactical elements of Buridan's theory of modes of personal supposition to extract patterns of formally valid inferences between members of a certain class of basic categorical propositions. The present study (...) aims at offering semantic corroboration?a proof of soundness?to the inferential relations syntactically identified by E. Karger, by means of the analysis of Buridan's semantic definitions of the modes of personal supposition. The semantic analysis is done with the help of some modern logical concepts, in particular that of the model. In effect, the relations of inference syntactically established are shown to hold also from a semantic point of view, which means thus that this fragment of Buridan's logic can be said to be sound. (shrink)

"If you turn left at the next corner, you will see a blue house at the end of the street." That sentence -- a conditional -- might be true even though it is possible that you will not see a blue house at the end of the street when you turn left at the next corner. A moving van may block your view; the house may have been painted pink; a crow might swoop down and peck out your eyes. Still, (...) in some contexts, we might ignore these possibilities and correctly assert the conditional. In this book, Christopher Gauker argues that such context-relativity is the key to understanding the semantics of conditionals. Contexts are defined as objective features of the situation in which a conversation takes place, and the semantic properties of sentences -- conditionals included -- are defined in terms of assertibility in a context. One of the primary goals of a theory of conditionals has to be to distinguish correctly between valid and invalid arguments containing conditionals. According to Gauker, an argument is valid if the conclusion is assertible in every context in which the premises are assertible. This runs counter to what Gauker sees as a systematic misreading of the data by other authors, who judge arguments to be invalid if they can think of a context in which the premises are judged true and some other context in which the conclusion is judged false. Different schools of thought on conditionals reflect fundamentally different approaches to semantics. Gauker offers his theory as a motive and test case for a distinctive kind of semantics that dispenses with reference relations and possible worlds. (shrink)

A theory of reference may be either an analysis of reference or merely an account of the correct use of the verb "refer". If we define the validity of arguments in the standard way, in terms of assignments of individuals and sets to the nonlogical vocabulary of the language, then we will be committed to seeking an analysis of reference. Those who prefer a metalinguistic account, therefore, will desire an alternative to standard semantics. One alternative is the Quinean conception of (...) logical validity as essentially a matter of logical form. Another alternative is Leblanc's truth-value semantics. But these prove to be either inadequate for purposes of metatheory or philosophically unsatisfactory. This paper shows how validity (i.e., semantic consequence) may be defined in a way that avoid the problems facing these other alternatives to standard semantics and also permits a metalinguistic account of reference. The validity of arguments is treated as a matter of logical form, but validity for forms is defined on analogy with the definition of semantic consequence in truth-value semantics. (A more radical kind of semantics without reference is the context logical approach represented in several of my other publications.). (shrink)

This paper is obsolete. It is superseded by the book, Conditionals in Context, MIT Press, 2005.

A new solution to the liar paradox is developed using the insight that it is illegitimate to even suppose (let alone assert) that a liar sentence has a truth-status (true or not) on the grounds that supposing this sentence to be true/not-true essentially defeats the telos of supposition in a readily identifiable way. On that basis, the paradox is blocked by restricting the Rule of Assumptions in Gentzen-style presentations of the sequent-calculus. The lesson of the liar is that not all (...) assumptions are for free. One merit of this proposal is that it is free from the revenge problem. (shrink)

There are numerous contexts in which philosophers and others use model-theoretic methods in assessing the validity of ordinary arguments; consider, for example, the use of models built upon 'possible worlds' in examinations of modal arguments. But the relevant uses of model-theoretic techniques may seem to assume controversial semantic or metaphysical accounts of ordinary concepts. So, numerous philosophers have suggested that standard uses of model-theoretic methods in assessing the validity of modal arguments commit one to accepting that modal claims are to (...) be analysed in terms of possible worlds. The paper provides a very general account of how uses of model-theoretic methods in demonstrating facts about validity and invalidity may in fact often be uncoupled from controversial semantic or metaphysical theses, applying the resulting techniques to some modal cases in particular. (shrink)

The traditional view that all logical truths are metaphysically necessary has come under attack in recent years. The contrary claim is prominent in David Kaplan’s work on demonstratives, and Edward Zalta has argued that logical truths that are not necessary appear in modal languages supplemented only with some device for making reference to the actual world (and thus independently of whether demonstratives like ‘I’, ‘here’, and ‘now’ are present). If this latter claim can be sustained, it strikes close to the (...) heart of the traditional view. I begin this paper by discussing and refuting Zalta’s argument in the context of a language for propositional modal logic with an actuality connective (section 1). This involves showing that his argument in favor of real world validity his preferred explication of logical truth, is fallacious. Next (section 2) I argue for an alternative explication of logical truth called general validity. Since the rule of necessitation preserves general validity, the argument of section 2 provides a reason for affirming the traditional view. Finally (section 3) I show that the intuitive idea behind the discredited notion of real world validity finds legitimate expression in an object language connective for deep necessity. (shrink)

Although the use of possible worlds in semantics has been very fruitful and is now widely accepted, there is a puzzle about the standard definition of validity in possible-worlds semantics that has received little notice and virtually no comment. A sentence of an intensional language is typically said to be valid just in case it is true at every world under every model on every model structure of the language. Each model structure contains a set of possible worlds, and models (...) are defined relative to model structures, assigning truth-values to sentences at each world countenanced by the model structure. The puzzle is why more than one model structure is used in the definition of validity. There is presumably just one class of all possible worlds and just one model structure defined on this class that does correctly the things that model structures are supposed to do. (These include, but need not be limited to, specifying the set of individuals in each world as well as various accessibility relations between worlds.) Why not define validity simply as truth at every world under every model on this one model structure? What is the point of bringing in more model structures than just this one?

We investigate these questions in some detail and conclude that for many intensional languages the puzzle points to a genuine difficulty: the standard definition of validity is insufficiently motivated. We begin (Section 1) by showing that a plausible and natural account of validity for intensional languages can be based on a single model structure, and that validity so defined is analogous in important respects to the standard account of validity for extensional languages. We call this notion of validity "validity!", and in Section 2 we contrast it with the standard notion, which we call "validity2". Several attempts are made to discover a rationale for the almost universal acceptance of validity2, but in most of these attempts we come up empty-handed. So in Section 3 we investigate validity! for some intensional languages. Our investigation includes providing axiomatizations for several propositional and predicate logics, most of which are provably complete. The completeness proofs are given in the Appendix, which also contains a sketch of a compactness proof for one of the predicate logics. (shrink)

The model-theoretic analysis of the concept of logical consequence has come under heavy criticism in the last couple of decades. The present work looks at an alternative approach to logical consequence where the notion of inference takes center stage. Formally, the model-theoretic framework is exchanged for a proof-theoretic framework. It is argued that contrary to the traditional view, proof-theoretic semantics is not revisionary, and should rather be seen as a formal semantics that can supplement model-theory. Specifically, there are formal resources (...) to provide a proof-theoretic semantics for both intuitionistic and classical logic. We develop a new perspective on proof-theoretic harmony for logical constants which incorporates elements from the substructural era of proof-theory. We show that there is a semantic lacuna in the traditional accounts of harmony. A new theory of how inference rules determine the semantic content of logical constants is developed. The theory weds proof-theoretic and model-theoretic semantics by showing how proof-theoretic rules can induce truth-conditional clauses in Boolean and many-valued settings. It is argued that such a new approach to how rules determine meaning will ultimately assist our understanding of the apriori nature of logic. (shrink)

Donald Davidson has claimed that for every logical truth 5 of a language L, a theory of meaning for L will entail that S is a logical truth of L. Jim Edwards has argued (2002) that this claim is false if we take 'entails' to mean 'has as a logical consequence. In this paper, I first show that, pace Edwards, Davidson's claim is correct even under this strong reading. I then discuss the argument given by Edwards and offer a diagnosis (...) of where he went wrong. (shrink)

Stig Kanger (1924--1988) made important contributions to logic and formal philosophy. Kanger's most original achievements were in the areas of general proof theory, the semantics of modal and deontic logic, and the logical analysis of the concept of rights. But he contributed significantly to action theory, preference logic and the theory of measurement as well. The first volume is a complete collection of Kanger's philosophical papers. The second volume contains critical essays on the various aspects of Kanger's work as well (...) as some biographical sketches. (shrink)

Anderson and Belnap devise a model theory for entailment on which propositional identity equals proposional coentailment. This feature can be reasonably questioned. The authors devise two extensions of Anderson and Belnap’s model theory. Both systems preserve Anderson and Belnap’s results for entailment, but distinguish coentailment from identity.

We give a semantical account of propositional identity which is stronger than mutual entailment. That is, according to our account: (1) if A = B is true in a model, so are A 'validates' B and B 'validates' A. (2) There exist models m such that A 'validates' B and B 'validates' A are true in M but A = B is not true in m. according to our account the following rule is sound: (3) from (.. A..) = (.. (...) B..) infer A = B. The paper is a response to a paper by James Freeman to an earlier paper by us. (shrink)

Let A, B, C stand for sentences expressing propositions; let A be a component of C; let C A/B be just like C except for replacing some occurrence of A in C by an occurrence of B; let = be a binary connective for propositional identity read as ‘the proposition that __ is the very same proposition as …’. Then authors defend adding ‘from C = C A/B infer A = B’ to Prior’s rules for propositional identity, appearing in OBJECTS (...) OF THOUGHT. (shrink)

A formal, computational, semantically clean representation of natural language is presented. This representation captures the fact that logical inferences in natural language crucially depend on the semantic relation of entailment between sentential constituents such as determiner, noun, adjective, adverb, preposition, and verb phrases.The representation parallels natural language in that it accounts for human intuition about entailment of sentences, it preserves its structure, it reflects the semantics of different syntactic categories, it simulates conjunction, disjunction, and negation in natural language by computable (...) operations with provable mathematical properties, and it allows one to represent coordination on different syntactic levels. (shrink)

Everyday reasoning is replete with arguments which, though not logically valid, nonetheless harbor a measure of credibility in their own right. Here the claim that such arguments force us to acknowledge material validity, in addition to logical validity, is advanced, and criteria that attempt to unpack this concept are examined in detail. Of special concern is the effort to model these criteria on explications of logical validity that rely on notions of substitutivity and logical form. It is argued, however, that (...) such a parallel is not easily located and that it is uncertain that a construal of material validity can be fashioned after traditional accounts of logical validity. Attention is also given to the topics of enthymemes and to the proper domain of logic. (shrink)

The force and the deceptive nature of the fallacy of equivocation lies in its dialectical nature. The speaker redefines a word in order to classify a fragment of reality, while the hearer draws a conclusion based on the ordinary meaning of such a classification. This difference between the interlocutors’ meanings is grounded on a crucial epistemic gap: how is it possible to know our hearer’s mind, and his knowledge of the words we used? Building on Hamblin’s account of equivocation, the (...) speaker’s meaning and the manipulative strategies based on redefinitions can be explained as the conclusion of an implicit reasoning based on a presumption of ordinary meaning. (shrink)

The informal fallacies can be conceived as enthymemes that are formally valid. But, then, what accounts for our sense of their fallaciousness? I explain this in terms of the notion of a warrant.

An account of validity that makes what is invalid conditional on how many individuals there are is what I call a conditional account of validity. Here I defend conditional accounts against a criticism derived from Etchemendy’s well-known criticism of the model-theoretic analysis of validity. The criticism is essentially that knowledge of the size of the universe is non-logical and so by making knowledge of the extension of validity depend on knowledge of how many individuals there are, conditional accounts fail to (...) reflect that the former knowledge is basic, i.e., independent of knowledge derived from other sciences. Appealing to Russell’s pre-Principia logic, I defend conditional accounts against this criticism by sketching a rationale for thinking that there are infinitely many logical objects. (shrink)

I examine the theory of consequentia of the medieval logician, John Buridan. Buridan advocates a strict commitment to what we now call proposition-tokens as the bearers of truth-value. The analysis of Buridan's theory shows that, within a token-based semantics, amendments to the usual notions of inference and consequence are made necessary, since pragmatic elements disrupt the semantic behaviour of propositions. In my reconstruction of Buridan's theory, I use some of the apparatus of modern two-dimensional semantics, such as two-dimensional matrices and (...) the distinction between the context of formation and the context of evaluation of utterances. (shrink)

Attack at dawn if the weather is fine! The weather is fine. Therefore, attack at dawn!" Is this argument valid? If so, what does this show about the semantics of the imperative mood?

In the nineteenth century, the separation of naturalist or psychological accounts of validity from normative validity came into question. In his 1877 Logical Studies (Logische Studien), Friedrich Albert Lange argues that the basis for necessary inference is demonstration, which takes place by spatially delimiting the extension of concepts using imagined or physical diagrams. These diagrams are signs or indications of concepts' extension, but do not represent their content. Only the inference as a whole captures the objective content of the proof. (...) Thus, Lange argues, the necessity of an inference is independent of psychological accounts of how we grasp the content of a proposition. (shrink)

. This paper examines the underpinnings of the preservationist approach to characterizing inference relations. Starting with a critique of the ‘truth-preservation’ semantic paradigm, we discuss the merits of characterizing an inference relation in terms of preserving consistency. Finally we turn our attention to the generalization of consistency introduced in the early work of Jennings and Schotch, namely the concept of level.

In 1934 a most singular event occurred. Two papers were published on a topic that had (apparently) never before been written about, the authors had never been in contact with one another, and they had (apparently) no common intellectual background that would otherwise account for their mutual interest in this topic.1 These two papers formed the basis for a movement in logic which is by now the most common way of teaching elementary logic by far, and indeed is perhaps all (...) that is known in any detail about logic by a number of philosophers (especially in North America). This manner of proceeding in logic is called ‘natural deduction’. And in its own way the instigation of this style of logical proof is as important to the history of logic as the discovery of resolution by Robinson in 1965, or the discovery of the logistical method by Frege in 1879, or even the discovery of the syllogistic by Aristotle in the fourth century BC. (shrink)

The proof of correctness and completeness of a logical calculus w.r.t. a given semantics can be read as telling us that the tautologies (or, more gen erally, the relation of consequence) specified in a model theoretic way can be equally well specified in a proof theoretic way, by means of the calculus (as the theorems, resp. the relation of inferability of the calculus). Thus we know that both for the classical propositional calculus and for the clas sical predicate calculus theorems (...) and tautologies represent two sides of the same coin. We also know that the relation of inference as instituted by any of the common axiom systems of the classical propositional calculus coin cides with the relation of consequence defined in terms of the truth tables; whereas the situation is a little bit more complicated w.r.t. the classical predicate calculus (the coincidence occurs if we restrict ourselves to closed ∀xFx is inferable from Fx without being its conse formulas; otherwise.. (shrink)

In the Tractatus Wittgenstein criticizes Frege and Russell's view that laws of inference (Schlussgesetze) "justify" logical inferences. What lies behind this criticism, I argue, is an attack on Frege and Russell's conceptions of logical entailment. In passing, I examine Russell's dispute with Bradley on the question whether all relations are "internal".

Being a pragmatic and not a referential approach tosemantics, the dialogical formulation ofparaconsistency allows the following semantic idea tobe expressed within a semi-formal system: In anargumentation it sometimes makes sense to distinguishbetween the contradiction of one of the argumentationpartners with himself (internal contradiction) and thecontradiction between the partners (externalcontradiction). The idea is that externalcontradiction may involve different semantic contextsin which, say A and ¬A have been asserted.The dialogical approach suggests a way of studying thedynamic process of contradictions through which thetwo (...) contexts evolve for the sake of argumentation intoone system containing both contexts.More technically, we show a new, dialogical, way tobuild paraconsistent systems for propositional andfirst-order logic with classical and intuitionisticfeatures (i.e. paraconsistency both with and withouttertium non-datur) and present theircorresponding tableaux. (shrink)

Many of the discussions about conditionals can best be put as follows:can those conditionals that involve an entailment relation be formulatedwithin a formal system? The reasons for the failure of the classical approachto entailment have usually been that they ignore the meaning connectionbetween antecedent and consequent in a valid entailment. One of the firsttheories in the history of logic about meaning connection resulted from thestoic discussions on tightening the relation between the If- and the Then-parts of conditionals, which in this (...) context was called (connection). This theory gave a justification for the validity of what we todayexpress through the formulae ¬(a ¬ a) and ¬(¬ a a). Hugh MacColl and, more recently, Storrs McCall (from 1877 to 1906 and from1963 to 1975 respectively) searched for a formal system in which the validity ofthese formulae could be expressed. Unfortunately neither of the resulting systems is very satisfactory. In this paper we introduce dialogical games with the help of a new connexive If-Then (), the structural rules of which allow the Proponent to develop (formal) winning strategies not only for the above-mentioned connexive theses but also for (a b) ¬(a ¬ b) and (a b) ¬(¬ a b). Further on, we developthe corresponding tableau systems and conclude with some remarks on possibleperspectives and consequences of the dialogical approach to connexivity including the loss of uniform substitution leading to a new concept of logical form. (shrink)

There is little doubt that a second-order axiomatization of Zermelo-Fraenkel set theory plus the axiom of choice (ZFC) is desirable. One advantage of such an axiomatization is that it permits us to express the principles underlying the first-order schemata of separation and replacement. Another is its almost-categoricity: M is a model of second-order ZFC if and only if it is isomorphic to a model of the form Vκ, ∈ ∩ (Vκ × Vκ) , for κ a strongly inaccessible ordinal.

Many authors (see e.g. [HW92], [HW94], [Par90], [Res83], [Res85], [Sha93], [Sha97]) have argued that nominalistic programmes in the philosophy of mathematics fail, since they will at some point or other involve the notion of logical consequence which is unavailable to the nominalist. In this paper we will argue that this is not the case. Using an idea of Nelson Goodman and W.V. Quine’s which they developed in [GQ47] and supplementing it with means that should be nominalistically acceptable, we present a (...) way to explicate logical consequence in a nominalistically acceptable way. (shrink)

In a series of publications beginning in the 1980s, John Etchemendy has argued that the standard semantical account of logical consequence, due in its essentials to Alfred Tarski, is fundamentally mistaken. He argues that, while Tarski's definition requires us to classify the terms of a language as logical or non-logical, no such division is guaranteed to deliver the correct extension of our pre-theoretical or intuitive consequence relation. In addition, and perhaps more importantly, Tarski's account is claimed to be incapable of (...) explaining an essential modal/epistemological feature of consequence, namely, its necessity and apriority. Bernard Bolzano (1781-1848) is widely recognized as having anticipated Tarski's definition in his Wissenschaftslehre (or Theory of Science ) of 1837. Because of the similarities between his account and Tarski's, Etchemendy's arguments have also been extended to cover Bolzano. The purpose of this article is to consider Bolzano's theory in the light of these criticisms. We argue that, due to important differences between Bolzano's and Tarski's theories, Etchemendy's objections do not apply immediately to Bolzano's account of consequence. Moreover, Bolzano's writings contain the elements of a detailed philosophical response to Etchemendy. (shrink)

According to John A Barker, whether an argument begs the question is purely a matter of logical form (Dialogue, 1976). According to me, it is also a matter of epistemic conditions; some arguments which beg the question in some contexts need not beg the question in every context (Analysis, 1972). I point out difficulties in Barker's treatment and defend my own views against some of his criticisms. In the concluding section, "Alleged difficulties with disjunctive syllogism," I defend the validity of (...) disjunctive syllogism against the views of Alan Ross Anderson and Nuel D Belnap, Jr., ask pointed questions about the notion of intensional disjunction, and suggest how my treatment of begging the question can be extended to deal with the so-called paradoxes of strict implication. (shrink)

We give a semantical account of propositional identity which is stronger than mutual entailment. That is, according to our account: (1) if A = B is true in a model, so are A 'validates' B and B 'validates' A. (2) There exist models m such that A 'validates' B and B 'validates' A are true in M but A = B is not true in m. according to our account the following rule is sound: (3) from (.. A..) = (.. (...) B..) infer A = B. The paper respondes to a criticism of an earlier paper by James Freeman . (shrink)

Fibring is recognized as one of the main mechanisms in combining logics, with great signicance in the theory and applications of mathematical logic. However, an open challenge to bring is posed by the collapsing problem: even when no symbols are shared, certain combinations of logics simply collapse to one of them, indicating that bring imposes unwanted interconnections between the given logics. Modulated bring allows a ner control of the combination, solving the collapsing problem both at the semantic and deductive levels. (...) Main properties like soundness and completeness are shown to be preserved, comparison with bring is discussed, and some important classes of examples are analyzed with respect to the collapsing problem. (shrink)

Deflationists about truth seek to undermine debates about the nature of truth by arguing that the truth predicate is merely a device that allows us to express a certain kind of generality. I argue that a parallel approach is available in the case of logical consequence. Just as deflationism about truth offers an alternative to accounts of truth's nature in terms of correspondence or justification, deflationism about consequence promises an alternative to model-theoretic or proof-theoretic accounts of consequence's nature. I then (...) argue, against considerations put forward by Field and Beall, that Curry's paradox no more rules out deflationism about consequence than the liar paradox rules out deflationism about truth. (shrink)

The purpose of this paper is to present a thought experiment and argument that spells trouble for “radical” deflationism concerning meaning and truth such as that advocated by the staunch nominalist Hartry Field. The thought experiment does not sit well with any view that limits a truth predicate to sentences understood by a given speaker or to sentences in (or translatable into) a given language, unless that language is universal. The scenario in question concerns sentences that are not understood but (...) are known to be logical consequences of known and understood sentences. Ultimately, the issue turns on the notion of logical consequence that is available to various versions of deflationism. (shrink)

Typically, a logic consists of a formal or informal language together with a deductive system and/or a model-theoretic semantics. The language is, or corresponds to, a part of a natural language like English or Greek. The deductive system is to capture, codify, or simply record which inferences are correct for the given language, and the semantics is to capture, codify, or record the meanings, or truth-conditions, or possible truth conditions, for at least part of the language.

We provide for the first time an exact translation into English of the Polish version of Alfred Tarski's classic 1936 paper, whose title we translate as ?On the Concept of Following Logically?. We also provide in footnotes an exact translation of all respects in which the German version, used as the basis of the previously published and rather inexact English translation, differs from the Polish. Although the two versions are basically identical, to an extent that is even uncanny, we note (...) more than 400 differences. Several dozen of these are substantive differences due to revisions by Tarski to the Polish version which he did not incorporate in the German version. With respect to these revisions the Polish version should be regarded as more authoritative than the German. Hence scholars limited to an English translation should use ours. (shrink)

We argue that the unexpected examination paradox can be regarded as showing that the logic of temporally indexed epistemic states, although it is intuitively appealing, cannot be recursively axiomatised.

Supervaluationism is often described as the most popular semantic treatment of indeterminacy. There’s little consensus, however, about how to fill out the barebones idea to include a characterization of logical consequence. In a recent paper, Achille Varzi writes: it is pretty clear that there is not just one supervaluational semantics out there–there are lots of such semantics; and although it is true that they all exploit the same insight, their relative differences are by no means immaterial . . . a (...) lot depends on how a given supervaluationally machinery is brought into play when it comes to explaining the logic of the language. (Varzi, forthcoming, p.463) The ‘supervaluational machinery’ to be discussed here is the idea of a supervaluational model defined below. Varzi highlights the fact that that all sorts of properties of sequents that are candidates for the name ‘validity’ can be defined using the resources of supervaluational models. (shrink)

In the literature on supervaluationism, a central source of concern has been the acceptability, or otherwise, of its alleged logical revisionism. I attack the presupposition of this debate: arguing that when properly construed, there is no sense in which supervaluational consequence is revisionary. I provide new considerations supporting the claim that the supervaluational consequence should be characterized in a ‘global’ way. But pace Williamson 1994) and Keefe (2000), I argue that supervaluationism does not give rise to counterexamples to familiar inference-patterns (...) such as reductio and conditional proof. (shrink)

In this paper I argue that Beall and Restall's claim that there is one true logic of metaphysical modality is incompatible with the formulation of logical pluralism that they give. I investigate various ways of reconciling their pluralism with this claim, but conclude that none of the options can be made to work.

I argue that, contra the claims of Knuuttila and Dumont, Scotus can not be credited with the invention of possible worlds semantics.