相关论文: Weak Godel's incompleteness property for some deci…
Relativization is one of the central topics in the study of algebras of relations. Some relativized relation algebras behave much nicer than the original relation algebras. In this paper, we study the atomicity of the finitely generated…
Tarski initiated a logic-based approach to formal geometry that studies first-order structures with a ternary betweenness relation (\beta) and a quaternary equidistance relation (\equiv). Tarski established, inter alia, that the first-order…
Tarski initiated a logic-based approach to formal geometry that studies first-order structures with a ternary betweenness relation \beta, and a quaternary equidistance relation \equiv. Tarski established, inter alia, that the first-order…
We study atom canonicity for several varieties of cylindric like algebras that contain properly the variety of representable algebras. The algebras in such varieties have relativized representations, and we thereby obtain many omitting…
We show that first-order logic can be translated into a very simple and weak logic, and thus set theory can be formalized in this weak logic. This weak logical system is equivalent to the equational theory of Boolean algebras with three…
We study what we call topological cylindric algebras and tense cylindric algebras defined for every ordinal $\alpha$. The former are cylindric algebras of dimension $\alpha$ expanded with $\sf S4$ modalities indexed by $\alpha$. The…
In this paper, first-order logic is interpreted in the framework of universal algebra, using the clone theory developed in three previous papers. We first define the free clone T(L, C) of terms of a first order language L over a set C of…
A. Tarski proved that the m-generated free algebra of $\mathrm{CA}_{\alpha}$, the class of cylindric algebras of dimension $\alpha$, contains exactly $2^m$ zero-dimensional atoms, when $m\ge 1$ is a finite cardinal and $\alpha$ is an…
Cylindric algebras, or concept algebras in another name, form an interface between algebra, geometry and logic; they were invented by Alfred Tarski around 1947. We prove that there are 2 to the alpha many varieties of geometric (i.e.,…
(1) Let 1\leq k\leq \omega. Call an atom structure \alpha weakly k neat representable, the term algebra is in \RCA_n\cap \Nr_n\CA_{n+k}, but the complex algebra is not representable. Call an atom structure neat if there is an atomic algebra…
We show that for finite n at least 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…
This paper investigates the logical strength of completeness theorems for modal propositional logic within second-order arithmetic. We demonstrate that the weak completeness theorem for modal propositional logic is provable in…
The class of weak BCK-algebras is obtained by weakening one of standard BCK axioms. It is known that every weak BCK-algebra is completely determined by the structure of its initial segments. We review several natural classes of commutative…
Fix a finite ordinal n>2. We show that there exists an atomic, simple and countable representable CA_n, such that its minimal completion is outside SNr_nCA_{n+3}. Hence, for any finite k\geq 3, the variety SNr_nCA_{n+k} is not…
Let n be finite >2. We show that any class between S\Nr_n\CA_{n+3} and RCA_n is not atom canonical, and any class containing the class of completely representable algebras and contained in S_c\Nr_n\CA_{n+3} is not elementary. We show that…
Fix 2<n<\omega. Let L_n denote first order logic restricted to the first n variables. CA_n denotes the class of cylindric algebras of dimension n and for m>n, Nr_n\CA_m(\subseteq CA_n) denotes the class of n-neat reducts of CA_m's. The…
Weakly dicomplemented lattices are bounded lattices equipped with two unary operations to encode a negation on {\it concepts}. They have been introduced to capture the equational theory of concept algebras \cite{Wi00}. They generalize…
Using model theoretic techniques that proved that the class of $n$ neat reducts of $m$ dimensional cylindric algebras, $\Nr_n\CA_m$, is not elementary, we prove the same result for $\Ra\CA_k$, $k\geq 5$, and we show that $\Ra\CA_k\subset…
We show that there is a restriction, or modification of the finite-variable fragments of First Order Logic in which a weak form of Craig's Interpolation Theorem holds, but a strong form of this theorem does not hold. Translating these…
This article discusses completeness of Boolean Algebra as First Order Theory in Goedel's meaning. If Theory is complete then any possible transformation is equivalent to some transformation using axioms, predicates etc. defined for this…