scientific article; zbMATH DE number 3941499

From MaRDI portal
Publication:3714047





The author, known for her results in mechanical proof methods for \(\omega^+\)-valued and fuzzy logics, presents here a resolution system for m-valued Post logics. The paper begins with an elegant presentation of the axioms of Post algebra of order m, of the syntax and semantics of the Post logic language. A Gentzen-style system is presented: decomposition rules [following \textit{Z. Saloni}, Bull. Acad. Pol. Sci., Sér. Sci. Math. Astron. Phys. 20, 819-826 (1972; Zbl 0255.02013)], which enable the author to assign to every formula a set of sequences of simpler formulas whose validity can be syntactically recognized. A (type of) completeness theorem for the given system is proved. Also, a resolution-style Herbrand theorem for Post logic provides a basis for a resolution theorem proving system of Post logic. The resolution system consists of two inference rules: resolution rule, which enables to eliminate an inconsistent pair of indecomposable formulas, and factoring rule, which enables to eliminate redundant disjuncts from a clause. An analogue of the Skolem-Löwenheim theorem and a corresponding completeness theorem are proved. Hints to the case of \(\omega^+\)-valued Post logic are given.











This page was built for publication:

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