Algebras from finite group actions and a question of Eilenberg and Schützenberger

Autor: Salma Shaheen, Ross Willard

Publikováno v: Journal of Algebra. 631:896-910

In 1976 S. Eilenberg and M.-P. Schützenberger posed the following diabolical question: if $\mathbf{A}$ is a finite algebraic structure, $Σ$ is the set of all identities true in $\mathbf{A}$, and there exists a finite subset $F$ of $Σ$ such that $F

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a497698855c183ba6f27fffb1ea39a26
https://doi.org/10.1016/j.jalgebra.2023.05.014

The first-order theory of binary overlap-free words is decidable

Autor: Luke Schaeffer, Jeffrey Shallit

Publikováno v: Canadian Journal of Mathematics. :1-19

We show that the first-order logical theory of the binary overlap-free words (and, more generally, the ${\alpha}$-free words for rational ${\alpha}$, $2 < {\alpha} \leq 7/3$), is decidable. As a consequence, many results previously obtained about thi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::11fd114ee35596756a4f957daef59263
https://doi.org/10.4153/s0008414x23000342

INVESTIGATING THE COMPUTABLE FRIEDMAN-STANLEY JUMP

Autor: Andrews, Uri, Mauro, Luca San

Publikováno v: The Journal of Symbolic Logic. :1-27

We answer several questions about the computable Friedman-Stanley jump on equivalence relations. This jump, introduced by Clemens, Coskey, and Krakoff, deepens the natural connection between the study of computable reduction and its Borel analog stud

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8d7b861b8b77ec6415a0a4da20c18726
https://doi.org/10.1017/jsl.2023.30

Linear Logic Properly Displayed

Autor: Giuseppe Greco, Alessandra Palmigiano

Publikováno v: ACM Transactions on Computational Logic, 24(2):3570919, 1-56. Association for Computing Machinery (ACM)
Greco, G & Palmigiano, A 2023, ' Linear Logic Properly Displayed ', ACM Transactions on Computational Logic, vol. 24, no. 2, 3570919, pp. 1-56 . https://doi.org/10.1145/3570919

We introduce proper display calculi for intuitionistic, bi-intuitionistic and classical linear logics with exponentials, which are sound, complete, conservative, and enjoy cut elimination and subformula property. Based on the same design, we introduc

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a2913c4fdea81e7f886107ed34d48aa9
https://research.vu.nl/en/publications/57e73491-0868-4c47-91ec-d9f48c8b5632

A note on k-cyclic modal pseudocomplemented De Morgan algebras

Autor: Aldo Figallo-Orellano, Juan Sebastián Slagter

Publikováno v: Soft Computing. 27:6961-6972

Symmetric and k-cyclic structure of modal pseudocomplemented De Morgan algebras algebras was introduced previously. In this paper, we first present the construction of epimorphims between finite symmetric (or 2-cyclic) modal pseudocomplemented De Mor

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::20cc733dc1a0c474aa4d3581a7aca509
https://doi.org/10.1007/s00500-023-07911-9