Finite model theory for pseudovarieties and universal algebra: preservation, definability and complexity

12/05/2022
by   Lucy Ham, et al.
0

We explore new interactions between finite model theory and a number of classical streams of universal algebra and semigroup theory. A key result is an example of a finite algebra whose variety is not finitely axiomatisable in first order logic, but which has first order definable finite membership problem. This algebra witnesses the simultaneous failure of the Łos-Tarski Theorem, the SP-preservation theorem and Birkhoff's HSP-preservation theorem at the finite level as well as providing a negative solution to a first order formulation of the long-standing Eilenberg Schützenberger problem. The example also shows that a pseudovariety without any finite pseudo-identity basis may be finitely axiomatisable in first order logic. Other results include the undecidability of deciding first order definability of the pseudovariety of a finite algebra and a mapping from any fixed template constraint satisfaction problem to a first order equivalent variety membership problem, thereby providing examples of variety membership problems complete in each of the classes , , _p(), , and infinitely many others (depending on complexity-theoretic assumptions).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/21/2018

The Subpower Membership Problem for Finite Algebras with Cube Terms

The subalgebra membership problem is the problem of deciding if a given ...
research
07/05/2023

The complexity of the Chinese Remainder Theorem

The Chinese Remainder Theorem for the integers says that every system of...
research
07/10/2020

Extension Preservation in the Finite and Prefix Classes of First Order Logic

It is well known that the classic Łoś-Tarski preservation theorem fails ...
research
01/15/2023

Deciding Equations in the Time Warp Algebra

Join-preserving maps on the discrete time scale ω^+, referred to as time...
research
03/27/2013

Can Uncertainty Management be Realized in a Finite Totally Ordered Probability Algebra?

In this paper, the feasibility of using finite totally ordered probabili...
research
04/05/2022

When Locality Meets Preservation

This paper investigates the expressiveness of a fragment of first-order ...
research
03/04/2023

Locally universal C*-algebras with computable presentations

The Kirchberg Embedding Problem (KEP) asks if every C*-algebra embeds in...

Please sign up or login with your details

Forgot password? Click here to reset