Displaying similar documents to “Parametrized prime implicant-implicate computations for regular logics.”

An algebraic completeness proof for Kleene's 3-valued logic

Maurizio Negri (2002)

Bollettino dell'Unione Matematica Italiana

Similarity:

We introduce Kleene's 3-valued logic in a language containing, besides the Boolean connectives, a constant n for the undefined truth value, so in developing semantics we can switch from the usual treatment based on DM-algebras to the narrower class of DMF-algebras (De Morgan algebras with a single fixed point for negation). A sequent calculus for Kleene's logic is introduced and proved complete with respect to threevalent semantics. The completeness proof is based on a version of the...

Cocktail: a tool for deriving correct programs.

Michael Franssen, Harrie De Swart (2004)

RACSAM

Similarity:

Cocktail is a tool for deriving correct programs from their specifications. The present version is powerful enough for educational purposes. The tool yields support for many sorted first order predicate logic, formulated in a pure type system with parametric constants (CPTS), as the specification language, a simple While-language, a Hoare logic represented in the same CPTS for deriving programs from their specifications and a simple tableau based automated theorem prover for verifying...