ConceptSystems & CS
First-order logic
A more powerful type of logic than propositional logic that uses constant and predicate symbols to represent objects and relations.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Lectures that assume it
24The first 12 are shown.
- Set Theory and the Philosophy of Set Theory
- The Continuum Hypothesis as a Fundamental Axiom
- Binary Relations, Partitions & Equivalence Relations
- Bi-interpretation of Weak Set Theories
- Making is Decision Making
- Forcing Axioms and Name Principles in Set Theory
- Provable Privacy and Security for Autonomous Agents: Are We There Yet?
- From P-Completeness to PSPACE-Completeness
- Simplicity and the Quest for Ultimate Mathematical Truth
- Even Ordinals and the Kunen Inconsistency
- Cantor’s Continuum Hypothesis in Set Theory
- Leibnizian and Anti-Leibnizian Motifs in Set Theory
Connections
31The lectures that define it or assume it, and the concepts next to it.
Concepts6
Lectures25
- Harvard CS50’s Artificial Intelligence with Python – Full University Course
- Set Theory and the Philosophy of Set Theory
- The Continuum Hypothesis as a Fundamental Axiom
- Binary Relations, Partitions & Equivalence Relations
- Bi-interpretation of Weak Set Theories
- Making is Decision Making
Show 19 moreShow fewer
- Forcing Axioms and Name Principles in Set Theory
- Provable Privacy and Security for Autonomous Agents: Are We There Yet?
- From P-Completeness to PSPACE-Completeness
- Simplicity and the Quest for Ultimate Mathematical Truth
- Even Ordinals and the Kunen Inconsistency
- Cantor’s Continuum Hypothesis in Set Theory
- Leibnizian and Anti-Leibnizian Motifs in Set Theory
- Some Set Theory of Kaufmann Models
- AI in Science and Engineering: Virtues and Vices of Robot Foundation Models
- A Fine-Grained Analogue of Schaefer's Theorem in P
- Computer Science and Homotopy Theory
- Recent Results on Structural Reflection Principles
- (Re)imagining Mathematics in a World of Reasoning Machines
- Definable Quotient Spaces for Unlikely Intersection Problems
- Definable Norms on Riemann-Zariski Spaces
- The Continuum Hypothesis and Other Set-Theoretic Ideas for Non-Set-Theorists (Part 1)
- Elementary Embeddings and Small Large Cardinals
- Minimal Models and Beta-Categoricity
- Enhanced and Efficient Reasoning in Large Language Models