In this paper, we studied the category of EQ-algebras and showed that it is complete, but it is not cocomplete, in general. We proved that multiplicatively relative EQ-algebras have coequlizers and we calculated coproduct and pushout in a special case. Also, we constructed a free EQ-algebra on a singleton.

In this paper, we apply the notion of $n$-fold filters to the $EQ$-algebras and introduce the concepts of $n$-fold pseudo implicative, $n$-fold implicative, $n$-fold obstinate, $n$-fold fantastic prefilters and filters on an $EQ$-algebra $\mathcal{E}$. Then we investigate some properties and relations among them. We prove that the quotient algebra $\mathcal{E}/F$ modulo an 1-fold pseudo implicative filter of an $EQ$-algebra $\mathcal{E}$ is a good $EQ$-algebra and the quotient algebra $\mathcal{E}/F$ modulo an 1-fold fantastic filter of a good $EQ$-algebra $\mathcal{E}$ is (...) an $IEQ$-algebra. (shrink)

If K is a field of finite Morley rank, then for any parameter set $A \subseteq K^{eq}$ the prime model over A is equal to the model-theoretic algebraic closure of A. A field of finite Morley rank eliminates imaginaries. Simlar results hold for minimal groups of finite Morley rank with infinite acl( $\emptyset$ ).

Assume that the class of partial automorphisms of the monster model of a complete theory has the amalgamation property. The beautiful automorphisms are the automorphisms of models ofT which: 1. are strong, i.e. leave the algebraic closure (inT eq) of the empty set pointwise fixed, 2. are obtained by the Fraïsse construction using the amalgamation property that we have just mentioned. We show that all the beautiful automorphisms have the same theory (in the language ofT plus one unary function symbol (...) for the automorphism), and we study this theory. In particular, we examine the question of the saturation of the beautiful automorphisms. We also prove that in some cases (in particular if the theory is ω-stable andG-trivial), almost all (in the sense of Baire categoricity) automorphisms of the saturated countable model are beautiful and conjugate. (shrink)

We study the notion of weak canonical bases in an NSOP $_{1}$ theory T with existence. Given $p=\operatorname {tp}$ where $B=\operatorname {acl}$ in ${\mathcal M}^{\operatorname {eq}}\models T^{\operatorname {eq}}$, the weak canonical base of p is the smallest algebraically closed subset of B over which p does not Kim-fork. With this aim we firstly show that the transitive closure $\approx $ of collinearity of an indiscernible sequence is type-definable. Secondly, we prove that given a total $\mathop {\smile \hskip -0.9em ^| \ (...) }^K$ -Morley sequence I in p, the weak canonical base of $\operatorname {tp}$ is $\operatorname {acl}$, if the hyperimaginary $I/\approx $ is eliminable to e, a sequence of imaginaries. We also supply a couple of criteria for when the weak canonical base of p exists. In particular the weak canonical base of p is the intersection of the weak canonical bases of all total $\mathop {\smile \hskip -0.9em ^| \ }^K$ -Morley sequences in p over B. However, while we investigate some examples, we point out that given two weak canonical bases of total $\mathop {\smile \hskip -0.9em ^| \ }^K$ -Morley sequences in p need not be interalgebraic, contrary to the case of simple theories. Lastly we suggest an independence relation relying on weak canonical bases, when T has those. The relation, satisfying transitivity and base monotonicity, might be useful in further studies on NSOP $_1$ theories. (shrink)

