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...

Logics with Impossibility as the Negation and Regular Extensions of the Deontic Logic D2

Krystyna Mruczek-Nasieniewska, Marek Nasieniewski (2017)

Bulletin of the Section of Logic

Similarity:

In [1] J.-Y. Bèziau formulated a logic called Z. Bèziau’s idea was generalized independently in [6] and [7]. A family of logics to which Z belongs is denoted in [7] by K. In particular; it has been shown in [6] and [7] that there is a correspondence between normal modal logics and logics from the class K. Similar; but only partial results has been obtained also for regular logics (see [8] and [9]). In (Došen; [2]) a logic N has been investigated in the language with negation; implication;...