Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Term Models for First-Order Logic
Graph Chatbot
Related lectures (28)
Coq: Introduction
Introduces Coq, covering defining propositions, proving theorems, and using tactics.
Automating First-Order Logic Proofs Using Resolution
Covers first-order logic syntax, semantics, and resolution for proving properties.
Theorem Proving and Vampire
Explores theorem proving in first-order logic and the saturation-based approach, highlighting the Vampire theorem prover.
Mathgraph Theorem Prover
Introduces the Mathgraph Theorem Prover, showcasing its unique approach to representing propositions and organizing graphs for first-order logic.
Automating First-Order Logic Proofs Using Resolution
Covers first-order logic syntax, semantics, Skolemization, resolution, and normal form transformations.
Predicate Logic: Basics and Applications
Covers the basics and applications of predicate logic, including quantifiers, predicates, and propositional functions.
Automating First-Order Logic Proofs Using Resolution
Covers first-order logic, resolution proofs, Skolem functions, and satisfiability checking in mathematics and program verification.
Proofs: Logic, Mathematics & Algorithms
Explores proof concepts, techniques, and applications in logic, mathematics, and algorithms.
Coq Workshop: Introduction to Interactive Theorem Proving
Introduces Coq, an interactive theorem assistant based on the Curry-Howard isomorphism.
Predicate Logic: Nested Quantifiers
Explores nested quantifiers in logic and their translation into natural language and mathematical statements.
Predicate Logic: Quantifiers and Normal Forms
Explores predicate logic, focusing on quantifiers and normal forms, emphasizing the importance of finding witnesses and counterexamples.
Markov Chains: Applications and Coupled Chains
Covers Markov chains, coupled chains, and their applications, emphasizing the importance of irreducibility.
Hoare Logic: Strongest Postcondition and Weakest Precondition
Covers Hoare logic, strongest postcondition, and weakest precondition for simplifying proofs in imperative programming.
Untitled
Untitled
Predicate Logic: Quantifiers, CNF, DNF
Covers Predicate Logic, focusing on Quantifiers, CNF, and DNF.
Coq: Overview
Introduces Coq and focuses on proving the theorem and_comm step by step.
Predicate Calculus: Basics
Covers the basics of predicate calculus, including propositions, formulas, terms, and semantic evaluation.
Conformity in Normal Components
Explores conformity in normal components across edges and the importance of continuity for generic components.
The Languages of Isabelle: Isar, ML, and Scala
Explores the languages of Isabelle, focusing on Isar, ML, and Scala, covering proof schemes, Natural Deduction rules, inductive definitions, and the LCF approach.
Previous
Page 1 of 2
Next