We make some beginning observations about the category Eq of equivalence relations on the set of natural numbers, where a morphism between two equivalence relations R and S is a mapping from the set of R-equivalence classes to that of S-equivalence classes, which is induced by a computable function. We also consider some full subcategories of Eq, such as the category Eq(Σ01) of computably enumerable equivalence relations (called ceers), the category Eq(Π01) of co-computably enumerable equivalence relations, and the category Eq(Dark*) (...) whose objects are the so-called dark ceers plus the ceers with finitely many equivalence classes. Although in all these categories the monomorphisms coincide with the injective morphisms, we show that in Eq(Σ01) the epimorphisms coincide with the onto morphisms, but in Eq(Π01) there are epimorphisms that are not onto. Moreover, Eq, Eq(Σ01), and Eq(Dark*) are closed under finite products, binary coproducts, and coequalizers, but we give an example of two morphisms in Eq(Π01) whose coequalizer in Eq is not an object of Eq(Π01). (shrink)

In this paper we develop a general representation theory for MV-algebras. We furnish the appropriate categorical background to study this problem. Our guide line is the theory of classifying topoi of coherent extensions of universal algebra theories. Our main result corresponds, in the case of MV-algebras and MV-chains, to the representation of commutative rings with unit as rings of global sections of sheaves of local rings. We prove that any MV-algebra is isomorphic to the MV-algebra of all global (...) sections of a sheaf of MV-chains on a compact topological space. This result is intimately related to McNaughton’s theorem, and we explain why our representation theorem can be viewed as a vast generalization of McNaughton’s theorem. In spite of the language used in this abstract, we have written this paper in the hope that it can be read by experts in MV-algebras but not in sheaf theory, and conversely. (shrink)

The calculus of relations was created and developed in the second half of the nineteenth century by Augustus De Morgan, Charles Sanders Peirce, and Ernst Schröder. In 1940 Alfred Tarski proposed an axiomatization for a large part of the calculus of relations. In the next decade Tarski's axiomatization led to the creation of the theory of relation algebras, and was shown to be incomplete by Roger Lyndon's discovery of nonrepresentable relation algebras. This paper introduces the calculus of relations (...) and the theory of relation algebras through a review of these historical developments. (shrink)

Pseudo MV-algebras are a non-commutative extension of MV-algebras introduced recently by Georgescu and Iorgulescu. We introduce states (finitely additive probability measures) on pseudo MV-algebras. We show that extremal states correspond to normal maximal ideals. We give an example in that, in contrast to classical MV-algebras introduced by Chang, states can fail on pseudo MV-algebras. We prove that representable and normal-valued pseudo MV-algebras admit at least one state.

We define and study monadic MV-algebras as pairs of MV-algebras one of which is a special case of relatively complete subalgebra named m-relatively complete. An m-relatively complete subalgebra determines a unique monadic operator. A necessary and sufficient condition is given for a subalgebra to be m-relatively complete. A description of the free cyclic monadic MV-algebra is also given.

SC , CA , QA and QEA stand for the classes of Pinter's substitution algebras, Tarski's cylindric algebras, Halmos' quasipolyadic algebras, and quasipolyadic equality algebras of dimension , respectively. Generalizing a result of Németi on cylindric algebras, we show that for K {SC, CA, QA, QEA} and ordinals , the class Nr K of -dimensional neat reducts of -dimensional K algebras, though closed under taking homomorphic images and products, is not closed under forming subalgebras (...) (i.e. is not a variety) if and only if > 1.From this it easily follows that for 1 , the operation of forming -neat reducts of algebras in K does not commute with forming subalgebras, a notion to be made precise. (shrink)

In this paper we continue the investigation of monadic Heyting algebras which we started in [2]. Here we present the representation theorem for monadic Heyting algebras and develop the duality theory for them. As a result we obtain an adequate topological semantics for intuitionistic modal logics over MIPC along with a Kripke-type semantics for them. It is also shown the importance and the effectiveness of the duality theory for further investigation of monadic Heyting algebras and logics over (...) MIPC. (shrink)

We characterize Δ20-categoricity in Boolean algebras and linear orderings under some extra effectiveness conditions. We begin with a study of the relativized notion in these structures.

