Polynomial Time Uniform Word Problems

DOI10.1002/MALQ.19950410204MaRDI QIDQ4835521zbMATH OpenOpenAlexFDO

Authors 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

finite axiomatizabilitypolynomial time decidabilityquasivarietyuniform word problemuniversal closureuniversal Horn classuniversal theory of latticesweak embedding closure

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4123793
• A Variety with Solvable, but not Uniformly Solvable, Word Problem
• scientific article; zbMATH DE number 871420
• On the word problem in the free quasigroups in the varieties of quasigroups isotopic to groups
• The word and generator problems for lattices

Cites work

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

Cited in

(14)

• The word and generator problems for lattices
• Automated theorem proving by resolution in non-classical logics
• Modular proof systems for partial functions with Evans equality
• Generality and existence: quantificational logic in historical perspective
• COMPUTATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM FOR VARIETIES
• A solution of the uniform word problem for ortholattices
• 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
• On combinations of local theory extensions
• A finitely axiomatizable undecidable equational theory with recursively solvable word problems
• In the Shadows of the Löwenheim-Skolem Theorem: Early Combinatorial Analyses of Mathematical Proofs
• On Local Reasoning in Verification
• On Hierarchical Reasoning in Combinations of Theories
• On the uniform word problem for lattices

This page was built for publication: Polynomial Time Uniform Word Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4835521)