# CSC 226 Lecture Notes - Lecture 1: First-Order Logic, Truth Table, Big O Notation

56 views3 pages
11 Jan 2017
School
Course

## Document Summary

***note: sorry the notes are a bit messy, class was rather casual. Further notes should have a different teacher speaking, and easier-to-take format for the lecture. Topics covered in the course: 1) logic, 2) logic circuit. Used in surprising number of fields, ie cryptography (encryption/decryption: 3) predicate calculus. Deals with proving statements and such: 4) imduction, 5) recursion, 6) big o notation. (cid:862)pro(cid:448)e to google that (cid:455)our progra(cid:373) is defi(cid:374)itel(cid:455) the (cid:373)ost effi(cid:272)ie(cid:374)t a(cid:374)d (cid:271)est(cid:863: 7) set theory, 8) binary relation, 9) counting + probability, 10) graph theory. All these topics are rele(cid:448)a(cid:374)t to a(cid:374)(cid:455) ki(cid:374)d of c c (cid:373)ajor, (cid:449)hether (cid:455)ou"re pla(cid:374)(cid:374)i(cid:374)g to (cid:271)e a professor or programmer or etcetera. Proposition: a sentence that can be either true or false: facts!!! You want to deal with facts for propositions: examples: Raleigh is the capital of north carolina (true) Compound proposition: a series of propositions connected with connectives: not, (cid:1166)or, (cid:1165) and.

## Get access

\$40 USD/m
Billed monthly
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class