Inductive Decidability Using Implicit Induction

DOI10.1007/11916277_4MaRDI QIDQ5387883zbMATH OpenOpenAlexFDO

Authors Stephan Falke, Deepak Kapur

Publication date 27 May 2008

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11916277_4

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1614706
• scientific article; zbMATH DE number 1639660
• scientific article; zbMATH DE number 1765694
• Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
• scientific article; zbMATH DE number 2177631

Cited in

(10)

• On proving termination of constrained term rewrite systems by eliminating edges from dependency graphs
• scientific article; zbMATH DE number 2177631 (Why is no real title available?)
• Building Decision Procedures in the Calculus of Inductive Constructions
• Rewriting Induction + Linear Arithmetic = Decision Procedure
• scientific article; zbMATH DE number 1614706 (Why is no real title available?)
• scientific article; zbMATH DE number 1765694 (Why is no real title available?)
• Deciding inductive validity of equations.
• An abstract decision procedure for a theory of inductive data types.
• Deciding the Inductive Validity of ∀ ∃ * Queries
• scientific article; zbMATH DE number 1670776 (Why is no real title available?)

Describes a project that uses

Uses Software

• BLAST

This page was built for publication: Inductive Decidability Using Implicit Induction

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