Pages that link to "Item:Q3192180"
From MaRDI portal
The following pages link to Unified Classical Logic Completeness (Q3192180):
Displaying 14 items.
- Formalization of the resolution calculus for first-order logic (Q1663242) (← links)
- A formalized general theory of syntax with bindings (Q1687739) (← links)
- Markov chains and Markov decision processes in Isabelle/HOL (Q1701041) (← links)
- A formalized general theory of syntax with bindings: extended version (Q1984791) (← links)
- Distilling the requirements of Gödel's incompleteness theorems with a proof assistant (Q2051568) (← links)
- Mechanised modal model theory (Q2096473) (← links)
- A formally verified abstract account of Gödel's incompleteness theorems (Q2305432) (← links)
- Soundness and completeness proofs by coinductive methods (Q2362498) (← links)
- A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality (Q2817909) (← links)
- Formalization of the Resolution Calculus for First-Order Logic (Q2829269) (← links)
- Complete Coinductive Theories. I (Q3486554) (← links)
- (Q6060676) (← links)
- A naive prover for first-order logic: a minimal example of analytic completeness (Q6541166) (← links)
- Verifying a sequent calculus Prover for first-order logic with functions in Isabelle/HOL (Q6611963) (← links)