• PhilPapers
  • PhilPeople
  • PhilArchive
  • PhilEvents
  • PhilJobs
  • Sign in
PhilPeople
 
  • Sign in
  • News Feed
  • Find Philosophers
  • Departments
  • Radar
  • Help
 
profile-cover
Drag to reposition
profile picture

Peter Schuster

University of Leeds
  •  Home
  •  Publications
    68
    • Most Recent
    • Most Downloaded
    • Topics
  •  Events
    1
  •  News and Updates
    2

 More details
  • University of Leeds
    Regular Faculty
Leeds, West Yorkshire, United Kingdom of Great Britain and Northern Ireland
Areas of Interest
Logic and Philosophy of Logic
Medieval and Renaissance Philosophy
  • All publications (68)
  • From Sets and Types to Topology and Analysis: Towards Practicable Foundations for Constructive Mathematics
    Bulletin of Symbolic Logic 12 (4): 611-612. 2006.
    Intuitionism and Constructivism
  •  44
    Complexity has come of age
    with Alfred Hübler
    Complexity 21 (S2): 6-6. 2016.
    Complexity
  •  29
    How complexity originates: Examples from history reveal additional roots to complexity
    Complexity 21 (S2): 7-12. 2016.
    Complexity
  •  35
    Contents
    with Dieter Probst
    In Dieter Probst & Peter Schuster (eds.), Concepts of Proof in Mathematics, Philosophy, and Computer Science, De Gruyter. 2016.
    The Contents of Perception
  •  29
    Preface
    with Dieter Probst
    In Dieter Probst & Peter Schuster (eds.), Concepts of Proof in Mathematics, Philosophy, and Computer Science, De Gruyter. 2016.
    British Philosophy
  •  42
    Models: From exploration to prediction: Bad reputation of modeling in some disciplines results from nebulous goals
    Complexity 21 (1): 6-9. 2016.
    The Nature of Models
  •  50
    Ebola-challenge and revival of theoretical epidemiology: Why Extrapolations from early phases of epidemics are problematic
    Complexity 20 (5): 7-12. 2015.
    Ebola
  •  7
    Are there noticeable relativistic effects on terrestrial evolution?
    Complexity 5 (3): 20. 2000.
    Quantum Mechanics
  • Über das Kripke-Schema und abzählbare Teilmengen
    with JÚlia Zappe
    Logique Et Analyse 51. 2008.
    Metaphysics and EpistemologyKripkenstein on Meaning
  •  54
    Are computer scientists the sutlers of modern biology?: Bioinformatics is indispensible for progress in molecular life sciences but does not get credit for its contributions
    Complexity 19 (4): 10-14. 2014.
    Philosophy of Biology, MiscellaneousBiological SciencesInformation Science
  •  59
    Networks in biology: Handling biological complexity requires novel inputs into network theory
    Complexity 16 (4): 6-9. 2011.
    Philosophy of Biology, MiscellaneousComplexity in Biology
  •  61
    Optimization of multiple criteria: Pareto efficiency and fast heuristics should be more popular than they are
    Complexity 18 (2): 5-7. 2013.
    Theory in Economics
  •  91
    Designing living matter. Can we do better than evolution?
    Complexity 18 (6): 21-33. 2013.
    Evolutionary Biology
  •  116
    A beginning of the end of the holism versus reductionism debate?: Molecular biology goes cellular and organismic
    Complexity 13 (1): 10-13. 2007.
    Reduction
  •  86
    Nonlinear dynamics from physics to biology
    Complexity 12 (4): 9-11. 2007.
    Nonlinear Dynamics
  •  42
    The disaster of central control
    Complexity 9 (4): 13-14. 2004.
    Motivation and Will
  •  50
    Boltzmann, atomism, evolution, and statistics: Continuity versus discreteness in biology
    Complexity 11 (6): 9-11. 2006.
    Thermodynamics and Statistical Mechanics
  •  118
    Origins of life: Concepts, data, and debates
    Complexity 15 (3): 7-10. 2010.
    Philosophy of Psychology
  •  101
    Free will, information, quantum mechanics, and biology
    Complexity 15 (1): 8-10. 2009.
    Quantum Information
  •  114
    A revival of the landscape paradigm: Large scale data harvesting provides access to fitness landscapes
    Complexity 17 (5): 6-10. 2012.
    Evolutionary Biology
  •  74
    Are there recipes for how to handle complexity?
    Complexity 14 (1): 8-12. 2008.
    Complexity
  •  40
    Contingeny and memory in evolution
    Complexity 15 (6): 7-10. 2010.
    Memory
  •  93
    Quasi-apartness and neighbourhood spaces
    with Hajime Ishihara, Ray Mines, and Luminiţa Vîţă
    Annals 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
    Science, Logic, and MathematicsAreas of Mathematics
  •  97
    A predicative completion of a uniform space
    with Josef Berger, Hajime Ishihara, and Erik Palmgren
    Annals of Pure and Applied Logic 163 (8): 975-980. 2012.
    Areas of MathematicsIntuitionism and Constructivism
  •  110
    A Silent revolution in mathematics
    Complexity 18 (6): 7-10. 2013.
    Philosophy of Mathematics, Miscellaneous
  •  138
    A continuity principle, a version of Baire's theorem and a boundedness principle
    with Hajime Ishihara
    Journal 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
    Logic and Philosophy of LogicIntuitionism and Constructivism
  •  94
    Unique solutions
    Mathematical 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
    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. Moreover, Brouwer's fan theorem for decidable bars turns out to be equivalent to the statement that, for uniformly continuous functions on a compact metric space, the crucial uniform “at most one” condition follows from its non-uniform counterpart. This classification in the spirit of the constructive reverse mathematics, as propagated by Ishihara and others, sharpens an earlier result obtained jointly with Berger and Bridges
    Intuitionism and Constructivism
  •  147
    Classifying Dini's Theorem
    with Josef Berger
    Notre 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
    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 analogue of the fan theorem, weak König's lemma, in the original classical setting of reverse mathematics started by Friedman and Simpson
    Logic and Philosophy of Logic, MiscellaneousIntuitionism and Constructivism
  •  110
    Linear independence without choice
    with Douglas Bridges and Fred Richman
    Annals 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
    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 independence and linear independence are equivalent in such spaces. Proofs are carried out in the context of intuitionistic logic without the axiom of countable choice.
    Logic and Philosophy of Logic, MiscellaneousIntuitionism and Constructivism
  •  141
    Countable choice as a questionable uniformity principle
    Philosophia 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.
    The Axiom of ChoiceIntuitionism and Constructivism
  • Prev.
  • 1
  • 2
  • 3
  • Next
PhilPeople logo

On this site

  • Find a philosopher
  • Find a department
  • The Radar
  • Index of professional philosophers
  • Index of departments
  • Help
  • Acknowledgments
  • Careers
  • Contact us
  • Terms and conditions

Brought to you by

  • The PhilPapers Foundation
  • The American Philosophical Association
  • Centre for Digital Philosophy, Western University
PhilPeople is currently in Beta Sponsored by the PhilPapers Foundation and the American Philosophical Association
Feedback