This paper defines a category of bounded distributive lattice-ordered grupoids with a left-residual operation that corresponds to a weak system in the family of relevant logics. Algebras corresponding to stronger systems are obtained by adding further postulates. A duality theoey piggy-backed on the Priestley duality theory for distributive lattices is developed for these algebras. The duality theory is then applied in providing characterizations of the dual spaces corresponding to stronger relevant logics.

We offer a proof of the duality theorem for finitely presented MV-algebras and rational polyhedra, a folklore and yet fundamental result. Our approach develops first a general dual adjunction between MV-algebras and subspaces of Tychonoff cubes, endowed with the transformations that are definable in the language of MV-algebras. We then show that this dual adjunction restricts to a duality between semisimple MV-algebras and closed subspaces of Tychonoff cubes. The duality theorem for finitely presented objects is obtained (...) by a further specialisation. Our treatment is aimed at showing exactly which parts of the basic theory of MV-algebras are needed in order to establish these results, with an eye towards future generalisations. (shrink)

In “A new proof of the completeness of the Lukasiewicz axioms” Chang proved that any totally ordered MV-algebra A was isomorphic to the segment \}\) of a totally ordered l-group with strong unit A *. This was done by the simple intuitive idea of putting denumerable copies of A on top of each other. Moreover, he also show that any such group G can be recovered from its segment since \^*}\), establishing an equivalence of categories. In “Interpretation of AF C (...) *-algebras in Lukasiewicz sentential calculus” Mundici extended this result to arbitrary MV-algebras and l-groups with strong unit. He takes the representation of A as a sub-direct product of chains A i, and observes that \ where \. Then he let A * be the l-subgroup generated by A inside \. He proves that this idea works, and establish an equivalence of categories in a rather elaborate way by means of his concept of good sequences and its complicated arithmetics. In this note, essentially self-contained except for Chang’s result, we give a simple proof of this equivalence taking advantage directly of the arithmetics of the the product l-group \, avoiding entirely the notion of good sequence. (shrink)

For given Boolean algebras$\mathbb {A}$and$\mathbb {B}$we endow the space$\mathcal {H}(\mathbb {A},\mathbb {B})$of all Boolean homomorphisms from$\mathbb {A}$to$\mathbb {B}$with various topologies and study convergence properties of sequences in$\mathcal {H}(\mathbb {A},\mathbb {B})$. We are in particular interested in the situation when$\mathbb {B}$is a measure algebra as in this case we obtain a natural tool for studying topological convergence properties of sequences of ultrafilters on$\mathbb {A}$in random extensions of the set-theoretical universe. This appears to have strong connections with Dow and Fremlin’s result (...) stating that there are Efimov spaces in the random model. We also investigate relations between topologies on$\mathcal {H}(\mathbb {A},\mathbb {B})$for a Boolean algebra$\mathbb {B}$carrying a strictly positive measure and convergence properties of sequences of measures on$\mathbb {A}$. (shrink)

Extending the relation between semi-Heyting algebras and semi-Nelson algebras to dually hemimorphic semi-Heyting algebras, we introduce and study the variety of dually hemimorphic semi-Nelson algebras and some of its subvarieties. In particular, we prove that the category of dually hemimorphic semi-Heyting algebras is equivalent to the category of dually hemimorphic centered semi-Nelson algebras. We also study the lattice of congruences of a dually hemimorphic semi-Nelson algebra through some of its deductive systems.

In this paper we provide a categorical equivalence for the category \ of product algebras, with morphisms the homomorphisms. The equivalence is shown with respect to a category whose objects are triplets consisting of a Boolean algebra B, a cancellative hoop C and a map \ from B × C into C satisfying suitable properties. To every product algebra P, the equivalence associates the triplet consisting of the maximum boolean subalgebra B, the maximum cancellative subhoop C, of P, and (...) the restriction of the join operation to B × C. Although several equivalences are known for special subcategories of \ , up to our knowledge, this is the first equivalence theorem which involves the whole category of product algebras. The syntactic counterpart of this equivalence is a syntactic reduction of classical logic CL and of cancellative hoop logic CHL to product logic, and viceversa. (shrink)

If a formal theory T is able to reason about its own syntax, then the diagonalizable algebra of T is defined as its Lindenbaum sentence algebra endowed with a unary operator □ which sends a sentence φ to the sentence □φ asserting the provability of φ in T. We prove that the first order theories of diagonalizable algebras of a wide class of theories are undecidable and establish some related results.

We study finitely generated free Heyting algebras from a topological and from a model theoretic point of view. We review Bellissima’s representation of the finitely generated free Heyting algebra; we prove that it yields an embedding in the profinite completion, which is also the completion with respect to a naturally defined metric. We give an algebraic interpretation of the Kripke model used by Bellissima as the principal ideal spectrum and show it to be first order interpretable in the Heyting (...) algebra, from which several model theoretic and algebraic properties are derived. In particular, we prove that a free finitely generated Heyting algebra has only one set of free generators, which is definable in it. As a consequence its automorphism group is the permutation group over its generators. (shrink)

We analyze the variety of A. Monteiro’s tetravalent modal algebras under the perspective of two logic systems naturally associated to it. Taking profit of the contrapositive implication introduced by A. Figallo and P. Landini, sound and complete Hilbert-style calculi for these logics are presented.

We consider countable so‐called rich subsemigroups of ; each such semigroup T gives a variety CPEAT that is axiomatizable by a finite schema of equations taken in a countable subsignature of that of ω‐dimensional cylindric‐polyadic algebras with equality where substitutions are restricted to maps in T. It is shown that for any such T, if and only if is representable as a concrete set algebra of ω‐ary relations. The operations in the signature are set‐theoretically interpreted like in polyadic equality (...) set algebras, but such operations are relativized to a union of cartesian spaces that are not necessarily disjoint. This is a form of guarding semantics. We show that CPEAT is canonical and atom‐canonical. Imposing an extra condition on T, we prove that atomic algebras in CPEAT are completely representable and that CPEAT has the super amalgamation property. If T is rich and finitely represented, it is shown that CPEAT is term definitionally equivalent to a finitely axiomatizable Sahlqvist variety. Such semigroups exist. This can be regarded as a solution to the central finitizability problem in algebraic logic for first order logic with equality if we do not insist on full fledged commutativity of quantifiers. The finite dimensional case is approached from the view point of guarded and clique guarded (relativized) semantics of fragments of first order logic using finitely many variables. Both positive and negative results are presented. (shrink)

The variety $\mathbb{DHMSH}$ of dually hemimorphic semi-Heyting algebras was introduced in 2011 by the second author as an expansion of semi-Heyting algebras by a dual hemimorphism. In this paper, we focus on the variety $\mathbb{DHMSH}$ from a logical point of view. The paper presents an extensive investigation of the logic corresponding to the variety of dually hemimorphic semi-Heyting algebras and of its axiomatic extensions, along with an equally extensive universal algebraic study of their corresponding algebraic semantics. Firstly, (...) we present a Hilbert-style axiomatization of a new logic called "Dually hemimorphic semi-Heyting logic" ($\mathcal{DHMSH}$, for short), as an expansion of semi-intuitionistic logic $\mathcal{SI}$ (also called $\mathcal{SH}$) introduced by the first author by adding a weak negation (to be interpreted as a dual hemimorphism). We then prove that it is implicative in the sense of Rasiowa and that it is complete with respect to the variety $\mathbb{DHMSH}$. It is deduced that the logic $\mathcal{DHMSH}$ is algebraizable in the sense of Blok and Pigozzi, with the variety $\mathbb{DHMSH}$ as its equivalent algebraic semantics and that the lattice of axiomatic extensions of $\mathcal{DHMSH}$ is dually isomorphic to the lattice of subvarieties of $\mathbb{DHMSH}$. A new axiomatization for Moisil's logic is also obtained. Secondly, we characterize the axiomatic extensions of $\mathcal{DHMSH}$ in which the "Deduction Theorem" holds. Thirdly, we present several new logics, extending the logic $\mathcal{DHMSH}$, corresponding to several important subvarieties of the variety $\mathbb{DHMSH}$. These include logics corresponding to the varieties generated by two-element, three-element and some four-element dually quasi-De Morgan semi-Heyting algebras, as well as a new axiomatization for the 3-valued Łukasiewicz logic. Surprisingly, many of these logics turn out to be connexive logics, only a few of which are presented in this paper. Fourthly, we present axiomatizations for two infinite sequences of logics namely, De Morgan Gödel logics and dually pseudocomplemented Gödel logics. Fifthly, axiomatizations are also provided for logics corresponding to many subvarieties of regular dually quasi-De Morgan Stone semi-Heyting algebras, of regular De Morgan semi-Heyting algebras of level 1, and of JI-distributive semi-Heyting algebras of level 1. We conclude the paper with some open problems. Most of the logics considered in this paper are discriminator logics in the sense that they correspond to discriminator varieties. Some of them, just like the classical logic, are even primal in the sense that their corresponding varieties are generated by primal algebras. (shrink)

