Year: 2026
Type: article
Abstract: In the work of Nation and Paolini [Sel. Math. New Ser. (32) 41 (2026)] we proved that the universal theory of infinite free lattices is (algorithmically) decidable, leaving open the problem of decidability of the full theory of an (infinite) free lattice. We solve this problem by proving that, for every cardinal κ ≥ 3 \kappa \geq 3 , the first-order theory of the free lattice F κ \mathbf {F}_\kappa is undecidable.
DOI: 10.1090/proc/17766
Authors: J. Nation, Gianluca Paolini
Language: English
Topic: Advanced Algebra and Logic
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4416361471
FWCI:
Cites:
Cited by:
Related to: