Natural limitations of decision procedures for arithmetic with bounded quantifiers (Q3674633)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Natural limitations of decision procedures for arithmetic with bounded quantifiers |
scientific article; zbMATH DE number 3827842
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Natural limitations of decision procedures for arithmetic with bounded quantifiers |
scientific article; zbMATH DE number 3827842 |
Statements
Natural limitations of decision procedures for arithmetic with bounded quantifiers (English)
0 references
1983
0 references
practical decidability
0 references
unfeasible computation
0 references
complexity of decision procedures
0 references
bounded arithmetic
0 references
concrete lower bounds for the complexity of theories
0 references
Turing machine
0 references
