Quantifier-free logic for multialgebraic theories

Abstract We develop a new quantifier-free logic for deriving consequences of multialgebraic theories. Multilagebras are used as models for nondeterminism in the context of algebraic specifications. They are many sorted algebras with set valued operations. Formulae are sequents over atoms allowing one to state set-inclusion or identity of 1-element sets (determinacy). We introduce a sound and complete Rasiowa-Sikorski logic for proving multilagebraic tautologies. We then extend this system for proving consequences of specifications based on translation of finite theories into logical formulae. Finally, we show how such a translation may be avoided – introduction of the specific cut rules leads to a sound and complete Gentzen system for proving directly consequences of specifications. The improvements over earlier logics for multialgebras concern mainly the ability to handle empty carriers (as well as empty result-sets) without the use of quantifiers, and to derive consequences of (potentially infinite) theories without the use of general cut.

[1]  Yngve Lamo,et al.  Modeling partiality by nondeterminism-from abstract specifications to flexible error handling , 1999 .

[2]  Michal Walicki,et al.  Multialgebras, Power Algebras and Complete Calculi of Identities and Inclusions , 1994, COMPASS/ADT.

[3]  Michal Walicki,et al.  Algebraic approaches to nondeterminism—an overview , 1997, CSUR.

[4]  K. Mani Chandy,et al.  Current trends in programming methodology , 1977 .

[5]  Michal Walicki,et al.  A complete calculus for the multialgebraic and functional semantics of nondeterminism , 1995, TOPL.

[6]  Heinrich Hussmann,et al.  Nondeterminism in Algebraic Specifications and Algebraic Programs , 1993 .

[7]  Beata Konikowska,et al.  Rasiowa-Sikorski Deduction Systems: A Handy Tool for Computer Science Logics , 1998, WADT.

[8]  R. Sikorski,et al.  The mathematics of metamathematics , 1963 .

[9]  Beata Konikowska,et al.  Rasiowa-Sikorski deduction systems in computer science applications , 2002, Theor. Comput. Sci..

[10]  Yngve Lamo,et al.  Modeling Partiality by Nondeterminism , 2001, ISAS-SCI.

[11]  A. Yu. Plyushkevichene Specialization of the use of axioms for deduction search in axiomatic theories with equality , 1972 .

[12]  John V. Guttag,et al.  The specification and application to programming of abstract data types. , 1975 .

[13]  Beata Konikowska,et al.  Reasoning with first order nondeterministic specifications , 1999, Acta Informatica.

[14]  Joseph A. Goguen,et al.  Institutions: abstract model theory for specification and programming , 1992, JACM.

[15]  Yngve Lamo The institution of multialgebras. A general framework for algebraic software development , 2002 .