Hostname: page-component-8448b6f56d-42gr6 Total loading time: 0 Render date: 2024-04-24T07:15:40.840Z Has data issue: false hasContentIssue false
  • English
  • Français

Corrections to a theory of restricted quantification

Published online by Cambridge University Press:  12 March 2014

Theodore Hailperin
Theodore Hailperin*
Affiliation:
Lehigh University
Get access Rights & Permissions [Opens in a new window]

Extract

R. Sherman Lehman has called my attention to an error which vitiates the proofs of two theorems in the paper mentioned in the title (this Journal, vol. 22, pp. 19–35, 113–129). New proofs are here presented.

Proof of Lemma, p. 27. Induction Step: Assume as hypothesis of induction that the lemma holds for formulas P with n—1 or fewer free restricted variables and consider a P having n (n>0) such variables.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 25 , Issue 1 , March 1960 , pp. 54 - 56
Copyright
Copyright © Association for Symbolic Logic 1960

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.)