Hostname: page-component-8448b6f56d-c47g7 Total loading time: 0 Render date: 2024-04-19T21:44:39.200Z Has data issue: false hasContentIssue false

A system of implicit quantification

Published online by Cambridge University Press:  12 March 2014

J. Jay Zeman*
Affiliation:
University of Florida

Extract

The “traditional” method of presenting the subject-matter of symbolic logic involves setting down, first of all, a basis for a propositional calculus—which basis might be a system of natural deduction, an axiom system, or a rule concerning tautologous formulas. The next step, ordinarily, consists of the introduction of quantifiers into the symbol-set of the system, and the stating of axioms or rules for quantification. In this paper I shall propose a system somewhat different from the ordinary; this system has rules for quantification and is, indeed, equivalent to classical quantification theory. It departs from the usual, however, in that it has no primitive quantifiers.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1968

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

References

[1]Goodstein, R. L., Recursive number theory, North-Holland, Amsterdam, 1964.Google Scholar
[2]Kleene, S. C., Introduction to metamathematks, North-Holland, Amsterdam, 1959.Google Scholar
[3]Robinson, R. M., Primitive recursive functions, Bulletin of the American Mathematical Society, vol. 53 (1947), pp. 925942.CrossRefGoogle Scholar