Applies the CERES_omega method to a proof.
Applies the CERES_omega method to a proof.
This is the set of projections to use. A projection to reflexvity is generated if needed.
The R_al proof to use as skeleton.
The end-sequent of the original proof.
The struct of the original proof. (unused at the moment)
a pair of an LKProof with atomic cuts only and of the subsequent of its root which corresponds the Ral sequent
After an application of a binary rule, end-sequent material might be duplicated.
After an application of a binary rule, end-sequent material might be duplicated. This method adds contractions for every end-sequent formula.
a proof with an end-sequent of the form: es x es x C (where C is some additional content)
the end-sequent material which occurs twice
a proof with an end-sequent of the form: es x C
Finds the first element in candidates - exclucsion_list fulfilling the predicate pred.
Finds the first element in candidates - exclucsion_list fulfilling the predicate pred. Throws an IllegalArgumentException, if none is found.
the list of candidates to choose from
a predicate on formula occurrences
no candidate in exclusion_list will match
the first element of candidates which fulfills the criteria
IllegalArgumentException
if no candidate fulfills pred.
Finds an occurrence in candidates - exclusion_list, which has the same formula and label as aux.
Finds an occurrence in candidates - exclusion_list, which has the same formula and label as aux.
the first occurrence in candidates which matches
Finds an occurrence in candidates - exclusion_list, which has the same formula and label as aux.
Finds an occurrence in candidates - exclusion_list, which has the same formula and label as aux.
the first occurrence in candidates which matches
Computes the list of earliest ancestors of the formula occurrence.
Computes the list of earliest ancestors of the formula occurrence. I.e. we calculate the least elements of all ancestors of the occurrence with regard to the ancestorship relation.
a formula occurrence
the list of first ancestors
Computes the list of earliest ancestors of the formula occurrence.
Computes the list of earliest ancestors of the formula occurrence. I.e. we calculate the least elements of all ancestors of the occurrence with regard to the ancestorship relation.
a formula occurrence
the list of first ancestors
Computes the reflexive, transitive closure of the ancestor relation, ie.
Computes the reflexive, transitive closure of the ancestor relation, ie. all ancestors.
a formula occurrence
the list of all ancestors
Computes the reflexive, transitive closure of the ancestor relation, ie.
Computes the reflexive, transitive closure of the ancestor relation, ie. all ancestors.
a formula occurrence
the list of all ancestors
Created by marty on 10/6/14.