## Abstract We present two results which shed some more light on the deep connection between ZFA and the standard ZF set theory: First of all we refine a result of Forti and Honsell (see [5]) in order to prove that the universe of ZFA can also be obtained (without appealing to choice) as the least
A cumulative hierarchy of predicates
β Scribed by Harvey Friedman
- Publisher
- John Wiley and Sons
- Year
- 1975
- Tongue
- English
- Weight
- 417 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper, we attempt to construct something analogous to the cumulative hierawhy of sets, for the notion of predicate. Analogously t o set theory, we will view every o b j ~~c ~t in our hicrarchy t o be a predicate, and evrry predicate in our hierarchy to have a ~~~1 1 defined truth value when applied t o any object in our hierarchy.
l ' h c cumulative hierarchies of predicates we consider here arc constructed by means of four principles.
I. The negation of any predicate is a predicate.
IT.
For any predicate x there is a predicate which holds of precisely those predicates 111. Any set y of predicates determines a predicate; i.e., there is a predicate which JV. The union of any set y of predicates is a predicate; i.e., there is a predicate which IVch will also consider the following extensionality principle.
1.. ,Any two predicates which hold of the same predicates are identical.
'I'Ii(> principal drawback in what, we do here is that, on the one hand we see no sigiiificant reason t o limit the construction principles t o the ones considered; on the oth(.i* hand we see no non ad hoe way to extend them. At least, these seem t o form the minimum natural collection that affords a nontrivial theory, and we expect furt JIW progress along these lines. ])(.finition 1 . .4 cumulative hierarchyisa system ({A,}, R), where A, = 0, A , C A , + ~, AA = U A,, and R is a binary relation on A = U A,. We say that ({A,}, R) is a cunr~rlatiw hierarchy of predicates just in case ({A,}, R) is a cumulative hierarchy, (A, R) satisfitis the axiom of extensionality, and each A,,, is the least subset of A obeying w11ic.h hold of x .
holds of precisely the elements of y. holds of precisely those predicates which are held by some member of y.
That is, A,+] is thcb closure of A, under principles I -IV. Two cumulative hierarchies ( { A n ; , R ) and ({Bd), S) are isomorphic just is case there is an isomorphism from (A, R) l ) This rcetbarc.h was partially supported by NSF P038823. JOHN MYHILL has suggested that work done hy MARC KRASXER, ThCorie de la ddfinition, Journal de mathdmatiques puma et appliquees, aer. U. 36 (1957). 325-357. and 37 (1958). 53-101, may be closely related. That paper is reviewed by G.
π SIMILAR VOLUMES
## Abstract We extend the hierarchy defined in [5] to cover all hyperarithmetical reals. An intuitive idea is used or the definition, but a characterization of the related classes is obtained. A hierarchy theorem and two fixed point theorems (concerning computations related to the hierarchy) are pr
## Abstract SturmβLiouville equations will be considered where the boundary conditions depend rationally on the eigenvalue parameter. Such problems apply to a variety of engineering situations, for example to the stability of rotating axles. Classesof these problems will be isolated with a rather r
A network model of development governing the whole temporal and spatial hierarchy of early embryogenesis and pattern formation in Drosophila is introduced. The network is related to a neural network model, with its units being developmental genes mostly connected by the genes' DNA-binding products.