* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Download ppt
Fuzzy logic wikipedia , lookup
Truth-bearer wikipedia , lookup
Modal logic wikipedia , lookup
History of logic wikipedia , lookup
Jesús Mosterín wikipedia , lookup
Probability interpretations wikipedia , lookup
Axiom of reducibility wikipedia , lookup
History of the function concept wikipedia , lookup
History of the Church–Turing thesis wikipedia , lookup
Quantum logic wikipedia , lookup
Propositional calculus wikipedia , lookup
Recursion (computer science) wikipedia , lookup
Combinatory logic wikipedia , lookup
Intuitionistic logic wikipedia , lookup
Natural deduction wikipedia , lookup
Foundations of mathematics wikipedia , lookup
Law of thought wikipedia , lookup
Mathematical proof wikipedia , lookup
Laws of Form wikipedia , lookup
Mathematical logic wikipedia , lookup
CSC 133 - Discrete Mathematical Structures Dr. Karl Ricanek Jr Quick Info • Dr. Karl Ricanek Jr – Web • www.uncw.edu/people/ricanekk – Contact • • • • CIS 2042 [email protected] 962-4261 fb: ricanekk and skype: karl.ricanek – Office Hours: • • TR 9:45am-11:00am and • by appointment Teaching Assistant: Paul Martin – – Email: pgm0543 Location: CI 2055 What is CSC 133? • Discrete Mathematical Structures – Focus on • • • • • • • Propositional and predicate logic Proofs (deduction, induction, contradiction) Set theory. Boolean algebra. Recursion. Graphs and Trees. Counting and probability. How Do I Get an ‘A’? • Come to every class. – Attendance is required. • Read the textbook. – Reading the textbook is required. • Do homeworks on time. • Make use of office hours, TA, and fellow students. – Send me email early and often. Course and Grading Criteria • Attendance – Your attendance grade will be computed by taking the number of classes attended and dividing by the total number of classes (minus 2). This grade counts 1/6 of your total grade. • Quizzes 1/6 … drop 2 lowest • 2 Midterms …1/6 each • Final 1/6 – or (2/6 as it will replace your lowest midterm score) • Homework projects … 1/6 The Required Text • Discrete Mathematics with Applications, 3rd Edition, Susanna S. Epp. An Overview of Each Topic • • • • • • Logic Proofs Functions Recursion Graphs Probability Logic • If you know a set of statements are true, what other statements can you also deduce are true? • If I tell you that all men are mortal, and Socrates is a man, what can you deduce? Digital Logic Proofs • What is a proof? • How is programming like writing a proof? Functions • What is a function? • What if a function calls itself? – That’s recursion! How good is a function at doing its job? • What do we mean by “good”? Graphs (and Trees) Probability • What is the likelihood of an event occurring? • What is randomness? • Statistics can be described as the study of how to make inference and decisions in the face of uncertainty and variability