Hostname: page-component-cd9895bd7-gxg78 Total loading time: 0 Render date: 2024-12-23T06:58:32.394Z Has data issue: false hasContentIssue false

A definition of negation in extended basic logic

Published online by Cambridge University Press:  12 March 2014

Frederic B. Fitch*
Affiliation:
Yale University

Extract

In a previous paper it was shown that the system K of basic logic could be formulated in a simpler way owing to the fact that the proper ancestral could be defined in terms of the other concepts of that system. In the present paper analogous but more far-reaching results will be obtained for the system K′ of extended basic logic. In particular we will show that negation and the dual of the proper ancestral, as well as the proper ancestral itself, are definable in terms of the other concepts of K′. Hence, in order to define K′, we need to add only a single non-finitary rule to the rules used to define K. This rule was already among the rules originally used to define K′. It asserts that ‘Aa’ is in K′ if (and only if) every ‘b’ is such that ‘ab’ is in K′.

We will also show that a large class of non-finitary classes and relations are represented in K′, among which is K′ itself, just as all finitary syntactical classes and all finitary two- and three-place syntactical relations are represented in K, one of which is the finitary syntactical class K itself. The point is that K′ is adequate to handle the sort of transfinite induction that is essential in formulating K′, just as K is adequate to handle the ordinary finitary mathematical induction required in defining K′.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1954

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 Fitch, F. B., A simplification of basic logic, this Journal, vol. 18 (1953), pp. 317325Google Scholar. We will refer to this paper hereafter as SBL.

2 Fitch, F. B., An extension of basic logic, this Journal, vol. 13 (1948), pp. 95106Google Scholar. This paper will be referred to as EBL. See also John R. Myhill, A finitary metalanguage for extended basic logic, ibid., vol. 17 (1952), pp. 164–178.

3 Fitch, F. B., A demonstrably consistent mathematics, this Journal, vol. 15 (1950), pp. 1724, vol. 16 (1951), pp. 121–124Google Scholar.

4 The inequality symbol and the existence quantifier are to be understood us defined in SBL. The universal quantifier is to be understood as defined in the same way as the existence quantifier, but using ‘A’ in place of ‘E’.