Polynomial Time Uniform Word Problems

DOI10.1002/malq.19950410204zbMath0820.08003OpenAlexW2115755485MaRDI QIDQ4835521

Stanley N. Burris

Publication date: 6 June 1995

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19950410204

zbMATH Keywords

quasivarietyfinite axiomatizabilityuniversal Horn classuniversal closureuniform word problempolynomial time decidabilityuniversal theory of latticesweak embedding closure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Word problems, etc. in computability and recursion theory (03D40) Quasivarieties (08C15) Partial algebras (08A55) Free lattices, projective lattices, word problems (06B25) Word problems (aspects of algebraic structures) (08A50)

Related Items

Automated theorem proving by resolution in non-classical logics, Partial algebras and complexity of satisfiability and universal theory for distributive lattices, Boolean algebras and Heyting algebras, Lattices freely generated by an order and preserving certain bounds, Modular proof systems for partial functions with Evans equality, On Combinations of Local Theory Extensions, In the Shadows of the Löwenheim-Skolem Theorem: Early Combinatorial Analyses of Mathematical Proofs, A solution of the uniform word problem for ortholattices, On Hierarchical Reasoning in Combinations of Theories, COMPUTATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM FOR VARIETIES, GENERALITY AND EXISTENCE: QUANTIFICATIONAL LOGIC IN HISTORICAL PERSPECTIVE, A finitely axiomatizable undecidable equational theory with recursively solvable word problems, On Local Reasoning in Verification

Cites Work

• Discriminator varieties and symbolic computation
• A correction to Lewis and Langford's Symbolic logic