Herbrand theorems in arbitrary institutions

Information Processing Letters

Volumn 90, Issue 1, 2004, Pages 29-37

  Diaconescu, Rǎzvan ^a  

^a INSTITUTE OF MATHEMATICS   (Romania)

Author keywords

Formal methods; Herbrand theorems; Institutions; Logic programming; Specification languages

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER SCIENCE; LOGIC PROGRAMMING; MATHEMATICAL MODELS; QUERY LANGUAGES; SEMANTICS;

ARBITRARY INSTITUTIONS; FORMAL METHODS; HERBRAND THEOREMS;

THEOREM PROVING;

EID: 1442332103     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.01.005     Document Type: Article

References (31)

1. Goguen J., Burstall R. Institutions: Abstract model theory for specification and programming. J. ACM. 39:(1):1992;95-146.
2. Sannella D., Tarlecki A. Specifications in an arbitrary institution. Inform. Control. 76:1988;165-210. earlier version Proceedings, International Symposium on the Semantics of Data Types. Lecture Notes in Computer Science. vol. 173:1985;Springer, Berlin.
3. Sannella D., Tarlecki A. Specifications in an arbitrary institution. Inform. Control. 76:1988;165-210. earlier version Proceedings, International Symposium on the Semantics of Data Types. Lecture Notes in Computer Science. vol. 173:1985;Springer, Berlin.
4. Astesiano E., Bidoit M., Kirchner H., Krieg-Brückner B., Mosses P., Sannella D., Tarlecki A. CASL: The common algebraic specification language. Theoret. Comput. Sci. 286:(2):2002;153-196.
5. Meseguer J. A logical theory of concurrent objects and its realization in the Maude language. Agha G., Wegner P., Yonezawa A. Research Directions in Concurrent Object-Oriented Programming. 1993;MIT Press, Cambridge, MA.
6. Diaconescu R., Futatsugi K. Logical foundations of CafeOBJ. Theoret. Comput. Sci. 285:2002;289-318.
7. Diaconescu R., Futatsugi K. Behavioural coherence in object-oriented algebraic specification. Universal Comput. Sci. 6:(1):2000;74-96. first version appeared as JAIST Technical Report IS-RR-98-0017F, June 1998.
8. Goguen J., Roşu G. Hiding more of hidden algebra. Wing J.M., Woodcock J., Davies J. FM '99 - Formal Methods. Lecture Notes in Computer Science. vol. 1709:1999;1704-1719 Springer, Berlin.
9. Hennicker R., Bidoit M. Observational logic. Haeberer A.M. Algebraic Methodology and Software Technology. Lecture Notes in Computer Science. vol. 1584:1999;263-277 Springer, Berlin.
10. Meseguer J. Conditional rewriting logic as a unified model of concurrency. Theoret. Comput. Sci. 96:(1):1992;73-155.
11. Lloyd J. Foundations of Logic Programming. second extended ed. 1988;Springer, Berlin.
12. O'Donnell M.J. Computing in systems described by equations. Lecture Notes in Computer Science. vol. 58:1977;Springer, Berlin.
13. Goguen J., Meseguer J. Eqlog: Equality, types, and generic modules for logic programming. DeGroot D., Lindstrom G. Logic Programming: Functions, Relations and Equations. 1986;295-363 Prentice-Hall, Englewood Cliffs, NJ. an earlier version appears J. Logic Programming. 1:(2):1984;179-210.
14. Goguen J., Meseguer J. Eqlog: Equality, types, and generic modules for logic programming. DeGroot D., Lindstrom G. Logic Programming: Functions, Relations and Equations. 1986;295-363 Prentice-Hall, Englewood Cliffs, NJ. an earlier version appears J. Logic Programming. 1:(2):1984;179-210.
15. Goguen J., Meseguer J. Models and equality for logical programming. Ehrig H., Levi G., Kowalski R., Montanari U. Proceedings, 1987 TAPSOFT. Lecture Notes in Computer Science. vol. 250:1987;1-22 Springer, Berlin.
16. Goguen J., Malcolm G., Kemp T. A hidden Herbrand theorem: Combining the object, logic and functional paradigms. J. Logic Algebraic Programming. 51:(1):2002;1-41.
17. Diaconescu R. Institution-independent ultraproducts. Fund. Inform. 55:(3-4):2003;321-348.
18. Orejas F., Pino E., Ehrig H. Institutions for logic programming. Theoret. Comput. Sci. 173:1997;485-511.
19. MacLane S. Categories for the Working Mathematician. second ed. 1998;Springer, Berlin.
20. Andréka H., Németi I. A general axiomatizability theorem formulated in terms of cone-injective subcategories. Csakany B., Fried E., Schmidt E. Universal Algebra. Colloquia Mathematics Societas János Bolyai. vol. 29:1981;13-35 North-Holland, Amsterdam.
21. Tarlecki A. Quasi-varieties in abstract algebraic institutions. J. Comput. System Sci. 33:(3):1986;333-360. original version: University of Edinburgh, Report CSR-173-84.
22. Shoenfield J. Mathematical Logic. 1967;Addison-Wesley, Reading, MA.
23. Hodges W. Model Theory. 1993;Cambridge Univ. Press, Cambridge.
24. Tarlecki A. On the existence of free models in abstract algebraic institutions. Theoret. Comput. Sci. 37:1986;269-304. preliminary version: University of Edinburgh, Computer Science Department, Report CSR-165-84, 1984.
25. Diaconescu R. Category-based constraint logic. Math. Struct. Comput. Sci. 10:(3):2000;373-407.
26. Diaconescu R. Completeness of category-based equational deduction. Math. Struct. Comput. Sci. 5:(1):1995;9-41.
27. R. Diaconescu, Category-based semantics for equational and constraint logic programming, Ph.D. thesis, University of Oxford (1994).
28. Meseguer J. Membership algebra as a logical framework for equational specification. Parisi-Pressice F. Proc. WADT '97. Lecture Notes in Computer Science. vol. 1376:1998;18-61 Springer, Berlin.
29. Y. Lamo, The institution of multialgebras - a general framework for algebraic software development, Ph.D. thesis, University of Bergen, 2002.
30. Diaconescu R., Goguen J., Stefaneas P. Logical support for modularisation. Huet G., Plotkin G. Logical Environments. 1993;83-130 Cambridge Univ. Press, Cambridge.
31. Goguen J., Roşu G. Institution morphisms. Formal Aspects Comput. 13:2002;274-307.