ISSN:
1572-8730
Keywords:
sets
;
types
;
comprehension principles
;
combinatory logic
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
,
Philosophy
Notes:
Abstract We show that, if non-uniform impredicative stratified comprehension is assumed, Feferman's theories of explicit mathematics are consistent with a strong power type axiom. This result answers a problem, raised by Jäger. The proof relies upon an interpretation into Quine's set theory NF with urelements.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1026495301622