Showing papers on "Conjunctive normal form published in 1969"
TL;DR: In this article, a decision procedure for S3.51 based on reduction to conjunctive normal form is proposed, where any formula can be reduced by standard methods (as in S52) to a conjunction of disjunctions of the form where I is (p ⊃ p), 0 is ∼(p/p/0), and α − λ are all PC-wffs.
Abstract: In this note we sketch a decision procedure for S3.51 based on reduction to conjunctive normal form. Using the following theorem of S3.5: and its dual for M over a conjunction, any formula can be reduced by standard methods (as in S52) to a conjunction of disjunctions of the form where I is (p ⊃ p), 0 is ∼(p ⊃ p) and α — λ are all PC-wffs (i.e. they contain no modal operators).
2 citations
01 Jan 1969
TL;DR: In this article, the authors present an algorithm for finding one of the minimal disjunctive normal forms (DNF) for an incompletely specified function of the algebra of logic.
Abstract: In this paper we present an algorithm for finding one of the minimal disjunctive normal forms (DNF) for an incompletely specified function of the algebra of logic. A completely specified function can be considered as a special case of an incompletely specified function.
1 citations