The Joint International Conference on Logic Programming, sponsored by the Association for Logic Programming, is a major forum for presentations of research, applications, and implementations in this important area of computer science. Logic programming is one of the most promising steps toward declarative programming and forms the theoretical basis of the programming language Prolog and its various extensions. Logic programming is also fundamental to work in artificial intelligence, where it has been used for nonmonotonic and commonsense (...) reasoning, expert systems implementation, deductive databases, and applications such as computer-aided manufacturing. Krzysztof R. Apt is project leader at the Centre for Mathematics and Computer Science in Amsterdam and part-time Professor in Computer Science at the University of Amsterdam. Topics covered: Theory Foundations. Programming Languages. Implementation. Programming Methodologies and Tools. Applications. Deductive Databases. Artificial Intelligence. Parallelism. (shrink)

Mathematicians often speak of conjectures as being confirmed by evidence that falls short of proof. For their own conjectures, evidence justifies further work in looking for a proof. Those conjectures of mathematics that have long resisted proof, such as Fermat's Last Theorem and the Riemann Hypothesis, have had to be considered in terms of the evidence for and against them. It is argued here that it is not adequate to describe the relation of evidence to hypothesis as `subjective', `heuristic' or (...) `pragmatic', but that there must be an element of what it is rational to believe on the evidence, that is, of non-deductive logic. (shrink)

This chapter contains sections titled: Introduction Statements The Square of Opposition Figure and Mood Deduction Counterexamples Independence Soundness Completeness: Syllogistic Arguments Completeness: Categorical Arguments Completeness: Arguments in General Note Bibliography.

This introduction to the basic forms of deductive inference as evaluated by methods of modern symbolic logic is de­signed for sophomore-junior-level stu­dents ready to specialize in the study of deductive logic. It can be used also for an introductory logic course. The inde­pendence of many sections allows the instructor utmost flexibility. The text consists of eight chapters, the first six of which are designed to intro­duce the student to basic topics of sen­tence and predicate (...) class='Hi'>logic. The last two chapters extend the procedures of the first six to alethic modal logic, the logic of imperatives, and deontic logic. Throughout the text there is an attempt to relate symbolic techniques to issues in the philosophy of logic. (shrink)

Deductive Logic is designed as an intermediate-level text directed at upper-division students from philosophy and the humanities. Its focus is exclusively on deductive logic, avoiding altogether topics such as informal reasoning and scientific method normally included in introductory logic courses. Its exposition of logical topics is informal, with emphasis on explaining the basic concepts and procedures of modern symbolic logic in the simplest and most intuitive manner possible rather than on developing a rigorous formal (...) system and providing proofs of its properties. The fact that the text presupposes a course offered to philosophy students and serves to introduce them to logic as the "language of philosophy" has strongly influenced the selection of topics. The topics here are controversial, and the problems not easily resolved, but this text strives to relate the formal logical structures introduced to issues of philosophic interest. (shrink)

This text provides a straightforward, lively but rigorous, introduction to truth-functional and predicate logic, complete with lucid examples and incisive exercises, for which Warren Goldfarb is renowned.

Mathematicians often speak of conjectures, yet unproved, as probable or well-confirmed by evidence. The Riemann Hypothesis, for example, is widely believed to be almost certainly true. There seems no initial reason to distinguish such probability from the same notion in empirical science. Yet it is hard to see how there could be probabilistic relations between the necessary truths of pure mathematics. The existence of such logical relations, short of certainty, is defended using the theory of logical probability (or objective Bayesianism (...) or non-deductive logic), and some detailed examples of its use in mathematics surveyed. Examples of inductive reasoning in experimental mathematics are given and it is argued that the problem of induction is best appreciated in the mathematical case. (shrink)

This text offers an innovative approach to the teaching of logic, which is rigorous but entirely non-symbolic. By introducing students to deductive inferences in natural language, the book breaks new ground pedagogically. Cannon focuses on such topics as using a tableaux technique to assess inconsistency; using generative grammar; employing logical analyses of sentences; and dealing with quantifier expressions and syllogisms. An appendix covers truth-functional logic.

THE INDICATIVE CONDITIONAL. A PROBABILISTIC CRITERION OF SOUNDNESS FOR DEDUCTIVE INFERENCES Our objective in this section is to establish a prima facie case ...

