Combining Reasoning Systems for Mathematical Discovery

Size: px
Start display at page:

Download "Combining Reasoning Systems for Mathematical Discovery"

Transcription

1 Combining Reasoning Systems for Mathematical Discovery Simon Colton Combined Reasoning Group Department of Computing Imperial College, London

2 My one point is... We [AI researchers] should stop thinking (only) about single AI systems for scientific discovery We should start thinking (more) about combining different reasoning systems for scientific discovery

3 To make my point... I ll describe projects where combined systems Have performed tasks which standalone systems cannot Have been more flexible than standalone systems Are better at standard AI tasks than standalone systems All in the context of mathematical discovery

4 Mathematical Discovery Taster Odd refactorable numbers are perfect squares (JIS 2001) Isomorphic/isotopic algebraic classification results (CMUC 2008) Commentationes Mathematicae Universitatis Carolinae

5 1,9,225,... (odd refactorable numbers) The HR System - Example [a,b]: b a [a,b,c] : a = b * c size split match [a,n]: n = {b : b a} [a]: 2 a [a,b] : a = b * b compose negate exists [a,n]: n = {b : b a} & n a exists [a]: (2 a) [a] : b (a = b * b) 1,4,9,16,... (square numbers) [a]: n (n = {b : b a} & n a) 1,2,8,9,12,18,...(refactorable numbers) compose implication conjecture [a]: n (n = {b : b a} & n a) & (2 a)

6 HR System - a few details 22 Production rules (but we normally only use 6 or 7) 3 Main ways to produce conjectures Also has ways to extract prime implicates 22 Measures of interestingness Which drive a heuristic search (new concepts are built from the best old ones)

7 Mathematical Applications HR + Otter + MACE [theory formation about star algebras] HR + Otter + Maple [conjecture making in number theory] Bootstrapping system [deriving classification theorems in loop/quasigroup theory]

8 Star algebras - setup Single axiom algebra : x y z ((x*y)*z = y*(z*x)) HR starts with only this axiom First conjecture: no star algebras exist MACE disproves with a counterexample HR makes conjectures Otter attempts to prove, MACE attempts to disprove We look for interesting true results and open conjectures

9 Star algebras - results a b (b * a = a a * b = a) Mathematical Knowledge Management 2006 with Pedro Torres, Paul Cairns and Volker Sorge Elements with a left/right identity are closed under * Idempotent elements are closed under * Main result: there is no interesting canonical example They are either reducible (repeated row and column) Or are star algebras because commutative & associative

10 The HOMER system - setup The user supplies some number theory concepts from Maple e.g., tau, sigma, phi, isprime, iseven, isodd, issquare Maple is used to calculate background knowledge HR makes conjectures, we prove interesting ones by hand Otter is used to prove conjectures from some given axioms Any proved conjectures are thrown away We also added interesting conjectures to axiom sets

11 The HOMER system - results Experiment 1: tau(n), sigma(n) and isprime(n) Journal of Symbolic Computation 2005 Nice result: isprime(sigma(n)) isprime(tau(n)) Experiment 2: tau, sigma, odd, even, refactorable, issquare Nice result: issquare(a) isodd(sigma(a)) Four teasers about r.f. numbers: even(a) & refactorable(sigma(a)) even(tau(a))

12 The HOMER system - results Conference on Automated Deduction (CADE) 2003 with Sophie Huczynska Experiment 3: With phi function Nice result: even(phi(n)) n > 2 Nice result: issquare(phi(n)) even(tau(n)) Cute because requires the contrapositive to prove

13 Bootstrapping system - overview Fairly complicated system by Sorge and Meier HR is one of a number of reasoning systems Model generators, SAT-solvers, CAS, theorem provers Starts with: (i) axioms of an algebra (ii) size (iii) equivalence relation Ends with: A fully proved classification tree (theorem)

14 Bootstrapping system - example

15 Bootstrapping system - results Isomorphic classification (with HR) 7 full results: Q3,Q4,Q5,IQ6,QG3.6,Loop5,Loop6 2 partial results: QG9.7, Idempotent Loop 7 Isotopism classification (without HR) 2 full results: Loop6, Loop7 Papers: IJCAR 04, ML 06, IJCAR 06, JAR 07, Loops08, CMUC 08 Work with Volker Sorge, Andreas Meier, Roy McCasland

16 Q4 Isomorphism #1

17 Loop6 Isotopism

18 Q4 - Isomorphism #2

19 More Flexibility - TM System Given a non-theorem, theorem provers just say no and model generators give a counterexample, but no explanation TM produces a set of alternative, proved theorems Works using Otter and MACE, but differently: MACE produces supporting and counter examples HR invents concepts true of supporting examples only Otter proves that specialised conjectures are true

