Recommendations
- Une Preuve Formelle et Intuitionniste du Théorème de Complétude de la Logique Classique
- Intuitionistic completeness and classical logic
- An intuitionistic completeness theorem for classical predicate logic
- A proof of the standard completeness for the involutive uninorm logic
- Uniform provability in classical logic
- Complete Coinductive Theories. I
- On the unification of classical, intuitionistic and affine logics
- On the completeness of propositional Hoare logic
- Provability logic and the completeness principle
- Monoidal logics: completeness and classical systems
Cited in
(16)- Formalization of the resolution calculus for first-order logic
- A formalized general theory of syntax with bindings
- Markov chains and Markov decision processes in Isabelle/HOL
- A formalized general theory of syntax with bindings: extended version
- Distilling the requirements of Gödel's incompleteness theorems with a proof assistant
- Mechanised modal model theory
- Completeness theorems for first-order logic analysed in constructive type theory
- A formally verified abstract account of Gödel's incompleteness theorems
- Soundness and completeness proofs by coinductive methods
- A verified SAT solver framework with learn, forget, restart, and incrementality
- Formalization of the Resolution Calculus for First-Order Logic
- Complete Coinductive Theories. I
- Completeness theorems for first-order logic analysed in constructive type theory
- Formalized proof systems for propositional logic
- A naive prover for first-order logic: a minimal example of analytic completeness
- Verifying a sequent calculus Prover for first-order logic with functions in Isabelle/HOL
Describes a project that uses
Uses Software
This page was built for publication: Unified Classical Logic Completeness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192180)
