Paul Bernays. A system of axiomatic set theory—Part VI. The journal of symbolic logic, vol. 13 (1948), pp 65–79.

1948 ◽  
Vol 13 (4) ◽  
pp. 220-221
Author(s):  
C. D. Firestone
Keyword(s):  
Set Theory ◽  
Symbolic Logic ◽  
Axiomatic Set Theory

scholarly journals A system of axiomatic set theory. Part III. Infinity and enumerability. Analysis

1942 ◽  
Vol 7 (2) ◽  
pp. 65-89 ◽  
Author(s):  
Paul Bernays
Keyword(s):  
Number Theory ◽  
Set Theory ◽  
Real Numbers ◽  
Full Generality ◽  
Axiomatic Set Theory

The foundation of analysis does not require the full generality of set theory but can be accomplished within a more restricted frame. Just as for number theory we need not introduce a set of all finite ordinals but only a class of all finite ordinals, all sets which occur being finite, so likewise for analysis we need not have a set of all real numbers but only a class of them, and the sets with which we have to deal are either finite or enumerable.We begin with the definitions of infinity and enumerability and with some consideration of these concepts on the basis of the axioms I—III, IV, V a, V b, which, as we shall see later, are sufficient for general set theory. Let us recall that the axioms I—III and V a suffice for establishing number theory, in particular for the iteration theorem, and for the theorems on finiteness.

Resolution in type theory

1971 ◽  
Vol 36 (3) ◽  
pp. 414-432 ◽  
Author(s):  
Peter B. Andrews
Keyword(s):  
Set Theory ◽  
Type Theory ◽  
Higher Order ◽  
Order Logic ◽  
First Order Logic ◽  
Higher Order Logic ◽  
First Order ◽  
Different Types ◽  
Axiomatic Set Theory ◽  
Order Predicate Calculus

In [8] J. A. Robinson introduced a complete refutation procedure called resolution for first order predicate calculus. Resolution is based on ideas in Herbrand's Theorem, and provides a very convenient framework in which to search for a proof of a wff believed to be a theorem. Moreover, it has proved possible to formulate many refinements of resolution which are still complete but are more efficient, at least in many contexts. However, when efficiency is a prime consideration, the restriction to first order logic is unfortunate, since many statements of mathematics (and other disciplines) can be expressed more simply and naturally in higher order logic than in first order logic. Also, the fact that in higher order logic (as in many-sorted first order logic) there is an explicit syntactic distinction between expressions which denote different types of intuitive objects is of great value where matching is involved, since one is automatically prevented from trying to make certain inappropriate matches. (One may contrast this with the situation in which mathematical statements are expressed in the symbolism of axiomatic set theory.).

Sign in / Sign up

Export Citation Format

Share Document