Theory of Automated Reasoning An Introduction. Antti-Juhani Kaijanaho

Save this PDF as:

Size: px
Start display at page:

Transcription

1 Theory of Automated Reasoning An Introduction Antti-Juhani Kaijanaho

2 Intended as compulsory reading for the Spring 2004 course on Automated Reasononing at Department of Mathematical Information Technology, University of Jyväskylä.

3 CHAPTER 1 Introduction In the 17th Century, Gottfried Leibniz dreamt of building a system where the truth of any assertion could be determined by calculation. Leibniz wrote: If controversies were to arise, there would be no more need of dispute between two philosophers than between two accountants. For it would suffice to take their pencils in their hands, and say to each other: Let us calculate. Leibniz s dream was a machine that could decide any question about what is and what is not. His dream has been shared by many, although they did not know of Leibniz s ideas. In the latter part of the 19th Century, modern logic emerged: George Boole created his algebra, Georg Cantor discovered magnitudes of infinity and developed an intuitive set theory, Gottlob Frege developed his unrestricted predicate calculus, Bertrand Russell crushed it by discovering the antinomy now known as Russell s paradox 1 and then in the first decade of the 20th Century wrote Principia Mathematica with Alfred Whitehead attempting to patch it up. In the first three decades of the 20th Century, research in logic was furious and fruitful, resulting in the modern approach to logic. Though this research was primarily motivated by interest in fundamentals of mathematics, it was critically important in realizing the dream of the reasoning machine. And such dream was also in the minds of the researchers. In 1900, at the International Congress of Mathematicians in Paris, David Hilbert delivered his famous speech on mathematical problems. He described 23 open problems for the new century; one of them is particularly relevant to our topic. Hilbert s second problem concerned the validity of formal arithmetic. In order to understand it, one must understand the point of view that it was posed from. Hilbert wanted to reduce all of mathematics to finite reasoning from a set of self-evident axioms. By that time, many important mathematical fields of study, such as geometry, had been reduced to the study of arithmetic. It was then critically 1 Russell s paradox can be paraphrased as the barber s problem: A village has a bearded barber, who swears to shave every bearded man in the village who does not shave himself. Does the barber shave himself? 1

5 1. INTRODUCTION 3 The first step in solving the Entscheidungsproblem would be defining what exactly is a mechanical procedure. Alonzo Church did that by defining his λ-calculus and arguing that it is a model of mechanical calculation. At about the same time, unaware of Church s work, Alan Turing created his machine and similarly argued that it is a model of mechanical calculation. Church published first, and so Turing was able to compare the two models, and as he presented his machine, he also gave a proof that it is equivalent to λ-calculus. Both Church and Turing solved the Entscheidungsproblem by proving that there is no mechanical procedure that can decide whether an arbitrary first-order sentence is a theorem or not. First-order logic was found to be undecidable. This finding was another severe blow to Hilbert s program, and also seems to make this booklet unnecessary. There is an old joke about a shop that promises immediate delivery on all orders, except for impossible ones, for which the delivery will take up to two weeks. In similar spirit, these discoveries have only slowed down the search for the reasoning machine. In the fifties, when computers were shiny and new, many researchers turned to the problem of making the computer prove theorems. Even though first-order logic was now know to be undecidable in general, it was also known that there are particular first-order theories that are decidable. Presbuger s arithmetic (natural numbers with addition but without multiplication, as mentioned above) has a decision procedure. In 1954, Martin Davis programmed Presburger s arithmetic. It did not perform well; as Davis later wrote: Its great triumph was to prove that the sum of two even numbers is even. This is not surprising in retrospect, as it was proven in the 1970s that any decision procedure for Presburger arithmetic has superexponential complexity. Although there were several attempts at making a general automatic theorem prover (notably by Davis and Putnam), the first major breakthrough was John Alan Robinson s combination of unification and the resolution principle 2. Since then, a lot of improvements have been made to both techniques. Today, most generalpurpose automatic reasoning systems are based on resolution, and nearly all of them use unification. Another main technique, semantic tableaux, has emerged as an important technique in the last ten years, although it has been around since 1960 s, developed by Raymond Smullyan 3 based on the work of E. W. Beth and Jaakko Hintikka in the 1950 s. 2 J. A. Robinson: A Machine-Oriented Logic Based on the Resolution Principle. Journal of the ACM, vol. 12 no. 1 (January 1965). 3 Raymond M. Smullyan: Trees and Nest Structures. The Journal of Symbolic Logic, vol. 31 no. 3 (September 1966).

