Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-15T05:20:12.355Z Has data issue: false hasContentIssue false

A conjunctive normal form for S3.5

Published online by Cambridge University Press:  12 March 2014

M. J. Cresswell*
Affiliation:
Victoria University of Wellington

Extract

In this note we sketch a decision procedure for S3.51 based onreduction to conjunctive normal form. Using the following theorem of S3.5: and itsdual for M over a conjunction, any formula can be reducedby standard methods (as in S52) to a conjunction of disjunctionsof the form where Í is (p ⊃ p), 0 is ∼(p ⊃ p)and α — λ are all PC-wffs (i.e. they contain no modal operators).

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1969

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable