DOCSLIB.ORG

Handbook of Tableau Methods Introduction Melvin Fitting Mlfl[email protected] Contents 1 General Introduction

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Handbook of Tableau Methods Introduction Melvin Fitting Mlflc@Cunyvm.Cuny.Edu Contents 1 General Introduction 1 Handbook of Tableau Methods Introduction Melvin Fitting mlfl[email protected] Contents 1 General Introduction . 1 1.1 What Is A Tableau? . 1 1.2 Classical Propositional Tableaus as an Example . 2 1.3 Abstract Data Types vs Implementations . 6 1.4 What Good Is a Tableau System? . 7 2 Classical History . 8 2.1 Gentzen . 9 2.2 Beth . 15 2.3 Hintikka . 18 2.4 Lis . 20 2.5 Smullyan . 21 2.6 The Complications Quantifiers Add . 24 3 Modern History . 26 3.1 Intuitionistic Logic . 26 3.2 Many-Valued Logic . 29 3.3 Modal Logic . 30 3.4 Relevance Logic . 34 4 Post-Modern History . 36 4.1 The Beginnings . 36 4.2 Dummy Variables and Unification . 38 4.3 Run-Time Skolemization . 39 4.4 Where Now . 40 5 Conclusions . 41 1 General Introduction 1.1 What Is A Tableau? This chapter is intended to be a prolog setting the stage for the acts that follow—a bit of background, a bit of history, a bit of general commentary. And the thing to begin with is the introduction of the main character. What is a tableau? It will make the introductions easier if we first deal with a minor nui- sance. Suppose we know what a tableau is—what do we call several of 2 them: “tableaus” or “tableaux?” History and the dictionary are on the side of “tableaux.” On the other hand, language evolves and tends to sim- plify; there is a clear drift toward “tableaus.” In this chapter we will use “tableaus,” with the non-judgemental understanding that either is accept- able. This brings our trivial aside to a cloeaux. Now, what is a tableau? In its everyday meaning it is simply a picture or a scene, but of course we have something more technical in mind. A tableau method is a formal proof procedure, existing in many varieties and for several logics, but always with certain characteristics. First, it is a refutation procedure: to show a formula X is valid we begin with some syntactical expression intended to assert it is not. How this is done is a detail, and varies from system to system. Next, the expression asserting the invalidity of X is broken down syntactically, generally splitting things into several cases. This part of a tableau procedure—the tableau expansion stage—can be thought of as a generalization of disjunctive normal form expansion. Generally, but not always, it involves moves from formulas to subformulas. Finally there are rules for closing cases: impossibility conditions based on syntax. If each case closes, the tableau itself is said to be closed. A closed tableau beginning with an expression asserting that X is not valid is a tableau proof of X. There is a second, more semantical, way of thinking about the tableau method, one that, perhaps unfortunately, has played a lesser role thus far: it is a search procedure for models meeting certain conditions. Each branch of a tableau can be considered to be a partial description of a model. Several fundamental theorems of model theory have proofs that can be extracted from results about the tableau method. Smullyan developed this approach in [84], and it was carried further by Bell and Machover in [5]. In automated theorem-proving, tableaus can be used, and sometimes are used, to generate counter-examples. The connection between the two roles for tableaus—as a proof procedure and as a model search procedure—is simple. If we use tableaus to search for a model in which X is false, and we produce a closed tableau, no such model exists, so X must be valid. This is a bare outline of the tableau method. To make it concrete we need syntactical machinery for asserting invalidity, and syntactical machin- ery allowing a case analysis. We also need syntactical machinery for closing cases. All this is logic dependent. We will give examples of several kinds as the chapter progresses, but in order to have something specific before us now, we briefly present a tableau system for classical logic. 1.2 Classical Propositional Tableaus as an Example In their current incarnation, tableau systems for classical logic are generally based on the presentation of Raymond Smullyan in [84]. We follow this in our sketch of a signed tableau system for classical propositional logic. Chapter ?? continues the discussion of propositional logic via tableaus. 3 (Throughout the rest of this handbook, unsigned tableaus are generally used for classical logic, but signs play a significant role when other logics are involved, and classical logic provides the simplest context in which to introduce them.) First, we need syntactical machinery for asserting the invalidity of a formula, and for doing a case analysis. For this purpose two signs are introduced: T and F , where these are simply two new symbols, not part of the language of formulas. Signed formulas are expressions of the form FX and TX, where X is a formula. The intuitive meaning of FX is that X is false (in some model); similarly TX intuitively asserts that X is true. Then FX is the syntactical device for (informally) asserting the invalidity of X: a tableau proof of X begins with FX. Next we need machinery—rules—for breaking signed formulas down and doing a case division. To keep things simple for the time being, let us assume that ¬ and ⊃ are the only connectives. This will be extended as needed. The treatment of negation is straightforward: from T ¬X we get FX and from F ¬X we get TX. These rules can be conveniently presented as follows. Negation T ¬X F ¬X FX TX The rules for implication are somewhat more complex. From truth tables we know that if X ⊃ Y is false, X must be true and Y must be false. Likewise, if X ⊃ Y is true, either X is false or Y is true; this involves a split into two cases. Corresponding syntactic rules are as follows. TX ⊃ Y FX ⊃ Y Implication FX TY TX FY The standard way of displaying tableaus is as downward branching trees with signed formulas as node labels—indeed, the tableau method is often referred to as the tree method. Think of a tree as representing the disjunc- tion of its branches, and a branch as representing the conjunction of the signed formulas on it. Since a node may be common to several branches, a formula labeling it, in effect, occurs as a constituent of several conjunc- tions, while being written only once. This amounts to a kind of structure sharing. When using a tree display, a tableau expansion is thought of temporally, and one talks about the stages of constructing a tableau, meaning the stages of growing a tree. The rules given above are thought of as branch- lengthening rules. Thus, a branch containing T ¬X can be lengthened by adding a new node to its end, with FX as label. Likewise a branch 4 containing FX ⊃ Y can be lengthened with two new nodes, labeled TX and FY (take the node with FY as the child of the one labeled TX). A branch containing TX ⊃ Y can be split—its leaf is given a new left and a new right child, with one labeled FX, the other TY . This is how the schematic rules above are applied to trees. An important point to note: the tableau rules are non-deterministic. They say what can be done, not what must be done. At each stage we choose a signed formula occurrence on a branch and apply a rule to it. Since the order of choice is arbitrary, there can be many tableaus for a single signed formula. Sometimes a prescribed order of rule application is imposed, but this is not generally considered to be basic to a tableau system. Here is the final stage of a tableau expansion beginning with (that is, for) the signed formula F (X ⊃ Y ) ⊃ ((X ⊃ ¬Y ) ⊃ ¬X). 1. F (X ⊃ Y ) ⊃ ((X ⊃ ¬Y ) ⊃ ¬X) 2. TX ⊃ Y 3. F (X ⊃ ¬Y ) ⊃ ¬X 4. TX ⊃ ¬Y 5. F ¬X 6. TX @ @ 7. FX 8. TY @ @ 9. FX 10. T ¬Y 11. FY In this we have added numbers for reference purposes. Items 2 and 3 are from 1 by F ⊃; 4 and 5 are from 3 by F ⊃; 6 is from 5 by F ¬; 7 and 8 are from 2 by T ⊃; 9 and 10 are from 4 by T ⊃; 11 is from 10 by T ¬. Finally, the conditions for closing off a case—declaring a branch closed— are simple. A branch is closed if it contains TA and FA for some formula A. If each branch is closed, the tableau is closed. A closed tableau for FX is a tableau proof of X. The tableau displayed above is closed, so the formula (X ⊃ Y ) ⊃ ((X ⊃ ¬Y ) ⊃ ¬X) has a tableau proof. It may happen that no tableau proof is forthcoming, and we can think of the tableau construction as providing us with counterexamples. Consider the following attempt to prove (X ⊃ Y ) ⊃ ((¬X ⊃ ¬Y ) ⊃ Y ). 5 1. F (X ⊃ Y ) ⊃ ((¬X ⊃ ¬Y ) ⊃ Y ) 2. TX ⊃ Y 3. F (¬X ⊃ ¬Y ) ⊃ Y 4. T ¬X ⊃ ¬Y 5. FY @ @ 6. FX 7. TY @ @ 8. F ¬X 9. T ¬Y 10. TX 11. FY Items 2 and 3 are from 1 by F ⊃, as are 4 and 5 from 3. Items 6 and 7 are from 2 by T ⊃, as are 8 and 9 from 4. Finally 10 is from 8 by F ¬, and 11 is from 9 by T ¬. The leftmost branch is closed because of 6 and 10.
Load more

