scholarly journals Principles Weaker than BD-N

2013 ◽  
Vol 78 (3) ◽  
pp. 873-885 ◽  
Author(s):  
Robert S. Lubarsky ◽  
Hannes Diener

AbstractBD-N is a weak principle of constructive analysis. Several interesting principles implied by BD-N have already been identified, namely the closure of the anti-Specker spaces under product, the Riemann Permutation Theorem, and the Cauchyness of all partially Cauchy sequences. Here these are shown to be strictly weaker than BD-N, yet not provable in set theory alone under constructive logic.

2007 ◽  
Vol 17 (1) ◽  
pp. 3-36 ◽  
Author(s):  
HERMAN GEUVERS ◽  
MILAD NIQUI ◽  
BAS SPITTERS ◽  
FREEK WIEDIJK

In this paper we will discuss various aspects of computable/constructive analysis, namely semantics, proofs and computations. We will present some of the problems and solutions of exact real arithmetic varying from concrete implementations, representation and algorithms to various models for real computation. We then put these models in a uniform framework using realisability, which opens the door to the use of type theoretic and coalgebraic constructions both in computing and reasoning about these computations. We will indicate that it is often natural to use constructive logic to reason about these computations.


Author(s):  
Ernest Schimmerling
Keyword(s):  

Author(s):  
Daniel W. Cunningham
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document