Polynomial Time Uniform Word Problems (Q4835521): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Stanley N. Burris / rank | |||
| Property / author | |||
| Property / author: Stanley N. Burris / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/malq.19950410204 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2115755485 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Discriminator varieties and symbolic computation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A correction to Lewis and Langford's <i>Symbolic logic</i> / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 13:44, 23 May 2024
scientific article; zbMATH DE number 761101
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial Time Uniform Word Problems |
scientific article; zbMATH DE number 761101 |
Statements
Polynomial Time Uniform Word Problems (English)
0 references
6 June 1995
0 references
universal theory of lattices
0 references
polynomial time decidability
0 references
finite axiomatizability
0 references
uniform word problem
0 references
quasivariety
0 references
universal Horn class
0 references
universal closure
0 references
weak embedding closure
0 references
