Publication:3803111
From MaRDI portal
zbMath0656.03042MaRDI QIDQ3803111
Douglas S. Bridges, Errett Bishop
Publication date: 1985
03F60: Constructive and recursive analysis
03-02: Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations
03F65: Other constructive mathematics
28C10: Set functions and measures on topological groups or semigroups, Haar measures, invariant measures
46S30: Constructive functional analysis
28-02: Research exposition (monographs, survey articles) pertaining to measure and integration
28C05: Integration theory via linear functionals (Radon measures, Daniell integrals, etc.), representing set functions and measures
Related Items
Sets, complements and boundaries, Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation, Continuum, name and paradox, Preference, indifference, and Markov's principle, Linear mappings are fairly well-behaved, A recursive counterexample to Debreu's theorem on the existence of a utility function, Extending strongly continuous functions between apartness spaces, Insight in discrete geometry and computational content of a discrete model of the continuum, Ideals in constructive Banach algebra theory, Generalized functions with pseudobounded support in constructive mathematics, Towards computability of elliptic boundary value problems in variational formulation, Pre-apartness structures on spaces of functions, Partial Horn logic and Cartesian categories, Constructing local optima on a compact interval, A constructive and functorial embedding of locally compact metric spaces into locales, Exact approximations to Stone-Čech compactification, Approximate interpolation by functions in a Haar space, Borel complexity and computability of the Hahn-Banach theorem, The anti-Specker property, a Heine-Borel property, and uniform continuity, On the computational complexity of the Riemann mapping, Finitary formal topologies and Stone's representation theorem, Kronecker's density theorem and irrational numbers in constructive reverse mathematics, Glueing continuous functions constructively, On computational complexity of Siegel Julia sets, Sequences of real functions on [0,1 in constructive reverse mathematics], A computable version of Banach's inverse mapping theorem, A computable approach to measure and integration theory, A constructive theory of continuous domains suitable for implementation, The connected Vietoris powerlocale, Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics, Continuity and Lipschitz constants for projections, Problems, solutions, and completions, Constructive irrational space, Heyting valued considerations on some fundamental existence theorems in modern analysis, Nonstandard analysis and constructivism?, Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine, Constructive compact operators on a Hilbert space, The constructive inequivalence of various notions of preference ordering, A globalization of the Hahn-Banach theorem, Fuzzy variables as a basis for a theory of fuzzy reliability in the possibility context, Extensions and fixed points of contractive maps in \(\mathbb{R}^ n\), A transfer theorem in constructive \(p\)-adic algebra, Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games, The construction of a continuous demand function for uniformly rotund preferences, Transcendental operators on a Banach space, Constructing best approximations on a Jordan curve, A domain-theoretic approach to computability on the real line, Computability on subsets of Euclidean space. I: Closed and compact subsets, Constructive mathematics: a foundation for computable analysis, An effective Riemann Mapping Theorem, Markov's constructive analysis; a participant's view, Computability on the probability measures on the Borel sets of the unit interval, Well-ordering proofs for Martin-Löf type theory, Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I, A common axiom set for classical and intuitionistic plane geometry, A real Nullstellensatz and Positivstellensatz for the semipolynomials over an ordered field, Constructing the real numbers in HOL, PCF extended with real numbers, A sheaf-theoretic foundation for nonstandard analysis, The constructive theory of preference relations on a locally compact space. II, Locating the range of an operator with an adjoint, Computability on subsets of metric spaces., Constructive metrisability in point-free topology., Unique existence, approximate solutions, and countable choice., A constructive theory of point-set nearness., Ishihara's proof technique in constructive analysis, Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval, A new graph characteristic and its application to numerical computability, A constructive algorithm for finding the exact roots of polynomials with computable real coefficients., Kernels of seminorms in constructive analysis., Effective simultaneous approximability of reals., The constructive reals as a Java library, Computability on computable metric spaces, Can constructive mathematics be applied in physics?, Heyting valued set theory and Sato hyperfunctions, Constructing extensions of ultraweakly continuous linear functionals, Integration in Real PCF, Apartness spaces as a framework for constructive topology, Spreads and choice in constructive mathematics., Computational complexity of optimization and crude range testing: A new approach motivated by fuzzy optimization, A constructive approach to nonstandard analysis, Spectra of selfadjoint operators in constructive analysis, Effective content of the calculus of variations. I: Semi-continuity and the chattering lemma, Type 2 computational complexity of functions on Cantor's space, Fundamental notions of analysis in subsystems of second-order arithmetic, Semantics of a sequential language for exact real-number computation, Constructive notions of equicontinuity, Near convexity, metric convexity, and convexity, Two simple sets that are not positively Borel, Constructive completions of ordered sets, groups and fields, Quotient topologies in constructive set theory and type theory, A computable version of the Daniell-Stone theorem on integration and linear functionals, Constructive utility functions on Banach spaces, Continuity and computability of reachable sets, Strong continuity implies uniform sequential continuity, On the collection of points of a formal space, Dynamical algebraic structures, pointfree topological spaces and Hilbert's program. (Structures algébriques dynamiques, espaces topologiques sans points et programme de Hilbert), Regular universes and formal spaces, Constructive algebraic integration theory, Adjoints and the image of the ball, A constructive Schwarz reflection principle, Unnamed Item, Constructivity, Computability and Computers in Economic Theory: Some Cautionary Notes, Computing infima on convex sets, with applications in Hilbert spaces, Continuous isomorphisms from R onto a complete abelian group, Pluralism in mathematics, Approximate counting in bounded arithmetic, The pseudocompactness of [0.1 is equivalent to the uniform continuity theorem], Resolution of the uniform lower bound problem in constructive analysis, A First Look into a Formal and Constructive Approach for Discrete Geometry Using Nonstandard Analysis, Non-computable Julia sets, A constructive view on ergodic theorems, The fan theorem and unique existence of maxima, On constructing completions, Converses of Bishop's lemma on located sets, The weak-operator sequential continuity of left multiplication, Constructive nonstandard representations of generalized functions, A constructive converse of the mean value theorem, Real numbers in the topos of sheaves over the category of filters, Constructive closed range and open mapping theorems, Hidden constructions in abstract algebra. I: Integral dependance., Conformal mapping in linear time, Locating subsets of a Hilbert space, On the (semi)lattices induced by continuous reducibilities, The swap of integral and limit in constructive mathematics, A proof–technique in uniform space theory, Light monotone Dialectica methods for proof mining, Local stability of ergodic averages, Unique solutions, 2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05, Factoring Out Intuitionistic Theorems: Continuity Principles and the Uniform Continuity Theorem, Continuity properties of preference relations, Real Number Calculations and Theorem Proving, Certified Exact Transcendental Real Number Computation in Coq, Continuous homomorphisms of R onto a compact group, Computability of Continuous Solutions of Higher-Type Equations, Metrization Theorem for Space-Times: From Urysohn’s Problem towards Physically Useful Constructive Mathematics, Constructive Reflexivity of a Uniformly Convex Banach Space, Almost locatedness in uniform spaces, Computability, noncomputability and undecidability of maximal intervals of IVPs, Building Mathematics-Based Software Systems to Advance Science and Create Knowledge, Metrization of the One-Point Compactification, The Wiener lemma and certain of its generalizations, On the Lebesgue measurability of continuous functions in constructive analysis, Introducing data types in intuitionistic type theory, Constructive Existence of Minkowski Functionals
