Contents: Math. Log. Quart. 1/2008
- Publisher
- John Wiley and Sons
- Year
- 2008
- Tongue
- English
- Weight
- 57 KB
- Volume
- 54
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
โฆ Synopsis
The Relation Reflection Scheme
We introduce a new axiom scheme for constructive set theory, the Relation Reflection Scheme (RRS). Each instance of this scheme is a theorem of the classical set theory ZF. In the constructive set theory CZF -, when the axiom scheme is combined with the axiom of Dependent Choices (DC), the result is equivalent to the scheme of Relative Dependent Choices (RDC). In contrast to RDC, the scheme RRS is preserved in Heyting-valued models of CZF -using set-generated frames. We give an application of the scheme to coinductive definitions of classes.
๐ SIMILAR VOLUMES
## Groupwise density cannot be much bigger than the unbounded number We prove that g (the groupwise density number) is smaller or equal to b + , the successor of the minimal cardinality of an unbounded subset of ฯ ฯ. This is true even for the version of g for groupwise dense ideals.
Various types of continuity for preference relations on a metric space are examined constructively. In particular, necessary and sufficient conditions are given for an order-dense, strongly extensional preference relation on a complete metric space to be continuous. It is also shown, in the spirit o
On the ฮ 1 1 -separation principle We study the proof-theoretic strength of the ฮ 1 1 -separation axiom scheme, and we show that ฮ 1 1 -separation lies strictly in between the ฮ 1 1 -comprehension and ฮฃ 1 1 -choice axiom schemes over RCA 0 .