2024/11/24 by Vsevolod Evtushevsky, Evtushevsky, Vsevolod
Computer Science · Physics and Astronomy · #Advanced Algebra and Logic #Advanced Mathematical Theories and Applications #Combinatorics (math.CO) #FOS: Mathematics #Logic (math.LO) #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.2411.17739
openalex publication_date 2024/11/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
For a poset (P,\leqslant) we consider the first-order theory, that is defined by set P and relation \leqslant. The problem of undecidability of combinatorial theories attracts significant attention. Recently A. Wires proved the undecidability of the elementary theory of Young lattice and also established the maximal definability property of this theory. The purpose of this article is to obtain the same results for another graded lattice, which has much in common with Young lattice: Young--Fibonacci lattice. As Wires does for Young lattice, for the proof of undecidability we define Arithmetic into this theory.