Extensions of arithmetic for proving termination of computations (Q4732468): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2307/2274742 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2168420831 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Proving termination with multiset orderings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Termination of rewriting / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4124327 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3881899 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Accessible Independence Results for Peano Arithmetic / rank | |||
Normal rank | |||
Latest revision as of 10:01, 20 June 2024
scientific article; zbMATH DE number 4118366
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extensions of arithmetic for proving termination of computations |
scientific article; zbMATH DE number 4118366 |
Statements
Extensions of arithmetic for proving termination of computations (English)
0 references
1989
0 references
provable ordinals
0 references
Goodstein predecessor
0 references
Goodstein sequence
0 references
\(\Sigma\)- reflection
0 references
provably recursive function
0 references
