Markov's Constructive Analysis: A Participant's View

No abstract is available for this paper.

• Publication year

  1999

• Venue

  Theoretical Computer Science

• Publication date

  1999-05-28

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/S0304-3975(98)00291-6
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Leçons sur la théorie des fonctions

  2009cited by this paper
• Computable Analysis

  2005cited by this paper
• Platonism, Constructivism, and Computer Proofs vs. Proofs by Hand

  2001cited by this paper
• Gödel's Dialectica Interpretation and Its Two-Way Stretch

  1993cited by this paper
• The constructive mathematics of A. A. Markov: some reflections

  1993cited by this paper
• Second Thoughts about Church's Thesis and Mathematical Proofs

  1990cited by this paper
• On the Early History of Intuitionistic Logic

  1990cited by this paper
• The Theory of Algorithms

  1988cited by this paper
• Mathematical Intuitionism. Introduction to Proof Theory

  1988cited by this paper
• Constructivism in Mathematics: An Introduction

  1988cited by this paper
• Mathematical logic

  1985cited by this paper
• Lectures on Constructive Mathematical Analysis

  1984cited by this paper
• Some Extensions of Markov's Constructive Continuum and Their Applications to the Theory of Constructive Functions

  1982cited by this paper
• Why Gödel Didn't Have Church's Thesis

  1982cited by this paper
• A class of theorems with valid constructive counterparts

  1981cited by this paper
• Choice sequences : a chapter of intuitionistic mathematics

  1977cited by this paper
• Mathematics as a Numerical Language

  1970cited by this paper
• Theory of Recursive Functions and Effective Computability

  1969cited by this paper
• After Thirty Years

  1966cited by this paper
• The foundations of intuitionistic mathematics : especially in relation to recursive functions

  1965cited by this paper
• Logic, Methodology and Philosophy of Science Proceedings of the 1960 International Congress

  1962cited by this paper
• ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES

  1958cited by this paper
• Intuitionism: An introduction

  1956cited by this paper
• Nicht konstruktiv beweisbare Sätze der Analysis

  1949cited by this paper
• On Computable Numbers, with an Application to the Entscheidungsproblem.

  1937cited by this paper
• Besitzt jede reelle Zahl eine Dezimalbruchentwicklung?

  1921cited by this paper

• Computable operators on left-c.e. reals and their continuity properties

  2025cites this paper
• Deciding Robust Instances of an Escape Problem for Dynamical Systems in Euclidean Space

  2025cites this paper
• On the consistent reasoning paradox of intelligence and optimal trust in AI: The power of 'I don't know'

  2024cites this paper
• Computability of Subsets of Metric Spaces

  2021cites this paper
• Intersection points of planar curves can be computed

  2020influential citation
• Computer-Assisted Proofs for Lyapunov Stability via Sums of Squares Certificates and Constructive Analysis

  2020cites this paper
• On the close interaction between algorithmic randomness and constructive/computable measure theory

  2018cites this paper
• Computable planar curves intersect in a computable point

  2018cites this paper
• Computable planar paths intersect in a computable point

  2017cites this paper
• DEMUTH’S PATH TO RANDOMNESS

  2014cites this paper
• Infinity in computable probability

  2011cites this paper
• Computable analysis with applications to dynamic systems

  2010cites this paper
• A sequentially computable function that is not effectively continuous at any point

  2006cites this paper
• A Banach-Mazur computable but not Markov computable function on the computable real numbers

  2002cites this paper
• Computability on Regular Subsets of Euclidean Space

  2002cites this paper
• Macrotransducers and Applicative Systems for Partially Continuous Functions

  2001cites this paper
• Computable paths intersect in a computable point

  year unknowncites this paper