Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
149 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Axiomatization of Finite Algebras (1403.7347v1)

Published 28 Mar 2014 in cs.LO and cs.FL

Abstract: We show that the set of all formulas in n variables valid in a finite class A of finite algebras is always a regular tree language, and compute a finite axiom set for A. We give a rational reconstruction of Barzdins' liquid flow algorithm (Barzdin+Barzdin, 1991). We show a sufficient condition for the existence of a class A of prototype algebras for a given theory T. Such a set allows us to prove T |= p simply by testing whether p holds in A.

Citations (6)

Summary

We haven't generated a summary for this paper yet.