This paper defends the view that the classification of an argument as being deductive ought to rest exclusively upon psychological considerations; specifically, upon whether the argument's author holds certain beliefs. This account is justified on theoretical and pedagogical grounds, and situated within a general taxonomy of competing proposals. Epistemological difficulties involved in the application of psychological definitions are recognized but claimed to be ineliminable from the praetice of argumentation. The paper concludes by discussing embryonic arguments where the author's relevant beliefs (...) are not sufficiently fine-grained so as to accord the argument deductive or inductive status. (shrink)

This paper investigates the strange case of an argument that was directed against a positivist verification principle. We find an early occurrence of the argument in a talk by the phenomenologist Roman Ingarden at the 1934 International Congress of Philosophy in Prague, where Carnap and Neurath were present and contributed short rejoinders. We discuss the underlying presuppositons of the argument, and we evaluate whether the attempts by Carnap (especially) actually succeed in answering this argument. We think they don’t, and offer (...) instead a few sociological thoughts about why the argument seems to have disappeared from the profession’s evaluaton of the positivist criterion of verifiability. (shrink)

THINKER is an automated natural deduction first-order theorem proving program. This paper reports on how it was adapted so as to prove theorems in modal logic. The method employed is an indirect semantic method, obtained by considering the semantic conditions involved in being a valid argument in these modal logics. The method is extended from propositional modal logic to predicate modal logic, and issues concerning the domain of quantification and existence in a world's domain are discussed. Finally, we look at (...) the very interesting issues involved with adding identity to the theorem prover in the realm of modal predicate logic. Various alternatives are discussed. (shrink)

Although resolution-based inference is perhaps the industry standard in automated theorem proving, there have always been systems that employed a different format. For example, the Logic Theorist of 1957 produced proofs by using an axiomatic system, and the proofs it generated would be considered legitimate axiomatic proofs; Wang’s systems of the late 1950’s employed a Gentzen-sequent proof strategy; Beth’s systems written about the same time employed his semantic tableaux method; and Prawitz’s systems of again about the same time are often (...) said to employ a natural deduction format. [See Newell, et al (1957), Beth (1958), Wang (1960), and Prawitz et al (1960)]. Like sequent proof systems and tableaux proof systems, natural deduction systems retain.. (shrink)

In this paper I examine some research on how to diminish or eliminate stereotype threat in mathematics. Some of the successful strategies include: informing our students about stereotype threat, challenging the idea that logical intelligence is an “innate” ability, making students In threatened groups feel welcomed, and introducing counter-stereotypical role models. The purpose of this paper is to take these strategies that have proven successful and come up with specific ways to incorporate them into introductory logic classes. For example, the (...) possible benefit of presenting logic to our undergraduate students by concentrating on aspects of logic that do not result in a clash of schemas. (shrink)

In the following the details of a state-of-affairs semantics for positive free logic are worked out, based on the models of common inner domain - outer domain semantics. Lambert's PFL system is proven to be weakly adequate (i.e., sound and complete) with respect to that semantics by demonstrating that the concept of logical truth definable therein coincides with that one of common truth-value semantics for PFL. Furthermore, this state-of-affairs semantics resists the challenges stemming from the slingshot argument since logically equivalent (...) statements do not always have the same extension according to it. Finally, it is argued that in such a semantics all statements of a certain language for PFL are state-of-affairs-related extensional as well as salva extensione extensional, even though their salva veritate extensionality fails. (shrink)

This paper presents a sound and complete proof system for the first order fragment of Discourse Representation Theory. Since the inferences that human language users draw from the verbal input they receive for the most transcend the capacities of such a system, it can be no more than a basis on which more powerful systems, which are capable of producing those inferences, may then be built. Nevertheless, even within the general setting of first order logic the structure of the formulas (...) of DRS-languages, i.e. of the Discourse Representation Structures suggest for the components of such a system inference rules that differ somewhat from those usually found in proof systems for the first order predicate calculus and which are, we believe, more in keeping with inference patterns that are actually employed in common sense reasoning.This is why we have decided to publish the present exercise, in spite of the fact that it is not one for which a great deal of originality could be claimed. In fact, it could be argued that the problem addressed in this paper was solved when Gödel first established the completeness of the system of Principia Mathematica for first order logic. For the DRS-languages we consider here are straightforwardly intertranslatable with standard formulations of the predicate calculus; in fact the translations are so straightforward that any sound and complete proof system for first order logic can be used as a sound and complete proof system for DRSs: simply translate the DRSs into formulas of predicate logic and then proceed as usual. As a matter of fact, this is how one has chosen to proceed in some implementations of DRT, which involve inferencing as well as semantic representation; an example is the Lex system developed jointly by IBM and the University of Tübingen ). (shrink)

