𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The natural numbers in constructive set theory

✍ Scribed by Michael Rathjen


Publisher
John Wiley and Sons
Year
2008
Tongue
English
Weight
191 KB
Volume
54
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

Constructive set theory started with Myhill's seminal 1975 article [8]. This paper will be concerned with axiomatizations of the natural numbers in constructive set theory discerned in [3], clarifying the deductive relationships between these axiomatizations and the strength of various weak constructive set theories. (Β© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)


πŸ“œ SIMILAR VOLUMES


A note on Bar Induction in Constructive
✍ Michael Rathjen πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 113 KB πŸ‘ 1 views

## Abstract Bar Induction occupies a central place in Brouwerian mathematics. This note is concerned with the strength of Bar Induction on the basis of Constructive Zermelo‐Fraenkel Set Theory, CZF. It is shown that CZF augmented by decidable Bar Induction proves the 1‐consistency of CZF. This answ

The union axiom in zermelo set theory
✍ Carlos G. GonzΓ‘lez πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 185 KB πŸ‘ 1 views
Contribution to the theory of semisets V
✍ Antonin Sochor πŸ“‚ Article πŸ“… 1975 πŸ› John Wiley and Sons 🌐 English βš– 299 KB πŸ‘ 1 views

Z e a c h r . i. d. L & k und Qrundlagen d . A ΒΆ&. Hd. P I , S. 439-412 (1975) CONTRIBUTION TO THE THEORY OF SEMISETS VI (Non-existence of the class of all absolute natural numbers) by ANTONIT SOCHOR in Prague (C.S.S.R.) .4n important concept-the class of all absolute natural numbers has been intro

The number of maximal independent sets i
✍ ZoltΓ‘n FΓΌredi πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 286 KB πŸ‘ 2 views

Generalizing a theorem of Moon and Moser. we determine the maximum number of maximal independent sets in a connected graph on n vertices for n sufficiently large, e.g., n > 50. = I .32. . .). Example 1.2. Let b, = i(C,), where C,z denotes the circuit of length n. Then b, = 3, 6, = 2, b, = 5, and b,