Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T15:29:57.141Z Has data issue: false hasContentIssue false

The problem of simplifying logical expressions1

Published online by Cambridge University Press:  12 March 2014

Extract

By quite elementary means, one can find “large” examples difficult, if not (for practical purposes) impossible, to be managed by that host of methods, after Quine, for minimizing expressions in alternational normal form. Because the workability rather than existence of an algorithm for minimizing logical formulae is generally critical, it may be pertinent to outline briefly the derivation of these “large” examples. Some more general insight may also be gained about simplification techniques.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1959

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