In this paper we obtain characterizations of subalgebras of Heyting algebras and De Morgan Heyting algebras. In both cases we obtain these characterizations by defining certain equivalence relations on the Priestley-type topological representations of the corresponding algebras. As a particular case we derive the characterization of maximal subalgebras of Heyting algebras given by M. Adams for the finite case.

We study algebras whose elements are relations, and the operations are natural “manipulations” of relations. This area goes back to 140 years ago to works of De Morgan, Peirce, Schröder . Well known examples of algebras of relations are the varieties RCAn of cylindric algebras of n-ary relations, RPEAn of polyadic equality algebras of n-ary relations, and RRA of binary relations with composition. We prove that any axiomatization, say E, of RCAn has to be very complex (...) in the following sense: for every natural number k there is an equation in E containing more than k distinct variables and all the operation symbols, if 2 < n < ω. Completely analogous statement holds for the case n ω. This improves Monk's famous non-finitizability theorem for which we give here a simple proof. We prove analogous nonfinitizability properties of the larger varieties SNrnCAn + k. We prove that the complementation-free subreducts of RCAn do not form a variety. We also investigate the reason for the above “non-finite axiomatizability” behaviour of RCAn. We look at all the possible reducts of RCAn and investigate which are finitely axiomatizable. We obtain several positive results in this direction. Finally, we summarize the results and remaining questions in a figure. We carry through the same programme for RPEAn and for RRA. By looking into the reducts we also investigate what other kinds of natural algebras of relations are possible with more positive behaviour than that of the well known ones. Our investigations have direct consequences for the logical properties of the n-variable fragment Ln of first order logic. The reason for this is that RCAn and RPEAn are the natural algebraic counterparts of Ln while the varieties SNrnCAn + k are in connection with the proof theory of Ln. This paper appears in two parts. The first part contains the non-finite axiomatizability results. The present second part contains finite axiomatizations of some fragments together with a figure summarizing the finite and non-finite axiomatizability results in this area and the problems left open. (shrink)

In this paper we study and equationally characterize the subvarieties of BL, the variety of BL-algebras, which are generated by families of single-component BL-chains, i.e. MV-chains, Product-chain or Gödel-chains. Moreover, it is proved that they form a segment of the lattice of subvarieties of BL which is bounded by the Boolean variety and the variety generated by all single-component chains, called ŁΠG.

In the paper some varieties E s n of BCK-algebras with condition defined by W. H. Cornish [1] are considered. A characterization of simple algebras in E s 2 is given and some properties of simple algebras in E s 3 are indicated.

