Pages that link to "Item:Q2362498"

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

Displaying 21 items.

• Soundness of abductive proof procedure with respect to constraint for non-ground abducibles (Q1274977) (← links)
• A verified SAT solver framework with learn, forget, restart, and incrementality (Q1663234) (← links)
• Formalization of the resolution calculus for first-order logic (Q1663242) (← links)
• Foundational (co)datatypes and (co)recursion for higher-order logic (Q1687535) (← links)
• A formalized general theory of syntax with bindings (Q1687739) (← links)
• A formalized general theory of syntax with bindings: extended version (Q1984791) (← links)
• (Co)inductive proof systems for compositional proofs in reachability logic (Q1996855) (← links)
• Formalizing a Seligman-style tableau system for hybrid logic (short paper) (Q2096470) (← links)
• Formalized soundness and completeness of epistemic logic (Q2148773) (← links)
• Completeness and Decidability Results for CTL in Coq (Q2879254) (← links)
• A coinductive approach to computing with compact sets (Q2974666) (← links)
• Sound lemma generation for proving inductive validity of equations (Q3165943) (← links)
• Complete Coinductive Theories. I (Q3486554) (← links)
• Soundness and completeness of a synthesis algorithm based on example computations (Q3766813) (← links)
• (Q4288052) (← links)
• Programming and verifying a declarative first-order prover in Isabelle/HOL (Q5145439) (← links)
• (Q5688889) (← links)
• Formalizing Bachmair and Ganzinger's ordered resolution prover (Q5919011) (← links)
• Proof by computation in the Coq system (Q5958299) (← 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)