Basics of galois connections

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5250 LNCS, Issue , 2008, Pages 38-67

  Börner, Ferdinand ^a  

^a UNIVERSITY OF POTSDAM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BASIC PROPERTIES; CLOSURE OPERATORS; GALOIS CONNECTIONS; GENERALIZED FUNCTIONS;

PROBABILITY DENSITY FUNCTION;

EID: 59149094026     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92800-3_3     Document Type: Conference Paper

References (33)

1. Blyth, T.S., Janowitz, M.F.: Residuation Theory. Pergamon Press, Oxford (1972)
2. Bodnaržuk, V.G., Kalužnin, L.A., Kotov, N.N., Romov, B.A.: Galois theory for Post algebras I. Kibernetika 3, 1-10 (1969) (Russian)
3. Bodnaržuk, V.G., Kalužnin, L.A., Kotov, N.N., Romov, B.A.: Galois theory for Post algebras II. Kibernetika 5, 1-9 (1969) (Russian)
4. Börner, F.: Operationen auf Relationen. Diss., Universität Leipzig (1989)
5. Börner, F.: Krasneralgebren. Logos-Verlag (2000)
6. Börner, F.: Total multifunctions and relations. Contributions to General Algebra 13, 23-36 (2001)
7. Börner, F., Pöschel, R., Sushchansky, V.: Boolean systems of relations and Galois connections. Acta Sci. Math (Szeged) 68, 535-560 (2002)
8. Börner, F., Krokhin, A., Bulatov, A., Jeavons, P.: Quantified constraints and surjective polymorphisms. Technical Report PRG-RR-02-11, Comp. Lab., Univ. of Oxford, UK (2002)
9. Börner, F., Bulatov, A., Jeavons, P., Krokhin, A.: Quantified Constraints: Algorithms and Complexity. In: Baaz, M., Makowsky, J.A. (eds.) Proc. 17th Int.Workshop on Computer Science Logic CSL, pp. 58-70. Springer, Heidelberg (2003)
10. Bulatov, A., Krokhin, A., Jeavons, P.: The complexity of maximal constraint languages. In: Proc. 33rd ACM Symp. on Theory of Computing, STOC 2001, pp. 667-674 (2001)
11. Creignou, N., Khanna, S., Sudan, M.: Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Math. and Appl. 7 (2001)
12. Freivald, R.V.: Functional completeness for not everywhere defined functions of the algebra of logic. Diskr. Analiz. 8, 55-68 (1966)
13. Geiger, D.: Closed systems of functions and predicates. Pacific J. Math. 27, 95-100 (1968)
14. Jeavons, P., Cohen, D., Gyssens, M.: Closure Properties of Constraints. J. of the ACM 44, 527-548 (1997)
15. Jeavons, P.: On the algebraic structure of combinatorial problems. Theoretical Computer Science 200, 185-204 (1998)
16. Krasner, M.: Une g'en'eralisation de la notion de corps. J. Math. pure et appl. 17, 367-385 (1938)
17. Krasner, M.: G'en'eralisation abstraite de la th'eorie de Galois. Colloq. internat. Centre nat. Rech. Sci., Algàbre et Th'eorie des Nombres 24, 163-168 (1950)
18. Lau, D.: Function Algebras on Finite Sets. Springer, Heidelberg (2006)
19. McKenzie, R.N., McNulty, G.F., Taylor,W.F.: Algebras, Lattices, Varieties, vol. 1. Wadsworth & Brooks/Cole, Monterey (1987)
20. Pöschel, R., Kaluznin, L.A.: Funktionen- und Relationenalgebren. Verlag der Wissenschaften, Berlin (1979)
21. Pöschel, R.: Closure properties for relational systems with given endomorphism structure. Beitr. Alg. Geom. 18, 153-166 (1984)
22. Pöschel, R.: Galois connections for operations and relations. Technical Report MATH-AL-8-2001, TU Dresden (2001)
23. Post, E.L.: Determination of all closed systems of truth tables. Bull. Amer. Math. Soc. 26, 437 (1920)
24. Post, E.L.: Introduction to a general theory of elementary propositions. Amer. J. Math. 43, 163-185 (1921)
25. Post, E.L.: The two-valued iterative system of mathematical logic. Annals Math. Stud. 5 (1941)
26. Romov, B.A.: The algebras of partial functions and their invariants. Kibernetika 2, 1-11 (1981); Engl. transl.: Cybernetics 17, 157-167 (1981)
27. Romov, B.A.: Hyperclones on a finite set. In: Mult. Val. Logic 1998, vol. 3, pp. 285-300 (1998)
28. Romov, B.A.: Partial hyperclones on a finite set. In: Proc. 32nd IEEE Int. Symp. Multiple-Valued Logic, pp. 17-27 (2002)
29. Rosenberg, I.G.: Galois theory for partial algebras. In: Freese, R., Garcia, O. (eds.) Universal Algebra and Lattice Theory. Lect. Notes in Math., pp. 257-272. Springer, Heidelberg (1883)
30. Rosenberg, I.G.: Minimal clones I: the five types. Lectures in Universal Algebra. Colloq. Math. Soc. J. Bolyai 43, 405-427 (1983)
31. Rosenberg, I.G.: Composition of functions on finite sets, completeness and relations, a short survey. In: Rine, D. (ed.) Multiple-valued Logic and Computer Science, 2nd edn., pp. 150-192. North-Holland, Amsterdam (1984)
32. Rosenberg, I.G.: An algebraic approach to hyperalgebras. In: Proc. 26th ISMVL, pp. 203-207. IEEE, Los Alamitos (1996)
33. Schaefer, T.: The complexity of satisfyability problems. In: Proc. 10th ACM Symp. on Theory of Computing, STOC 1978, pp. 216-226 (1978)