20 TM System - Results Electronic Notes on Computer Science 2005 with Alison Pease 83% of 97 non-theorems were modified successfully Theorems taken from the TPTP library (and ruined...) Nice example from ring theory w x ((((w*w)*x)*(w*w) = id) fixed if x (x*x = x+x)

21 Improving AI systems - ICARUS CSP reformulation is an important area We looked at discovering implied constraints Start with a specification of a parameterised CSP CLPFD solver produces solutions to small problems HR suggests some conjectures about the examples Otter is used to prove that they follow from the spec. ICARUS finds those (sets) which make good constraints

22 ICARUS - results European Conference on AI (ECAI) 2006 with John Charnley and Ian Miguel Worked with standard CSP benchmark: QG quasigroups QG3/4: quasigroups are anti-abelian QG3: a*a = b b*b = a

23 Please ask me about... Case-splitting first order theorems Automatic generation of first order theorems for TPTP A rational reconstruction of Graffiti Computational model of Lakatos s philosophy of Maths

24 Some Ongoing Work PhD project of Pedro Torres: Meta-theory formation PhD project of John Charnley: A global workspaces approach to combining reasoners PostDoc project of Alison Pease A computational model of axiom formation using Where mathematics comes from by Lakoff and Nunez Feasibility study: mathematical invention of fitness functions

25 Conclusions The whole is more than a sum of the parts: New tasks, improved efficiency, more flexibility It is time to put AI back together again Workflows of reasoning (like data analysis) Math/scientific discovery is a great application domain Hopefully of benefit to science

COMPUTING RELATIVELY LARGE ALGEBRAIC STRUCTURES BY AUTOMATED THEORY EXPLORATION

COMPUTING RELATIVELY LARGE ALGEBRAIC STRUCTURES BY AUTOMATED THEORY EXPLORATION COMPUTING RELATIVELY LARGE ALGEBRAIC STRUCTURES BY AUTOMATED THEORY EXPLORATION by QURATUL-AIN MAHESAR A thesis submitted to The University of Birmingham for the degree of DOCTOR OF PHILOSOPHY School of

More information

MATH CSE20 Homework 5 Due Monday November 4

MATH CSE20 Homework 5 Due Monday November 4 MATH CSE20 Homework 5 Due Monday November 4 Assigned reading: NT Section 1 (1) Prove the statement if true, otherwise find a counterexample. (a) For all natural numbers x and y, x + y is odd if one of

More information

Week 2. Week 1 Recap. Week 2

Week 2. Week 1 Recap. Week 2 Week 2 Week 1 Recap In our first session, we outlined our big-picture goals for this course. We are going to spend these first couple weeks looking at mathematical proof, then we will take a couple weeks

More information

Automated theorem proving in algebra

Automated theorem proving in algebra Automated theorem proving in algebra David Stanovský Charles University in Prague Czech Republic stanovsk@karlin.mff.cuni.cz http://www.karlin.mff.cuni.cz/ stanovsk Beograd, November 2009 David Stanovský

More information

Scalable and Accurate Verification of Data Flow Systems. Cesare Tinelli The University of Iowa

Scalable and Accurate Verification of Data Flow Systems. Cesare Tinelli The University of Iowa Scalable and Accurate Verification of Data Flow Systems Cesare Tinelli The University of Iowa Overview AFOSR Supported Research Collaborations NYU (project partner) Chalmers University (research collaborator)

More information

Enumerating AG-Groups with a Study of Smaradache AG-Groups

Enumerating AG-Groups with a Study of Smaradache AG-Groups International Mathematical Forum, Vol. 6, 2011, no. 62, 3079-3086 Enumerating AG-Groups with a Study of Smaradache AG-Groups Muhammad Shah 1 Department of Mathematics Quaid-i-Azam University, Pakistan

More information

The following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof

The following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof Ch. 1.6 Introduction to Proofs The following techniques for methods of proofs are discussed in our text - Vacuous proof - Trivial proof - Direct proof - Indirect proof (our book calls this by contraposition)

More information

Unit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9

Unit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9 Unit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9 Typeset September 23, 2005 1 Statements or propositions Defn: A statement is an assertion

More information

We last time we began introducing equivalency laws.

We last time we began introducing equivalency laws. Monday, January 14 MAD2104 Discrete Math 1 Course website: www/mathfsuedu/~wooland/mad2104 Today we will continue in Course Notes Chapter 22 We last time we began introducing equivalency laws Today we

More information

On relations between right alternative and nuclear square AG-groupoids

On relations between right alternative and nuclear square AG-groupoids International Mathematical Forum, Vol. 8, 2013, no. 5, 237-243 On relations between right alternative and nuclear square AG-groupoids Muhammad Rashad, Imtiaz Ahmad, Amanullah Department of Mathematics

More information

Your quiz in recitation on Tuesday will cover 3.1: Arguments and inference. Your also have an online quiz, covering 3.1, due by 11:59 p.m., Tuesday.

Your quiz in recitation on Tuesday will cover 3.1: Arguments and inference. Your also have an online quiz, covering 3.1, due by 11:59 p.m., Tuesday. Friday, February 15 Today we will begin Course Notes 3.2: Methods of Proof. Your quiz in recitation on Tuesday will cover 3.1: Arguments and inference. Your also have an online quiz, covering 3.1, due

More information

Agent-Based HOL Reasoning 1

Agent-Based HOL Reasoning 1 Agent-Based HOL Reasoning 1 Alexander Steen Max Wisniewski Christoph Benzmüller Freie Universität Berlin 5th International Congress on Mathematical Software (ICMS 2016) 1 This work has been supported by

More information

All numbered readings are from Beck and Geoghegan s The art of proof.

All numbered readings are from Beck and Geoghegan s The art of proof. MATH 301. Assigned readings and homework All numbered readings are from Beck and Geoghegan s The art of proof. Reading Jan 30, Feb 1: Chapters 1.1 1.2 Feb 6, 8: Chapters 1.3 2.1 Feb 13, 15: Chapters 2.2

More information

MATH 433 Applied Algebra Lecture 22: Review for Exam 2.

MATH 433 Applied Algebra Lecture 22: Review for Exam 2. MATH 433 Applied Algebra Lecture 22: Review for Exam 2. Topics for Exam 2 Permutations Cycles, transpositions Cycle decomposition of a permutation Order of a permutation Sign of a permutation Symmetric

More information

Outline. We will now investigate the structure of this important set.

Outline. We will now investigate the structure of this important set. The Reals Outline As we have seen, the set of real numbers, R, has cardinality c. This doesn't tell us very much about the reals, since there are many sets with this cardinality and cardinality doesn't

More information

Classifying Bol-Moufang Quasigroups Under a Single Operation

Classifying Bol-Moufang Quasigroups Under a Single Operation Classifying Bol-Moufang Quasigroups Under a Single Operation Ashley Arp Jasmine Van Exel Michael Kaminski Davian Vernon Black Hills State University Paine College Knox College Morehouse College Abstract

More information

1.1 Statements and Compound Statements

1.1 Statements and Compound Statements Chapter 1 Propositional Logic 1.1 Statements and Compound Statements A statement or proposition is an assertion which is either true or false, though you may not know which. That is, a statement is something

More information

Section 1.2 Propositional Equivalences. A tautology is a proposition which is always true. A contradiction is a proposition which is always false.

Section 1.2 Propositional Equivalences. A tautology is a proposition which is always true. A contradiction is a proposition which is always false. Section 1.2 Propositional Equivalences A tautology is a proposition which is always true. Classic Example: P P A contradiction is a proposition which is always false. Classic Example: P P A contingency

More information

A Note on UNAR LA-Semigroup

A Note on UNAR LA-Semigroup Punjab University Journal of Mathematics (ISSN 1016-2526) Vol. 50(3)(2018) pp. 113-121 A Note on UNAR LA-Semigroup Muhammad Rashad Department of Mathematics, University of Malakand, Pakistan, Email: rashad@uom.edu.pk

More information

COMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University

COMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University COMP 182 Algorithmic Thinking Proofs Luay Nakhleh Computer Science Rice University 1 Reading Material Chapter 1, Section 3, 6, 7, 8 Propositional Equivalences The compound propositions p and q are called

More information

Homework 3/ Solutions

Homework 3/ Solutions MTH 310-3 Abstract Algebra I and Number Theory S17 Homework 3/ Solutions Exercise 1. Prove the following Theorem: Theorem Let R and S be rings. Define an addition and multiplication on R S by for all r,

More information

Short Equational Bases for Ortholattices

Short Equational Bases for Ortholattices Short Equational Bases for Ortholattices W. McCune R. Padmanabhan M. A. Rose R. Veroff October 30, 2003 Abstract Short single axioms for ortholattices, orthomodular lattices, and modular ortholattices

More information

(3,1) Methods of Proof

(3,1) Methods of Proof King Saud University College of Sciences Department of Mathematics 151 Math Exercises (3,1) Methods of Proof 1-Direct Proof 2- Proof by Contraposition 3- Proof by Contradiction 4- Proof by Cases By: Malek

More information

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises WUCT11 Discrete Mathematics Logic Tutorial Exercises 1 Logic Predicate Logic 3 Proofs 4 Set Theory 5 Relations and Functions WUCT11 Logic Tutorial Exercises 1 Section 1: Logic Question1 For each of the

More information

Math 38: Graph Theory Spring 2004 Dartmouth College. On Writing Proofs. 1 Introduction. 2 Finding A Solution

Math 38: Graph Theory Spring 2004 Dartmouth College. On Writing Proofs. 1 Introduction. 2 Finding A Solution Math 38: Graph Theory Spring 2004 Dartmouth College 1 Introduction On Writing Proofs What constitutes a well-written proof? A simple but rather vague answer is that a well-written proof is both clear and

More information

Eves Equihoop, The Card Game SET, and Abstract SET

Eves Equihoop, The Card Game SET, and Abstract SET Eves Equihoop, The Card Game SET, and Abstract SET Arthur Holshouser 3600 Bullard St Charlotte, NC, USA Harold Reiter Department of Mathematics, University of North Carolina Charlotte, Charlotte, NC 83,

More information

Homework 1/Solutions. Graded Exercises

Homework 1/Solutions. Graded Exercises MTH 310-3 Abstract Algebra I and Number Theory S18 Homework 1/Solutions Graded Exercises Exercise 1. Below are parts of the addition table and parts of the multiplication table of a ring. Complete both

More information

Mathematical Proofs. e x2. log k. a+b a + b. Carlos Moreno uwaterloo.ca EIT e π i 1 = 0.

Mathematical Proofs. e x2. log k. a+b a + b. Carlos Moreno uwaterloo.ca EIT e π i 1 = 0. Mathematical Proofs Carlos Moreno cmoreno @ uwaterloo.ca EIT-4103 N k=0 log k 0 e x2 e π i 1 = 0 dx a+b a + b https://ece.uwaterloo.ca/~cmoreno/ece250 Today's class: Mathematical Proofs We'll investigate

More information

* 8 Groups, with Appendix containing Rings and Fields.

* 8 Groups, with Appendix containing Rings and Fields. * 8 Groups, with Appendix containing Rings and Fields Binary Operations Definition We say that is a binary operation on a set S if, and only if, a, b, a b S Implicit in this definition is the idea that

More information

Chapter 2 Section 2.1: Proofs Proof Techniques. CS 130 Discrete Structures

Chapter 2 Section 2.1: Proofs Proof Techniques. CS 130 Discrete Structures Chapter 2 Section 2.1: Proofs Proof Techniques CS 130 Discrete Structures Some Terminologies Axioms: Statements that are always true. Example: Given two distinct points, there is exactly one line that

More information

Name Date Class California Standards Prep for 4.0. Variables and Expressions

Name Date Class California Standards Prep for 4.0. Variables and Expressions California Standards Prep for 4.0 To translate words into algebraic expressions, find words like these that tell you the operation. add subtract multiply divide sum difference product quotient more less

More information

Total Time = 90 Minutes, Total Marks = 50. Total /50 /10 /18

Total Time = 90 Minutes, Total Marks = 50. Total /50 /10 /18 University of Waterloo Department of Electrical & Computer Engineering E&CE 223 Digital Circuits and Systems Midterm Examination Instructor: M. Sachdev October 23rd, 2007 Total Time = 90 Minutes, Total

More information

Mathematical Proofs. e x2. log k. a+b a + b. Carlos Moreno uwaterloo.ca EIT e π i 1 = 0.

Mathematical Proofs. e x2. log k. a+b a + b. Carlos Moreno uwaterloo.ca EIT e π i 1 = 0. Mathematical Proofs Carlos Moreno cmoreno @ uwaterloo.ca EIT-4103 N k=0 log k 0 e x2 e π i 1 = 0 dx a+b a + b https://ece.uwaterloo.ca/~cmoreno/ece250 Mathematical Proofs Standard reminder to set phones

More information

NORTHERN INDIA ENGINEERING COLLEGE, LKO D E P A R T M E N T O F M A T H E M A T I C S. B.TECH IIIrd SEMESTER QUESTION BANK ACADEMIC SESSION

NORTHERN INDIA ENGINEERING COLLEGE, LKO D E P A R T M E N T O F M A T H E M A T I C S. B.TECH IIIrd SEMESTER QUESTION BANK ACADEMIC SESSION NORTHERN INDIA ENGINEERING COLLEGE, LKO D E P A R T M E N T O F M A T H E M A T I C S B.TECH IIIrd SEMESTER QUESTION BANK ACADEMIC SESSION 011-1 DISCRETE MATHEMATICS (EOE 038) 1. UNIT I (SET, RELATION,

More information

Examples of Groups

Examples of Groups Examples of Groups 8-23-2016 In this section, I ll look at some additional examples of groups. Some of these will be discussed in more detail later on. In many of these examples, I ll assume familiar things

More information

Vinter: A Vampire-Based Tool for Interpolation

Vinter: A Vampire-Based Tool for Interpolation Vinter: A Vampire-Based Tool for Interpolation Kryštof Hoder 1, Andreas Holzer 2, Laura Kovács 2, and Andrei Voronkov 1 1 University of Manchester 2 TU Vienna Abstract. This paper describes the Vinter

More information

Intro to Algebra Today. We will learn names for the properties of real numbers. Homework Next Week. Due Tuesday 45-47/ 15-20, 32-35, 40-41, *28,29,38

Intro to Algebra Today. We will learn names for the properties of real numbers. Homework Next Week. Due Tuesday 45-47/ 15-20, 32-35, 40-41, *28,29,38 Intro to Algebra Today We will learn names for the properties of real numbers. Homework Next Week Due Tuesday 45-47/ 15-20, 32-35, 40-41, *28,29,38 Due Thursday Pages 51-53/ 19-24, 29-36, *48-50, 60-65

More information

Math Real Analysis

Math Real Analysis 1 / 28 Math 370 - Real Analysis G.Pugh Sep 3 2013 Real Analysis 2 / 28 3 / 28 What is Real Analysis? Wikipedia: Real analysis... has its beginnings in the rigorous formulation of calculus. It is a branch

More information

7. Propositional Logic. Wolfram Burgard and Bernhard Nebel

7. Propositional Logic. Wolfram Burgard and Bernhard Nebel Foundations of AI 7. Propositional Logic Rational Thinking, Logic, Resolution Wolfram Burgard and Bernhard Nebel Contents Agents that think rationally The wumpus world Propositional logic: syntax and semantics

More information

Modern Algebra Prof. Manindra Agrawal Department of Computer Science and Engineering Indian Institute of Technology, Kanpur

Modern Algebra Prof. Manindra Agrawal Department of Computer Science and Engineering Indian Institute of Technology, Kanpur Modern Algebra Prof. Manindra Agrawal Department of Computer Science and Engineering Indian Institute of Technology, Kanpur Lecture 02 Groups: Subgroups and homomorphism (Refer Slide Time: 00:13) We looked

More information

STRATEGIES OF PROBLEM SOLVING

STRATEGIES OF PROBLEM SOLVING STRATEGIES OF PROBLEM SOLVING Second Edition Maria Nogin Department of Mathematics College of Science and Mathematics California State University, Fresno 2014 2 Chapter 1 Introduction Solving mathematical

More information

Group, Rings, and Fields Rahul Pandharipande. I. Sets Let S be a set. The Cartesian product S S is the set of ordered pairs of elements of S,

Group, Rings, and Fields Rahul Pandharipande. I. Sets Let S be a set. The Cartesian product S S is the set of ordered pairs of elements of S, Group, Rings, and Fields Rahul Pandharipande I. Sets Let S be a set. The Cartesian product S S is the set of ordered pairs of elements of S, A binary operation φ is a function, S S = {(x, y) x, y S}. φ

More information

Direct Proof and Counterexample I:Introduction

Direct Proof and Counterexample I:Introduction Direct Proof and Counterexample I:Introduction Copyright Cengage Learning. All rights reserved. Goal Importance of proof Building up logic thinking and reasoning reading/using definition interpreting :

More information

Direct Proof and Counterexample I:Introduction. Copyright Cengage Learning. All rights reserved.

Direct Proof and Counterexample I:Introduction. Copyright Cengage Learning. All rights reserved. Direct Proof and Counterexample I:Introduction Copyright Cengage Learning. All rights reserved. Goal Importance of proof Building up logic thinking and reasoning reading/using definition interpreting statement:

More information

Math 3320 Foundations of Mathematics

Math 3320 Foundations of Mathematics Math 3320 Foundations of Mathematics Chapter 1: Fundamentals Jesse Crawford Department of Mathematics Tarleton State University (Tarleton State University) Chapter 1 1 / 55 Outline 1 Section 1.1: Why Study

More information

Section 3.1: Direct Proof and Counterexample 1

Section 3.1: Direct Proof and Counterexample 1 Section 3.1: Direct Proof and Counterexample 1 In this chapter, we introduce the notion of proof in mathematics. A mathematical proof is valid logical argument in mathematics which shows that a given conclusion

More information

Inductive Theorem Proving

Inductive Theorem Proving Introduction Inductive Proofs Automation Conclusion Automated Reasoning P.Papapanagiotou@sms.ed.ac.uk 11 October 2012 Introduction Inductive Proofs Automation Conclusion General Induction Theorem Proving

More information

Chapter 2. Boolean Algebra and Logic Gates

Chapter 2. Boolean Algebra and Logic Gates Chapter 2 Boolean Algebra and Logic Gates Basic Definitions A binary operator defined on a set S of elements is a rule that assigns, to each pair of elements from S, a unique element from S. The most common

More information

Deduction and Induction. Stephan Schulz. The Inference Engine. Machine Learning. A Match Made in Heaven

Deduction and Induction. Stephan Schulz. The Inference Engine. Machine Learning. A Match Made in Heaven Deduction and Induction A Match Made in Heaven Stephan Schulz The Inference Engine Machine Learning Deduction and Induction A Match Made in Heaven Stephan Schulz or a Deal with the Devil? The Inference

More information

An Introduction to Proofs in Mathematics

An Introduction to Proofs in Mathematics An Introduction to Proofs in Mathematics The subject of mathematics is often regarded as a pinnacle in the achievement of human reasoning. The reason that mathematics is so highly regarded in the realm

More information

Prove proposition 68. It states: Let R be a ring. We have the following

Prove proposition 68. It states: Let R be a ring. We have the following Theorem HW7.1. properties: Prove proposition 68. It states: Let R be a ring. We have the following 1. The ring R only has one additive identity. That is, if 0 R with 0 +b = b+0 = b for every b R, then

More information

MATH10040: Chapter 0 Mathematics, Logic and Reasoning

MATH10040: Chapter 0 Mathematics, Logic and Reasoning MATH10040: Chapter 0 Mathematics, Logic and Reasoning 1. What is Mathematics? There is no definitive answer to this question. 1 Indeed, the answer given by a 21st-century mathematician would differ greatly

More information

A CLASS OF LOOPS CATEGORICALLY ISOMORPHIC TO UNIQUELY 2-DIVISIBLE BRUCK LOOPS

A CLASS OF LOOPS CATEGORICALLY ISOMORPHIC TO UNIQUELY 2-DIVISIBLE BRUCK LOOPS A CLASS OF LOOPS CATEGORICALLY ISOMORPHIC TO UNIQUELY 2-DIVISIBLE BRUCK LOOPS MARK GREER Abstract. We define a new variety of loops we call Γ-loops. After showing Γ-loops are power associative, our main

More information

COLLEGE ALGEBRA. Properties of Real Numbers with Clock Arithmetic

COLLEGE ALGEBRA. Properties of Real Numbers with Clock Arithmetic COLLEGE ALGEBRA By: Sister Mary Rebekah www.survivormath.weebly.com Cornell-Style Fill in the Blank Notes and Teacher s Key Properties of Real Numbers with Clock Arithmetic 1 Topic: Clock Arithmetic Addition

More information

Proofs. Chapter 2 P P Q Q

Proofs. Chapter 2 P P Q Q Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,

More information

ASSIGNMENT 1 SOLUTIONS

ASSIGNMENT 1 SOLUTIONS MATH 271 ASSIGNMENT 1 SOLUTIONS 1. (a) Let S be the statement For all integers n, if n is even then 3n 11 is odd. Is S true? Give a proof or counterexample. (b) Write out the contrapositive of statement

More information

NAPOLEON S QUASIGROUPS

NAPOLEON S QUASIGROUPS NAPOLEON S QUASIGROUPS VEDRAN KRČADINAC Abstract. Napoleon s quasigroups are idempotent medial quasigroups satisfying the identity (ab b)(b ba) = b. In works by V.Volenec geometric terminology has been

More information

Combinational Logic Fundamentals

Combinational Logic Fundamentals Topic 3: Combinational Logic Fundamentals In this note we will study combinational logic, which is the part of digital logic that uses Boolean algebra. All the concepts presented in combinational logic

More information

Spectra of Semidirect Products of Cyclic Groups

Spectra of Semidirect Products of Cyclic Groups Spectra of Semidirect Products of Cyclic Groups Nathan Fox 1 University of Minnesota-Twin Cities Abstract The spectrum of a graph is the set of eigenvalues of its adjacency matrix A group, together with

More information

Proofs. Chapter 2 P P Q Q

Proofs. Chapter 2 P P Q Q Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,

More information

Foundations of Artificial Intelligence

Foundations of Artificial Intelligence Foundations of Artificial Intelligence 7. Propositional Logic Rational Thinking, Logic, Resolution Wolfram Burgard, Maren Bennewitz, and Marco Ragni Albert-Ludwigs-Universität Freiburg Contents 1 Agents

More information

Cheban loops. 1 Introduction

Cheban loops. 1 Introduction Ashdin Publishing Journal of Generalized Lie Theory and Applications Vol. 4 (2010), Article ID G100501, 5 pages doi:10.4303/jglta/g100501 Cheban loops J. D. Phillips a and V. A. Shcherbacov b a Department

More information

Lecture 3. Logic Predicates and Quantified Statements Statements with Multiple Quantifiers. Introduction to Proofs. Reading (Epp s textbook)

Lecture 3. Logic Predicates and Quantified Statements Statements with Multiple Quantifiers. Introduction to Proofs. Reading (Epp s textbook) Lecture 3 Logic Predicates and Quantified Statements Statements with Multiple Quantifiers Reading (Epp s textbook) 3.1-3.3 Introduction to Proofs Reading (Epp s textbook) 4.1-4.2 1 Propositional Functions

More information

Group Theory in Linear Algebra

Group Theory in Linear Algebra (Boston, 1/4/2012 : 0) Group Theory in Linear Algebra Paul Becker: Penn State Erie, The Behrend College Mark Medwid: Penn State Erie, The Behrend College (Boston, 1/4/2012 : 1) Math 436 (Linear Algebra)

More information

Foundations of Artificial Intelligence

Foundations of Artificial Intelligence Foundations of Artificial Intelligence 7. Propositional Logic Rational Thinking, Logic, Resolution Joschka Boedecker and Wolfram Burgard and Bernhard Nebel Albert-Ludwigs-Universität Freiburg May 17, 2016

More information

MATH 433 Applied Algebra Lecture 22: Semigroups. Rings.

MATH 433 Applied Algebra Lecture 22: Semigroups. Rings. MATH 433 Applied Algebra Lecture 22: Semigroups. Rings. Groups Definition. A group is a set G, together with a binary operation, that satisfies the following axioms: (G1: closure) for all elements g and

More information

AN INTRODUCTION TO AFFINE SCHEMES

AN INTRODUCTION TO AFFINE SCHEMES AN INTRODUCTION TO AFFINE SCHEMES BROOKE ULLERY Abstract. This paper gives a basic introduction to modern algebraic geometry. The goal of this paper is to present the basic concepts of algebraic geometry,

More information

CHAPTER 10. Gentzen Style Proof Systems for Classical Logic

CHAPTER 10. Gentzen Style Proof Systems for Classical Logic CHAPTER 10 Gentzen Style Proof Systems for Classical Logic Hilbert style systems are easy to define and admit a simple proof of the Completeness Theorem but they are difficult to use. By humans, not mentioning

More information

Ivy: Safety Verification by Interactive Generalization

Ivy: Safety Verification by Interactive Generalization Ivy: Safety Verification by Interactive Generalization Oded Padon Verification Day 1-June-2016 [PLDI 16] Oded Padon, Kenneth McMillan, Aurojit Panda, Mooly Sagiv, Sharon Shoham. Ivy: Safety Verification

More information

Chapter 1 Elementary Logic

Chapter 1 Elementary Logic 2017-2018 Chapter 1 Elementary Logic The study of logic is the study of the principles and methods used in distinguishing valid arguments from those that are not valid. The aim of this chapter is to help

More information

Zeta types and Tannakian symbols

Zeta types and Tannakian symbols Zeta types and Tannakian symbols Andreas Holmstrom & Torstein Vik Uppsala University / Fagerlia Upper Secondary School 2nd Conference on Artificial Intelligence and Theorem Proving Obergurgl, March 26-30,

More information

Boolean Algebra and Logic Gates

Boolean Algebra and Logic Gates Boolean Algebra and Logic Gates ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall, 2017 ldvan@cs.nctu.edu.tw http://www.cs.nctu.edu.tw/~ldvan/ Outlines Basic

More information

First-Order Theorem Proving and Vampire. Laura Kovács (Chalmers University of Technology) Andrei Voronkov (The University of Manchester)

First-Order Theorem Proving and Vampire. Laura Kovács (Chalmers University of Technology) Andrei Voronkov (The University of Manchester) First-Order Theorem Proving and Vampire Laura Kovács (Chalmers University of Technology) Andrei Voronkov (The University of Manchester) Outline Introduction First-Order Logic and TPTP Inference Systems

More information

Mathematics 220 Midterm Practice problems from old exams Page 1 of 8

Mathematics 220 Midterm Practice problems from old exams Page 1 of 8 Mathematics 220 Midterm Practice problems from old exams Page 1 of 8 1. (a) Write the converse, contrapositive and negation of the following statement: For every integer n, if n is divisible by 3 then

More information

Chapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples

Chapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples Chapter 3 Rings Rings are additive abelian groups with a second operation called multiplication. The connection between the two operations is provided by the distributive law. Assuming the results of Chapter

More information

Midterm Exam Solution

Midterm Exam Solution Midterm Exam Solution Name PID Honor Code Pledge: I certify that I am aware of the Honor Code in effect in this course and observed the Honor Code in the completion of this exam. Signature Notes: 1. This

More information

Sect Least Common Denominator

Sect Least Common Denominator 4 Sect.3 - Least Common Denominator Concept #1 Writing Equivalent Rational Expressions Two fractions are equivalent if they are equal. In other words, they are equivalent if they both reduce to the same

More information

Proof Terminology. Technique #1: Direct Proof. Learning objectives. Proof Techniques (Rosen, Sections ) Direct Proof:

Proof Terminology. Technique #1: Direct Proof. Learning objectives. Proof Techniques (Rosen, Sections ) Direct Proof: Proof Terminology Proof Techniques (Rosen, Sections 1.7 1.8) TOPICS Direct Proofs Proof by Contrapositive Proof by Contradiction Proof by Cases Theorem: statement that can be shown to be true Proof: a

More information

Reasoning and Proof Unit

Reasoning and Proof Unit Reasoning and Proof Unit 1 2 2 Conditional Statements Conditional Statement if, then statement the if part is hypothesis the then part is conclusion Conditional Statement How? if, then Example If an angle

More information

Formal Proof Methodology

Formal Proof Methodology Formal Proof Methodology Jason Filippou CMSC250 @ UMCP 06-09-2016 ason Filippou (CMSC250 @ UMCP) Formal Proof Methodology 06-09-2016 1 / 45 Today s agenda We will talk about how to formally prove mathematical

More information

Summer Induction Work

Summer Induction Work Further Maths Summer Induction Work Deadline: Friday 7th September The Hazeley Academy Further Mathematics OCR (MEI): Further Core Pure, Mechanics, Statistics Objectives: To reinforce understanding of

More information

Linear Algebra. Min Yan

Linear Algebra. Min Yan Linear Algebra Min Yan January 2, 2018 2 Contents 1 Vector Space 7 1.1 Definition................................. 7 1.1.1 Axioms of Vector Space..................... 7 1.1.2 Consequence of Axiom......................

More information

Formal Verification Methods 1: Propositional Logic

Formal Verification Methods 1: Propositional Logic Formal Verification Methods 1: Propositional Logic John Harrison Intel Corporation Course overview Propositional logic A resurgence of interest Logic and circuits Normal forms The Davis-Putnam procedure

More information

CM10196 Topic 2: Sets, Predicates, Boolean algebras

CM10196 Topic 2: Sets, Predicates, Boolean algebras CM10196 Topic 2: Sets, Predicates, oolean algebras Guy McCusker 1W2.1 Sets Most of the things mathematicians talk about are built out of sets. The idea of a set is a simple one: a set is just a collection

More information

For all For every For each For any There exists at least one There exists There is Some

For all For every For each For any There exists at least one There exists There is Some Section 1.3 Predicates and Quantifiers Assume universe of discourse is all the people who are participating in this course. Also let us assume that we know each person in the course. Consider the following

More information

Commentationes Mathematicae Universitatis Carolinae

Commentationes Mathematicae Universitatis Carolinae Commentationes Mathematicae Universitatis Carolinae Mark Greer; Lee Raney Moufang semidirect products of loops with groups and inverse property extensions Commentationes Mathematicae Universitatis Carolinae,

More information

Automated Geometry Theorem Proving: Readability vs. Efficiency

Automated Geometry Theorem Proving: Readability vs. Efficiency Automated Geometry Theorem Proving: Readability vs. Efficiency Predrag Janičić URL: www.matf.bg.ac.rs/ janicic Faculty of Mathematics, University of Belgrade, Serbia CADGME; Convergence on Mathematics

More information

A heuristic prover for real inequalities

A heuristic prover for real inequalities A heuristic prover for real inequalities Jeremy Avigad Department of Philosophy and Department of Mathematical Sciences Carnegie Mellon University joint work with Robert Y. Lewis and Cody Roux (many slides

More information

AI Programming CS S-09 Knowledge Representation

AI Programming CS S-09 Knowledge Representation AI Programming CS662-2013S-09 Knowledge Representation David Galles Department of Computer Science University of San Francisco 09-0: Overview So far, we ve talked about search, which is a means of considering

More information

Pre-Algebra (6/7) Pacing Guide

Pre-Algebra (6/7) Pacing Guide Pre-Algebra (6/7) Pacing Guide Vision Statement Imagine a classroom, a school, or a school district where all students have access to high-quality, engaging mathematics instruction. There are ambitious

More information

π(x Y ) and π(k); Semi-Direct Products

π(x Y ) and π(k); Semi-Direct Products π(x Y ) and π(k); Semi-Direct Products Richard Koch January 29, 2006 1 Group Products Recall that if H and K are groups, the new group H K is the set of all ordered pairs (h, k) with h H and k K. The group

More information

Introduction to Data Mining

Introduction to Data Mining Introduction to Data Mining Lecture #21: Dimensionality Reduction Seoul National University 1 In This Lecture Understand the motivation and applications of dimensionality reduction Learn the definition

More information

Boolean Algebra CHAPTER 15

Boolean Algebra CHAPTER 15 CHAPTER 15 Boolean Algebra 15.1 INTRODUCTION Both sets and propositions satisfy similar laws, which are listed in Tables 1-1 and 4-1 (in Chapters 1 and 4, respectively). These laws are used to define an

More information

MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM

MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM Basic Questions 1. Compute the factor group Z 3 Z 9 / (1, 6). The subgroup generated by (1, 6) is

More information

Linear Algebra (Part II) Vector Spaces, Independence, Span and Bases

Linear Algebra (Part II) Vector Spaces, Independence, Span and Bases Linear Algebra (Part II) Vector Spaces, Independence, Span and Bases A vector space, or sometimes called a linear space, is an abstract system composed of a set of objects called vectors, an associated

More information

Review CHAPTER. 2.1 Definitions in Chapter Sample Exam Questions. 2.1 Set; Element; Member; Universal Set Partition. 2.

Review CHAPTER. 2.1 Definitions in Chapter Sample Exam Questions. 2.1 Set; Element; Member; Universal Set Partition. 2. CHAPTER 2 Review 2.1 Definitions in Chapter 2 2.1 Set; Element; Member; Universal Set 2.2 Subset 2.3 Proper Subset 2.4 The Empty Set, 2.5 Set Equality 2.6 Cardinality; Infinite Set 2.7 Complement 2.8 Intersection

More information

CS Lecture 19: Logic To Truth through Proof. Prof. Clarkson Fall Today s music: Theme from Sherlock

CS Lecture 19: Logic To Truth through Proof. Prof. Clarkson Fall Today s music: Theme from Sherlock CS 3110 Lecture 19: Logic To Truth through Proof Prof. Clarkson Fall 2014 Today s music: Theme from Sherlock Review Current topic: How to reason about correctness of code Last week: informal arguments

More information

Math 430 Exam 2, Fall 2008

Math 430 Exam 2, Fall 2008 Do not distribute. IIT Dept. Applied Mathematics, February 16, 2009 1 PRINT Last name: Signature: First name: Student ID: Math 430 Exam 2, Fall 2008 These theorems may be cited at any time during the test

More information

Please give details of your answer. A direct answer without explanation is not counted.

Please give details of your answer. A direct answer without explanation is not counted. Please give details of your answer. A direct answer without explanation is not counted. Your answers must be in English. Please carefully read problem statements. During the exam you are not allowed to

More information

A Complete Proof of the Robbins Conjecture

A Complete Proof of the Robbins Conjecture A Complete Proof of the Robbins Conjecture Allen L. Mann May 25, 2003 1 Boolean algebra The language of Boolean algebra consists of two binary function symbols and, one unary function symbol, and two constants

More information