Propositional Logic & Equivalences
                
                
             
            
            
            
                
                
			Boolean algebra, Canonical Forms
                
                
             
            
                
                
			Canonical Forms, Predicate Logic
                
		
             
            
                
                
			Circuits & Predicate Logic
                
		
             
            
                
                
			Predicate Logic, Inference
                
                
             
            
            
                
                
			Propositional & Predicate Logic Proofs
		   
                
             
            
                
                
			Predicate Logic Proofs, English Proofs
                
                
             
            
            
                
                
			English Proof Strategies, Number Theory
                
                
             
            
            
            
                
                
			Applications of Modular Arithmetic, Prime Factorization, GCD
		
                
             
            
                
                    Section 4
                    (Thurs, Apr 20)
                 
                
			Number Theory
                
                
             
            
                
                
			Modular Equations, Exponentiation, Set Theory
                
                
             
            
            
            
            
                
                
			Modular Exponentiation, Set Theory, Induction
                
                
             
            
                
                
			Strong Induction and Recursion
                
                
             
            
            
                
                
			Recursively Defined Sets and Structural Induction
                
                
             
            
                
                
			More Structural Induction
                
                
             
            
                
                
			Induction: Ordinary, Strong, Structural
                
                
             
            
                
                
			      Strings and Regular Expressions
                
                
             
            
            
                
                
			Context-Free Grammars (CFGs)
                
                
             
            
            
                
                    Section 7
                    (Thurs, May 11)
                 
                
			Induction, Regular Expressions
                
                
             
            
            
            
                
                
			Directed Graphs, Finite State Machines (FSMs)
                
                
             
            
                
                
			Finite State Machine Design
                
                
             
            
                
                    Section 8
                    (Thurs, May 18)
                 
                
			CFGs, Relations, Finite State Machines
                
                
             
            
            
            
                
                
			NFAs, RegExp, NFAs to DFAs
                
                
             
            
                
                
			The Limitations of DFA/NFA/RegExp
                
		
             
            
                
                    Section 9
                    (Thurs, May 25)
                 
                
			FSM Minimization, NFAs, Subset Construction, Irregularity
                
                
             
            
                
                
			Cardinality, Uncomputability
                
                
             
            
            
            
                
                
			Undecidability of the Halting Problem
                
                
             
            
            
                
                
                    Turing Machines and Reductions
                
                
             
            
            
                
                
		  Final exams are scheduled at 2:30-4:20 pm and 4:30-6:20 pm in JHN 102 rather than our regular classroom. 
(You will need to select one of these two times to take your exam and confirm your choice by Saturday June 3.)
                    
                
                
                    
                
             
    This course website heavily follows the example of the website of CSE373 2019 Spring.