Completeness theorem
From MaRDI portal
Cited in
(26)- PyRes
- THINKER
- A verified SAT solver framework with learn, forget, restart, and incrementality
- Formalization of the resolution calculus for first-order logic
- MUSCADET
- Formally verified tableau-based reasoners for a description logic
- Soundness and completeness proofs by coinductive methods
- PVSio
- Formalization of the Resolution Calculus for First-Order Logic
- Self-formalisation of higher-order logic. Semantics, soundness, and a verified implementation
- IsaFoL
- Unified Classical Logic Completeness
- DPT
- Superposition Calculus
- Paraconsistency
- Abstract Completeness
- FOL Fitting
- Incompleteness Theorems
- NASA PVS
- Verified Prover
- SAT Solver Verification
- Abstract Soundness
- Propositional Resolution
- FOL_Harrison
- Programming and verifying a declarative first-order prover in Isabelle/HOL
- Epistemic Logic
This page was built for software: Completeness theorem
