The computational complexity of logical theories (Q1256445)
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: The computational complexity of logical theories |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The computational complexity of logical theories |
scientific article |
Statements
The computational complexity of logical theories (English)
0 references
1979
0 references
Computational Complexity of Logical Theories
0 references
Integers
0 references
Real Numbers
0 references
Decidable Theories
0 references
Decision Procedure
0 references
Ehrenfeucht Games
0 references
Efficient Arithmetization of Turing Machines
0 references
First Order Theory
0 references
Upper Bound
0 references
Lower Bound
0 references
Unary Function
0 references
Monadic Predicate
0 references
One Successor
0 references
Two Successors
0 references
Equal Length Predicate
0 references
Well-Order
0 references
Lexicographical Order
0 references
Finite Abelian Groups
0 references
Pairing Functions
0 references
