diff --git a/README.md b/README.md
index a07f65c..82728bb 100644
--- a/README.md
+++ b/README.md
@@ -308,6 +308,11 @@ real analysis;
 formal languages;
 Turing machines;
 computability;
+computational geometry theory;
+propositional logic;
+relational logic;
+Herbrand logic;
+concept lattices;
 game trees;
 and more.
 
@@ -315,11 +320,14 @@ Courses | Duration | Effort | Prerequisites
 :-- | :--: | :--: | :--:
 [Introduction to Mathematical Thinking](https://www.coursera.org/learn/mathematical-thinking) | 10 weeks | 10 hours/week | high school math
 [Automata Theory](https://lagunita.stanford.edu/courses/course-v1:ComputerScience+Automata+Fall2016/about) | 8 weeks | 10 hours/week | discrete mathematics
+[Computational Geometry](https://www.edx.org/course/computational-geometry-tsinghuax-70240183x) | 16 weeks | 8 hours/week | algorithms, C++
+[Introduction to Logic](https://www.coursera.org/learn/logic-introduction) | 10 weeks | 4-8 hours/week | set theory
+[Introduction to Formal Concept Analysis](https://www.coursera.org/learn/formal-concept-analysis) | 6 weeks | 4-6 hours/week | logic, probability
 [Game Theory](https://www.coursera.org/learn/game-theory-1) | 8 weeks | x hours/week | mathematical thinking, probability, calculus
 
 ### Advanced applications
 
-All Coursera Specializations end with a Capstone project.
+These Coursera Specializations all end with a Capstone project.
 Depending on the course, you may be able to utilize the Capstone as your Final Project for this Computer Science curriculum.
 Note that doing a Specialization with the Capstone at the end always costs money.
 So if you don't wish to spend money or use the Capstone as your Final, it may be possible to take the courses in the Specialization for free by manually searching for them, but not all allow this.