6 4 1. INTRODUCTION While the original motivation for a reasoning machine was philosophical and metamathematical, its greatest application today is in verification of software and hardware systems. Reasoning systems have also solved several open mathematical problems. Automated reasoning also has applications in artificial intelligence, database systems and programming. This booklet develops the basic theory of automated reasoning. It assumes that the reader has the maturity of a post-baccalaureate graduate student in (theoretical) computer science. In particular, it assumes a knowledge of formal logic, theory of computation and formal languages as they are taught in computer science undergraduate (pre-baccalaureate) curricula. This booklet is a companion to the author s lectures in the Spring 2004 course on Automated reasoning at University of Jyväskylä, focusing on theory, while the lectures focus on intuitive understanding of concepts, issues and implementation techniques. We start with a precis of formal logic. The rest of this booklet covers important techniques such as normal form transformations, term unification, semantic tableaux and resolution. The main references used in writing this booklet are Melvin Fitting: First-Order Logic and Automated Theorem Proving, Second Edition, New York, Springer (Graduate Texts in Computer Science), 1996, and Alan Robinson and Andrei Voronkov, editors: Handbook of Automated Reasoning, Amsterdam, North-Holland (Elsevier) and Cambridge (Massachusetts), MIT Press, Other papers and books used as sources are referred to in footnotes.

Computation Beyond Turing Machines

Computation Beyond Turing Machines Peter Wegner, Brown University Dina Goldin, U. of Connecticut 1. Turing s legacy Alan Turing was a brilliant mathematician who showed that computers could not completely

Hilberts Entscheidungsproblem, the 10th Problem and Turing Machines

Hilberts Entscheidungsproblem, the 10th Problem and Turing Machines Nitin Saxena (Hausdorff Center for Mathematics, Bonn) [Happy] [100 th ] [Alan] [Mathison] [Turing!][][][]... **all pictures are works

The History of Logic. Aristotle (384 322 BC) invented logic.

The History of Logic Aristotle (384 322 BC) invented logic. Predecessors: Fred Flintstone, geometry, sophists, pre-socratic philosophers, Socrates & Plato. Syllogistic logic, laws of non-contradiction

Consistency, completeness of undecidable preposition of Principia Mathematica. Tanmay Jaipurkar

Consistency, completeness of undecidable preposition of Principia Mathematica Tanmay Jaipurkar October 21, 2013 Abstract The fallowing paper discusses the inconsistency and undecidable preposition of Principia

Automated Theorem Proving - summary of lecture 1

Automated Theorem Proving - summary of lecture 1 1 Introduction Automated Theorem Proving (ATP) deals with the development of computer programs that show that some statement is a logical consequence of

CHAPTER 7 GENERAL PROOF SYSTEMS

CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes

CANTOR S DIAGONAL ARGUMENT: PROOF AND PARADOX

CANTOR S DIAGONAL ARGUMENT: PROOF AND PARADOX Cantor s diagonal method is elegant, powerful, and simple. It has been the source of fundamental and fruitful theorems as well as devastating, and ultimately,

CS 3719 (Theory of Computation and Algorithms) Lecture 4

CS 3719 (Theory of Computation and Algorithms) Lecture 4 Antonina Kolokolova January 18, 2012 1 Undecidable languages 1.1 Church-Turing thesis Let s recap how it all started. In 1990, Hilbert stated a

