scientific article; zbMATH DE number 1765694

MaRDI QIDQ4539635zbMATH OpenFDO

Authors Jürgen Giesl, Deepak Kapur

Publication date 10 July 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2083/20830469

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35)

Recommendations

• Deciding inductive validity of equations.
• Inductive Decidability Using Implicit Induction
• scientific article; zbMATH DE number 1614706
• Automata-driven automated induction
• Rewriting Induction + Linear Arithmetic = Decision Procedure

Cited in

(9)

• Decidability in elementary analysis. I
• scientific article; zbMATH DE number 1614706 (Why is no real title available?)
• A decidable subclass of the minimal Gödel class with identity
• Variant-Based Satisfiability in Initial Algebras
• scientific article; zbMATH DE number 887303 (Why is no real title available?)
• Inductive Decidability Using Implicit Induction
• A tableaux-based decision procedure for multi-parameter propositional schemata
• Deciding inductive validity of equations.
• Some techniques for reasoning automatically on co-inductive data structures

This page was built for publication:

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