Affiliation:
1. University of Canterbury
Abstract
Abstract
We show that several weakenings of the Cauchy condition are all equivalent under the assumption of countable choice, and investigate to what extent choice is necessary. We also show that the syntactically reminiscent notion of metastability allows similar variations, but is empty in terms of its constructive content.1
Publisher
Oxford University Press (OUP)
Subject
Logic,Hardware and Architecture,Arts and Humanities (miscellaneous),Software,Theoretical Computer Science
Reference24 articles.
1. Notes on constructive set theory;Aczel,2001
2. A metastable dominated convergence theorem;Avigad;Journal of Logic and Analysis,2012
3. Rearranging series constructively;Berger;Journal of Universal Computer Science,2009
4. Double sequences, almost Cauchyness and BD-N;Berger;Logic Journal of IGPL,2012