CS_226 Computability Theory

Examples CS_226 Computability Theory http://www.cs.swan.ac.uk/ csetzer/lectures/computability/ 08/index.html Course Notes, Michaelmas Term 2008 Anton Setzer (Dept. of Computer Science, Swansea) http://www.cs.swan.ac.uk/

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly

How many numbers there are?

How many numbers there are? RADEK HONZIK Radek Honzik: Charles University, Department of Logic, Celetná 20, Praha 1, 116 42, Czech Republic radek.honzik@ff.cuni.cz Contents 1 What are numbers 2 1.1 Natural

Section 2.6 Cantor s Theorem and the ZFC Axioms

1 Section 2.6 and the ZFC Axioms Purpose of Section: To state and prove Cantor theorem, which guarantees the existence of infinities larger than the cardinality of the continuum. We also state and discuss

(LMCS, p. 317) V.1. First Order Logic. This is the most powerful, most expressive logic that we will examine.

(LMCS, p. 317) V.1 First Order Logic This is the most powerful, most expressive logic that we will examine. Our version of first-order logic will use the following symbols: variables connectives (,,,,

Lecture 13 of 41. More Propositional and Predicate Logic

Lecture 13 of 41 More Propositional and Predicate Logic Monday, 20 September 2004 William H. Hsu, KSU http://www.kddresearch.org http://www.cis.ksu.edu/~bhsu Reading: Sections 8.1-8.3, Russell and Norvig

This chapter is all about cardinality of sets. At first this looks like a

CHAPTER Cardinality of Sets This chapter is all about cardinality of sets At first this looks like a very simple concept To find the cardinality of a set, just count its elements If A = { a, b, c, d },

2.1 The Algebra of Sets

Chapter 2 Abstract Algebra 83 part of abstract algebra, sets are fundamental to all areas of mathematics and we need to establish a precise language for sets. We also explore operations on sets and relations

Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory

Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory Robert I. Soare January 3, 2009 Contents 1 Introduction 4 1.1 Terminology: Incompleteness and Incomputability......

Summary Last Lecture. Automated Reasoning. Outline of the Lecture. Definition sequent calculus. Theorem (Normalisation and Strong Normalisation)

Summary Summary Last Lecture sequent calculus Automated Reasoning Georg Moser Institute of Computer Science @ UIBK Winter 013 (Normalisation and Strong Normalisation) let Π be a proof in minimal logic

Alan Turing and the Unsolvable Problem To Halt or Not to Halt That Is the Question

Alan Turing and the Unsolvable Problem To Halt or Not to Halt That Is the Question Cristian S. Calude 26 April 2012 Alan Turing Alan Mathison Turing was born in a nursing home in Paddington, London, now

SJÄLVSTÄNDIGA ARBETEN I MATEMATIK

SJÄLVSTÄNDIGA ARBETEN I MATEMATIK MATEMATISKA INSTITUTIONEN, STOCKHOLMS UNIVERSITET Automated Theorem Proving av Tom Everitt 2010 - No 8 MATEMATISKA INSTITUTIONEN, STOCKHOLMS UNIVERSITET, 106 91 STOCKHOLM

ON FUNCTIONAL SYMBOL-FREE LOGIC PROGRAMS

PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical and Mathematical Sciences 2012 1 p. 43 48 ON FUNCTIONAL SYMBOL-FREE LOGIC PROGRAMS I nf or m at i cs L. A. HAYKAZYAN * Chair of Programming and Information

1 / Basic Structures: Sets, Functions, Sequences, and Sums - definition of a set, and the use of the intuitive notion that any property whatever there

C H A P T E R Basic Structures: Sets, Functions, Sequences, and Sums.1 Sets. Set Operations.3 Functions.4 Sequences and Summations Much of discrete mathematics is devoted to the study of discrete structures,

Hypercomputation: computing more than the Turing machine

Hypercomputation: computing more than the Turing machine Abstract: Toby Ord Department of Philosophy * The University of Melbourne t.ord@pgrad.unimelb.edu.au In this report I provide an introduction to

Alan Turing and the Mathematical Objection

Alan Turing and the Mathematical Objection GUALTIERO PICCININI Department of History and Philosophy of Science, University of Pittsburgh, 1017 Cathedral of Learning, Pittsburgh, PA 15260, USA; E-mail:

arxiv:0804.4490v1 [math.gm] 28 Apr 2008

Infinite sequences in the framework of classical logic arxiv:0804.4490v1 [math.gm] 28 Apr 2008 V.V. Ivanov N.N. Semenov Institute of Chemical Physics, Russian Academy of Sciences, Kosygin str.4, Moscow,

6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008

MIT OpenCourseWare http://ocw.mit.edu 6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.

Turing Machine and the Conceptual Problems of Computational Theory

Research Inventy: International Journal of Engineering And Science Vol.4, Issue 4 (April 204), PP 53-60 Issn (e): 2278-472, Issn (p):239-6483, www.researchinventy.com Turing Machine and the Conceptual

CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE

CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE With the notion of bijection at hand, it is easy to formalize the idea that two finite sets have the same number of elements: we just need to verify

Rigorous Software Development CSCI-GA 3033-009

Rigorous Software Development CSCI-GA 3033-009 Instructor: Thomas Wies Spring 2013 Lecture 11 Semantics of Programming Languages Denotational Semantics Meaning of a program is defined as the mathematical

Ultraproducts and Applications I

Ultraproducts and Applications I Brent Cody Virginia Commonwealth University September 2, 2013 Outline Background of the Hyperreals Filters and Ultrafilters Construction of the Hyperreals The Transfer

Introduction to formal semantics -

Introduction to formal semantics - Introduction to formal semantics 1 / 25 structure Motivation - Philosophy paradox antinomy division in object und Meta language Semiotics syntax semantics Pragmatics

HILBERT S PROGRAM THEN AND NOW

HILBERT S PROGRAM THEN AND NOW Richard Zach 1 INTRODUCTION Hilbert s program is, in the first instance, a proposal and a research program in the philosophy and foundations of mathematics. It was formulated

Discrete Mathematics Lecture 5. Harper Langston New York University

Discrete Mathematics Lecture 5 Harper Langston New York University Empty Set S = {x R, x 2 = -1} X = {1, 3}, Y = {2, 4}, C = X Y (X and Y are disjoint) Empty set has no elements Empty set is a subset of

Turing Machines: An Introduction

CIT 596 Theory of Computation 1 We have seen several abstract models of computing devices: Deterministic Finite Automata, Nondeterministic Finite Automata, Nondeterministic Finite Automata with ɛ-transitions,

Chapter 1. Computation theory

Chapter 1. Computation theory In this chapter we will describe computation logic for the machines. This topic is a wide interdisciplinary field, so that the students can work in an interdisciplinary context.

Extending Semantic Resolution via Automated Model Building: applications

Extending Semantic Resolution via Automated Model Building: applications Ricardo Caferra Nicolas Peltier LIFIA-IMAG L1F1A-IMAG 46, Avenue Felix Viallet 46, Avenue Felix Viallei 38031 Grenoble Cedex FRANCE

13 Infinite Sets. 13.1 Injections, Surjections, and Bijections. mcs-ftl 2010/9/8 0:40 page 379 #385

mcs-ftl 2010/9/8 0:40 page 379 #385 13 Infinite Sets So you might be wondering how much is there to say about an infinite set other than, well, it has an infinite number of elements. Of course, an infinite

Introduction to Theory of Computation

Introduction to Theory of Computation Prof. (Dr.) K.R. Chowdhary Email: kr.chowdhary@iitj.ac.in Formerly at department of Computer Science and Engineering MBM Engineering College, Jodhpur Tuesday 28 th

Handout #1: Mathematical Reasoning

Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or

On Formally Undecidable Propositions of Principia Mathematica And Related Systems

On Formally Undecidable Propositions of Principia Mathematica And Related Systems KURT GÖDEL Translated by B. MELTZER Introduction by R. B. BRAITHWAITE TO CHRISTOPHER FERNAU in gratitude FL: Page 1 11/10/00

FREEDOM AND TRUTH IN MATHEMATICS

DANIEL BONEVAC FREEDOM AND TRUTH IN MATHEMATICS "The very essence of mathematics," Georg Cantor wrote in 1883, "is its freedom." 1 Few philosophers of mathematics in the intervening 100 years have taken

Georg Cantor (1845-1918):

Georg Cantor (845-98): The man who tamed infinity lecture by Eric Schechter Associate Professor of Mathematics Vanderbilt University http://www.math.vanderbilt.edu/ schectex/ In papers of 873 and 874,

Conversations: from Alan Turing to NP-completeness

Conversations: from Alan Turing to NP-completeness Compiled by Jaikumar Radhakrishnan* School of Technology and Computer Science, Tata Institute of Fundamental Research, Mumbai 400 005, India Scientists

OHJ-2306 Introduction to Theoretical Computer Science, Fall 2012 8.11.2012

276 The P vs. NP problem is a major unsolved problem in computer science It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute to carry a \$ 1,000,000 prize for the

Kolmogorov Complexity and the Incompressibility Method

Kolmogorov Complexity and the Incompressibility Method Holger Arnold 1. Introduction. What makes one object more complex than another? Kolmogorov complexity, or program-size complexity, provides one of

What Is School Mathematics?

What Is School Mathematics? Lisbon, Portugal January 30, 2010 H. Wu *I am grateful to Alexandra Alves-Rodrigues for her many contributions that helped shape this document. The German conductor Herbert

THE LOGICAL LIMITS OF SCIENTIFIC KNOWLEDGE: HISTORICAL AND INTEGRATIVE PERSPECTIVES

THE LOGICAL LIMITS OF SCIENTIFIC KNOWLEDGE: HISTORICAL AND INTEGRATIVE PERSPECTIVES Ettore DE MONTE, Antonino TAMBURELLO ABSTRACT: This work investigates some of the most important logical limits of scientific

Gödel s First Incompleteness Theorem. The following result is a cornerstone of modern logic:

Gödel s First Incompleteness Theorem The following result is a cornerstone of modern logic: Self-referential Lemma. For any formula R(x), there is a sentence N such that (N : R([ + N, ])) is a consequence

CS Master Level Courses and Areas COURSE DESCRIPTIONS. CSCI 521 Real-Time Systems. CSCI 522 High Performance Computing

CS Master Level Courses and Areas The graduate courses offered may change over time, in response to new developments in computer science and the interests of faculty and students; the list of graduate

6.080/6.089 GITCS Feb 12, 2008. Lecture 3

6.8/6.89 GITCS Feb 2, 28 Lecturer: Scott Aaronson Lecture 3 Scribe: Adam Rogal Administrivia. Scribe notes The purpose of scribe notes is to transcribe our lectures. Although I have formal notes of my

The Classes P and NP

The Classes P and NP We now shift gears slightly and restrict our attention to the examination of two families of problems which are very important to computer scientists. These families constitute the

ECS 120 Lesson 17 Church s Thesis, The Universal Turing Machine

ECS 120 Lesson 17 Church s Thesis, The Universal Turing Machine Oliver Kreylos Monday, May 7th, 2001 In the last lecture, we looked at the computation of Turing Machines, and also at some variants of Turing

CSE 459/598: Logic for Computer Scientists (Spring 2012)

CSE 459/598: Logic for Computer Scientists (Spring 2012) Time and Place: T Th 10:30-11:45 a.m., M1-09 Instructor: Joohyung Lee (joolee@asu.edu) Instructor s Office Hours: T Th 4:30-5:30 p.m. and by appointment

Introducing Formal Methods. Software Engineering and Formal Methods

Introducing Formal Methods Formal Methods for Software Specification and Analysis: An Overview 1 Software Engineering and Formal Methods Every Software engineering methodology is based on a recommended

UNIVERSALITY IS UBIQUITOUS

UNIVERSALITY IS UBIQUITOUS Martin Davis Professor Emeritus Courant Institute, NYU Visiting Scholar UC Berkeley Q 3 a 0 q 5 1 Turing machine operation: Replace symbol ( print ) Move left or right one square,

N o w f o r S o m e t h i n g. C o m p l e t e l y C o m p u t a t i o n a l. C. J. Date. July 17th, 2006

A n d N o w f o r S o m e t h i n g C o m p l e t e l y C o m p u t a t i o n a l by C. J. Date July 17th, 2006 Myself when young did eagerly frequent Doctor and Saint, and heard great Argument About it

Mathematical Reasoning in Software Engineering Education. Peter B. Henderson Butler University

Mathematical Reasoning in Software Engineering Education Peter B. Henderson Butler University Introduction Engineering is a bridge between science and mathematics, and the technological needs of mankind.

Algebraic Computation Models. Algebraic Computation Models

Algebraic Computation Models Ζυγομήτρος Ευάγγελος ΜΠΛΑ 201118 Φεβρουάριος, 2013 Reasons for using algebraic models of computation The Turing machine model captures computations on bits. Many algorithms

Basic Proof Techniques

Basic Proof Techniques David Ferry dsf43@truman.edu September 13, 010 1 Four Fundamental Proof Techniques When one wishes to prove the statement P Q there are four fundamental approaches. This document

2. Methods of Proof Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try.

2. METHODS OF PROOF 69 2. Methods of Proof 2.1. Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try. Trivial Proof: If we know q is true then

Fixed-Point Logics and Computation

1 Fixed-Point Logics and Computation Symposium on the Unusual Effectiveness of Logic in Computer Science University of Cambridge 2 Mathematical Logic Mathematical logic seeks to formalise the process of

Proof of Infinite Number of Fibonacci Primes. Stephen Marshall. 22 May Abstract

Proof of Infinite Number of Fibonacci Primes Stephen Marshall 22 May 2014 Abstract This paper presents a complete and exhaustive proof of that an infinite number of Fibonacci Primes exist. The approach

(Academy of Economic Studies) Veronica Adriana Popescu (Academy of Economic Studies) Cristina Raluca Popescu (University of Bucharest)

24 (Academy of Economic Studies) Veronica Adriana Popescu (Academy of Economic Studies) Cristina Raluca Popescu (University of Bucharest) Abstract: the importance of computer science, with the most important

Self-Referential Probabilities

Self-Referential Probabilities And a Kripkean semantics Catrin Campbell-Moore Munich Center for Mathematical Philosophy Bridges 2 September 2015 Supported by Introduction Languages that can talk about

The Fruits of Logicism

The Fruits of Logicism Timothy Bays 1. Introduction. You ll be pleased to know that I don t intend to use these remarks to comment on all of the papers presented at this conference. I won t try to show

Theory of Computation Lecture Notes

Theory of Computation Lecture Notes Abhijat Vichare August 2005 Contents 1 Introduction 2 What is Computation? 3 The λ Calculus 3.1 Conversions: 3.2 The calculus in use 3.3 Few Important Theorems 3.4 Worked

EQUATIONAL LOGIC AND ABSTRACT ALGEBRA * ABSTRACT

EQUATIONAL LOGIC AND ABSTRACT ALGEBRA * Taje I. Ramsamujh Florida International University Mathematics Department ABSTRACT Equational logic is a formalization of the deductive methods encountered in studying

Tarski s Conceptual Analysis of Semantical Notions 1. Solomon Feferman

Tarski s Conceptual Analysis of Semantical Notions 1 Solomon Feferman Dedicated to the memory of Robert L. Vaught (1926-2002) Fellow student, dear friend, colleague Abstract: Tarski is famous for his widely

6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008

MIT OpenCourseWare http://ocw.mit.edu 6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.

Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras

Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture No. # 31 Recursive Sets, Recursively Innumerable Sets, Encoding

Models of Sequential Computation

Models of Sequential Computation 13 C H A P T E R Programming is often considered as an art, but it raises mostly practical questions like which language should I choose, which algorithm is adequate, and

Foundations of mathematics

Foundations of mathematics 1. First foundations of mathematics 1.1. Introduction to the foundations of mathematics Mathematics, theories and foundations Sylvain Poirier http://settheory.net/ Mathematics

Degrees that are not degrees of categoricity

Degrees that are not degrees of categoricity Bernard A. Anderson Department of Mathematics and Physical Sciences Gordon State College banderson@gordonstate.edu www.gordonstate.edu/faculty/banderson Barbara

So let us begin our quest to find the holy grail of real analysis.

1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers

MATHEMATICS EDUCATION FOR SOFTWARE ENGINEERS: IT SHOULD BE RADICALLY DIFFERENT!

MATHEMATICS EDUCATION FOR SOFTWARE ENGINEERS: IT SHOULD BE RADICALLY DIFFERENT! Franz LICHTENBERGER Research Institute for Sybolic Computation (Risc-Linz) Johannes Kepler University and Department of Software

Gödel's Theorems and Truth

HOME BOOKSTORE ESSAYS VIDEOS PHOTOS BLOG GODTUBE YOUTUBE PANORAMIO FAQ LINKS GENESIS WEEK Gödel's Theorems and Truth Author: Dan Graves Subject: Mathematics & Probability Date: 1/17/98 Summary Famed mathematician

Foundational Proof Certificates

An application of proof theory to computer science INRIA-Saclay & LIX, École Polytechnique CUSO Winter School, Proof and Computation 30 January 2013 Can we standardize, communicate, and trust formal proofs?

Artificial Intelligence in Knowledge-based Technologies and Systems

Computer Science and Information Technology 4(1): 27-32, 2016 DOI: 10.13189/csit.2016.040105 http://www.hrpub.org Artificial Intelligence in Knowledge-based Technologies and Systems Viktor Krasnoproshin

This asserts two sets are equal iff they have the same elements, that is, a set is determined by its elements.

3. Axioms of Set theory Before presenting the axioms of set theory, we first make a few basic comments about the relevant first order logic. We will give a somewhat more detailed discussion later, but

DEGREE OF NEGATION OF AN AXIOM

DEGREE OF NEGATION OF AN AXIOM Florentin Smarandache, Ph D Professor of Mathematics Chair of Department of Math & Sciences University of New Mexico 200 College Road Gallup, NM 87301, USA E-mail: smarand@unm.edu

6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008

MIT OpenCourseWare http://ocw.mit.edu 6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.

Theorem3.1.1 Thedivisionalgorithm;theorem2.2.1insection2.2 If m, n Z and n is a positive

Chapter 3 Number Theory 159 3.1 Prime Numbers Prime numbers serve as the basic building blocs in the multiplicative structure of the integers. As you may recall, an integer n greater than one is prime

Logic and Computers. A Sketch of Their Symbiotic Relationships

Logic and Computers. A Sketch of Their Symbiotic Relationships Jordi Vallverdú (Philosophy Department, Universitat Autònoma de Barcelona) jordi.vallverdu@uab.cat 0. Introduction It is a well established

COMPUTER SCIENCE STUDENTS NEED ADEQUATE MATHEMATICAL BACKGROUND

COMPUTER SCIENCE STUDENTS NEED ADEQUATE MATHEMATICAL BACKGROUND Hasmik GHARIBYAN PAULSON Computer Science Department, California Polytechnic State University, 1 Grand Avenue, San Luis Obispo, CA 93407,

Verification of Imperative Programs in Theorema

Verification of Imperative Programs in Theorema Laura Ildikó Kovács, Nikolaj Popov, Tudor Jebelean 1 Research Institute for Symbolic Computation, Johannes Kepler University, A-4040 Linz, Austria Institute

The Relation between Two Present Value Formulae

James Ciecka, Gary Skoog, and Gerald Martin. 009. The Relation between Two Present Value Formulae. Journal of Legal Economics 15(): pp. 61-74. The Relation between Two Present Value Formulae James E. Ciecka,

Appendices master s degree programme Artificial Intelligence 2014-2015

Appendices master s degree programme Artificial Intelligence 2014-2015 Appendix I Teaching outcomes of the degree programme (art. 1.3) 1. The master demonstrates knowledge, understanding and the ability

The epistemic structure of de Finetti s betting problem

The epistemic structure of de Finetti s betting problem Tommaso Flaminio 1 and Hykel Hosni 2 1 IIIA - CSIC Campus de la Univ. Autònoma de Barcelona s/n 08193 Bellaterra, Spain. Email: tommaso@iiia.csic.es

Formalism and Intuition in Software Development

Formalism and Intuition in Software Development... intuition and deduction, on which alone we rely in the acquisition of knowledge. René Descartes Michael Jackson The Open University jacksonma@acm.org

Predicate logic Proofs Artificial intelligence. Predicate logic. SET07106 Mathematics for Software Engineering

Predicate logic SET07106 Mathematics for Software Engineering School of Computing Edinburgh Napier University Module Leader: Uta Priss 2010 Copyright Edinburgh Napier University Predicate logic Slide 1/24

Remarks on Non-Fregean Logic

STUDIES IN LOGIC, GRAMMAR AND RHETORIC 10 (23) 2007 Remarks on Non-Fregean Logic Mieczys law Omy la Institute of Philosophy University of Warsaw Poland m.omyla@uw.edu.pl 1 Introduction In 1966 famous Polish

Technical Report. Machine learning and automated theorem proving. James P. Bridge. Number 792. November Computer Laboratory

Technical Report UCAM-CL-TR-792 ISSN 1476-2986 Number 792 Computer Laboratory Machine learning and automated theorem proving James P. Bridge November 2010 15 JJ Thomson Avenue Cambridge CB3 0FD United

The history of his life

One of the most important scientist of the history, father of the artificial intelligence. A man that, during the second world war, saved millions of people and who was sentenced because homosexual. Alan

Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof. Harper Langston New York University

Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof Harper Langston New York University Proof and Counterexample Discovery and proof Even and odd numbers number n from Z is called

Factoring & Primality

Factoring & Primality Lecturer: Dimitris Papadopoulos In this lecture we will discuss the problem of integer factorization and primality testing, two problems that have been the focus of a great amount

Undecidable First-Order Theories of Affine Geometries

Undecidable First-Order Theories of Affine Geometries Antti Kuusisto University of Tampere Joint work with Jeremy Meyers (Stanford University) and Jonni Virtema (University of Tampere) Tarski s Geometry

Overview of the TACITUS Project

Overview of the TACITUS Project Jerry R. Hobbs Artificial Intelligence Center SRI International 1 Aims of the Project The specific aim of the TACITUS project is to develop interpretation processes for

SELF-REFERENCE IN FINITE AND INFINITE PARADOXES TJEERD B. JONGELING, TEUN KOETSIER AND EVERT WATTEL

Logique & Analyse 177 178 (2002), x x SELF-REFERENCE IN FINITE AND INFINITE PARADOXES TJEERD B. JONGELING, TEUN KOETSIER AND EVERT WATTEL Introduction The paradoxical character of logical paradoxes has