The completeness of functional logic (Q1318282)
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 540133
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The completeness of functional logic |
scientific article; zbMATH DE number 540133 |
Statements
The completeness of functional logic (English)
0 references
1 December 1994
0 references
The completeness of functional logic, a first-order logic proposed by Staples, Robinson and Hazel [see the review above] unifying reasoning about procedural programs and classical logic, but essentially a logic to reason about properties of mathematical functions, is established along with auxiliary results such as a deduction theorem for this logic. Completeness is obtained by the construction of a certain model for a consistent (complete) functional theory, which comprises the bulk of this technical paper.
0 references
completeness
0 references
intensional logic
0 references
functional logic
0 references
deduction theorem
0 references
0.8281264305114746
0 references
0.7808797359466553
0 references
0.7706506252288818
0 references
0.7665795087814331
0 references
0.761955976486206
0 references
