2 papers
cs.LO2021
E-Cyclist: Implementation of an Efficient Validation of FOLID Cyclic Induction Reasoning
Sorin Stratulat
Checking the soundness of cyclic induction reasoning for first-order logic with inductive definitions (FOLID) is decidable but the standard checking method is based on an exponenti…
cs.LO2018
Validating Back-links of FOLID Cyclic Pre-proofs
Sorin Stratulat
Cyclic pre-proofs can be represented as sets of finite tree derivations with back-links. In the frame of the first-order logic with inductive definitions, the nodes of the tree der…