Free-variable tableaux for monotonic preorders
In this paper, free-variable tableaux for dealing with preorders are defined (as special case we have monotonic preorders). Preorders are useful, for instance, in the area of process algebra formalisms. For the nonmonotonic case, the authors define a unification calculus, called \({\mathcal P}\), which is sound, complete and terminating. Next, rewrite strategies are introduced to build a calculus, called \({\mathcal P}_1\), to reduce the \({\mathcal P}\)-search space. When monotonicity is considered, a sound and existentially complete calculus, \({\mathcal M}{\mathcal P}\), is defined in order to solve problems of monotonic preorders. This calculus is not terminating; however, it avoids the use of the function reflexivity axioms.
- Monotonic preorders for free variable tableaux
- Free variable tableaux for a many sorted logic with preorders
- Toward a theory of monomial preorders
- Incremental closure of free variable tableaux
- Ordered tableaux: extensions and applications
- Representing preorders with injective monotones
- Full first-order free variable sequents and tableaux in implicit induction
- Free variable tableaux for propositional modal logics
- Rosser orderings and free variables
- Free-variable tableaux for propositional modal logics
This page was built for publication: Free-variable tableaux for monotonic preorders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147362)