scientific article

From MaRDI portal
Publication:3338243

zbMath0547.03040MaRDI QIDQ3338243

Boris A. Kushner

Publication date: 1984


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (59)

Annual Meeting of the Association for Symbolic Logic, Durham, 19921998–1999 Winter Meeting of the Association for Symbolic LogicOn the Lebesgue measurability of continuous functions in constructive analysisTowards Formalizing Non-monotonic Reasoning in Physics: Logical Approach Based on Physical Induction and Its Relation to Kolmogorov ComplexityFuzzy constructive logicEuropean summer meeting of the Association for Symbolic LogicOn the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysisConstructive mathematics and unbounded operators -- a reply to HellmanDecidability problems for meta-\(R\)-functionsA sequentially computable function that is not effectively continuous at any pointIntersection points of planar curves can be computedConstructing local optima on a compact intervalClasse of functions defined by transducersOperations on R-numbersSpectra of selfadjoint operators in constructive analysisAnnual meeting of the Association for Symbolic Logic, Notre Dame, 19931994 Annual Meeting of the Association for Symbolic LogicOne-to-one mappings defined by finite transformersHerbrand strategies and the greater deducibility relationSome properties of the injective tensor product of \(L^{p}\)[0,1 and a Banach space.] ⋮ Proof-theoretical analysis: Weak systems of functions and classesSingular coverings and non‐uniform notions of closed set computabilityCompactness notions for an apartness spaceRecursive quasi-metric spaces.A constructive theory of point-set nearness.Algebras of recursively enumerable sets and their applications to fuzzy logicSets, complements and boundariesExtensions and fixed points of contractive maps in \(\mathbb{R}^ n\)Solving the Dirichlet problem constructivelyNotes on computable analysisSingular Coverings and Non-Uniform Notions of Closed Set ComputabilityOn the comparison of Darboux and Riemann integrals in constructive analysisExtended fuzzy constructive logicA Banach-Mazur computable but not Markov computable function on the computable real numbersThe weak-operator sequential continuity of left multiplicationMetrization Theorem for Space-Times: From Urysohn’s Problem towards Physically Useful Constructive MathematicsAlgorithmic questions for real functionsGlueing continuous functions constructivelyDEMUTH’S PATH TO RANDOMNESSComputability on computable metric spacesPreference, indifference, and Markov's principleConstructing best approximations on a Jordan curveMacrotransducers on labeled trees and partially continuous operatorsCan constructive mathematics be applied in physics?Computable invarianceSemantics of algorithmic languagesPhysically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physicsMarkov's constructive analysis; a participant's viewComputability on the probability measures on the Borel sets of the unit intervalEffectiveness of the global modulus of continuity on metric spacesPoint-free topological spaces, functions and recursive points; filter foundation for recursive analysis. INumerical theorem proving by electronic computers and its application in various branches of mathematicsA weak countable choice principleStrong continuity implies uniform sequential continuityRational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact intervalApartness spaces as a framework for constructive topologyMarkov's principle, Church's thesis and Lindelöf's theoremBishop-Style Constructive Reverse MathematicsA Real Number Structure that is Effectively Categorical






This page was built for publication: