Which Data Types have omega-complete Initial Algebra Specifications?

Abstract An algebraic specification is called ω-complete or inductively complete if all (open as well as closed) equations valid in its initial model are equationally derivable from it, i.e., if the equational theory of the initial model is identical to the equational theory of the specification. As the latter is recursively enumerable, the initial model of an ω-complete algebraic specification is a data type with a recursively enumerable equational theory. We show that if hidden sorts and functions are allowed in the specification, the converse is also true: every data type with a recursively enumerable equational theory has an ω-complete initial algebra specification with hidden sorts and functions. We also show that in the case of finite data types the hidden sorts can be dispensed with.

[1]  Emil L. Post.  Introduction to a General Theory of Elementary Propositions , 1921 .

[2]  TAPSOFT '87 , 1987, Lecture Notes in Computer Science.

[3]  J Heering,et al.  Partial Evaluation and omega-Completeness of Algebraic Specifications , 1986, Theor. Comput. Sci..

[4]  D. Richardson.  Solution of the identity problem for integral exponential functions , 1969 .

[5]  Andrei P. Ershov,et al.  Mixed Computation: Potential Applications and Problems for Study , 1982, Theor. Comput. Sci..

[6]  G. Marongiu,et al.  On a Conjecture of Bergstra and Tucker , 1989, Theor. Comput. Sci..

[7]  Faron Moller,et al.  Axioms for concurrency , 1989 .

[8]  William Craig,et al.  Finite Axiomatizability using additional predicates , 1958, Journal of Symbolic Logic.

[9]  Jan Friso Groote.  A New Strategy for Proving omega-Completeness applied to Process Algebra , 1990, CONCUR.

[10]  S. C. Kleene,et al.  Finite Axiomatizability of Theories in the Predicate Calculus Using Additional Predicate Symbols , 1952 .

[11]  R. Gurevic.  Equational Theory of Positive Numbers with Exponentiation is Not Finitely Axiomatizable , 1990, Ann. Pure Appl. Log..

[12]  George Gratzer,et al.  Universal Algebra , 1979 .

[13]  Gabriele Marongiu,et al.  Finite Algebraic Specifications of Semicomputable Data Types , 1987, TAPSOFT, Vol.1.

[14]  E. Paul,et al.  Proofs by Inducting in Equational Theories with Relations Between Constructors , 1984, Colloquium on Trees in Algebra and Programming.

[15]  Dale Miller,et al.  Deriving Mixed Evaluation from Standard Evaluation for a Simple Functional Language , 1989, MPC.

[16]  Mihaly Makkai.  Review: S. C. Kleene, Finite Axiomatizability of Theories in the Predicate Calculus Using Additional Predicate Symbols; W. Craig, R. L. Vaught, Finite Axiomatizability Using Additional Predicates , 1971 .

[17]  Sauro Tulipani,et al.  On algebraic specifications of computable algebras with the discriminator technique , 1990, RAIRO Theor. Informatics Appl..

[18]  Deepak Kapur,et al.  Proof by Consistency , 1987, Artif. Intell..

[19]  AZEDDINE LAZREK,et al.  Tools for Proving Inductive Equalities, Relative Completeness, and omega-Completeness , 1990, Inf. Comput..

[20]  Donald Sannella,et al.  Completeness of Proof Systems for Equational Specifications , 1985, IEEE Transactions on Software Engineering.

[21]  George F. McNulty.  An Equational Logic Sampler , 1989, RTA.

[22]  G. Epstein.  The lattice theory of Post algebras , 1960 .

[23]  Jan A. Bergstra,et al.  Algebraic Specifications of Computable and Semicomputable Data Types , 1987, Theor. Comput. Sci..

[24]  I. Rosenberg,et al.  completeness properties of multiple-valued logic algebras , 1977 .

[25]  Gordon D. Plotkin.  The lambda-Calculus is omega-Incomplete , 1974, J. Symb. Log..

[26]  José Meseguer,et al.  Initiality, induction, and computability , 1986 .

[27]  Leon Henkin,et al.  The Logic of Equality , 1977 .

[28]  Angus Macintyre,et al.  The laws of exponentiation , 1981 .

[29]  Donald L. Webb,et al.  Definition of Post's Generalized Negative and Maximum in Terms of One Binary Operation , 1936 .

[30]  W. Taylor.  Equational logic , 1979 .

[31]  George Epstein.  An Equational Axiomatization for the Disjoint System of Post Algebras , 1973, IEEE Transactions on Computers.