Weakly higher order cylindric algebras and finite axiomatization of the representables
نویسندگان
چکیده
We show that the variety of n-dimensional weakly higher order cylindric algebras, introduced in Németi [9], [8], is finitely axiomatizable when n > 2. Our result implies that in certain non-well-founded set theories the finitization problem of algebraic logic admits a positive solution; and it shows that this variety is a good candidate for being the cylindric algebra theoretic counterpart of Tarski’s quasi-projective relation algebras.
منابع مشابه
S 5 × S 5 × S 5 lacks the finite model property
It follows from algebraic results of Maddux that every multi-modal logic L such that [S5,S5, . . . ,S5] ⊆ L ⊆ S5 is undecidable, whenever n ≥ 3. This implies that the product logic S5×S5×S5 does not have the product finite model property. Here we answer a question of Gabbay and Shehtman by showing that S5×S5×S5 also lacks the ‘real’ finite model property (fmp). We prove that every logic L from ...
متن کاملBare canonicity of representable cylindric and polyadic algebras
We show that for finite n ≥ 3, every first-order axiomatisation of the varieties of representable n-dimensional cylindric algebras, diagonal-free cylindric algebras, polyadic algebras, and polyadic equality algebras contains an infinite number of non-canonical formulas. We also show that the class of structures for each of these varieties is non-elementary. The proofs employ algebras derived fr...
متن کاملSplitting methods in algebraic logic in connection to non-atom–canonicity and non-first order definability
We deal with various splitting methods in algebraic logic. The word ‘splitting’ refers to splitting some of the atoms in a given relation or cylindric algebra each into one or more subatoms obtaining a bigger algebra, where the number of subatoms obtained after splitting is adjusted for a certain combinatorial purpose. This number (of subatoms) can be an infinite cardinal. The idea originates w...
متن کاملEpimorphisms in Cylindric Algebras and Definability in Finite Variable Logic
The main result gives a sufficient condition for a class K of finite dimensional cylindric algebras to have the property that not every epimorphism in K is surjective. In particular, not all epimorphisms are surjective in the classes CAn of n-dimensional cylindric algebras and the class of representable algebras in CAn for finite n > 1, solving Problem 10 of [28] for finite n. By a result of Né...
متن کاملCylindric Algebras of First - Order Languages
We show when two countable first-order languages have isomorphic cylindric algebras. Introduction. The cylindric algebra of a language is the co-dimensional cylindric algebra of formulas of the language modulo logical equivalence. We classify first-order languages according to the isomorphism types of their cylindric algebras. For two languages involving only predicate symbols, their cylindric ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Studia Logica
دوره 91 شماره
صفحات -
تاریخ انتشار 2009