On the complexity of theories of permutations (Q1088647)
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: On the complexity of theories of permutations |
scientific article; zbMATH DE number 3991472
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of theories of permutations |
scientific article; zbMATH DE number 3991472 |
Statements
On the complexity of theories of permutations (English)
0 references
1985
0 references
The first-order theory T of two permutations which commute is investigated and its decidability is proved. Moreover, we show that the computational complexity of the decision algorithm for SAT(T) - on NTM's and ATM's - is the same (for upper and lower bounds) as that of the theory of one permutation.
0 references
two commuting permutations
0 references
first-order theory
0 references
computational complexity
0 references
decision algorithm
0 references