This paper presents the main aspects of the views of the Tibetan logician Phya pa Chos kyi seng ge (1109–1169) on argumentation “by consequence” (thal ʼgyur, Skt. prasaṅga) based on his exposition of the topic in the fifth chapter of his Tshad ma yid kyi mun sel and on a parallel excursus in his commentary on Dharmakīrti’s Pramānaviniścaya. It aims at circumscribing primarily the nature and function of consequences (thal ʼgyur/thal ba) for this author—in particular the distinction between “proving consequences” (...) and “refuting consequences”—and the form prescribed for their enunciation in the context of debate. In addition to pointing out differences with the systems adopted by his predecessors, contemporaries and successors, the paper also discusses some of the similarities and differences between Phya pa’s understanding of argumentation by consequence and the notion of reductio ad absurdum in Western logic. (shrink)

There is no concept more central to logic and critical thinking than the concept of an argument. I here address the definition of ‘argument’ in the logical sense of the term and defend the claim that many current proposals, once they are interpreted in a way that makes them sufficiently precise, are extensionally inadequate. Definitions found in some contemporary, prominent critical thinking textbooks will serve as a springboard. I claim that each may be interpreted in an absolutist way or a (...) relativistic way, yet all turn out to be objectionable no matter which route is taken. I finish with a proposal on which the definition of ‘argument’ is an absolutist one, yet one that avoids the problems discussed for the earlier proposals. (shrink)

Natural deduction is the type of logic most familiar to current philosophers, and indeed is all that many modern philosophers know about logic. Yet natural deduction is a fairly recent innovation in logic, dating from Gentzen and Jaśkowski in 1934. This article traces the development of natural deduction from the view that these founders embraced to the widespread acceptance of the method in the 1960s. I focus especially on the different choices made by writers of elementary textbooks—the standard conduits of (...) the method to a generation of philosophers—with an eye to determining what the ‘essential characteristics’ of natural deduction are. (shrink)

A critical examination of the dialectical approach, focusing on a comparison ofthe illative and the dialectical definitions of argument. I distinguish a moderate, a strong and a hyper dialectical conception of argument. I critique Goldman's argument for the moderate conception and Johnson's argument for the strong conception, and argue that the moderate conception is correct.

The general theory of variable binding term operators is an interesting recent development in logic. It opens up a rich class of semantic and model-theoretic problems. In this paper we survey the recent literature on the topic, and offer some remarks on its significances and on its connections with other branches of mathematical logic.

Rooth & Partee (1982) and Rooth (1985) have shown that the English-specific rule-by-rule system of PTQ can be factored out into function application plus two transformations for resolving type mismatch (type lifting and variable binding). Building on these insights, this article proposes a universal system for type-driven translation, by adding two more innovations: local type determination for gaps (generalizing Montague 1973) and a set of semantic filters (extending Cooper 1983). This system, dubbed Cross-Linguistic Semantics (XLS), is shown to account for (...) various phenomena — including scope relations in English and Greenlandic Eskimo, internally headed relative clauses in Lakhota, serial verbs in Yoruba and VP ellipsis in English. (shrink)

En este estudio analizamos dos tendencias claramente distintas y contrapuestas en la forma de impartir cursos elementales de Lógica en la formación superior. Para este propósito, se ha seleccionado una muestra de manuales angloamericanos clásicos, así como otra más pequeña de la tradición iberoamericana para comprobar nuestras hipótesis. Los estilos identificados y analizados en dichos manuales son lo que hemos denominado lógica matemática y lógica para filósofos. En ambos casos se trata de tendencias muy generales reconocibles en las más diversas (...) tradiciones locales. El periodo analizado, 1940-1980, responde al proceso de introducción de la Lógica contemporánea en el ámbito académico occidental. (shrink)

The Law of Non-Contradiction holds that both sides of a contradiction cannot be true. Dialetheism is the view that there are contradictions both sides of which are true. Crucial to the dispute, then, is the central notion of contradiction. My first step here is to work toward clarification of that simple and central notion: Just what is a contradiction?

The Barber paradox is often introduced as a popular version of Russell’s paradox, though some experts have denied their similarity, evencalling the Barber paradox a pseudoparadox. In the first part of thepaper, I demonstrate mainly that in the standard (Quinean) defini-tion of a paradox the Barber paradox is a clear-cut example of a non-paradox. Despite some outward similarities, it differs radically fromRussell’s paradox. I also expose many other differences. In the secondpart of the paper, I examine a probable source of (...) the paradoxicality ofthe Barber paradox, which is found in a certain ambivalence in terms ofmeaning. The two different readings of the crucial phrase yield distinctexistential assumptions which produce the paradoxical conclusion. (shrink)

In ‘On Denoting’ and to some extent in ‘Review of Meinong and Others, Untersuchungen zur Gegenstandstheorie und Psychologie’, published in the same issue of Mind (Russell, 1905a,b), Russell presents not only his famous elimination (or contextual defi nition) of defi nite descriptions, but also a series of considerations against understanding defi nite descriptions as singular terms. At the end of ‘On Denoting’, Russell believes he has shown that all the theories that do treat defi nite descriptions as singular terms fall (...) logically short: Meinong’s, Mally’s, his own earlier (1903) theory, and Frege’s. (He also believes that at least some of them fall short on other grounds—epistemological and metaphysical—but we do not discuss these criticisms except in passing). Our aim in the present paper is to discuss whether his criticisms actually refute Frege’s theory. We fi rst attempt to specify just what Frege’s theory is and present the evidence that has moved scholars to attribute one of three different theories to Frege in this area. We think that each of these theories has some claim to be Fregean, even though they are logically quite different from each other. This raises the issue of determining Frege’s attitude towards these three theories. We consider whether he changed his mind and came to replace one theory with another, or whether he perhaps thought that the different theories applied to different realms, for example, to natural language versus a language for formal logic and arithmetic. We do not come to any hard and fast conclusion here, but instead just note that all these theories treat defi nite descriptions as singular terms, and that Russell proceeds as if he has refuted them all. After taking a brief look at the formal properties of the Fregean theories (particularly the logical status of various sentences containing nonproper defi - nite descriptions) and comparing them to Russell’s theory in this regard, we turn to Russell’s actual criticisms in the above-mentioned articles to examine the extent to which the criticisms hold.. (shrink)

Building on the work of Peter Hinst and Geo Siegwart, we develop a pragmatised natural deduction calculus, i.e., a natural deduction calculus that incorporates illocutionary operators at the formal level, and prove its adequacy. In contrast to other linear calculi of natural deduction, derivations in this calculus are sequences of object-language sentences which do not require graphical or other means of commentary in order to keep track of assumptions or to indicate subproofs.

Building on the work of Peter Hinst and Geo Siegwart, we develop a pragmatised natural deduction calculus, i.e. a natural deduction calculus that incorporates illocutionary operators at the formal level, and prove its adequacy. In contrast to other linear calculi of natural deduction, derivations in this calculus are sequences of object-language sentences which do not require graphical or other means of commentary in order to keep track of assumptions or to indicate subproofs. (Translation of our German paper "Ein Redehandlungskalkül. Ein (...) pragmatisierter Kalkül des natürlichen Schließens nebst Metatheorie"; online available at http://philpapers.org/rec/CORERE.). (shrink)

Wir stellen einen pragmatisierten Kalkül des natürlichen Schließens vor, der sich dadurch auszeichnet, dass Ableitungen reine Folgen objektsprachlicher Sätze sind und ohne graphische oder andere Kommentarmittel auskommen.