Termination assertions for recursive programs: Completeness and axiomatic definability (Q3323258)
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 3854407
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Termination assertions for recursive programs: Completeness and axiomatic definability |
scientific article; zbMATH DE number 3854407 |
Statements
Termination assertions for recursive programs: Completeness and axiomatic definability (English)
0 references
1983
0 references
soundness
0 references
completeness
0 references
termination
0 references
recursive procedures
0 references
axiom system
0 references
global procedure calls
0 references
recursive program
0 references
0.7735503911972046
0 references
0.7593615651130676
0 references
0.7565325498580933
0 references
0.7524967193603516
0 references
