Propositional calculus, also known as propositional logic, is a branch of logic that deals with propositions and their relations. It focuses on constructing arguments based on true or false propositions and connecting them using logical connectives. While it does not deal with non-logical objects or quantifiers like first-order logic, it serves as the foundation for higher-order logics.
Stanford University
Winter 2020
CS 103A serves as an additional review course for CS103 students, focusing on strengthening proof-based mathematics skills and general problem-solving strategies in a context closely tied to CS103.
No concepts data
+ 31 more conceptsUniversity of Washington
Autumn 2021
CSE 311 introduces theoretical computer science, the theory background necessary for other CSE courses, and how to construct rigorous, formal arguments. Topics include logic, set theory, modular arithmetic, induction, regular expression, and relations.
No concepts data
+ 33 more conceptsUC Berkeley
Fall 2022
CS 70 presents key ideas from discrete mathematics and probability theory with emphasis on their application in Electrical Engineering and Computer Sciences. It addresses a variety of topics such as logic, induction, modular arithmetic, and probability. Sophomore mathematical maturity and programming experience equivalent to an Advanced Placement Computer Science A exam are prerequisites.
No concepts data
+ 32 more conceptsStanford University
Autumn 2022-2023
Stanford's CS 221 course teaches foundational principles and practical implementation of AI systems. It covers machine learning, game playing, constraint satisfaction, graphical models, and logic. A rigorous course requiring solid foundational skills in programming, math, and probability.
No concepts data
+ 88 more conceptsStanford University
Fall 2019
This course emphasizes SAT and SMT technology and its applications, offering an understanding of theoretical foundations and how to implement a small theory solver. Applications of SAT/SMT technology in the context of verification are also covered. The advanced topics and lack of specified prerequisites suggest this is a high-level course.
No concepts data
+ 20 more conceptsStanford University
Fall 2022
CS 157 provides a rigorous introduction to Logic from a computational viewpoint. The course mainly deals with encoding information as logical sentences and reasoning methods for this information. It gives an overview of logic technology and its applications. Topics range from propositional logic, relational logic, functional logic to various deduction techniques and mathematical induction.
No concepts data
+ 11 more conceptsBrown University
Spring 2023
CSCI 0220 provides a foundation in discrete math and probability theory. Key topics include logic, set theory, number theory, combinatorics, graph theory, and probability. No prior math background assumed. Aims to develop problem solving, communication, and collaboration skills. Introduces new concepts and ways of thinking to enable analyzing problems arising in computer science. Beginner-friendly introduction to core mathematical concepts underlying many aspects of CS.
No concepts data
+ 26 more conceptsCarnegie Mellon University
Spring 2019
This course from Carnegie Mellon University provides a deep understanding of AI's theory and practice, covering methods for decision-making, problem-solving, and handling uncertainty. Topics include search algorithms, computational game theory, and AI ethics.
No concepts data
+ 24 more conceptsStanford University
Winter 2023
CS 103 introduces mathematical logic, proofs, and discrete structures, paving the way to an understanding of computational problem-solving. It encourages a profound appreciation of mathematical beauty while addressing concepts like finite automata and regular expressions. CS106B is a prerequisite or corequisite. The course also incorporates programming assignments.
No concepts data
+ 10 more concepts