General affine adjunctions,Nullstellensätze,and dualities

We introduce and investigate a category-theoretic abstraction of the standard “system-solution” adjunction in affine algebraic geometry. We then look further into these geometric adjunctions at different levels of generality, from syntactic categories to (possibly infinitary) equational classes of algebras. In doing so, we discuss the relationships between the dualities induced by our framework and the well-established theory of concrete dual adjunctions. In the context of general algebra we prove an analogue of Hilbert's Nullstellensatz, thereby achieving a complete characterisation of the fixed points on the algebraic side of the adjunction.     

Fuzzy Horn logic I

The paper presents generalizations of results on so-called Horn logic, well-known in universal algebra, to the setting of fuzzy logic. The theories we consider consist of formulas which are implications between identities (equations) with premises weighted by truth degrees. We adopt Pavelka style: theories are fuzzy sets of formulas and we consider degrees of provability of formulas from theories. Our basic structure of truth degrees is a complete residuated lattice. We derive a Pavelka-style completeness theorem (degree of provability equals degree of truth) from which we get some particular cases by imposing restrictions on the formulas under consideration. As a particular case, we obtain completeness of fuzzy equational logic.     

Fibered universal algebra for first-order logics

We extend Lawvere-Pitts prop-categories (aka. hyperdoctrines) to develop a general framework for providing fibered algebraic semantics for general first-order logics. This framework includes a natural notion of substitution, which allows first-order logics to be considered as structural closure operators just as propositional logics are in abstract algebraic logic. We then establish an extension of the homomorphism theorem from universal algebra for generalized prop-categories and characterize two natural closure operators on the prop-categorical semantics. The first closes a class of structures (which are interpreted as morphisms of prop-categories) under the satisfaction of their common first-order theory and the second closes a class of prop-categories under their associated first-order consequence. It turns out that these closure operators have characterizations that closely mirror Birkhoff's characterization of the closure of a class of algebras under the satisfaction of their common equational theory and Blok and Jónsson's characterization of closure under equational consequence, respectively. These algebraic characterizations of the first-order closure operators are unique to the prop-categorical semantics. They do not have analogues, for example, in the Tarskian semantics for classical first-order logic. The prop-categories we consider are much more general than traditional intuitionistic prop-categories or triposes (i.e., topos representing indexed partially ordered sets). Nonetheless, to the best of our knowledge, our results are new, even when restricted to these special classes of prop-categories.     

Extensions and renormalized traces

It has been shown by Nistor (Doc Math J DMV 2:263–295, 1997) that given any extension of associative algebras over \mathbb C{\mathbb C}, the connecting morphism in periodic cyclic homology is compatible, under the Chern–Connes character, with the index morphism in lower algebraic K-theory. The proof relies on the abstract properties of cyclic theory, essentially excision, which does not provide explicit formulas a priori. Avoiding the use of excision, we explain in this article how to get explicit formulas in a wide range of situations. The method is connected to the renormalization procedure introduced in our previous work on the bivariant Chern character for quasihomomorphisms Perrot (J Geom Phys 60:1441–1473, 2010), leading to “local” index formulas in the sense of non-commutative geometry. We illustrate these principles with the example of the classical family index theorem: we find that the characteristic numbers of the index bundle associated to a family of elliptic pseudodifferential operators are expressed in terms of the (fiberwise) Wodzicki residue.     

Algebras Defined from Ordered Sets and the Varieties they Generate

We investigate ways of representing ordered sets as algebras and how the order relation is reflected in the algebraic properties of the variety (equational class) generated by these algebras. In particular we consider two different but related methods for constructing an algebra with one binary operation from an arbitrary ordered set with a top element. The two varieties generated by all these algebras are shown to be well-behaved in that they are locally finite, finitely based, and have an equationally definable order relation. We exhibit a bijection between the subdirectly irreducible algebras in each variety and the class of all ordered sets with top element. We determine the structure and cardinality of the free algebra on n-free generators and provide sharp bounds on the number of n-generated algebras in each variety. These enumeration results involve the number of quasi-orders on an n-element set.     

On weakening the Deduction Theorem and strengthening Modus Ponens

This paper studies, with techniques of Abstract Algebraic Logic, the effects of putting a bound on the cardinality of the set of side formulas in the Deduction Theorem, viewed as a Gentzen‐style rule, and of adding additional assumptions inside the formulas present in Modus Ponens, viewed as a Hilbert‐style rule. As a result, a denumerable collection of new Gentzen systems and two new sentential logics have been isolated. These logics are weaker than the positive implicative logic. We have determined their algebraic models and the relationships between them, and have classified them according to several standard criteria of Abstract Algebraic Logic. One of the logics is protoalgebraic but neither equivalential nor weakly algebraizable, a rare situation where very few natural examples were hitherto known. In passing we have found new, alternative presentations of positive implicative logic, both in Hilbert style and in Gentzen style, and have characterized it in terms of the restricted Deduction Theorem: it is the weakest logic satisfying Modus Ponens and the Deduction Theorem restricted to at most 2 side formulas. The algebraic part of the work has lead to the class of quasi‐Hilbert algebras, a quasi‐variety of implicative algebras introduced by Pla and Verdú in 1980, which is larger than the variety of Hilbert algebras. Its algebraic properties reflect those of the corresponding logics and Gentzen systems. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A common generalization for MV-algebras and Łukasiewicz–Moisil algebras

