Parameterized provability in equational logic

DOI10.1007/978-3-319-66902-1_22zbMath1496.68158OpenAlexW2752784239MaRDI QIDQ1694478

Mateus de Oliveira Oliveira

Publication date: 2 February 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-66902-1_22

Mathematics Subject Classification ID

Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25) Complexity of proofs (03F20) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: Parameterized provability in equational logic