A Computer Implementation of the Transformations of Formulas into Prenex Normal Form

Simple item page
dc.contributor.authorProvenza, Clinton E.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:36:58Zen
dc.date.available2013-06-19T14:36:58Zen
dc.date.issued1974en
dc.description.abstractThe purpose of this paper is to explain a computerized process whereby any well-formed formula (wff) of first order predicate calculus can be moved to its prenex normal form (PNF). The main features of the program demonstrate some of the interesting capabilities of the WATFIV compiler in utilizing Markov Algorithms.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000764/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000764/01/CS74010-R.pdfen
dc.identifier.trnumberCS74010-Ren
dc.identifier.urihttp://hdl.handle.net/10919/20225en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleA Computer Implementation of the Transformations of Formulas into Prenex Normal Formen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
CS74010-R.pdf
Size:
689.56 KB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports