scientific article; zbMATH DE number 1765694

zbMATH Open0988.03017MaRDI QIDQ4539635FDOQ4539635

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

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

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

Cited In (8)

• A Tableaux-Based Decision Procedure for Multi-parameter Propositional Schemata
• Title not available (Why is that?)
• Title not available (Why is that?)
• A decidable subclass of the minimal Gödel class with identity
• Deciding inductive validity of equations.
• Decidability in elementary analysis. I
• Inductive Decidability Using Implicit Induction
• Variant-Based Satisfiability in Initial Algebras

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)