Join algorithms for the theory of uninterpreted functions
From MaRDI portal
Mechanization of proofs and logical operations (03B35) Logic in computer science (03B70) Equational classes, universal algebra in model theory (03C05) Automata and formal grammars in connection with logical questions (03D05) Subalgebras, congruence relations (08A30) Applications of universal algebra in computer science (08A70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Recommendations
- On algorithmic problems for joins of pseudovarieties
- A generalization of join and an algorithmic recognition problem
- Some results in the join-calculus
- An algorithm for distributive unification
- Towards a unified complexity theory of total functions
- Towards a Unified Complexity Theory of Total Functions
- Algorithmic properties of models with signatures containing two unary functional symbols
- scientific article; zbMATH DE number 3866609
- scientific article; zbMATH DE number 4112560
- On algebras of algorithms and specifications over uninterpreted data
Cited in
(5)
This page was built for publication: Join algorithms for the theory of uninterpreted functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5465863)