On a finitary version of mathematical analysis (Q5957917): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5573965 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5338270 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4333835 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Binary recursive arithmetic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5834503 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4113814 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some questions in constructive functional analysis / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Function Theory in an Axiom-Free Equation Calculus / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A constructivist theory of plane curves / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recursive number theory. A development of recursive arithmetic in a logic-free equation calculus / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recursive analysis / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4757531 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3228884 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5626620 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3262212 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3849889 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the logic of constructive mathematics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3244673 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5725919 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Formal Reductions of the General Combinatorial Decision Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3325707 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: [Russian Text Ignored] / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: [Russian Text Ignored.] / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3849890 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5556429 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4071217 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4111540 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3866093 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Georg Cantor as the author of constructions playing fundamental roles in constructive mathematics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3849891 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3849892 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Half-Century of Mathematics / rank | |||
Normal rank |
Revision as of 23:45, 3 June 2024
scientific article; zbMATH DE number 1719232
Language | Label | Description | Also known as |
---|---|---|---|
English | On a finitary version of mathematical analysis |
scientific article; zbMATH DE number 1719232 |
Statements
On a finitary version of mathematical analysis (English)
0 references
20 November 2002
0 references
This paper is an extended exposition of the talk ``A finitary version of mathematical analysis as a result of the development of theory of functional spaces in classical mathematics'' presented by the author at the conference ``First St. Petersburg Days of Logic and Computability'' in 1999. An approach of constructing a finitary version of some fields of mathematical analysis is sketched in this paper. The choice of basic concepts for building the finitary version of analysis is motivated primarily by specific theorems in analysis that have the form: the metric space \((M, \rho)\) under consideration has a countable dense set \(D\) such that (1) elements in \(D\) have individual representations as constructively defined objects of a certain specific type, called objects of type \(\tau\); (2) objects of type \(\tau\) (= elements of \(D\)) form a decidable set; (3) the metric function \(\rho \) on \(D\) viewed as the set of objects of type \(\tau\) is given as a certain algorithm; and (4) if \(x\) and \(y\) are objects of type \(\tau\) then \(\rho (x, y)\) is a rational number or, in the alternatice version, an algebraic number. Thus every element in such metric space can be approximated by constructively defined objects in \(D\). In other words, elements in \((M, \rho)\) are ``almost constructively defined objects of type \(\tau\)''. Consequently, many operators in analysis are approximable in a ``sufficiently interesting'' sense by ``finitarily describable'' operators of the same type. Thus one obtains a finitary version of such operators and theorems.
0 references
finitary mathematics
0 references
constructive mathematics
0 references
recursive analysis
0 references
0 references
0 references