This article investigates the nature of Aristotelian syllogistics and shows that the categorical syllogism is fundamentally about showing the connection, in the premises of the syllogism, between the major and minor terms as stated in the conclusion. It discusses how this is important for the use of the syllogism in scientific demonstration. The article then examines modern deductive logic with an eye to they way in which it contrasts with Aristotelian syllogistics. It shows howmodern logic is about (...) making necessary connections between each proposition by means of external or second order rules. In the syllogism, on the other hand, the necessity between the premises as a whole unit and the conclusion is based on the internal middle term. The article concludes with a discussion of Günther Patzig’s claim that Aristotelian syllogisms are best thought of as tautological propositions. If this were the case, then the differences asserted to exist between syllogistic and modern logic would not hold. However, it is shown that Patzig’s assimilation of syllogistics to modern deductive logic is illegitimate. (shrink)

This article investigates the nature of Aristotelian syllogistics and shows that the categorical syllogism is fundamentally about showing the connection, in the premises of the syllogism, between the major and minor terms as stated in the conclusion. It discusses how this is important for the use of the syllogism in scientific demonstration. The article then examines modern deductive logic with an eye to they way in which it contrasts with Aristotelian syllogistics. It shows howmodern logic is about (...) making necessary connections between each proposition by means of external or second order rules. In the syllogism, on the other hand, the necessity between the premises as a whole unit and the conclusion is based on the internal middle term. The article concludes with a discussion of Günther Patzig’s claim that Aristotelian syllogisms are best thought of as tautological propositions. If this were the case, then the differences asserted to exist between syllogistic and modern logic would not hold. However, it is shown that Patzig’s assimilation of syllogistics to modern deductive logic is illegitimate. (shrink)

This book stands at the intersection of two topics: the decidability and computational complexity of hybrid logics, and the deductive systems designed for them. Hybrid logics are here divided into two groups: standard hybrid logics involving nominals as expressions of a separate sort, and non-standard hybrid logics, which do not involve nominals but whose expressive power matches the expressive power of binder-free standard hybrid logics.The original results of this book are split into two parts. This division reflects the division (...) of the book itself. The first type of results concern model-theoretic and complexity properties of hybrid logics. Since hybrid logics which we call standard are quite well investigated, the efforts focused on hybrid logics referred to as non-standard in this book. Non-standard hybrid logics are understood as modal logics with global counting operators ) whose expressive power matches the expressive power of binder-free standard hybrid logics. The relevant results comprise: 1. Establishing a sound and complete axiomatization for the modal logic K with global counting operators ), which can be easily extended onto other frame classes, 2. Establishing tight complexity bounds, namely NExpTime-completeness for the modal logic with global counting operators defined over the classes of arbitrary, reflexive, symmetric, serial and transitive frames ), MT), MD), MB), MK4) with numerical subscripts coded in binary. Establishing the exponential-size model property for this logic defined over the classes of Euclidean and equivalential frames ), MS5).Results of the second type consist of designing concrete deductive systems for standard and non-standard hybrid logics. More precisely, they include: 1. Devising a prefixed and an internalized tableau calculi which are sound, complete and terminating for a rich class of binder-free standard hybrid logics. An interesting feature of indicated calculi is the nonbranching character of the rule, 2. Devising a prefixed and an internalized tableau calculi which are sound, complete and terminating for non-standard hybrid logics. The internalization technique applied to a tableau calculus for the modal logic with global counting operators is novel in the literature, 3. Devising the first hybrid algorithm involving an inequality solver for modal logics with global counting operators. Transferring the arithmetical part of reasoning to an inequality solver turned out to be sufficient in ensuring termination.The book is directed to philosophers and logicians working with modal and hybrid logics, as well as to computer scientists interested in deductive systems and decision procedures for logics. Extensive fragments of the first part of the book can also serve as an introduction to hybrid logics for wider audience interested in logic.The content of the book is situated in the areas of formal logic and theoretical computer science with some elements of the theory of computational complexity. (shrink)

