# On the Finiteness Problem for classes of modular lattices

## TL;DR

This paper proves that determining whether a large class of modular lattices is finite is an unsolvable problem, highlighting fundamental limitations in classifying such algebraic structures.

## Contribution

It establishes the undecidability of the Finiteness Problem for broad classes of modular lattices, extending understanding of computational limits in lattice theory.

## Key findings

- Finiteness Problem is undecidable for large classes of modular lattices
- Shows fundamental computational limitations in classifying modular lattices
- Highlights the boundary of algorithmic solvability in algebraic structures

## Abstract

The Finiteness Problem is shown to be unsolvable for any sufficiently large class of modular lattices.