-
From Sets and Types to Topology and Analysis: Towards Practicable Foundations for Constructive MathematicsBulletin of Symbolic Logic 12 (4): 611-612. 2006.
-
30How complexity originates: Examples from history reveal additional roots to complexityComplexity 21 (S2): 7-12. 2016.
-
29PrefaceIn Dieter Probst & Peter Schuster (eds.), Concepts of Proof in Mathematics, Philosophy, and Computer Science, De Gruyter. 2016.
-
35ContentsIn Dieter Probst & Peter Schuster (eds.), Concepts of Proof in Mathematics, Philosophy, and Computer Science, De Gruyter. 2016.
-
50Ebola-challenge and revival of theoretical epidemiology: Why Extrapolations from early phases of epidemics are problematicComplexity 20 (5): 7-12. 2015.
-
42Models: From exploration to prediction: Bad reputation of modeling in some disciplines results from nebulous goalsComplexity 21 (1): 6-9. 2016.
-
61Optimization of multiple criteria: Pareto efficiency and fast heuristics should be more popular than they areComplexity 18 (2): 5-7. 2013.
-
116A beginning of the end of the holism versus reductionism debate?: Molecular biology goes cellular and organismicComplexity 13 (1): 10-13. 2007.
-
50Boltzmann, atomism, evolution, and statistics: Continuity versus discreteness in biologyComplexity 11 (6): 9-11. 2006.
-
114A revival of the landscape paradigm: Large scale data harvesting provides access to fitness landscapesComplexity 17 (5): 6-10. 2012.
-
94Compactness under constructive scrutinyMathematical Logic Quarterly 50 (6): 540-550. 2004.How are the various classically equivalent definitions of compactness for metric spaces constructively interrelated? This question is addressed with Bishop-style constructive mathematics as the basic system – that is, the underlying logic is the intuitionistic one enriched with the principle of dependent choices. Besides surveying today's knowledge, the consequences and equivalents of several sequential notions of compactness are investigated. For instance, we establish the perhaps unexpected co…Read more
-
144The Fan Theorem and Unique Existence of MaximaJournal of Symbolic Logic 71 (2). 2006.The existence and uniqueness of a maximum point for a continuous real—valued function on a metric space are investigated constructively. In particular, it is shown, in the spirit of reverse mathematics, that a natural unique existence theorem is equivalent to the fan theorem
-
100Strong continuity implies uniform sequential continuityArchive for Mathematical Logic 44 (7): 887-895. 2005.Uniform sequential continuity, a property classically equivalent to sequential continuity on compact sets, is shown, constructively, to be a consequence of strong continuity on a metric space. It is then shown that in the case of a separable metric space, uniform sequential continuity implies strong continuity if and only if one adopts a certain boundedness principle that, although valid in the classical, recursive and intuitionistic setting, is independent of Heyting arithmetic.
-
76
-
80On the contrapositive of countable choiceArchive for Mathematical Logic 50 (1-2): 137-143. 2011.We show that in elementary analysis (EL) the contrapositive of countable choice is equivalent to double negation elimination for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Sigma_{2}^{0}}$$\end{document}-formulas. By also proving a recursive adaptation of this equivalence in Heyting arithmetic (HA), we give an …Read more
-
53The Kripke schema in metric topologyMathematical Logic Quarterly 58 (6): 498-501. 2012.A form of Kripke's schema turns out to be equivalent to each of the following two statements from metric topology: every open subspace of a separable metric space is separable; every open subset of a separable metric space is a countable union of open balls. Thus Kripke's schema serves as a point of reference for classifying theorems of classical mathematics within Bishop-style constructive reverse mathematics
-
34A direct proof of Wiener's theoremIn S. Barry Cooper (ed.), How the World Computes, . pp. 293--302. 2012.
-
77Formal Zariski topology: positivity and pointsAnnals of Pure and Applied Logic 137 (1-3): 317-359. 2006.The topic of this article is the formal topology abstracted from the Zariski spectrum of a commutative ring. After recollecting the fundamental concepts of a basic open and a covering relation, we study some candidates for positivity. In particular, we present a coinductively generated positivity relation. We further show that, constructively, the formal Zariski topology cannot have enough points
-
University of LeedsRegular Faculty
Leeds, West Yorkshire, United Kingdom of Great Britain and Northern Ireland
Areas of Interest
| Logic and Philosophy of Logic |
| Medieval and Renaissance Philosophy |