Studia Logica 64 (3):345-353 (2000)
We present a finitary regularly algebraizable logic not finitely equivalential, for every similarity type. We associate to each of these logics a class of algebras with an equivalence relation, with the property that in this class, the identity is atomatically definable but not finitely atomatically definable.
|Keywords||Philosophy Logic Mathematical Logic and Foundations Computational Linguistics|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Step by Step-Building Representations in Algebraic Logic.Robin Hirsch & Ian Hodkinson - 1997 - Journal of Symbolic Logic 62 (1):225-279.
Groups and Algebras of Binary Relations.Steven Givant & Hajnal Andreka - 2002 - Bulletin of Symbolic Logic 8 (1):38-64.
An Ulm-Type Classification Theorem for Equivalence Relations in Solovay Model.Vladimir Kanovei - 1997 - Journal of Symbolic Logic 62 (4):1333-1351.
Weakly Associative Relation Algebras with Polyadic Composition Operations.Vera Stebletsova - 2000 - Studia Logica 66 (2):297-323.
Characterizing Equivalential and Algebraizable Logics by the Leibniz Operator.Burghard Herrmann - 1997 - Studia Logica 58 (2):305-323.
Nonfinite Axiomatizability Results for Cylindric and Relation Algebras.Roger D. Maddux - 1989 - Journal of Symbolic Logic 54 (3):951-974.
Added to index2009-01-28
Total downloads22 ( #216,613 of 2,058,163 )
Recent downloads (6 months)1 ( #396,194 of 2,058,163 )
How can I increase my downloads?
There are no threads in this forum
Nothing in this forum yet.