We introduce the notion of n-nuanced MV-algebra by performing a Łukasiewicz–Moisil nuancing construction on top of MV-algebras. These structures extend both MV-algebras and Łukasiewicz–Moisil algebras, thus unifying two important types of structures in the algebra of logic. On a logical level, n-nuanced MV-algebras amalgamate two distinct approaches to many valuedness: that of the infinitely valued Łukasiewicz logic, more related in spirit to the fuzzy approach, and that of Moisil n-nuanced logic, which is more concerned with nuances of truth rather than truth degree. We study n-nuanced MV-algebras mainly from the algebraic and categorical points of view, and also consider some basic model-theoretic aspects. The relationship with a suitable notion of n-nuanced ordered group via an extension of the Γ construction is also analyzed.     

Equational spectrum of Hilbert varieties

We prove that an equational class of Hilbert algebras cannot be defined by a single equation. In particular Hilbert algebras and implication algebras are not one-based. Also, we use a seminal theorem of Alfred Tarski in equational logic to characterize the set of cardinalities of all finite irredundant bases of the varieties of Hilbert algebras, implication algebras and commutative BCK algebras: all these varieties can be defined by independent bases of n elements, for each n > 1.      

Partial algebras for Łukasiewicz logics and its extensions

It is a well-known fact that MV-algebras, the algebraic counterpart of Łukasiewicz logic, correspond to a certain type of partial algebras: lattice-ordered effect algebras fulfilling the Riesz decomposition property. The latter are based on a partial, but cancellative addition, and we may construct from them the representing ℓ-groups in a straightforward manner. In this paper, we consider several logics differing from Łukasiewicz logics in that they contain further connectives: the PŁ-, PŁ'-, PŁ'_△-, and ŁΠ-logics. For all their algebraic counterparts, we characterise the corresponding type of partial algebras. We moreover consider the representing f-rings. All in all, we get three-fold correspondences: the total algebras - the partial algebras - the representing rings.     

Algebraic semantics for superintuitionistic predicate logics

We construct a unified algebraic semantics for superintuitionistic predicate logics. Assigned to each predicate logic is some deductive system of a propositional language which is kept fixed throughout all predicate superintuitionistic ones. Given that system, we build up a variety of algebras w.r.t. which a given logic is proved to be strongly complete. Supported by the Russian Arts Foundation (RAF), grant No. 97-03-04089a. Translated fromAlgebra i Logika, Vol. 38, No. 1, pp. 68–95, January–February, 1999.     

Monadic Bounded Commutative Residuated ℓ-monoids

Bounded commutative residuated ℓ-monoids are a generalization of algebras of propositional logics such as BL-algebras, i.e. algebraic counterparts of the basic fuzzy logic (and hence consequently MV-algebras, i.e. algebras of the Łukasiewicz infinite valued logic) and Heyting algebras, i.e. algebras of the intuitionistic logic. Monadic MV-algebras are an algebraic model of the predicate calculus of the Łukasiewicz infinite valued logic in which only a single individual variable occurs. We introduce and study monadic residuated ℓ-monoids as a generalization of monadic MV-algebras. Jiří Rachůnek was supported by the Council of Czech Goverment MSM 6198959214.     

Abstract ordered compact convex sets and algebras of the (sub)probabilistic powerdomain monad over ordered compact spaces

The majority of categories used in denotational semantics are topological in nature. One of these is the category of stably compact spaces and continuous maps. Previously, Eilenberg–Moore algebras were studied for the extended probabilistic powerdomain monad over the category of ordered compact spaces X and order-preserving continuous maps in the sense of Nachbin. Appropriate algebras were characterized as compact convex subsets of ordered locally convex topological vector spaces. In so doing, functional analytic tools were involved. The main accomplishments of this paper are as follows: the result mentioned is re-proved and is extended to the subprobabilistic case; topological methods are developed which defy an appeal to functional analysis; a more topological approach might be useful for the stably compact case; algebras of the (sub)probabilistic powerdomain monad inherit barycentric operations that satisfy the same equational laws as those in vector spaces. Also, it is shown that it is convenient first to embed these abstract convex sets in abstract cones, which are simpler to work with. Lastly, we state embedding theorems for abstract ordered locally compact cones and compact convex sets in ordered topological vector spaces.     

Problems in algebra inspired by universal algebraic geometry

