Standard
Subrecursive Equivalence Relations and (non-)Closure Under Lattice Operations. / Moyen, Jean Yves; Simonsen, Jakob Grue.
Connecting with Computability - 17th Conference on Computability in Europe, CiE 2021, Proceedings. red. / Liesbeth De Mol; Andreas Weiermann; Florin Manea; David Fernández-Duque. Springer, 2021. s. 363-372 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 12813 LNCS).
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Harvard
Moyen, JY
& Simonsen, JG 2021,
Subrecursive Equivalence Relations and (non-)Closure Under Lattice Operations. i L De Mol, A Weiermann, F Manea & D Fernández-Duque (red),
Connecting with Computability - 17th Conference on Computability in Europe, CiE 2021, Proceedings. Springer, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), bind 12813 LNCS, s. 363-372, 17th Conference on Computability in Europe, CiE 2021, Virtual, Online,
05/07/2021.
https://doi.org/10.1007/978-3-030-80049-9_34APA
Moyen, J. Y.
, & Simonsen, J. G. (2021).
Subrecursive Equivalence Relations and (non-)Closure Under Lattice Operations. I L. De Mol, A. Weiermann, F. Manea, & D. Fernández-Duque (red.),
Connecting with Computability - 17th Conference on Computability in Europe, CiE 2021, Proceedings (s. 363-372). Springer. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Bind 12813 LNCS
https://doi.org/10.1007/978-3-030-80049-9_34Vancouver
Moyen JY
, Simonsen JG.
Subrecursive Equivalence Relations and (non-)Closure Under Lattice Operations. I De Mol L, Weiermann A, Manea F, Fernández-Duque D, red., Connecting with Computability - 17th Conference on Computability in Europe, CiE 2021, Proceedings. Springer. 2021. s. 363-372. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 12813 LNCS).
https://doi.org/10.1007/978-3-030-80049-9_34Author
Moyen, Jean Yves ; Simonsen, Jakob Grue. / Subrecursive Equivalence Relations and (non-)Closure Under Lattice Operations. Connecting with Computability - 17th Conference on Computability in Europe, CiE 2021, Proceedings. red. / Liesbeth De Mol ; Andreas Weiermann ; Florin Manea ; David Fernández-Duque. Springer, 2021. s. 363-372 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 12813 LNCS).
Bibtex
@inproceedings{cccbf2a3a1704da08592fdc4b9671279,
title = "Subrecursive Equivalence Relations and (non-)Closure Under Lattice Operations",
abstract = "The set of equivalence relations on any non-empty set is equipped with a natural order that makes it a complete lattice. The lattice structure only depends on the cardinality of the set, and thus the study of the lattice structure on any countably infinite set is (up to order-isomorphism) the same as studying the lattice of equivalence relations on the set of natural numbers. We investigate closure under the meet and join operations in the lattice of equivalence relations on the set of natural numbers. Among other results, we show that no set of co-r.e. equivalence relations that contains all logspace-decidable equivalence relations is a lattice.",
keywords = "Equivalence relations, Lattice theory, Subrecursive sets",
author = "Moyen, {Jean Yves} and Simonsen, {Jakob Grue}",
note = "Publisher Copyright: {\textcopyright} 2021, Springer Nature Switzerland AG.; 17th Conference on Computability in Europe, CiE 2021 ; Conference date: 05-07-2021 Through 09-07-2021",
year = "2021",
doi = "10.1007/978-3-030-80049-9_34",
language = "English",
isbn = "9783030800482",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "363--372",
editor = "{De Mol}, Liesbeth and Andreas Weiermann and Florin Manea and David Fern{\'a}ndez-Duque",
booktitle = "Connecting with Computability - 17th Conference on Computability in Europe, CiE 2021, Proceedings",
address = "Switzerland",
}
RIS
TY - GEN
T1 - Subrecursive Equivalence Relations and (non-)Closure Under Lattice Operations
AU - Moyen, Jean Yves
AU - Simonsen, Jakob Grue
N1 - Publisher Copyright:
© 2021, Springer Nature Switzerland AG.
PY - 2021
Y1 - 2021
N2 - The set of equivalence relations on any non-empty set is equipped with a natural order that makes it a complete lattice. The lattice structure only depends on the cardinality of the set, and thus the study of the lattice structure on any countably infinite set is (up to order-isomorphism) the same as studying the lattice of equivalence relations on the set of natural numbers. We investigate closure under the meet and join operations in the lattice of equivalence relations on the set of natural numbers. Among other results, we show that no set of co-r.e. equivalence relations that contains all logspace-decidable equivalence relations is a lattice.
AB - The set of equivalence relations on any non-empty set is equipped with a natural order that makes it a complete lattice. The lattice structure only depends on the cardinality of the set, and thus the study of the lattice structure on any countably infinite set is (up to order-isomorphism) the same as studying the lattice of equivalence relations on the set of natural numbers. We investigate closure under the meet and join operations in the lattice of equivalence relations on the set of natural numbers. Among other results, we show that no set of co-r.e. equivalence relations that contains all logspace-decidable equivalence relations is a lattice.
KW - Equivalence relations
KW - Lattice theory
KW - Subrecursive sets
U2 - 10.1007/978-3-030-80049-9_34
DO - 10.1007/978-3-030-80049-9_34
M3 - Article in proceedings
AN - SCOPUS:85112219611
SN - 9783030800482
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 363
EP - 372
BT - Connecting with Computability - 17th Conference on Computability in Europe, CiE 2021, Proceedings
A2 - De Mol, Liesbeth
A2 - Weiermann, Andreas
A2 - Manea, Florin
A2 - Fernández-Duque, David
PB - Springer
T2 - 17th Conference on Computability in Europe, CiE 2021
Y2 - 5 July 2021 through 9 July 2021
ER -
