{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:37:57Z","timestamp":1753889877977,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2017,9,14]],"date-time":"2017-09-14T00:00:00Z","timestamp":1505347200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2017,9,14]],"date-time":"2017-09-14T00:00:00Z","timestamp":1505347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2017,9,14]],"date-time":"2017-09-14T00:00:00Z","timestamp":1505347200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>We give a new order-theoretic characterization of a complete Heyting and co-Heyting algebra $C$. This result provides an unexpected relationship with the field of Nash equilibria, being based on the so-called Veinott ordering relation on subcomplete sublattices of $C$, which is crucially used in Topkis' theorem for studying the order-theoretic stucture of Nash equilibria of supermodular games.<\/jats:p><jats:p>Comment: To appear in Logical Methods in Computer Science<\/jats:p>","DOI":"10.23638\/lmcs-13(3:25)2017","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:34:06Z","timestamp":1743701646000},"source":"Crossref","is-referenced-by-count":0,"title":["A new characterization of complete Heyting and co-Heyting algebras"],"prefix":"10.23638","volume":"Volume 13, Issue 3","author":[{"given":"Francesco","family":"Ranzato","sequence":"first","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2017,9,14]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1504.03919v4","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1504.03919v4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:34:06Z","timestamp":1743701646000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/3931"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,14]]},"references-count":0,"URL":"https:\/\/doi.org\/10.23638\/lmcs-13(3:25)2017","relation":{"is-same-as":[{"id-type":"arxiv","id":"1504.03919","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1504.03919","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2017,9,14]]},"article-number":"3931"}}