Logic for Computer Scientists
Homework 3 solutions
- Predicate logic trees and variable scoping
- Propositional proofs (Modus Ponens, Addition)
- CNF conversion with algebraic steps
- Predicate logic formalization
Featured
Recent assignment solutions
Worked solutions with step-by-step explanations for recent coursework
Intelligent Systems
Assignment 4 solutions
- Probability table sizes and sums
- Bayesian network representation
- D-separation and independence
- Variable elimination inference
Explore
Quick links
Spring 2026
Current courses
Active courses this semester with posts and assignments
Cryptography
Advanced cryptographic systems, security protocols, and modern encryption techniques.
Software Verification and Validation
Software testing, formal methods, model checking, and quality assurance.
Latest
Recent blog posts
Articles on course topics, research, and technical notes
The Fragility of Raw RSA: From Mathematical Elegance to Existential Forgery
Why textbook RSA preserves multiplicative structure and enables existential forgery, and how hash-then-sign and padding schemes like RSA-PSS close the...
The Architecture of Trust: A Comparative Analysis of Group Structures in Cryptography
How Lagrange and Cauchy shape real-world DH and ECC groups, why nearly-prime cofactor curves trade purity for performance, and what...
The Hidden Geometry of Trust: Subgroups, Cofactors, and Scalar Efficiency in ECC
From Weierstrass curves and double-and-add to cofactor attacks and Dual_EC_DRBG—how subgroup geometry and implementation choices determine ECC trust boundaries.
Vulnerability Assessment Report: Nonce Leakage and Implementation Risks in (EC)DSA
A structured look at HNP-based key recovery, BIGNUM representation leaks, lazy resizing CVEs, and protocol-level subgroup failures in modern signature...
Engineering Protocol-Secure and Side-Channel Resistant Cryptography: From Theory to Implementation
Bridging prime-order proofs with cofactor reality: small-subgroup attacks, BIGNUM leaks, twist security, and a practical mitigation checklist for protocol engineers....
The Great Cryptographic Shift: From Classical Diffie-Hellman to Elliptic Curves
Why finite-field DLP hits a scalability wall, how ECC and Pollard rho change the cost curve, and a worked finite-field...
Cracking the Code: A Review of Cryptographic Failures in Peer-to-Peer and Wireless Protocols
From Tamarin’s prime-order ideal to Scuttlebutt, Bluetooth P-224, and OpenSSL lazy resize—how symbolic proofs miss implementation and protocol reality.
The Perfection Paradox: Why the World's Only Unbreakable Code is a Logistical Nightmare
Discover the only mathematically unbreakable encryption method—and why its perfection makes it practically useless.
The One-Time Pad: When Math Guarantees Absolute Security
Discover the only encryption method proven to be mathematically unbreakable—and why its implementation is far more dangerous than it appears....
Why Natural Numbers Fail the Security Test: The Zero Divisor Trap
Explore why the natural numbers we use everyday are fundamentally unsuitable for encryption, and the mathematical traps that await those...
Malleability and the Block Cipher: Why Encryption Isn't Enough
Learn why encrypted data can still be tampered with and how block ciphers attempt to solve the fundamental problems of...
The Linearity Trap: Why Your Algebra Teacher is an Accidental Hacker
Explore how the Hill Cipher's reliance on linear algebra made it vulnerable to high school math—and why pattern repetition destroyed...
The Secret Architecture of Security: Groups Aren't Just for Numbers
Discover how the Symmetric Group—where elements are actions rather than numbers—forms the foundation of modern cryptographic security.
From DES to AES: The Mathematical Evolution of Modern Ciphers
Trace the journey from the broken DES standard to the ironclad AES, and discover the algebraic foundations that make modern...
The Binary Secret: How AES Uses Polynomials to Secure the Internet
Discover how the simplest mathematical field Z_2 with just 0 and 1 becomes the foundation for AES encryption through extension...
Unit Testing Strategies: Writing Effective Test Cases
Comprehensive guide to unit testing strategies, covering test case design, coverage metrics, mocking techniques, and best practices for writing maintainable...
Symmetric Encryption Algorithms: Understanding Block and Stream Ciphers
A deep dive into symmetric encryption algorithms, including block ciphers like AES and DES, stream ciphers, and their applications in...
Spring 2026 Semester Overview: Cryptography and Software Verification
An overview of Spring 2026 coursework in Cryptography and Software Verification and Validation: goals, themes, and how this blog supports...
Software Verification and Testing: Building Reliable Systems
Exploring the fundamentals of software verification and validation, covering testing strategies, quality assurance techniques, and methods for building reliable software...
Public Key Cryptography: Understanding RSA and Key Exchange
Exploring public key cryptography systems, including the RSA algorithm, Diffie-Hellman key exchange, and how asymmetric encryption enables secure communication without...
Integration Testing and Continuous Verification
Exploring integration testing methodologies and continuous verification practices, including test automation, CI/CD pipelines, and strategies for maintaining software quality throughout...
Formal Methods in Software Verification: Mathematical Approaches to Correctness
An introduction to formal methods for software verification, including model checking, theorem proving, and mathematical techniques for proving program correctness....
Cryptography Fundamentals: An Introduction to Secure Communication
An introduction to the fundamental concepts of cryptography, exploring how secure communication systems work and why they are essential in...
Cryptographic Hash Functions: Ensuring Data Integrity
Understanding cryptographic hash functions, their properties, applications in data integrity verification, digital signatures, and password storage systems.
Homework 3 Guide: Quantifier Scope, Proofs, and CNF
Worked guide for Logic for Computer Scientists Homework 3: scoping, inference proofs, CNF transformations, and predicate encodings.
Model Checking and Logic Review: Validating Systems and Concepts
A comprehensive review of advanced logic concepts including Hilbert Systems, the Tableaux Method, and Herbrand Semantics, showing how they feed...
Logistic Regression and Softmax: Probabilistic Linear Models for Classification
Upgrade the perceptron into a calibrated probabilistic classifier with logistic regression and its multiclass softmax extension, unpacking the sigmoid link,...
Linear Temporal Logic: Specification and Verification of Reactive Systems
Master Linear Temporal Logic (LTL) for specifying and verifying time-dependent properties of reactive systems, from safety invariants to liveness guarantees....
The Perceptron Algorithm: Introduction to Linear Classifiers and Neural Networks
Transition from probabilistic to discriminative models with the Perceptron algorithm, learning how linear classifiers use weighted features to make predictions...
Negation and Non-Monotonic Reasoning: When New Information Invalidates Old Conclusions
Explore non-monotonic reasoning systems where new information can invalidate previous conclusions, from the classic Tweety the bird example to stable...
Laplace Smoothing and Maximum Likelihood Estimation in Naive Bayes
Learn how to handle zero-frequency problems and overfitting in Naive Bayes through Laplace smoothing and understand the theoretical foundations of...
Herbrand Logic and Semantics: Simplifying First-Order Interpretations
Learn how Herbrand semantics reduce the infinite complexity of first-order logic interpretations to finite, manageable models through ground atoms and...
Naive Bayes Classification: From Bayesian Networks to Supervised Learning
Learn how Naive Bayes bridges probabilistic reasoning and machine learning, using conditional independence assumptions to build powerful classifiers for spam...
Variable Elimination: Efficient Probabilistic Inference in Bayesian Networks
Learn how variable elimination dramatically reduces computational complexity in Bayesian network inference through strategic factor manipulation and elimination ordering.
Bayesian Networks: D-Separation and Probabilistic Inference
Master d-separation algorithms for determining conditional independence in Bayesian networks and understand the foundation of probabilistic inference.
Hilbert Proof Systems and Herbrand Logic: Foundations of Automated Theorem Proving
An in-depth exploration of Hilbert proof systems and the Tableaux method for predicate logic, with detailed examples on quantifier manipulation...
The Unification Algorithm: Finding Most General Unifiers in First-Order Logic
Learn how the unification algorithm finds the most general unifier (MGU) that makes two terms identical, a fundamental operation in...
Reinforcement Learning: An Introduction to Learning from Rewards
Discover reinforcement learning—the paradigm where agents learn to maximize expected rewards through experience, from robot locomotion to DeepRacer vehicles.
Propositional Logic II: Truth Tables and Formation Trees
Learn to analyze propositional formulas using truth tables and formation trees—essential tools for understanding logical structure and validity.
Propositional Logic Basics: Building the Foundation for Logical Reasoning
Master the fundamental building blocks of logical reasoning: propositions, truth values, and logical connectives that form the bedrock of computer...
Introduction to Logic for Computer Scientists
Discover how logic—the study of reasoning—forms the invisible foundation of every computer program, database query, and artificial intelligence system you...
Welcome to My Blog
An introduction to this blog and what I plan to share about my journey in computer science and machine learning...
Prolog Programming Fundamentals: Logic Programming for Beginners
An introduction to Prolog's unique declarative paradigm, exploring facts, rules, queries, and how logic programming differs from imperative approaches.
Understanding the Master's Theorem: A Practical Guide
A comprehensive guide to understanding and applying the Master's Theorem for analyzing divide-and-conquer algorithms.