Extending constructive operational set theory by impredicative principles

被引:4
|
作者
Cantini, Andrea [1 ]
机构
[1] Univ Florence, Dipartimento Filosofia, I-50139 Florence, Italy
关键词
Set; operation; partial combinatory logic; uniform comprehension; mu-operator; unbounded set quantifier; INDUCTIVE DEFINITIONS; STRENGTH;
D O I
10.1002/malq.201010009
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We study constructive set theories, which deal with (partial) operations applying both to sets and operations themselves. Our starting point is a fully explicit, finitely axiomatized system ESTE of constructive sets and operations, which was shown in [10] to be as strong as PA. In this paper we consider extensions with operations, which internally represent description operators, unbounded set quantifiers and local fixed point operators. We investigate the proof theoretic strength of the resulting systems, which turn out to be (except for the description operator) impredicative (being comparable with full second-order arithmetic and the second-order mu-calculus over arithmetic). (C) 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim
引用
收藏
页码:299 / 322
页数:24
相关论文
共 50 条