IST 4 Information and Logic
|
|
- Steven Williamson
- 5 years ago
- Views:
Transcription
1 IST 4 Information and Logic
2 mon tue wed thr fri sun T = today 3 M oh x= hw#x out oh M 7 oh oh 2 M2 oh oh x= hw#x due 24 oh oh 2 oh = office hours oh oh T M2 8 3 oh midterms oh oh Mx= MQx out 5 oh 3 4 oh Mx= MQx due 22 oh oh oh oh oh 5 oh 5 oh
3 MQ2 Everyone has a gift! Due TODAY, 5/2/27, by pm Please PDF lastname-firstname.pdf to istta4@paradise.caltech.edu
4 Information System Memory Intention Languages Evolution External Memory Algorizms
5 Building Blocks finite number of building blocks à infinitely many descriptions DNA natural languages
6 Building Blocks Separation finite number of building blocks à infinitely many descriptions Separation A between syntax and semantics Separation C between algorithms and implementation Separation B between what is represented and reality, feasibility, time, space,...
7 The appearance of life is the first Information Megamorphosis DNA ~3.7 Billion ya The appearance of the human brain is the second Information Megamorphosis Spoken languages ~6Kya
8 Written languages ~5,ya Babylonians The language of numbers positional number systems mathematics our number sense is 3
9 Formal languages Greeks ~2,5ya Pythagoras BC Axioms Theorems Euclid,3BC Proofs
10 Formal languages Greeks Aristotle BC Logic Syllogism Inference... ~2,5ya our logical sense is 3 People that are wise are Babylonians Leibniz was wise Leibniz was a Babylonian
11 Algorizms Algorizmi 78-85AD ~ya Fibonacci 7-25AD Algorizms for everything!! ~3ya Gottfried Leibniz
12 Formal languages for ideas Gottfried Leibniz Let us calculate without further ado, to see who is right" Let s Google it!! Let s Leibniz it!!
13 Algorizms and syntax boxes Gottfried Leibniz instead of progression by tens, I have for many years used the most simple of all, which goes by two...
14 Gottfried Leibniz The Binary d d2 majority c 2 symbol adder c s a b m parity magic box finite universality
15 Gottfried Leibniz The Leibniz challenges : we need a language for... We need a language for...
16 ~2 years after Aristotle... George Boole No perfection but a lot of inspiration Calculus for logic,847 Shannon 96-2 and Calculus for syntax boxes Boole was a Babylonian...
17 Boolean Algebra Huntington 94; concise set of axioms Edward Huntington April 26, Undergrad and Masters at Harvard PhD at the U of Strasbourg, Germany (9) Professor at Harvard until 94 Huntington was a Greek...
18 The Algebra (Boolean Calculus) Algebraic system: set of elements B, two binary operations + and B has at least two elements ( and ) If the following axioms are true then it is a Boolean Algebra: A. identity A2. complement A3. commutative A4. distributive
19 Properties of an Axiomatic System consistent consistent complete independent
20 Complete: Every true statement in the math theory can be derived using the axioms Can we prove EVERYTHING? Can we build EVERYTHING?
21 A simpler question: Is everything countable? Can we prove EVERYTHING?
22 Are infinite length binary strings countable? Proof by contradiction: Assume that it is countable and reach a contradiction
23 Cantor Diagonal argument George Cantor, 89 Are infinite length binary strings countable? ?... Idea: Complement the diagonal This string is binary and is not counted, contradiction!
24 Is everything countable? NO Can we prove EVERYTHING?
25 Consistent: No contradictions in the math theory Complete: Every true statement in the math theory can be derived using the axioms Kurt Gödel April 28, : For any axiomatic system that is powerful enough to describe the arithmetic of the natural numbers: If the system is consistent, it cannot be complete In a consistent system there are statements that are not provable... The key idea: represent the axiomatic system using numbers, use the diagonal argument of Cantor
26 A simple example Can we prove EVERYTHING?
27 6, 3,, 5, 6, 8, 4, 2,, 34, 7, 52, 26, 3, 4, 2,, 5, 6, 8, 4, 2, Source: wikipedia
28 Does it always reach? Other options? 6, 3,, 5, 6, 8, 4, 2,, 34, 7, 52, 26, 3, 4, 2,, 5, 6, 8, 4, 2, n even n odd Source: wikipedia
29 Which number in -5 has the longest sequence to reach? 6, 8, 4, 2, 3, 4, 2,, 5, 6, 8, 4, 2, 7, 52, 26, 3, 4, 2,, 5, 6, 8, 4, 2, Source: wikipedia
30 Which number in -5 has the longest sequence to reach? 9, 28, 4, 7, 22,, 34, 7, 52, 26, 3, 4, 2,, 5, 6, 8, 4, 2, 7, 22,, 34, 7, 52, 26, 3, 4, 2,, 5, 6, 8, 4, 2, The number 9, a sequence with 2 numbers Source: wikipedia
31 Lothar Collatz 9-99 The Collatz conjecture (937): For every starting value m, the sequence always reaches Empirical evidence: Verified up to some large number (29): True False Prove that it is impossible to decide if the conjecture is true or false
32 Lothar Collatz 9-99 The Collatz conjecture (937): For every starting value m, the sequence always reaches A generalization:
33 The Collatz conjecture (937): For every starting value m, the sequence always reaches Open problem... This generalization is undecidable, J. Conway, 972 Undecidable: Given a function f, does the Collatz sequence reach, for all n>? Undecidable even if p = 648 is fixed We can prove that it is impossible to decide if true or false
34 Euclid,3BC Languages:: possible and impossible There are theorems that cannot be proved Turing Algorizmi 78-85AD There are problems that cannot be solved by an Gödel algorizm Cantor There are objects that cannot be counted
35 Boolean Algebra is: consistent independent complete
36 Boolean Algebra Proving theorems You have to see a giraffe to believe it exists Intuition is not natural it comes with practice
37 Proving theorems Intuition is not natural it comes with practice
38 If I satisfy the axioms then I am a Boolean Algebra You do not need to see it to believe it exists!
39 Boolean Algebra - algebra You can see this one
40 - Boolean Algebra Boolean Algebra: set of elements B={,}, two binary operations OR and AND xy OR(x,y) xy AND(x,y) iff both x and y are iff both x and y are Is it a Boolean Algebra?
41 - Boolean Algebra Boolean Algebra: set of elements B={,}, two binary operations OR and AND The following axioms are obviously true:??? A. identity A2. complement A3. commutative A4. distributive
42 - Boolean Algebra Boolean Algebra: set of elements B={,}, two binary operations OR and AND A. identity a + = a a x = a xy OR(x,y) xy AND(x,y)
43 - Boolean Algebra Boolean Algebra: set of elements B={,}, two binary operations OR and AND A. identity a + = a a x = a + = + = xy OR(x,y) xy AND(x,y)
44 - Boolean Algebra Boolean Algebra: set of elements B={,}, two binary operations OR and AND A. identity a + = a a x = a x = x = xy OR(x,y) xy AND(x,y)
45 - Boolean Algebra Boolean Algebra: set of elements B={,}, two binary operations OR and AND A2. complement a + a = a x a = xy OR(x,y) xy AND(x,y)
46 - Boolean Algebra Boolean Algebra: set of elements B={,}, two binary operations OR and AND A2. complement a + a = a x a = + = + = x = x = xy OR(x,y) xy AND(x,y) a complement of a complement of
47 - Boolean Algebra Boolean Algebra: set of elements B={,}, two binary operations OR and AND A3. commutative a + b = b + a a x b = b x a xy OR(x,y) xy AND(x,y)
48 - Boolean Algebra Boolean Algebra: set of elements B={,}, two binary operations OR and AND A3. commutative a + b = b + a a x b = b x a + = + x = x + = + x = x + = + x = x xy OR(x,y) + = + x = x xy AND(x,y)
49 - Boolean Algebra Boolean Algebra: set of elements B={,}, two binary operations OR and AND A4. distributive a + (b x c) = (a + b) x (a + c) a x (b + c) = (a x b) + (a x c) xy OR(x,y) xy AND(x,y)
50 - Boolean Algebra Boolean Algebra: set of elements B={,}, two binary operations OR and AND A4. distributive a + (b x c) = (a + b) x (a + c) + ( x ) = ( + ) x ( + ) + ( x ) = ( + ) x ( + ) xy OR(x,y) We can check all the cases... xy AND(x,y)
51 Now, to our first Boolean proof
52 Self Absorption ME-MYSELF&I Lemma : Proof: xy OR(x,y) Two-valued Boolean Algebra: set of elements B={,}, two binary operations OR and AND Is the lemma true? xy AND(x,y)
53 Self Absorption ME-MYSELF&I Lemma : Proof: A A2 A4 A2 A Q
54 Self Absorption ME-MYSELF&I Lemma : Proof: We only proved that Need to prove Ideas?
55 Boolean Algebra Duality
56 Duality Theorem : Any identity that is true in a Boolean algebra, is also true if + and are interchanged, and and are interchanged.
57 ME-MYSELF&I Lemma : Proof: if + and. are interchanged, and and are interchanged A A2 A4 A2 A
58 Duality Theorem : Any identity that is true in a Boolean algebra, is also true if + and are interchanged, and and are interchanged. Proof:????
59 Theorem : Any identity that is true algebra, is also true if + and. are interchanged, and and are interchanged. It is a syntax machine: It is true for the axioms!
60 Back to the Axioms Q: Is the complement unique / well defined?
61 Boolean Algebra One way to say NO
62 One Way to Theorem : Each element of a Boolean Algebra has exactly one complement. Proof: Say No! L: Self Absorption Warm-up: First we will prove that an element is not self-complement Assume that:?? By Lemma : However by A2:
63 One Way to Say No! L: Self Absorption Theorem : Each element of a Boolean Algebra has exactly one complement. Proof: Warm-up: First we will prove that an element is not self-complement Assume that: By duality: By Lemma : However by A2: Contradiction! and are distinct Q
64 One Way to Say No! Theorem : Each element of a Boolean Algebra has exactly one complement. Proof: We proved that an element is not self-complement Next will prove that the complement is unique
65 One Way to Say No! Proof: Need to prove that the complement is unique By contradiction: Assume an element has two distinct complements A A2 A4 A3 A2
66 One Way to Say No! Proof: Need to prove that the complement is unique By contradiction: Assume an element has two distinct complements A A2 A4 A3 A4 A2 A A2
67 One Way to Say No! Proof: Need to prove that the complement is unique By contradiction: Assume an element has two distinct complements A A2 A4 A3 A2 A2 A3 A4 A2 A Contradiction! Q
68 So far True for any Boolean Algebra T: duality principle T: one complement per element L: Self Absorption
69 Quiz time
70 Quiz #5 min - Boolean Algebra: set of elements B={,} two binary operations OR and AND xy OR(x,y) xy AND(x,y) Prove that the following statement is true for a - Boolean algebra:
IST 4 Information and Logic
IST 4 Information and Logic HW2 will be returned today Average is 53/6~=88% T = today x= hw#x out x= hw#x due mon tue wed thr fri 3 M 6 oh M oh 3 oh oh 2M2M 2 oh oh 2 Mx= MQx out 27 oh M2 oh oh = office
More informationIST 4 Information and Logic
IST 4 Information and Logic T = today mon tue wed thr 3 M1 oh 1 fri sun x= hw#x out 10 oh M1 17 oh oh 1 2 M2 oh oh x= hw#x due 24 oh oh 2 Mx= MQx out 1 oh M2 oh = office hours oh T 8 3 15 oh 3 4 oh oh
More informationIST 4 Information and Logic
IST 4 Information and Logic MQ1 Everyone has a gift! Due Today by 10pm Please email PDF lastname-firstname.pdf to ta4@paradise.caltech.edu HW #1 Due Tuesday, 4/14 230 2:30pm in class T = today x= hw#x
More informationIST 4 Information and Logic
IST 4 Information and Logic MQ1 Everyone has a gift! Due Today by 10pm Please email PDF lastname-firstname.pdf to ta4@paradise.caltech.edu HW #1 Due Tuesday, 4/12 2:30pm in class T = today x= hw#x out
More informationIST 4 Information and Logic
IST 4 Information and Logic MQ1 Computers outperform the human brain? Due Today by 10pm Have your name inside the file as well... Please email PDF lastname-firstname.pdf to istta4@paradise.caltech.edu
More informationIST 4 Information and Logic
IST 4 Information and Logic T = today x= hw#x out x= hw#x due mon tue wed thr fri 31 M1 1 7 oh M1 14 oh 1 oh 2M2 21 oh oh 2 oh Mx= MQx out 28 oh M2 oh oh = office hours 5 3 12 oh 3 4 oh oh T midterms oh
More informationIST 4 Information and Logic
IST 4 Information and Logic T = today x= hw#x out x= hw#x due mon tue wed thr fri 30 M1 1 6 oh M1 oh 13 oh 1 oh 2M2M 20 oh oh 2 T Mx= MQx out 27 oh M2 oh oh = office hours 4 3 11 oh 3 4 oh oh midterms
More informationIST 4 Information and Logic
IST 4 Information and Logic Lectures are at: paradise.caltech.edu/ist4/lectures.html edu/ist4/lectures html Homeworks are at: paradise.caltech.edu/ist4/homeworks.html edu/ist4/homeworks html T = today
More informationIST 4 Information and Logic
IST 4 Information and Logic Quizzes grade (6): average of top n-2 T = today x= hw#x out x= hw#x due mon tue wed thr fri 1 M1 oh 1 8 oh M1 15 oh 1 T 2 oh M2 22 oh PCP oh 2 oh sun oh 29 oh M2 oh = office
More informationIST 4 Information and Logic
IST 4 Information and Logic mon tue wed thr fri sun T = today 3 M oh x= hw#x out 0 oh M 7 oh oh 2 M2 oh oh x= hw#x due 24 oh oh 2 oh = office hours oh oh M2 8 3 oh midterms oh oh Mx= MQx out 5 oh 3 4 oh
More informationIST 4 Information and Logic
IST 4 Information and Logic mon tue wed thr fri sun T = today 3 M oh x= hw#x out oh M 7 oh oh 2 M2 oh oh x= hw#x due 24 oh oh 2 oh = office hours oh oh M2 8 3 oh midterms oh oh Mx= MQx out 5 oh 3 4 oh
More informationCNS 188a Computation Theory and Neural Systems. Monday and Wednesday 1:30-3:00 Moore 080
CNS 88a Computation Theory and Neural Systems Monday and Wednesday :30-3:00 Moore 080 Lecturer: Shuki Bruck; 33 Moore office hours: Mon, Wed, 3-4pm TAs: Vincent Bohossian, Matt Cook; 3 Moore office hours:
More informationIST 4 Information and Logic
IST 4 Information and Logic T = today x= hw#x out x= hw#x due mon tue wed thr fri 3 M 7 oh M 4 oh oh 2M2 2 oh oh 2 oh T Mx= MQx out 28 oh M2 oh oh = office hours 5 3 2 oh 3 4 oh oh midterms oh Mx= MQx
More informationIST 4 Information and Logic
IST 4 Information and Logic Lectures are at: paradise.caltech.edu/ist4/lectures.html edu/ist4/lectures html Homeworks are at: paradise.caltech.edu/ist4/homeworks.html edu/ist4/homeworks html T = today
More informationIST 4 Information and Logic
IST 4 Information and Logic T = today x= hw#x out mon tue wed thr fri 31 M1 1 7 oh M1 14 oh 1 oh 2M2 oh x= hw#x due 21 oh oh 2 T Mx= MQx out 28 oh M2 oh oh = office hours 5 3 12 oh 3 4 oh oh midterms oh
More informationIST 4 Information and Logic
IST 4 Information and Logic T = today x= hw#x out x= hw#x due mon tue wed thr fri 30 M1 1 6 oh M1 oh 13 oh 1 oh 2M2M 20 oh oh 2 Mx= MQx out 27 oh M2 h T oh = office hours oh T 4 3 11 oh 3 4 oh oh midterms
More informationDecidability: Church-Turing Thesis
Decidability: Church-Turing Thesis While there are a countably infinite number of languages that are described by TMs over some alphabet Σ, there are an uncountably infinite number that are not Are there
More informationIST 4 Information and Logic
IST 4 Information and Logi T = today x= hw#x out x= hw#x due mon tue wed thr fri 3 M 7 oh M 4 oh oh 2M2 2 oh oh 2 oh 28 oh M2 oh oh = offie hours 5 3 Mx= MQx out 2 oh 3 4 oh oh midterms oh Mx= MQx due
More information2. Associative Law: A binary operator * on a set S is said to be associated whenever (A*B)*C = A*(B*C) for all A,B,C S.
BOOLEAN ALGEBRA 2.1 Introduction Binary logic deals with variables that have two discrete values: 1 for TRUE and 0 for FALSE. A simple switching circuit containing active elements such as a diode and transistor
More informationWarm-Up Problem. Please fill out your Teaching Evaluation Survey! Please comment on the warm-up problems if you haven t filled in your survey yet.
Warm-Up Problem Please fill out your Teaching Evaluation Survey! Please comment on the warm-up problems if you haven t filled in your survey yet Warm up: Given a program that accepts input, is there an
More informationCSE 105 Theory of Computation
CSE 105 Theory of Computation http://www.jflap.org/jflaptmp/ Professor Jeanne Ferrante 1 Undecidability Today s Agenda Review and More Problems A Non-TR Language Reminders and announcements: HW 7 (Last!!)
More informationCITS2211 Discrete Structures (2017) Cardinality and Countability
CITS2211 Discrete Structures (2017) Cardinality and Countability Highlights What is cardinality? Is it the same as size? Types of cardinality and infinite sets Reading Sections 45 and 81 84 of Mathematics
More informationIST 4 Information and Logic
IST 4 Information and Logic T = today x= hw#x out x= hw#x due mon tue wed thr fri 30 M 6 oh M oh 3 oh oh 2M2M 20 oh oh 2 27 oh M2 oh midterms Students MQ oh = office hours Mx= MQx out 4 3 oh 3 4 oh oh
More informationFinal Exam Comments. UVa - cs302: Theory of Computation Spring < Total
UVa - cs302: Theory of Computation Spring 2008 Final Exam Comments < 50 50 59 60 69 70 79 80 89 90 94 95-102 Total 2 6 8 22 16 16 12 Problem 1: Short Answers. (20) For each question, provide a correct,
More informationUnderstanding Computation
Understanding Computation 1 Mathematics & Computation -Mathematics has been around for a long time as a method of computing. -Efforts to find canonical way of computations. - Machines have helped with
More informationThe Search for the Perfect Language
The Search for the Perfect Language I'll tell you how the search for certainty led to incompleteness, uncomputability & randomness, and the unexpected result of the search for the perfect language. Bibliography
More informationFrom Greek philosophers to circuits: An introduction to boolean logic. COS 116, Spring 2011 Sanjeev Arora
From Greek philosophers to circuits: An introduction to boolean logic. COS 116, Spring 2011 Sanjeev Arora Midterm One week from today in class Mar 10 Covers lectures, labs, homework, readings to date You
More informationLogic Synthesis and Verification
Logic Synthesis and Verification Boolean Algebra Jie-Hong Roland Jiang 江介宏 Department of Electrical Engineering National Taiwan University Fall 2014 1 2 Boolean Algebra Reading F. M. Brown. Boolean Reasoning:
More informationHandbook of Logic and Proof Techniques for Computer Science
Steven G. Krantz Handbook of Logic and Proof Techniques for Computer Science With 16 Figures BIRKHAUSER SPRINGER BOSTON * NEW YORK Preface xvii 1 Notation and First-Order Logic 1 1.1 The Use of Connectives
More informationModels. Models of Computation, Turing Machines, and the Limits of Turing Computation. Effective Calculability. Motivation for Models of Computation
Turing Computation /0/ Models of Computation, Turing Machines, and the Limits of Turing Computation Bruce MacLennan Models A model is a tool intended to address a class of questions about some domain of
More informationSelf-reproducing programs. And Introduction to logic. COS 116, Spring 2012 Adam Finkelstein
Self-reproducing programs. And Introduction to logic. COS 6, Spring 22 Adam Finkelstein Midterm One week from today in class Mar 5 Covers lectures, labs, homework, readings to date Old midterms will be
More informationThe Legacy of Hilbert, Gödel, Gentzen and Turing
The Legacy of Hilbert, Gödel, Gentzen and Turing Amílcar Sernadas Departamento de Matemática - Instituto Superior Técnico Security and Quantum Information Group - Instituto de Telecomunicações TULisbon
More informationCSE 105 THEORY OF COMPUTATION
CSE 105 THEORY OF COMPUTATION Spring 2017 http://cseweb.ucsd.edu/classes/sp17/cse105-ab/ Today's learning goals Summarize key concepts, ideas, themes from CSE 105. Approach your final exam studying with
More informationEECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits)
EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) September 5, 2002 John Wawrzynek Fall 2002 EECS150 Lec4-bool1 Page 1, 9/5 9am Outline Review of
More informationSets are one of the basic building blocks for the types of objects considered in discrete mathematics.
Section 2.1 Introduction Sets are one of the basic building blocks for the types of objects considered in discrete mathematics. Important for counting. Programming languages have set operations. Set theory
More information03 Review of First-Order Logic
CAS 734 Winter 2014 03 Review of First-Order Logic William M. Farmer Department of Computing and Software McMaster University 18 January 2014 What is First-Order Logic? First-order logic is the study of
More informationOutline. EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) Combinational Logic (CL) Defined
EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) January 30, 2003 John Wawrzynek Outline Review of three representations for combinational logic:
More informationThe Limit of Humanly Knowable Mathematical Truth
The Limit of Humanly Knowable Mathematical Truth Gödel s Incompleteness Theorems, and Artificial Intelligence Santa Rosa Junior College December 12, 2015 Another title for this talk could be... An Argument
More informationLecture 11: Gödel s Second Incompleteness Theorem, and Tarski s Theorem
Lecture 11: Gödel s Second Incompleteness Theorem, and Tarski s Theorem Valentine Kabanets October 27, 2016 1 Gödel s Second Incompleteness Theorem 1.1 Consistency We say that a proof system P is consistent
More informationCS20a: Turing Machines (Oct 29, 2002)
CS20a: Turing Machines (Oct 29, 2002) So far: DFA = regular languages PDA = context-free languages Today: Computability 1 Church s thesis The computable functions are the same as the partial recursive
More informationLogic: The Big Picture
Logic: The Big Picture A typical logic is described in terms of syntax: what are the legitimate formulas semantics: under what circumstances is a formula true proof theory/ axiomatization: rules for proving
More informationby Yurii Khomskii There is a weaker notion called semi-representability:
Gödel s Incompleteness Theorem by Yurii Khomskii We give three different proofs of Gödel s First Incompleteness Theorem. All three proofs are essentially variations of one another, but some people may
More informationCSE 105 Theory of Computation
CSE 105 Theory of Computation http://www.jflap.org/jflaptmp/ Professor Jeanne Ferrante 1 Undecidability Today s Agenda Review: The TM Acceptance problem, A TM The Halting Problem for TM s Other problems
More informationBetter Logic Through Algebra, Probability, and. Joseph W. Norman, M.D., Ph.D. University of Michigan, Ann Arbor
Better Logic Through Algebra,, and Joseph W. Norman, M.D., Ph.D. University of Michigan, Ann Arbor Association for Symbolic Logic 2012 Madison, Wisconsin Diversity Is the Savior of Logical Truth I. There
More informationHandout on Logic, Axiomatic Methods, and Proofs MATH Spring David C. Royster UNC Charlotte
Handout on Logic, Axiomatic Methods, and Proofs MATH 3181 001 Spring 1999 David C. Royster UNC Charlotte January 18, 1999 Chapter 1 Logic and the Axiomatic Method 1.1 Introduction Mathematicians use a
More informationGödel s Theorem: Limits of logic and computation
Gödel s Theorem: Limits of logic and computation David Keil (dkeil@frc.mass.edu) Framingham State College Math/CS Faculty Seminar March 27, 2003 1 Overview Kurt Gödel, 1931, at age 25, in Vienna, shook
More informationChurch s undecidability result
Church s undecidability result Alan Turing Birth Centennial Talk at IIT Bombay, Mumbai Joachim Breitner April 21, 2011 Welcome, and thank you for the invitation to speak about Church s lambda calculus
More informationThe roots of computability theory. September 5, 2016
The roots of computability theory September 5, 2016 Algorithms An algorithm for a task or problem is a procedure that, if followed step by step and without any ingenuity, leads to the desired result/solution.
More informationLogic in Computer Science. Frank Wolter
Logic in Computer Science Frank Wolter Meta Information Slides, exercises, and other relevant information are available at: http://www.liv.ac.uk/~frank/teaching/comp118/comp118.html The module has 18 lectures.
More informationAxiomatic set theory. Chapter Why axiomatic set theory?
Chapter 1 Axiomatic set theory 1.1 Why axiomatic set theory? Essentially all mathematical theories deal with sets in one way or another. In most cases, however, the use of set theory is limited to its
More informationComplexity Theory Part I
Complexity Theory Part I Outline for Today Recap from Last Time Reviewing Verifiers Nondeterministic Turing Machines What does nondeterminism mean in the context of TMs? And just how powerful are NTMs?
More informationCSE 105 THEORY OF COMPUTATION. Spring 2018 review class
CSE 105 THEORY OF COMPUTATION Spring 2018 review class Today's learning goals Summarize key concepts, ideas, themes from CSE 105. Approach your final exam studying with confidence. Identify areas to focus
More informationCISC 876: Kolmogorov Complexity
March 27, 2007 Outline 1 Introduction 2 Definition Incompressibility and Randomness 3 Prefix Complexity Resource-Bounded K-Complexity 4 Incompressibility Method Gödel s Incompleteness Theorem 5 Outline
More informationELEC Digital Logic Circuits Fall 2014 Boolean Algebra (Chapter 2)
ELEC 2200-002 Digital Logic Circuits Fall 2014 Boolean Algebra (Chapter 2) Vishwani D. Agrawal James J. Danaher Professor Department of Electrical and Computer Engineering Auburn University, Auburn, AL
More informationPREDICATE LOGIC: UNDECIDABILITY AND INCOMPLETENESS HUTH AND RYAN 2.5, SUPPLEMENTARY NOTES 2
PREDICATE LOGIC: UNDECIDABILITY AND INCOMPLETENESS HUTH AND RYAN 2.5, SUPPLEMENTARY NOTES 2 Neil D. Jones DIKU 2005 14 September, 2005 Some slides today new, some based on logic 2004 (Nils Andersen) OUTLINE,
More informationDigital Logic Design: a rigorous approach c
Digital Logic Design: a rigorous approach c Chapter 1: Sets and Functions Guy Even Moti Medina School of Electrical Engineering Tel-Aviv Univ. October 25, 2017 Book Homepage: http://www.eng.tau.ac.il/~guy/even-medina
More informationDecidable Languages - relationship with other classes.
CSE2001, Fall 2006 1 Last time we saw some examples of decidable languages (or, solvable problems). Today we will start by looking at the relationship between the decidable languages, and the regular and
More informationDiscrete Mathematics
Discrete Mathematics Yi Li Software School Fudan University March 13, 2017 Yi Li (Fudan University) Discrete Mathematics March 13, 2017 1 / 1 Review of Lattice Ideal Special Lattice Boolean Algebra Yi
More informationInformal Statement Calculus
FOUNDATIONS OF MATHEMATICS Branches of Logic 1. Theory of Computations (i.e. Recursion Theory). 2. Proof Theory. 3. Model Theory. 4. Set Theory. Informal Statement Calculus STATEMENTS AND CONNECTIVES Example
More informationPropositional Logics and their Algebraic Equivalents
Propositional Logics and their Algebraic Equivalents Kyle Brooks April 18, 2012 Contents 1 Introduction 1 2 Formal Logic Systems 1 2.1 Consequence Relations......................... 2 3 Propositional Logic
More informationGödel s Incompleteness Theorem. Overview. Computability and Logic
Gödel s Incompleteness Theorem Overview Computability and Logic Recap Remember what we set out to do in this course: Trying to find a systematic method (algorithm, procedure) which we can use to decide,
More informationBoolean algebra. Values
Boolean algebra 1854 by George Boole in his book An Investigation of the Laws of Thought, is a variant of ordinary elementary algebra differing in its values, operations, and laws. Instead of the usual
More informationCOMP 2600: Formal Methods for Software Engineeing
COMP 2600: Formal Methods for Software Engineeing Dirk Pattinson Semester 2, 2013 What do we mean by FORMAL? Oxford Dictionary in accordance with convention or etiquette or denoting a style of writing
More informationFinite Automata Part Two
Finite Automata Part Two DFAs A DFA is a Deterministic Finite Automaton A DFA is defined relative to some alphabet Σ. For each state in the DFA, there must be exactly one transition defined for each symbol
More informationGödel s Incompleteness Theorems
Seminar Report Gödel s Incompleteness Theorems Ahmet Aspir Mark Nardi 28.02.2018 Supervisor: Dr. Georg Moser Abstract Gödel s incompleteness theorems are very fundamental for mathematics and computational
More information4.2 The Halting Problem
172 4.2 The Halting Problem The technique of diagonalization was discovered in 1873 by Georg Cantor who was concerned with the problem of measuring the sizes of infinite sets For finite sets we can simply
More informationVictoria Gitman and Thomas Johnstone. New York City College of Technology, CUNY
Gödel s Proof Victoria Gitman and Thomas Johnstone New York City College of Technology, CUNY vgitman@nylogic.org http://websupport1.citytech.cuny.edu/faculty/vgitman tjohnstone@citytech.cuny.edu March
More informationComputational Models Lecture 8 1
Computational Models Lecture 8 1 Handout Mode Nachum Dershowitz & Yishay Mansour. Tel Aviv University. May 17 22, 2017 1 Based on frames by Benny Chor, Tel Aviv University, modifying frames by Maurice
More informationComputational Models Lecture 8 1
Computational Models Lecture 8 1 Handout Mode Ronitt Rubinfeld and Iftach Haitner. Tel Aviv University. May 11/13, 2015 1 Based on frames by Benny Chor, Tel Aviv University, modifying frames by Maurice
More information23.1 Gödel Numberings and Diagonalization
Applied Logic Lecture 23: Unsolvable Problems in Logic CS 4860 Spring 2009 Tuesday, April 14, 2009 The fact that Peano Arithmetic is expressive enough to represent all computable functions means that some
More informationComputation. Some history...
Computation Motivating questions: What does computation mean? What are the similarities and differences between computation in computers and in natural systems? What are the limits of computation? Are
More informationCSCI3390-Lecture 6: An Undecidable Problem
CSCI3390-Lecture 6: An Undecidable Problem September 21, 2018 1 Summary The language L T M recognized by the universal Turing machine is not decidable. Thus there is no algorithm that determines, yes or
More informationBound and Free Variables. Theorems and Proofs. More valid formulas involving quantifiers:
Bound and Free Variables More valid formulas involving quantifiers: xp(x) x P(x) Replacing P by P, we get: x P(x) x P(x) Therefore x P(x) xp(x) Similarly, we have xp(x) x P(x) x P(x) xp(x) i(i 2 > i) is
More informationCSE 20. Lecture 4: Introduction to Boolean algebra. CSE 20: Lecture4
CSE 20 Lecture 4: Introduction to Boolean algebra Reminder First quiz will be on Friday (17th January) in class. It is a paper quiz. Syllabus is all that has been done till Wednesday. If you want you may
More informationFirst-Order Logic First-Order Theories. Roopsha Samanta. Partly based on slides by Aaron Bradley and Isil Dillig
First-Order Logic First-Order Theories Roopsha Samanta Partly based on slides by Aaron Bradley and Isil Dillig Roadmap Review: propositional logic Syntax and semantics of first-order logic (FOL) Semantic
More informationLecture 24: Gödel s s Proof. Microsoft Foundation Classes. Story So Far. Quiz? PS6 Classes. sim-object. physical-object. place. mobile-object.
Lecture 24: Gödel s s Proof CS150: Computer Science University of Virginia Computer Science David Evans http://www.cs.virginia.edu/evans PS6 Classes thing physical-object mobile-object person sim-object
More informationCSE 105 THEORY OF COMPUTATION
CSE 105 THEORY OF COMPUTATION "Winter" 2018 http://cseweb.ucsd.edu/classes/wi18/cse105-ab/ Today's learning goals Sipser Ch 4.2 Trace high-level descriptions of algorithms for computational problems. Use
More informationGeneral Info. Grading
Syllabus & Policies General Info Lecture 1: Introduction, Set Theory, and Boolean Algebra Classroom: Perkins 2-072 Time: Mon - Fri, 2:00-3:15 pm Wed, 3:30-4:30 pm Sta 111 Colin Rundel May 13, 2014 Professor:
More informationMost General computer?
Turing Machines Most General computer? DFAs are simple model of computation. Accept only the regular languages. Is there a kind of computer that can accept any language, or compute any function? Recall
More informationCS187 - Science Gateway Seminar for CS and Math
CS187 - Science Gateway Seminar for CS and Math Fall 2013 Class 3 Sep. 10, 2013 What is (not) Computer Science? Network and system administration? Playing video games? Learning to use software packages?
More informationOverview, cont. Overview, cont. Logistics. Optional Reference #1. Optional Reference #2. Workload and Grading
Course staff CS389L: Automated Logical Reasoning Lecture 1: ntroduction and Review of Basics şıl Dillig nstructor: şil Dillig E-mail: isil@cs.utexas.edu Office hours: Thursday after class until 6:30 pm
More information1 Reals are Uncountable
CS 30: Discrete Math in CS (Winter 2019): Lecture 6 Date: 11th January, 2019 (Friday) Topic: Uncountability and Undecidability Disclaimer: These notes have not gone through scrutiny and in all probability
More informationChapter 2: Switching Algebra and Logic Circuits
Chapter 2: Switching Algebra and Logic Circuits Formal Foundation of Digital Design In 1854 George Boole published An investigation into the Laws of Thoughts Algebraic system with two values 0 and 1 Used
More informationComputational Models Lecture 8 1
Computational Models Lecture 8 1 Handout Mode Ronitt Rubinfeld and Iftach Haitner. Tel Aviv University. April 18/ May 2, 2016 1 Based on frames by Benny Chor, Tel Aviv University, modifying frames by Maurice
More informationPeano Arithmetic. CSC 438F/2404F Notes (S. Cook) Fall, Goals Now
CSC 438F/2404F Notes (S. Cook) Fall, 2008 Peano Arithmetic Goals Now 1) We will introduce a standard set of axioms for the language L A. The theory generated by these axioms is denoted PA and called Peano
More informationSlides for Lecture 10
Slides for Lecture 10 ENEL 353: Digital Circuits Fall 2013 Term Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary 30 September, 2013 ENEL 353
More informationDecision Problems with TM s. Lecture 31: Halting Problem. Universe of discourse. Semi-decidable. Look at following sets: CSCI 81 Spring, 2012
Decision Problems with TM s Look at following sets: Lecture 31: Halting Problem CSCI 81 Spring, 2012 Kim Bruce A TM = { M,w M is a TM and w L(M)} H TM = { M,w M is a TM which halts on input w} TOTAL TM
More informationChapter 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 informationSample Problems for all sections of CMSC250, Midterm 1 Fall 2014
Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014 1. Translate each of the following English sentences into formal statements using the logical operators (,,,,, and ). You may also use mathematical
More informationLanguage of Propositional Logic
Logic A logic has: 1. An alphabet that contains all the symbols of the language of the logic. 2. A syntax giving the rules that define the well formed expressions of the language of the logic (often called
More informationCSE 105 THEORY OF COMPUTATION
CSE 105 THEORY OF COMPUTATION Spring 2018 http://cseweb.ucsd.edu/classes/sp18/cse105-ab/ Today's learning goals Sipser Ch 5.1, 5.3 Define and explain core examples of computational problems, including
More informationLogic and Computation
Logic and Computation CS245 Dr. Borzoo Bonakdarpour University of Waterloo (Fall 2012) Computability and Decidability Logic and Computation p. 1/29 Agenda Programs as Formulas Cantor s Diagonalization
More informationCS 361 Meeting 26 11/10/17
CS 361 Meeting 26 11/10/17 1. Homework 8 due Announcements A Recognizable, but Undecidable Language 1. Last class, I presented a brief, somewhat inscrutable proof that the language A BT M = { M w M is
More informationDefinition: Let S and T be sets. A binary relation on SxT is any subset of SxT. A binary relation on S is any subset of SxS.
4 Functions Before studying functions we will first quickly define a more general idea, namely the notion of a relation. A function turns out to be a special type of relation. Definition: Let S and T be
More informationLogic Design. Chapter 2: Introduction to Logic Circuits
Logic Design Chapter 2: Introduction to Logic Circuits Introduction Logic circuits perform operation on digital signal Digital signal: signal values are restricted to a few discrete values Binary logic
More informationA Note on Turing Machine Design
CS103 Handout 17 Fall 2013 November 11, 2013 Problem Set 7 This problem explores Turing machines, nondeterministic computation, properties of the RE and R languages, and the limits of RE and R languages.
More informationON COMPUTAMBLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHENIDUGSPROBLEM. Turing 1936
ON COMPUTAMBLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHENIDUGSPROBLEM Turing 1936 Where are We? Ignoramus et ignorabimus Wir mussen wissen Wir werden wissen We do not know We shall not know We must know
More informationProofs. 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 informationFinite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018
Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018 Lecture 15 Ana Bove May 17th 2018 Recap: Context-free Languages Chomsky hierarchy: Regular languages are also context-free; Pumping lemma
More informationChapter 2: Introduction to Propositional Logic
Chapter 2: Introduction to Propositional Logic PART ONE: History and Motivation Origins: Stoic school of philosophy (3rd century B.C.), with the most eminent representative was Chryssipus. Modern Origins:
More information