For each integer n ≥ 2, MVn denotes the variety of MV-algebras generated by the MV-chain with n elements. Algebras in MVn are represented as continuous functions from a Boolean space into a n-element chain equipped with the discrete topology. Using these representations, maximal subalgebras of algebras in MVn are characterized, and it is shown that proper subalgebras are intersection of maximal subalgebras. When A ∈ MV3, the mentioned characterization of maximal subalgebras of A can be given (...) in terms of prime filters of the underlying lattice of A, in the form that was conjectured by A. Monteiro. (shrink)

The article deals with compatible families of Boolean algebras. We define the notion of a partial Boolean algebra in a broader sense (PBA(bs)) and then we show that there is a mutual correspondence between PBA(bs) and compatible families of Boolean algebras (Theorem (1.8)). We examine in detail the interdependence between PBA(bs) and the following classes: partial Boolean algebras in the sense of Kochen and Specker (§ 2), ortholattices (§ 3, § 5), and orthomodular posets (§ 4), respectively.

In this paper we prove that the equational class generated by bounded BCK-algebras is the variety generated by the class of finite simple bounded BCK-algebras. To obtain these results we prove that every simple algebra in the equational class generated by bounded BCK-algebras is also a relatively simple bounded BCK-algebra. Moreover, we show that every simple bounded BCK-algebra can be embedded into a simple integral commutative bounded residuated lattice. We extend our main results to some richer subreducts (...) of the class of integral commutative bounded residuated lattices and to the involutive case. (© 2007 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim). (shrink)

We construct the finitely generated free algebras and determine the free spectra of varieties of linear equivalential algebras and linear equivalential algebras of finite height corresponding. respectively, to the equivalential fragments of intermediate Gödel-Dummett logic and intermediate finite-valued logics of Gödel. Thus we compute the number of purely equivalential propositional formulas in these logics in n variables for an arbitrary n ∈ N.

In 1941, Tarski published an abstract, finitely axiomatized version of the theory of binary relations, called the theory of relation algebras, He asked whether every model of his abstract theory could be represented as a concrete algebra of binary relations. He and Jonsson obtained some initial, positive results for special classes of abstract relation algebras. But Lyndon showed, in 1950, that in general the answer to Tarski's question is negative. Monk proved later that the answer remains negative even (...) if one adjoins finitely many new axioms to Tarski's system. In this paper we describe a far-reaching generalization of the positive results of Jonsson and Tarski, as well as of some later, related results of Maddux. We construct a class of concrete models of Tarski's axioms-called coset relation algebras-that are very close in spirit to algebras of binary relations, but are built using systems of groups and cosets instead of elements of a base set. The models include all algebras of binary relations, and many non-representable relation algebras as well, We prove that every atomic relation algebra satisfying a certain measurability condition-a condition generalizing the conditions imposed by Jonsson and Tarski-is essentially isomorphic to a coset relation algebra. The theorem raises the possibility of providing a positive solution to Tarski's problem by using coset relation algebras instead of the standard algebras of binary relations. (shrink)

In the present paper we continue the investigation of the lattice of subvarieties of the variety of √′ P quasi-MV algebras, already started in [6]. Beside some general results on the structure of such a lattice, the main contribution of this work is the solution of a long-standing open problem concerning these algebras: namely, we show that the variety generated by the standard disk algebra D r is not finitely based, and we provide an infinite equational basis for (...) the same variety. (shrink)

Łukasiewicz implication algebras are {→,1}-subreducts of Wajsberg algebras (MV-algebras). They are the algebraic counterpart of Super-Łukasiewicz Implicational logics investigated in Komori, Nogoya Math J 72:127–133, 1978. The aim of this paper is to study the direct decomposability of free Łukasiewicz implication algebras. We show that freely generated algebras are directly indecomposable. We also study the direct decomposability in free algebras of all its proper subvarieties and show that infinitely freely generated algebras are indecomposable, (...) while finitely free generated algebras can be only decomposed into a direct product of two factors, one of which is the two-element implication algebra. (shrink)