A New Approach to Predicative Set Theory
We suggest a new framework for the Weyl-Feferman predicativist program by constructing a formal predicative set theory P ZF which resembles ZF , and is suitable for mechanization. The basic idea is that the predicatively acceptable instances of the comprehension schema are those which determine the collections they deﬁne in an absolute way, independent of the extension of the “surrounding universe”. The language of P ZF is type-free, and it reﬂects real mathematical practice in making an extensive use of statically deﬁned abstract set terms. Another important feature of P ZF is that its underlying logic is ancestral logic (i.e. the extension of ﬁrst-order logic with a transitive closure operation)
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
A Note on Finiteness in the Predicative Foundations of Arithmetic.Fernando Ferreira - 1999 - Journal of Philosophical Logic 28 (2):165-174.
An Axiom Schema of Comprehension of Zermelo–Fraenkel–Skolem Set Theory.Johannes Heidema - 1990 - History and Philosophy of Logic 11 (1):59-65.
Predicative Foundations of Arithmetic.Solomon Feferman & Geoffrey Hellman - 1995 - Journal of Philosophical Logic 24 (1):1 - 17.
The Equivalence of NF-Style Set Theories with "Tangled" Theories; the Construction of Ω-Models of Predicative NF (and More).M. Randall Holmes - 1995 - Journal of Symbolic Logic 60 (1):178-190.
Added to index2009-04-13
Total downloads8 ( #487,363 of 2,158,909 )
Recent downloads (6 months)0
How can I increase my downloads?