Advertisement

On the Power of Quantifiers in First-Order Algebraic Specification

  • David Kempe
  • Arno Schönegge
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1584)

Abstract

The well-known completeness theorem of Bergstra & Tucker [BT82,BT97] states that all computable data types can be specified without quantifiers, i.e., quantifiers can be dispensed with–at least if the introduction of auxiliary (hidden) functions is allowed.

However, the situation concerning the specification without hidden functions is quite different. Our main result is that, in this case, quantifiers do contribute to expressiveness. More precisely, we give an example of a computable data type that has a monomorphic first-order specification (without hidden functions) and prove that it fails to possess a monomorphic quantifier-free specification (without hidden functions).

Keywords

Data Type Conjunctive Normal Form Ground Term Abstract Data Type Primality Predicate 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. AT82.
    Asveld, P.R.J., Tucker, J.V.: Complexity theory and the operational structure of algebraic programming systems. Acta Inform. 17, 451–476 (1982)zbMATHCrossRefMathSciNetGoogle Scholar
  2. BBTW81.
    Bergstra, J.A., Broy, M., Tucker, J.V., Wirsing, M.: On the power of algebraic specifications. In: Gruska, J., Chytil, M.P. (eds.) MFCS 1981. LNCS, vol. 118, pp. 193–204. Springer, Heidelberg (1981)Google Scholar
  3. BDP+79.
    Broy, M., Dosch, W., Partsch, H., Pepper, P., Wirsing, M.: Existential quantifiers in abstract data types. In: Maurer, H.A. (ed.) ICALP 1979. LNCS, vol. 71, pp. 73–87. Springer, Heidelberg (1979)Google Scholar
  4. Ber93.
    Berghammer, R.: On the characterization of the integers: the hidden function problem revisited. Acta Cybernetica 11(1-2), 85–96 (1993)zbMATHMathSciNetGoogle Scholar
  5. BT82.
    Bergstra, J.A., Tucker, J.V.: The completeness of the algebraic speci cation methods for computable data types. Information and Control 54, 186–200 (1982)zbMATHCrossRefMathSciNetGoogle Scholar
  6. BT87.
    Bergstra, J.A., Tucker, J.V.: Algebraic specifications of computable and semicomputable data types. Theoret. Comput. Sci. 50, 137–181 (1987)zbMATHCrossRefMathSciNetGoogle Scholar
  7. EF95.
    Ebbinghaus, H.-D., Flum, J.: Finite Model Theory. In: Perspectives in Mathematical Logic. Springer, Heidelberg (1995)Google Scholar
  8. EM81.
    Ehrig, H., Mahr, B.: Complexity of algebraic implementations for abstract data types. Computer and System Sciences 23(2), 223–253 (1981)zbMATHCrossRefMathSciNetGoogle Scholar
  9. Gai82.
    Gaifman, H.: On local and non-local properties. In: Stern, J. (ed.) Proc. Of the Herbrand Symp., Logic Colloq (1981), pp. 105–135. North-Holland, Amsterdam (1982)CrossRefGoogle Scholar
  10. Imm82.
    Immerman, N.: Upper and lower bounds for first order expressibility. Computer and System Sciences 25, 76–98 (1982)zbMATHCrossRefMathSciNetGoogle Scholar
  11. Kem98.
    Kempe, D.: Ausdrucksmächtigkeit von Quantoren in algebraischen Spezifikationen. Master’s thesis, Universität Karlsruhe (August 1998)Google Scholar
  12. LEW96.
    Loeckx, J., Ehrich, H.-D., Wolf, M.: Specification of abstract data types. Wiley-Teubner, Chichester (1996)zbMATHGoogle Scholar
  13. Maj79.
    Majster, M.E.: Data types, abstract data types and their specification problem. Theoret. Comput. Sci. 8, 89–127 (1979)zbMATHCrossRefMathSciNetGoogle Scholar
  14. Mat93.
    Matiyasevich, Y.: Hilbert’s Tenth Problem. MIT Press, Cambridge (1993)Google Scholar
  15. Ore79.
    Orejas, F.: On the power of conditional specifications. ACM SIGPLAN Notices 14(7), 78–81 (1979)CrossRefGoogle Scholar
  16. Rob74.
    Robinson, A.: Introduction to model theory and to the metamathematics of algebra. In: Studies in Logic and the Foundations of Mathematics. North Holland, Amsterdam (1974)Google Scholar
  17. Sch97a.
    Schönegge, A.: An answer to the hidden function question for algebraic specification methods (abstract). In: 4th Workshop on Logic, Language, Information and Computation. Logic Journal of the IGPL, vol. 5(6) (1997)Google Scholar
  18. Sch97b.
    Schönegge, A.: The hidden function question revisited. In: Johnson, M. (ed.) AMAST 1997. LNCS, vol. 1349, pp. 451–464. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  19. TWW82.
    Thatcher, J.W., Wagner, E.G., Wright, J.B.: Data type specification: Parameterization and the power of specification techniques. ACM Trans. on Programming Languages and Systems 4, 711–732 (1982)zbMATHCrossRefGoogle Scholar
  20. Wir90.
    Wirsing, M.: Algebraic Specification. In: Handbook of Theoretical Computer Science, vol. B, pp. 675–788. Elsevier Science Publishers B. V, Amsterdam (1990)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • David Kempe
    • 1
  • Arno Schönegge
    • 2
  1. 1.Department of Computer ScienceCornell UniversityIthacaUSA
  2. 2.Institut für Logik, Komplexität und DeduktionssystemeUniversität KarlsruheKarlsruheGermany

Personalised recommendations