No label defined (Q3687706)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3911699
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3911699 |
Statements
1984
0 references
programming logic
0 references
higher order predicate calculus
0 references
propositions-as-types principle
0 references
primitive recursive functions
0 references
Simple Arithmetic
0 references
0.94052655
0 references
0 references
[For the entire collection see Zbl 0533.00026.] This paper is meant to be an invitation for and a 'feasibility proof' of 'doing' mathematics with 'programming tools'. The author asserts that ''in a sufficiently rich programming language it is possible to express a very substantial amount of mathematics in a natural way'' and that ''expressing mathematics in this way reveals its computational content and makes it available for use with digital computers''. The first three sections in the paper establish the general framework of the discussion and the basic concepts: a programming logic, with a rich type structure, is employed as context to define a higher order predicate calculus using the 'propositions-as-types principle' as fundamental organizing principle (similarly to AUTOMATH and Martin-Löf's type theory). The fourth section is devoted to the definition of the primitive recursive functions, of the partial functions and of \(\mu\)-recursive functions. The last section shows that the study of a 'Simple Arithmetic' theory may be carried out in the used framework, starting from a definition of the Arithmetic as a type.
0 references