-
From Sets and Types to Topology and Analysis: Towards Practicable Foundations for Constructive MathematicsBulletin of Symbolic Logic 12 (4): 611-612. 2006.
-
29How complexity originates: Examples from history reveal additional roots to complexityComplexity 21 (S2): 7-12. 2016.
-
35ContentsIn Dieter Probst & Peter Schuster (eds.), Concepts of Proof in Mathematics, Philosophy, and Computer Science, De Gruyter. 2016.
-
29PrefaceIn Dieter Probst & Peter Schuster (eds.), Concepts of Proof in Mathematics, Philosophy, and Computer Science, De Gruyter. 2016.
-
42Models: From exploration to prediction: Bad reputation of modeling in some disciplines results from nebulous goalsComplexity 21 (1): 6-9. 2016.
-
50Ebola-challenge and revival of theoretical epidemiology: Why Extrapolations from early phases of epidemics are problematicComplexity 20 (5): 7-12. 2015.
-
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.
-
93Quasi-apartness and neighbourhood spacesAnnals of Pure and Applied Logic 141 (1): 296-306. 2006.We extend the concept of apartness spaces to the concept of quasi-apartness spaces. We show that there is an adjunction between the category of quasi-apartness spaces and the category of neighbourhood spaces, which indicates that quasi-apartness is a more natural concept than apartness. We also show that there is an adjoint equivalence between the category of apartness spaces and the category of Grayson’s separated spaces
-
97A predicative completion of a uniform spaceAnnals of Pure and Applied Logic 163 (8): 975-980. 2012.
-
138A continuity principle, a version of Baire's theorem and a boundedness principleJournal of Symbolic Logic 73 (4): 1354-1360. 2008.We deal with a restricted form WC-N' of the weak continuity principle, a version BT' of Baire's theorem, and a boundedness principle BD-N. We show, in the spirit of constructive reverse mathematics, that WC-N'. BT' + ¬LPO and BD-N + ¬LPO are equivalent in a constructive system, where LPO is the limited principle of omniscience
-
94Unique solutionsMathematical Logic Quarterly 52 (6): 534-539. 2006.It is folklore that if a continuous function on a complete metric space has approximate roots and in a uniform manner at most one root, then it actually has a root, which of course is uniquely determined. Also in Bishop's constructive mathematics with countable choice, the general setting of the present note, there is a simple method to validate this heuristic principle. The unique solution even becomes a continuous function in the parameters by a mild modification of the uniqueness hypothesis. …Read more
-
147Classifying Dini's TheoremNotre Dame Journal of Formal Logic 47 (2): 253-262. 2006.Dini's theorem says that compactness of the domain, a metric space, ensures the uniform convergence of every simply convergent monotone sequence of real-valued continuous functions whose limit is continuous. By showing that Dini's theorem is equivalent to Brouwer's fan theorem for detachable bars, we provide Dini's theorem with a classification in the recently established constructive reverse mathematics propagated by Ishihara. As a complement, Dini's theorem is proved to be equivalent to the an…Read more
-
110Linear independence without choiceAnnals of Pure and Applied Logic 101 (1): 95-102. 1999.The notions of linear and metric independence are investigated in relation to the property: if U is a set of n+1 independent vectors, and X is a set of n independent vectors, then adjoining some vector in U to X results in a set of n+1 independent vectors. It is shown that this property holds in any normed linear space. A related property – that finite-dimensional subspaces are proximinal – is established for strictly convex normed spaces over the real or complex numbers. It follows that metric …Read more
-
141Countable choice as a questionable uniformity principlePhilosophia Mathematica 12 (2): 106-134. 2004.Should weak forms of the axiom of choice really be accepted within constructive mathematics? A critical view of the Brouwer-Heyting-Kolmogorov interpretation, accompanied by the intention to include nondeterministic algorithms, leads us to subscribe to Richman's appeal for dropping countable choice. As an alternative interpretation of intuitionistic logic, we propose to renew dialogue semantics.
-
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 |