Warren Goldfarb, Deductive Logic, Hackett Publishing Company, 2003.    : 0872206602. Deductive Logic is an introductory textbook in formal logic. The book is divided into four parts covering truth-functional logic, monadic quantifi- cation, polyadic quantification and names and identity, and there are exercises for all these topics at the end of the book. In the truth-functional logic part, the reader learns to produce paraphrases of English statements and arguments in logical notation, (...) then about the semantic properties of such paraphrased statements and arguments, such as satisfiability, implication and equivalence and finally there is an axiomatic proof method and some important extras such as disjunctive normal form and expressive adequacy. Parts two and three mirror this analysis/assessment/reflection structure for monadic and polyadic quantification, though this time the proof system is a natural deduction one, and part three contains a completeness proof for that system. The fourth part of the book introduces names, the identity predicate and descriptions and examines the additional expressive power which these provide. I do not think there should be any doubt that this is an excellent book; it presents the essential topics of a first logic course with accuracy, clarity and attention to detail, and it makes material that can be confusing the first time round—say, the translation of conditionals—transparent and easy to understand. But there are a lot of good introductory logic textbooks out there, so I will say something about how it resembles and differs from some other books, and then discuss one minor irritation with this one. (shrink)

Clear focus on its application of formal logic to ordinary English is the most distinctive feature of this textbook for the introductory course in deductive logic. Great care is taken with the appropriate translation into logical languages of ordinary English sentences. Evaluation of these translations promotes a more effective use of ordinary language. The Principles of Deductive Logic presents symbolic logic in a fuller and more leisurely fashion than other introductory textbooks. Early chapters cover (...) informal material, including definition and informal fallacies. The remainder of the text is devoted to the treatment of four distinct artificial languages. The Categorical language is the language of syllogistic logic. The Extended Categorical language enriches this first language with the symbolic connectives for conjunction and negation. The Propositional Connective language and the First-Order language are the two basic languages of modern logic. Each language is accompanied by a deductive system, and is used as an instrument for exploring ordinary language, including ordinary arguments The book contains a large number of exercises whose answers are supplied in the back of the book, and many more that can be assigned as homework. A solution’s manual is available to instructors upon their request. The request must be written on college or university letterhead. (shrink)

This work is an introductory textbook for deductive logic being primarily concerned with truth-functional logic, but also containing an introduction to syllogisms with the application of Venn diagrams, an introduction to quantification theory, and a brief discussion of axiom systems. Harrison employs six logical operators in his truth-functional calculus, including both inclusive and exclusive disjunction. The six operators are initially defined by truth tables, but in the natural deduction presentation negation and conjunction are taken as primitive and (...) the other connectives are defined in terms of these two. The conditional and indirect methods of proof are included with the approach being essentially the same as that given in Copi’s Symbolic Logic. Categorical statements and syllogisms are analyzed from both hypothetical and existential viewpoints. The treatment of quantification theory includes two-place predicates and employs the four standard rules for generalization and instantiation. The book contains an abundance of explanations, examples, and exercises. Selected answers, usually for the odd numbered problems, are given in an appendix.—T. G. N. (shrink)

This is a textbook covering the basics of formal logic and elementary metatheory. Its distinguishing feature is that it has more emphasis on metatheory than comparable introductory textbooks. It was originally written to accompany lectures in an introductory to intermediate logic course at the University of Oxford, but it is designed to be used independently.

This introduction to formal logic is one of the few paperbacks available that provides a broad survey of the field. In addition to a clear presentation of sentential and first order quantificational logic, there is a discussion of the philosophical significance of recent work by Church, Gödel, and Tarski. The proof technique employed throughout is the indirect argument. Since proofs of this sort can be converted into mechanical tests of validity, it is easier than most for a beginning (...) student to grasp. Furthermore, this style of argument has long been recognized as the most obvious method of showing arguments in ordinary language to be invalid. Interesting treatments of the construction of decision machines, the nature of formal systems, and the application of logic to mathematics are included in the last section. Numerous exercises are included for which some answers are provided.--R. P. M. (shrink)

A philosophical argument in ordinary language is made the basis for a series of deductive logic exercises. Problems of translating the reasoning and alternative symbolizations are discussed to help guide students toward accurate charitable formalizations. Finally, the inference is critically evaluated in light of its deductive validity.

This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, you will see the original copyright references, library stamps (as most of these works have been housed in our most important libraries around the world), and other notations in the work. This work is in the public domain (...) in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work. As a reproduction of a historical artifact, this work may contain missing or blurred pages, poor pictures, errant marks, etc. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant. (shrink)

One of the main aims of modern logic at its inception was to show that mathematics could be "reduced to logic"; that is, that mathematical notions could be defined in terms of logical constants in the sense in which we have defined some logical ...