Pages that link to "Item:Q2362498"

The following pages link to Soundness and completeness proofs by coinductive methods (Q2362498):

Displaying 8 items.

• A verified SAT solver framework with learn, forget, restart, and incrementality (Q1663234) (← links)
• Formalization of the resolution calculus for first-order logic (Q1663242) (← links)
• A formalized general theory of syntax with bindings (Q1687739) (← links)
• A formalized general theory of syntax with bindings: extended version (Q1984791) (← links)
• Formalizing a Seligman-style tableau system for hybrid logic (short paper) (Q2096470) (← links)
• Formalized soundness and completeness of epistemic logic (Q2148773) (← links)
• Programming and verifying a declarative first-order prover in Isabelle/HOL (Q5145439) (← links)
• Formalizing Bachmair and Ganzinger's ordered resolution prover (Q5919011) (← links)