Parameterized provability in equational logic

DOI10.1007/978-3-319-66902-1_22MaRDI QIDQ1694478zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 1114022
• Equational problems and disunification
• Parameterized proof complexity
• scientific article; zbMATH DE number 762061
• On the complexity of equational problems in CNF

Cited in

(4)

• Symbol elimination and applications to parametric entailment problems
• The power of parameterization in coinductive proof
• Proof-Relevant Parametricity
• Proofs in parameterized specifications

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

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