Problems, solutions, and completions-Reference-Cited by-同舟云学术

Problems, solutions, and completions

Published:2010-01 Issue:1 Volume:79 Page:84-91
ISSN:1567-8326
Container-title:The Journal of Logic and Algebraic Programming
language:en
Short-container-title:The Journal of Logic and Algebraic Programming

Author:

Schuster Peter

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Logic,Theoretical Computer Science,Software

Reference48 articles.

1. P. Aczel, The type theoretic interpretation of constructive set theory, in: A. Macintyre, L. Pacholski, J. Paris, (Eds.), Logic Colloquium’77, North-Holland, Amsterdam, 1978, pp. 55–66.

2. Binary refinement implies discrete exponentiation;Aczel;Studia Logica,2006

3. P. Aczel, M. Rathjen, Notes on Constructive Set Theory, Institut Mittag–Leffler Preprint no. 40, 2000/2001.

4. A. Bauer, Realizability as connection between constructive and computable mathematics, in: T. Grubba, P. Hertling, H. Tsuiki, K. Weihrauch (Eds.), CCA 2005, Second International Conference on Computability and Complexity in Analysis. Kyoto, Japan, August 2005, Fernuniversität Hagen, Informatik-Berichte, vols. 326–327, 2005, pp. 378–379.

5. A. Bauer, P. Taylor, The Dedekind reals in abstract Stone duality, in: T. Grubba, P. Hertling, H. Tsuiki, K. Weihrauch (Eds.), CCA 2005, Second International Conference on Computability and Complexity in Analysis. Kyoto, Japan, August 2005, Fernuniversität Hagen, Informatik-Berichte, vols. 326–327, 2005, pp. 25–64.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Toward a Clarity of the Extreme Value Theorem;Logica Universalis;2014-05-01

2. Uniqueness, continuity and the existence of implicit functions in constructive analysis;LMS Journal of Computation and Mathematics;2011-06-01

3. Unique paths as formal points;Journal of Logic and Analysis;2011

4. Minima and best approximations in constructive analysis;Journal of Logic and Analysis;2011