Let Θ be a variety of algebras. In every variety Θ and every algebra H from Θ one can consider algebraic geometry in Θ over H. We also consider a special categorical invariant K _Θ of this geometry. The classical algebraic geometry deals with the variety Θ = Com-P of all associative and commutative algebras over the ground field of constants P. An algebra H in this setting is an extension of the ground field P. Geometry in groups is related to the varieties Grp and Grp-G, where G is a group of constants. The case Grp-F, where F is a free group, is related to Tarski’s problems devoted to logic of a free group. The described general insight on algebraic geometry in different varieties of algebras inspires some new problems in algebra and algebraic geometry. The problems of such kind determine, to a great extent, the content of universal algebraic geometry. For example, a general and natural problem is: When do algebras H ₁ and H ₂ have the same geometry? Or more specifically, what are the conditions on algebras from a given variety Θ that provide the coincidence of their algebraic geometries? We consider two variants of coincidence: 1) K _Θ(H ₁) and K _Θ(H ₂) are isomorphic; 2) these categories are equivalent. This problem is closely connected with the following general algebraic problem. Let Θ⁰ be the category of all algebras W = W(X) free in Θ, where X is finite. Consider the groups of automorphisms Aunt(Θ⁰) for different varieties Θ and also the groups of autoequivalences of Θ⁰. The problem is to describe these groups for different Θ.     

The equational complexity of Lyndon’s algebra

The equational complexity of Lyndon’s nonfinitely based 7-element algebra lies between n − 4 and 2n + 1. This result is based on a new algebraic proof that Lyndon’s algebra is not finitely based. We prove that Lyndon’s algebra is inherently nonfinitely based relative to a rather rich class of algebras. We also show that the variety generated by Lyndon’s algebra contains subdirectly irreducible algebras of all cardinalities except 0, 1, and 4.     

Algebraic geometry over free metabelian lie algebras. I. U-algebras and universal classes

This paper is the first in a series of three, the object of which is to lay the foundations of algebraic geometry over the free metabelian Lie algebra F. In the current paper, we introduce the notion of a metabelian U-Lie algebra and establish connections between metabelian U-Lie algebras and special matrix Lie algebras. We define the Δ-localization of a metabelian U-Lie algebra A and the direct module extension of the Fitting radical of A and show that these algebras lie in the universal closure of A. __________ Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 9, No. 3, pp. 37–63, 2003.     

Geometrical equivalence of groups

The notion of geometrical equivalence of two algebras, which is basic for this paper, is introduced in [5], [6]. It is motivated in the framework of universal algebraic geometry, in which algebraic varieties are considered in arbitrary varieties of algebras. Universal algebraic geometry (as well as classic algebraic geometry) studies systems of equations and its geometric images, i.e., algebraic varieties, consisting of solutions of equations. Geometrical equivalence of algebras means, in some sense, equal possibilities for solving systems of equations.

In this paper we consider results about geometrical equivalence of algebras, and special attention is paied on groups (abelian and nilpotent).     

Abelian Logic and the Logics of Pointed Lattice-Ordered Varieties

We consider the class of pointed varieties of algebras having a lattice term reduct and we show that each such variety gives rise in a natural way, and according to a regular pattern, to at least three interesting logics. Although the mentioned class includes several logically and algebraically significant examples (e.g. Boolean algebras, MV algebras, Boolean algebras with operators, residuated lattices and their subvarieties, algebras from quantum logic or from depth relevant logic), we consider here in greater detail Abelian ℓ-groups, where such logics respectively correspond to: i) Meyer and Slaney’s Abelian logic [31]; ii) Galli et al.’s logic of equilibrium [21]; iii) a new logic of “preservation of truth degrees”. This paper was written while the second author was a Visiting Professor in the Department of Education at the University of Cagliari. The facilities and assistance provided by the University and by the Department are gratefully acknowledged.     

Very true on CBA fuzzy logic

CBA logic was introduced as a non-associative generalization of the Łukasiewicz many-valued propositional logic. Its algebraic semantic is just the variety of commutative basic algebras. Petr Hájek introduced vt-operators as models for the “very true” connective on fuzzy logics. The aim of the paper is to show possibilities of using vt-operators on commutative basic algebras, especially we show that CBA logic endowed with very true connective is still fuzzy.     

Tableau method for residuated logic

Residuated logic is a generalization of intuitionistic logic, which does not assume the idempotence of the conjunction operator. Such generalized conjunction operators have proved important in expert systems (in the area of Approximate Reasoning) and in some areas of Theoretical Computer Science. Here we generalize the intuitionistic tableau procedure and prove that this generalized tableau method is sound for the semantics (the class of residuated algebras) of residuated propositional calculus (RPC). Since the axioms of RPC are complete for the semantics we may conclude that whenever a formula 0 is tableau provable, it is deducible in RPC. We present two different approaches for constructing residuated algebras which give us countermodels for some formulas φ which are not tableau provable. The first uses the fact that the theory of residuated algebras is equational, to construct quotients of free algebras. The second uses finite algebras. We end by discussing a number of open questions.