zbMath0656.03042MaRDI QIDQ3803111
Errett Bishop, Douglas S. Bridges
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extending strongly continuous functions between apartness spaces ⋮
A constructive real projective plane ⋮
Interpretation of constructive multi-typed theory in the theory of arithmetical truth ⋮
Constructing the real numbers in HOL ⋮
Limit spaces with approximations ⋮
A constructive manifestation of the Kleene-Kreisel continuous functionals ⋮
Apartness spaces and uniform neighbourhood structures ⋮
Insight in discrete geometry and computational content of a discrete model of the continuum ⋮
A separating hyperplane theorem, the fundamental theorem of asset pricing, and Markov's principle ⋮
Basic notions of (constructive) semigroups with apartness ⋮
PCF extended with real numbers ⋮
A sheaf-theoretic foundation for nonstandard analysis ⋮
Constructive irrational space ⋮
Convexity and constructive infima ⋮
The constructive theory of preference relations on a locally compact space. II ⋮
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 ⋮
Heyting valued considerations on some fundamental existence theorems in modern analysis ⋮
Constructing local optima on a compact interval ⋮
Nonstandard analysis and constructivism? ⋮
A constructive and functorial embedding of locally compact metric spaces into locales ⋮
Exact approximations to Stone-Čech compactification ⋮
Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine ⋮
Revisiting Zariski main theorem from a constructive point of view ⋮
Brouwer's fan theorem as an axiom and as a contrast to Kleene's alternative ⋮
Locating the range of an operator with an adjoint ⋮
Constructive proof of the existence of Nash equilibrium in a finite strategic game with sequentially locally nonconstant payoff functions ⋮
A proof of constructive version of Brouwer's fixed point theorem with uniform sequential continuity ⋮
Equivalence between the existence of an approximate equilibrium in a competitive economy and Sperner's lemma: a constructive analysis ⋮
A predicative completion of a uniform space ⋮
Aligning the weak König lemma, the uniform continuity theorem, and Brouwer's fan theorem ⋮
Almost new pre-apartness from old ⋮
The intermediate value theorem in constructive mathematics without choice ⋮
The uniform boundedness theorem and a boundedness principle ⋮
The computational content of Walras' existence theorem ⋮
Beta-shifts, their languages, and computability ⋮
Approximate interpolation by functions in a Haar space ⋮
Locatedness and overt sublocales ⋮
Computability of finite-dimensional linear subspaces and best approximation ⋮
Constructing the minimal period of homomorphisms into \(\mathbb R^n\) ⋮
Compactness notions for an apartness space ⋮
Metric spaces in synthetic topology ⋮
Reflections on function spaces ⋮
Two subcategories of apartness spaces ⋮
Lebesgue's dominated convergence theorem in Bishop's style ⋮
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. ⋮
Borel complexity and computability of the Hahn-Banach theorem ⋮
The anti-Specker property, a Heine-Borel property, and uniform continuity ⋮
Ishihara's proof technique in constructive analysis ⋮
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 ⋮
Proof-relevance of families of setoids and identity in type theory ⋮
Pluralism and proofs ⋮
On the computational complexity of the Riemann mapping ⋮
Sets, complements and boundaries ⋮
Extensions and fixed points of contractive maps in \(\mathbb{R}^ n\) ⋮
Finitary formal topologies and Stone's representation theorem ⋮
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 ⋮
Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation ⋮
Effective versions of local connectivity properties ⋮
An effective Carathéodory theorem ⋮
Computing conformal maps of finitely connected domains onto canonical slit domains ⋮
Kronecker's density theorem and irrational numbers in constructive reverse mathematics ⋮
Continuum, name and paradox ⋮
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 ⋮
Preference, indifference, and Markov's principle ⋮
Linear mappings are fairly well-behaved ⋮
A computable approach to measure and integration theory ⋮
Constructing best approximations on a Jordan curve ⋮
A constructive theory of continuous domains suitable for implementation ⋮
A domain-theoretic approach to computability on the real line ⋮
The connected Vietoris powerlocale ⋮
Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics ⋮
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 ⋮
Continuity and Lipschitz constants for projections ⋮
Problems, solutions, and completions ⋮
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 ⋮
Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval ⋮
A real Nullstellensatz and Positivstellensatz for the semipolynomials over an ordered field ⋮
A recursive counterexample to Debreu's theorem on the existence of a utility function
This page was built for publication: