Axiomatizability of algebras of binary relations

被引：0
|
作者：
Mikulás, S [1 ]
机构：
[1] Univ London Birkbeck Coll, Sch Comp Sci & Informat Syst, London WC1E 7HX, England
来源：
Classical and New Paradigms of Computation and Their Complexity Hierarchies | 2004年 / 23卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We present an overview of the axiomatizability problem of algebras of binary relations. The focus will be on the finite and non-finite axiomatizability of several fragments of Tarski's class of representable relation algebras. We examine the step-by-step method for establishing finite axiomatizability and ultraproduct constructions for establishing non-finite axiomatizability. We conclude with some open problems that could be tackled using either of the above methods.
引用
收藏
页码：187 / 205
页数：19
相关论文
共 50 条
12345