User talk:Cousotp

Cousotp, you are invited to the Teahouse

Hi Cousotp! Thanks for contributing to Wikipedia.
Be our guest at the Teahouse! The Teahouse is a friendly space where new editors can ask questions about contributing to Wikipedia and get help from peers and experienced editors. I hope to see you there! Ushau97 (I'm a Teahouse host)

Visit the Teahouse

This message was delivered automatically by your robot friend, HostBot (talk) 21:21, 21 May 2014 (UTC)[reply]

Welcome!

Hello, Cousotp, and welcome to Wikipedia! Thank you for your contributions. I hope you like the place and decide to stay. Here are a few links to pages you might find helpful:

Please remember to sign your messages on talk pages by typing four tildes (~~~~); this will automatically insert your username and the date. If you need help, check out Wikipedia:Questions, ask me on my talk page, or ask your question on this page and then place {{Help me}} before the question. Again, welcome! Racklever (talk) 20:05, 5 June 2014 (UTC)[reply]

Galois connection

Hi! You recently added a remark at Galois_connection#Applications_in_the_theory_of_programming that your POPL 1977 article only considers complete lattices, while the counterexample uses arbitrary partial orders. It seems that your objection has a point: the counterexample indeed is no lattice, let alone a complete one.

However, I guess that its basic idea (to use self-similarity to obtain embeddings in both directions, but no isomorphism) might carry over to some complete lattices, too. Meanwhile, I believe to have constructed a counterexample (based on complete lattices, and even linear orders) in File:GaloisEmbeddings Complete Lattices.pdf, and would appreciate if you could comment on it. Many thanks in advance. Best regards - Jochen Burghardt (talk) 16:40, 7 June 2022 (UTC)[reply]