Abstract canonical inference

From MaRDI portal
Publication:5277771



Abstract: An abstract framework of canonical inference is used to explore how different proof orderings induce different variants of saturation and completeness. Notions like completion, paramodulation, saturation, redundancy elimination, and rewrite-system reduction are connected to proof orderings. Fairness of deductive mechanisms is defined in terms of proof orderings, distinguishing between (ordinary) "fairness," which yields completeness, and "uniform fairness," which yields saturation.












This page was built for publication: Abstract canonical inference

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