Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T01:34:03.144Z Has data issue: false hasContentIssue false

An improved prenex normal form1

Published online by Cambridge University Press:  12 March 2014

C. C. Chang
Affiliation:
University of California, Los AngelesUniversity of California, BerkeleyCalifornia Institute of Technology, Pasadena
H. Jerome Keisler
Affiliation:
University of California, Los AngelesUniversity of California, BerkeleyCalifornia Institute of Technology, Pasadena

Extract

Let ℒ be the set of all formulas of a given first order predicate logic (with or without identity). For each positive integer n, let ℒn be the set of all formulas φ in ℒ logically equivalent to a formula of the form

where Q is a (possibly empty) string of quantifiers, m is a positive integer, and each αij is either an atomic formula or the negation of an atomic formula.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1962

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