Searching for "Formal Systems of Constructive Mathematics." – sorted by Relevance.
-
Partial Applicative Theories and Explicit Substitutions
- formal systems for constructive mathematics and functional programming. Feferman introduced in [6] and [7
- Cited by 6 (1 self) – Add To MetaCart
-
The Strength of Some Martin-Löf Type Theories
- is the formal system for constructive mathematics due to Feferman. In the literature it has already been shown
- Cited by 22 (4 self) – Add To MetaCart
-
The Strength of Some Martin-Löf Type Theories
- is the formal system for constructive mathematics due to Feferman. In the literature it has already been shown
- Cited by 15 (11 self) – Add To MetaCart
-
Proof-Theoretic Contributions to Explicit Mathematics
- provided an adequate interpretation of intuitionism. The study of formal systems for constructive
- Cited by 2 (2 self) – Add To MetaCart
-
On Founding the Theory of Algorithms
- )P (x; f(x)); and there exists a considerable body of work verifying this for formalized systems
- Cited by 8 (3 self) – Add To MetaCart
-
On Founding the Theory of Algorithms
- 2 A)P (x; f(x)); and there exists a considerable body of work verifying this for formalized systems
- Add To MetaCart
-
Constructive algebraic integration theory
- , and since this construction is not possible in certain formal systems for constructive mathematics we prefer
- Cited by 3 (2 self) – Add To MetaCart
-
Subrecursion as Basis for a Feasible Programming Language
- purposes for instance in [5], or as a meta-language for the study of formal systems for constructive
- Cited by 9 (8 self) – Add To MetaCart

