Hostname: page-component-76fb5796d-25wd4 Total loading time: 0 Render date: 2024-04-26T20:13:37.963Z Has data issue: false hasContentIssue false
  • English
  • Français

Expressibility of properties of relations

Published online by Cambridge University Press:  12 March 2014

Hajnal Andréka ,
Ivo Düntsch  and
István Németi
Hajnal Andréka
Affiliation:
Mathematical Institute, Academy of Sciences, Budapest 1363, Hungary, E-mail: h2644and@huella.bitnet
Ivo Düntsch
Affiliation:
School of Information and Software Engineering, University of Ulster at Jordanstown, Newtownabbey, BT 37 0QB, N.Ireland, E-mail: I.Duentsch@ulst.ac.uk
István Németi
Affiliation:
Mathematical Institute, Academy of Sciences, Budapest 1363, Hungary, E-mail: h1469nem@huella.bitnet
Get access Rights & Permissions [Opens in a new window]

Abstract

We investigate in an algebraic setting the question of which logical languages can express the properties integral, permutational, and rigid for algebras of relations.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 60 , Issue 3 , September 1995 , pp. 970 - 991
Copyright
Copyright © Association for Symbolic Logic 1995

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Andréka, Hajnal, Düntsch, Ivo, and Németi, István, Binary relations and permutation groups, Mathematical Logic Quarterly, to appear (1995).Google Scholar
[2]Andréka, Hajnal, A non permutational integral relation algebra, Michigan Mathematical Journal, vol. 39 (1992), pp. 371–384.CrossRefGoogle Scholar
[3]Andréka, Hajnal and Maddux, Roger, Representations for small relation algebras, Preprint, Department of Mathematics, Iowa State University, 1988.Google Scholar
[4]Blass, A. and Harary, F., Properties of almost all graphs and complexes, Journal of Graph Theory, vol. 3 (1979), pp. 225–240.CrossRefGoogle Scholar
[5]Chang, C. and Keisler, J., Model theory, North Holland, 1971.Google Scholar
[6]Compton, K. J., 0–1 laws in logic and combinatorics, Algorithms and order (Rival, Ivan, editor), Kluwer, 1988.Google Scholar
[7]Düntsch, Ivo, A microcomputer based system for small relation algebras, Journal of Symbolic Computational 18 (1994), pp. 83–86.CrossRefGoogle Scholar
[8]Fagin, R., Stockmeyer, L., and Vardi, M., On monadic NP vs. monadic co-NP, Research report RJ 9225 (81789), IBM Almaden, 1992.Google Scholar
[9]Fagin, Ron, Finite model theory—a personal perspective, Springer lecture notes in computer science, no. 470, Springer, 1987, pp. 3–24.Google Scholar
[10]Henkin, Leon, Monk, J. Donald, and Tarski, Alfred, Cylindric algebras, Part I, North Holland, 1971.Google Scholar
[11]Henkin, Leon, Cylindric algebras, Part II, North Holland, 1985.Google Scholar
[12]Immerman, Neil, Upper and lower bounds for first order expressibility, Journal of Computer and System Science, vol. 25 (1982), pp. 76–98.CrossRefGoogle Scholar
[13]Immerman, Neil and Kozen, Dexter, Definability with a bounded number of variables, Information and Computation, vol. 83 (1989), pp. 121–139.CrossRefGoogle Scholar
[14]Jónsson, Bjarni, Maximal algebras of binary relations, Contemporary Mathematics, vol. 33 (1984), pp. 299–307.CrossRefGoogle Scholar
[15]Jónsson, Bjarni and Tarski, Alfred, Boolean algebras with operators II, American Journal of Mathematics, vol. 74 (1952), pp. 127–162.CrossRefGoogle Scholar
[16]Kolaitis, P. and Vardi, M., Infinitary logic and 0-1 laws, Information and Computation, vol. 98 (1992), pp. 258–294.CrossRefGoogle Scholar
[17]McKay, Brendan, NAUTY user guide, Tech. Report TR-CS-90-02, Australian National University, 1990.Google Scholar
[18]McKenzie, Ralph, Representations of integral relation algebras, Ph.D. thesis, University of Colorado, 1966.Google Scholar
[19]Tarski, Alfred and Givant, Steven, A formalization of set theory without variables, American Mathematical Society (1987).Google Scholar