Pages that link to "Item:Q4835521"
From MaRDI portal
The following pages link to Polynomial Time Uniform Word Problems (Q4835521):
Displaying 12 items.
- Partial algebras and complexity of satisfiability and universal theory for distributive lattices, Boolean algebras and Heyting algebras (Q391322) (← links)
- Lattices freely generated by an order and preserving certain bounds (Q412015) (← links)
- Automated theorem proving by resolution in non-classical logics (Q2385426) (← links)
- Modular proof systems for partial functions with Evans equality (Q2432764) (← links)
- GENERALITY AND EXISTENCE: QUANTIFICATIONAL LOGIC IN HISTORICAL PERSPECTIVE (Q2795206) (← links)
- COMPUTATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM FOR VARIETIES (Q3043639) (← links)
- A solution of the uniform word problem for ortholattices (Q3583025) (← links)
- On Combinations of Local Theory Extensions (Q4916087) (← links)
- A finitely axiomatizable undecidable equational theory with recursively solvable word problems (Q4955722) (← links)
- In the Shadows of the Löwenheim-Skolem Theorem: Early Combinatorial Analyses of Mathematical Proofs (Q5421030) (← links)
- On Local Reasoning in Verification (Q5458332) (← links)
- On Hierarchical Reasoning in Combinations of Theories (Q5747749) (← links)