Recommended publications
  • The Method of Proof Analysis: Background, Developments, New Directions
    The Method of Proof Analysis: Background, Developments, New Directions Sara Negri University of Helsinki JAIST Spring School 2012 Kanazawa, March 5–9, 2012 Motivations and background Overview Hilbert-style systems Gentzen systems Axioms-as-rules Developments Proof-theoretic semantics for non-classical logics Basic modal logic Intuitionistic and intermediate logics Intermediate logics and modal embeddings Gödel-Löb provability logic Displayable logics First-order modal logic Transitive closure Completeness, correspondence, decidability New directions Social and epistemic logics Knowability logic References What is proof theory? “The main concern of proof theory is to study and analyze structures of proofs. A typical question in it is ‘what kind of proofs will a given formula A have, if it is provable?’, or ‘is there any standard proof of A?’. In proof theory, we want to derive some logical properties from the analysis of structures of proofs, by anticipating that these properties must be reflected in the structures of proofs. In most cases, the analysis will be based on combinatorial and constructive arguments. In this way, we can get sometimes much more information on the logical properties than with semantical methods, which will use set-theoretic notions like models,interpretations and validity.” (H. Ono, Proof-theoretic methods in nonclassical logic–an introduction, 1998) Challenges in modal and non-classical logics Difficulties in establishing analyticity and normalization/cut-elimination even for basic modal systems. Extension of proof-theoretic semantics to non-classical logic. Generality of model theory vs. goal directed developments in proof theory for non-classical logics. Proliferation of calculi “beyond Gentzen systems”. Defeatist attitudes: “No proof procedure suffices for every normal modal logic determined by a class of frames.” (M.
    [Show full text]
  • Designing a Theorem Prover
    Designing a Theorem Prover Lawrence C Paulson Computer Laboratory University of Cambridge May 1990 CONTENTS 2 Contents 1 Folderol: a simple theorem prover 3 1.1 Representation of rules :::::::::::::::::::::::::: 4 1.2 Propositional logic :::::::::::::::::::::::::::: 5 1.3 Quanti¯ers and uni¯cation :::::::::::::::::::::::: 7 1.4 Parameters in quanti¯er rules :::::::::::::::::::::: 7 2 Basic data structures and operations 10 2.1 Terms ::::::::::::::::::::::::::::::::::: 10 2.2 Formulae :::::::::::::::::::::::::::::::::: 11 2.3 Abstraction and substitution ::::::::::::::::::::::: 11 2.4 Parsing and printing ::::::::::::::::::::::::::: 13 3 Uni¯cation 14 3.1 Examples ::::::::::::::::::::::::::::::::: 15 3.2 Parameter dependencies in uni¯cation :::::::::::::::::: 16 3.3 The environment ::::::::::::::::::::::::::::: 17 3.4 The ML code for uni¯cation ::::::::::::::::::::::: 17 3.5 Extensions and omissions ::::::::::::::::::::::::: 18 3.6 Instantiation by the environment :::::::::::::::::::: 19 4 Inference in Folderol 20 4.1 Solving a goal ::::::::::::::::::::::::::::::: 21 4.2 Selecting a rule :::::::::::::::::::::::::::::: 22 4.3 Constructing the subgoals :::::::::::::::::::::::: 23 4.4 Goal selection ::::::::::::::::::::::::::::::: 25 5 Folderol in action 27 5.1 Propositional examples :::::::::::::::::::::::::: 27 5.2 Quanti¯er examples :::::::::::::::::::::::::::: 30 5.3 Beyond Folderol: advanced automatic methods ::::::::::::: 37 6 Interactive theorem proving 39 6.1 The Boyer/Moore theorem prover :::::::::::::::::::: 40 6.2 The Automath languages
    [Show full text]
  • Propositional Logic
    Chapter 3 Propositional Logic 3.1 Introduction Every logic comprises a (formal) language for making statements about ob- jects and reasoning about properties of these objects. This view of logic is very general and actually we will restrict our attention to mathematical objects, programs, and data structures in particular. Statements in a logical language are constructed according to a prede¯ned set of formation rules (depending on the language) called syntax rules. One might ask why a special language is needed at all, and why English (or any other natural language) is not adequate for carrying out logical reason- ing. The ¯rst reason is that English (and any natural language in general) is such a rich language that it cannot be formally described. The second reason, which is even more serious, is that the meaning of an English sentence can be ambiguous, subject to di®erent interpretations depending on the context and implicit assumptions. If the object of our study is to carry out precise rigor- ous arguments about assertions and proofs, a precise language whose syntax can be completely described in a few simple rules and whose semantics can be de¯ned unambiguously is required. Another important factor is conciseness. Natural languages tend to be verbose, and even fairly simple mathematical statements become exceedingly long (and unclear) when expressed in them. The logical languages that we shall de¯ne contain special symbols used for abbreviating syntactical con- 28 3.1 Introduction 29 structs. A logical language can be used in di®erent ways. For instance, a language can be used as a deduction system (or proof system); that is, to construct proofs or refutations.
    [Show full text]
  • Proof Editor for Natural Deduction in First-Order Logic the Evaluation of an Educational Aiding Tool for Students Learning Logic
    Proof Editor for Natural Deduction in First-order Logic The Evaluation of an Educational Aiding Tool for Students Learning Logic Bachelor’s thesis in Computer Science ELIN BJÖRNSSON, FREDRIK JOHANSSON, JAN LIU, HENRY LY, JESPER OLSSON, ANDREAS WIDBOM Department of Computer Science and Engineering CHALMERS UNIVERSITY OF TECHNOLOGY UNIVERSITY OF GOTHENBURG Gothenburg, Sweden 2017 Proof Editor for Natural Deduction in First-order Logic The Evaluation of an Educational Aiding Tool for Students Learning Logic ELIN BJÖRNSSON, FREDRIK JOHANSSON, JAN LIU, HENRY LY, JESPER OLSSON, ANDREAS WIDBOM Department of Computer Science and Engineering Computer Science Chalmers University of Technology Göteborg, Sweden 2017 Proof Editor for Natural Deduction in First-order Logic The Evaluation of an Educational Aiding Tool for Students Learning Logic ELIN BJÖRNSSON, FREDRIK JOHANSSON, JAN LIU, HENRY LY, JESPER OLSSON, ANDREAS WIDBOM © ELIN BJÖRNSSON, FREDRIK JOHANSSON, JAN LIU, HENRY LY, JESPER OLSSON, ANDREAS WIDBOM, 2017. Supervisor: Fredrik Lindblad, Department of Computer Science and Engineering Examiner: Niklas Broberg, Department of Computer Science and Engineering Bachelor’s Thesis 2017 Department of Computer Science and Engineering Computer Science Chalmers University of Technology SE-412 96 Gothenburg Telephone +46 31 772 1000 Cover: Visualisation of the correct natural deduction steps for the first-order logic proof ∃xP (x), ∀x∀yP (x) → Q(y) ` ∀yQ(y), constructed in the developed proof editor. Typeset in LATEX Printed by [Name of printing company] Gothenburg, Sweden 2017 iv Proof Editor for Natural Deduction in First-order Logic The Evaluation of an Educational Aiding Tool for Students Learning Logic ELIN BJÖRNSSON, FREDRIK JOHANSSON, JAN LIU, HENRY LY, JESPER OLSSON, ANDREAS WIDBOM Department of Computer Science and Engineering Chalmers University of Technology Abstract The subject of this thesis is the presentation and evaluation of Conan, an editor for writing natural deduction proofs in first-order logic.
    [Show full text]
  • Logic and Proof Computer Science Tripos Part IB
    Logic and Proof Computer Science Tripos Part IB Lawrence C Paulson Computer Laboratory University of Cambridge [email protected] Copyright c 2014 by Lawrence C. Paulson Contents 1 Introduction and Learning Guide 1 2 Propositional Logic 2 3 Proof Systems for Propositional Logic 5 4 First-order Logic 8 5 Formal Reasoning in First-Order Logic 11 6 Clause Methods for Propositional Logic 13 7 Skolem Functions, Herbrand’s Theorem and Unification 17 8 First-Order Resolution and Prolog 21 9 Decision Procedures and SMT Solvers 24 10 Binary Decision Diagrams 27 11 Modal Logics 28 12 Tableaux-Based Methods 30 i 1 INTRODUCTION AND LEARNING GUIDE 1 1 Introduction and Learning Guide 2008 Paper 3 Q6: BDDs, DPLL, sequent calculus • 2008 Paper 4 Q5: proving or disproving first-order formulas, This course gives a brief introduction to logic, including • resolution the resolution method of theorem-proving and its relation 2009 Paper 6 Q7: modal logic (Lect. 11) to the programming language Prolog. Formal logic is used • for specifying and verifying computer systems and (some- 2009 Paper 6 Q8: resolution, tableau calculi • times) for representing knowledge in Artificial Intelligence 2007 Paper 5 Q9: propositional methods, resolution, modal programs. • logic The course should help you to understand the Prolog 2007 Paper 6 Q9: proving or disproving first-order formulas language, and its treatment of logic should be helpful for • 2006 Paper 5 Q9: proof and disproof in FOL and modal logic understanding other theoretical courses. It also describes • 2006 Paper 6 Q9: BDDs, Herbrand models, resolution a variety of techniques and data structures used in auto- • mated theorem provers.
    [Show full text]
  • Natural Deduction
    Natural Deduction Francis Jeffry Pelletier Allen P. Hazen Simon Fraser University University of Melbourne Contents 1 Introduction 1 2 Object Language Natural Deduction 1 2.1 TheWiderNotionofNaturalDeduction . 2 2.2 DifferentProofSystems .................................. 3 2.3 The Beginnings of Natural Deduction: Jaśkowski and Gentzen (and Suppes) on RepresentingNaturalDeductionProofs . 6 2.4 NaturalDeductioninElementaryTextbooks . 12 2.5 MoreFeaturesofthePrototypeofNaturalDeduction . 14 2.6 NaturalDeductionQuantificationalRules . 18 2.7 ASummaryofElementaryNaturalDeductionTextbooks . 21 2.8 Exploiting Natural Deduction Techniques: Modal Logic . 26 3 The Metatheory of Natural Deduction 29 3.1 NormalizingNaturalDeduction . 29 3.2 NaturalDeductionandSequentCalculus. 33 3.3 SequentNaturalDeduction .. .. .. .. .. .. .. .. .. .. .... .. .. 34 3.4 FromSequentNaturalDeductiontoSequentCalculus . 35 3.5 TheSequentCalculusLK ................................. 38 3.6 VariantsofSequentCalculi .. .. .. .. .. .. .. .. .. .. .. .. .. .. 41 3.7 SequentCalculiandTableaux. 44 3.8 NaturalDeductionwithSequences . 48 3.9 SizeofNormalProofs ................................... 49 4 Problems and Projects 51 4.1 The Concept of Natural Deduction, Some Further Informal Thoughts . 51 4.2 NaturalDeductionandComputers . 53 4.3 NaturalDeductionandSemantics. 56 4.4 TheOneTrueLogic? SomePhilosophicalReflections. 62 Acknowledgments 65 References 66 Appendix: 50 Elementary Logic Textbooks 76 i Pelletier & Hazen Natural Deduction 1 Introduction Work that is called ‘natural deduction’
    [Show full text]
  • An Introduction to Proof Theory
    CHAPTER I An Introduction to Proof Theory Samuel R. Buss Departments of Mathematics and Computer Science, University of California, San Diego La Jolla, California 92093-0112, USA Contents 1. Proof theory of propositional logic ......................... 3 1.1. Frege proof systems .............................. 5 1.2. The propositional sequent calculus ...................... 10 1.3. Propositional resolution refutations ...................... 18 2. Proof theory of ¯rst-order logic ........................... 26 2.1. Syntax and semantics ............................. 26 2.2. Hilbert-style proof systems .......................... 29 2.3. The ¯rst-order sequent calculus ........................ 31 2.4. Cut elimination ................................ 36 2.5. Herbrand's theorem, interpolation and de¯nability theorems ........ 48 2.6. First-order logic and resolution refutations .................. 59 3. Proof theory for other logics ............................. 64 3.1. Intuitionistic logic ............................... 64 3.2. Linear logic .................................. 70 References ........................................ 74 HANDBOOK OF PROOF THEORY Edited by S. R. Buss c 1998 Elsevier Science B.V. All rights reserved ° 2 S. Buss Proof Theory is the area of mathematics which studies the concepts of mathemat- ical proof and mathematical provability. Since the notion of \proof" plays a central role in mathematics as the means by which the truth or falsity of mathematical propositions is established; Proof Theory is, in principle at least, the study of the foundations of all of mathematics. Of course, the use of Proof Theory as a foundation for mathematics is of necessity somewhat circular, since Proof Theory is itself a sub¯eld of mathematics. There are two distinct viewpoints of what a mathematical proof is. The ¯rst view is that proofs are social conventions by which mathematicians convince one another of the truth of theorems.
    [Show full text]
  • Some Applications of Gentzen's Proof Theory in Automated Deduction
    Some Applications of Gentzen’s Proof Theory in Automated Deduction Michael Beeson Mathematics and Computer Science San Jose State University San Jose, California 95192, USA May 29, 1990 Reasoning and problem-solving programs must eventually allow the full use of quantifiers and sets, and have strong enough control methods to use them without combinatorial explosion. 1 –J. McCarthy Abstract We show that Prolog is intimately connected with Gentzen’s cut-free sequent calculus G , analyzing Prolog computations as the construction of certain cut- free derivations. We introduce a theorem-proving program GENTZEN based on Gentzen’s sequent calculus, which incorporates some features of Prolog’s computation procedure. We show that GENTZEN has the following properties: (1) It is (non-deterministically) sound and complete for first-order intuitionistic predicate calculus; (2) Its successful computations coincide with those of Prolog on the Horn clause fragment (both deterministically and non-deterministically). The proofs of (1) and (2) contain a new proof of the completeness of (non- deterministic) Prolog for Horn clause logic, based on our analysis of Prolog in terms of Gentzen sequents instead of on resolution. GENTZEN has been implemented and tested on examples including some proofs by induction in number theory, an example constructed by J. McCarthy to show the limitations of Prolog, and “Schubert’s Steamroller.” An extension of GENTZEN also provides a decision procedure for intuitionistic propositional calculus (but at some cost in efficiency). 1McCarthy [1987], p. 1032. 1 Contents 1 Introduction 2 2 Proof-theoretic Preliminaries 6 3 Explaining Prolog by Gentzen Sequents 17 4 Completeness of Prolog 26 5 The Program GENTZEN 30 6 McCarthy’s sterilization example 37 7 Completeness of Non-deterministic GENTZEN 39 8 GENTZEN Extends Prolog 44 9 Automating proofs by induction with GENTZEN 52 10 Relations to the Literature 53 1 Introduction Prolog is a programming language in which the underlying computation mecha- nism is logical deduction.
    [Show full text]
  • Logic and Proof Computer Science Tripos Part IB
    Logic and Proof Computer Science Tripos Part IB Lawrence C Paulson Computer Laboratory University of Cambridge [email protected] Copyright c 2016 by Lawrence C. Paulson Contents 1 Introduction and Learning Guide 1 2 Propositional Logic 2 3 Proof Systems for Propositional Logic 5 4 First-order Logic 8 5 Formal Reasoning in First-Order Logic 11 6 Clause Methods for Propositional Logic 13 7 Skolem Functions, Herbrand’s Theorem and Unification 17 8 First-Order Resolution and Prolog 21 9 Decision Procedures and SMT Solvers 24 10 Binary Decision Diagrams 27 11 Modal Logics 28 12 Tableaux-Based Methods 30 i 1 INTRODUCTION AND LEARNING GUIDE 1 1 Introduction and Learning Guide 2010 Paper 6 Q6: sequent or tableau calculus, DPLL. Note: • the formula should be . x P.x/ Q/ x .P.x/ Q/. This course gives a brief introduction to logic, including 9 ! ! 8 ! 2008 Paper 3 Q6: BDDs, DPLL, sequent calculus the resolution method of theorem-proving and its relation • to the programming language Prolog. Formal logic is used 2008 Paper 4 Q5: (dis)proving first-order formulas, resolu- • for specifying and verifying computer systems and (some- tion times) for representing knowledge in Artificial Intelligence 2009 Paper 6 Q7: modal logic programs. • 2009 Paper 6 Q8: resolution, tableau calculi The course should help you to understand the Prolog • language, and its treatment of logic should be helpful for 2007 Paper 5 Q9: propositional methods, resolution, modal understanding other theoretical courses. It also describes • logic a variety of techniques and data structures used in auto- 2007 Paper 6 Q9: proving or disproving first-order formulas mated theorem provers.
    [Show full text]
  • History of Interactive Theorem Proving
    HISTORY OF INTERACTIVE THEOREM PROVING John Harrison, Josef Urban and Freek Wiedijk Reader: Lawrence C. Paulson 1 INTRODUCTION By interactive theorem proving, we mean some arrangement where the machine and a human user work together interactively to produce a formal proof. There is a wide spectrum of possibilities. At one extreme, the computer may act merely as a checker on a detailed formal proof produced by a human; at the other the prover may be highly automated and powerful, while nevertheless being subject to some degree of human guidance. In view of the practical limitations of pure automation, it seems today that, whether one likes it or not, interactive proof is likely to be the only way to formalize most non-trivial theorems in mathematics or computer system correctness. Almost all the earliest work on computer-assisted proof in the 1950s [Davis, 1957; Gilmore, 1960; Davis and Putnam, 1960; Wang, 1960; Prawitz et al., 1960] and 1960s [Robinson, 1965; Maslov, 1964; Loveland, 1968] was devoted to truly automated theorem proving, in the sense that the machine was supposed to prove assertions fully automatically. It is true that there was still a considerable diver- sity of methods, with some researchers pursuing AI-style approaches [Newell and Simon, 1956; Gelerntner, 1959; Bledsoe, 1984] rather than the dominant theme of automated proof search, and that the proof search programs were often highly tun- able by setting a complicated array of parameters. As described by Dick [2011], the designers of automated systems would often study the details of runs and tune the systems accordingly, leading to a continuous process of improvement and understanding that could in a very general sense be considered interactive.
    [Show full text]
  • Reciprocal Influences Between Proof Theory and Logic Programming
    Philosophy & Technology manuscript No. (will be inserted by the editor) Reciprocal influences between proof theory and logic programming Dale Miller the date of receipt and acceptance should be inserted later Abstract The topics of structural proof theory and logic programming have influ- enced each other for more than three decades. Proof theory has contributed the notion of sequent calculus, linear logic, and higher-order quantification. Logic programming has introduced new normal forms of proofs and forced the examination of logic-based approaches to the treatment of bindings. As a result, proof theory has responded by developing an approach to proof search based on focused proof systems in which in- troduction rules are organized into two alternating phases of rule application. Since the logic programming community can generate many examples and many design goals (e.g., modularity of specifications and higher-order programming), the close connections with proof theory have helped to keep proof theory relevant to the gen- eral topic of computational logic. Keywords Structural proof theory · logic programming · computational logic · history of programming languages 1 Introduction Both symbolic logic and the theory of proof have been applied successfully in the foundations of mathematics. For example, Gentzen’s early work on the sequent calcu- lus [28, 29] was used to show the consistency of classical and intuitionistic logic and arithmetic. The last several decades have demonstrated that logic has a significant and continuing impact on computer science, possibly rivaling its impact on mathematics. For example, there are major journals that cover the general topic of computational logic—the ACM Transactions on Computational Logic, Logical Methods in Com- puter Science, the Journal on Automated Reasoning, and the Journal of Logic and Computation—to name a few.
    [Show full text]