Rings and Gödel algebras

In this paper, we study those rings whose semiring of ideals can be given the structure of a Gödel algebra. Such rings are called Gödel rings. We investigate such structures both from an algebraic and a topological point of view. Our main result states that every Gödel ring R is a subdirect product of prime Gödel rings R _i , and the Gödel algebra Id(R) associated to R is subdirectly embeddable as an algebraic lattice into ${{\prod_{i}}Id(R_{i})}$ , where each Id(R _i ) is the algebraic lattice of ideals of R _i that can be equipped with the structure of a Gödel algebra. We see that the mapping associating to each Gödel ring its Gödel algebra of ideals is functorial from the category of Gödel rings with epimorphisms into the full subcategory of frames whose objects are Gödel algebras and whose morphisms are complete epimorphisms.     

Monotone operators on Gödel logic

We consider an extension of Gödel logic by a unary operator that enables the addition of non-negative reals to truth-values. Although its propositional fragment has a simple proof system, first-order validity is Π ₂-hard. We explain the close connection to Scarpellini’s result on Π ₂-hardness of ?ukasiewicz’s logic.     

Geodesic connectedness in Gödel type space-times

In this paper we use a variational approach in order to prove the geodesic connectedness of some Gödel type space-times; moreover direct methods allow to prove the geodesic connectedness of the Gödel Universe. At last a result of geodesic completeness is given.     

On the classification of first order Gödel logics

We characterize the recursively enumerable first order Gödel logics with △ with respect to validity and non-satisfiability. The finitely valued and four infinitely valued Gödel logics with △ are recursively enumerable, not-satisfiability is recursively enumerable if validity is recursively enumerable. This is in contrast to first order Gödel logics without △, where validity is recursively enumerable for finitely valued and two infinitely valued Gödel logics, not-satisfiability is recursively enumerable if validity is recursively enumerable or 0 isolated in the truth value set.     

Gröbner Flags and Gorenstein Algebras

The goal of this paper is to study the Koszul property and the property of having a Gröbner basis of quadrics for classical varieties and algebras as canonical curves, finite sets of points and Artinian Gorenstein algebras with socle in low degree. Our approach is based on the notion of Gröbner flags and Koszul filtrations. The main results are the existence of a Gröbner basis of quadrics for the ideal of the canonical curve whenever it is defined by quadrics, the existence of a Gröbner basis of quadrics for the defining ideal of s 2n points in general linear position in P ⁿ , and the Koszul property of the generic Artinian Gorenstein algebra of socle degree 3.     

Weak Hopf Algebras Corresponding to Borcherds-Cartan Matrices

Let y be a generalized Kac-Moody algebra with an integral Borcherds-Cartan matrix. In this paper, we define a d-type weak quantum generalized Kac-Moody algebra wUq^d（y）, which is a weak Hopf algebra. We also study the highest weight module over the weak quantum algebra wUdq^d（y） and weak A-forms of wUq^d（y）.     

Structures of Not-finitely Graded Lie Algebras Related to Generalized Heisenberg–Virasoro Algebras

In this paper, we study the structure theory of a class of not-finitely graded Lie algebras related to generalized Heisenberg–Virasoro algebras. In particular, the derivation algebras, the automorphism groups and the second cohomology groups of these Lie algebras are determined.     

Pointed Hopf Algebras—from Enveloping Algebras to Quantum Groups and Beyond

A fundamental example of a pointed Hopf algebra is the universal enveloping algebra of a Lie algebra. This example finds its generalization in quantum groups. The class of pointed Hopf algebras is rather extensive and has been the subject of intense study. We recount some of the basic ideas in the development of the theory. A fundamental structure in the general theory is an analog of the enveloping algebra in a certain category, the Nichols algebra.     

A Categorical Approach to Groupoid Frobenius Algebras

In this paper, we show that $\mathcal{G}$ -Frobenius algebras (for $\mathcal{G}$ a finite groupoid) correspond to a particular class of Frobenius objects in the representation category of $D(k[\mathcal{G}])$ , where $D(k[\mathcal{G}])$ is the Drinfeld double of the quantum groupoid $k[\mathcal{G}]$ (Nikshych et al. 2000).     

Invariant Weighted Algebras ℒ p w (G)

The paper is devoted to weighted spaces ? _p ^w (G) on a locally compact group G. If w is a positive measurable function on G, then the space ? _p ^w (G), p ≥ 1, is defined by the relation ? _p ^w (G) = {f: fw ∈ ? _p (G)}. The weights w for which these spaces are algebras with respect to the ordinary convolution are treated. It is shown that, for p > 1, every sigma-compact group admits a weight defining such an algebra. The following criterion is proved (which was known earlier for special cases only): a space ? _p ^w (G) is an algebra if and only if the function w is semimultiplicative. It is proved that the invariance of the space ? _p ^w (G) with respect to translations is a sufficient condition for the existence of an approximate identity in the algebra ? _p ^w (G). It is also shown that, for a nondiscrete group G and for p > 1, no approximate identity of an invariant weighted algebra can be bounded.     

Sigma Functions and Lie Algebras of Schrödinger Operators

Functional Analysis and Its Applications - In a 2004 paper by V. M. Buchstaber and D. V. Leikin, published in “Functional Analysis and Its Applications,” for each $$g > 0$$ , a...     

Ringel–Hall Algebras of Quotient Algebras of Path Algebras

We determine the generating relations for Ringel–Hall algebras associated with quotient algebras of path algebras of Dynkin and tame quivers, and investigate their connection with composition subalgebras.     

Opérateurs de mise en mémoire et traduction de Gödel

Résumé En-calcul, la stratégie de réduction à gauche (appel par nom) a, comme on sait, de bonnes propriétés mathématiques; en particulier, elle termine toujours si on l'applique à un terme normalisable. Mais, avec cette stratégie, l'argument d'une fonction est recalculé à chaque utilisation.Pour éviter ce défaut, on définit la notion «d'opérateur de mise en mémoire» (pour un type de données). SiT est un opérateur de mise en mémoire, pour les entiers par exemple, on remplace l'évaluation, par réduction gauche, de (où est un entier et un -terme quelconque) par celle deT; et celle-ci revient à ramener d'abord à une forme réduite ₀, puis à appliquer à ₀. On a donc ainsi simulé «l'appel par valeur» dans la stratégie de réduction à gauche.Le théorème principal (Corollaire du Théorème 4.1) montre que, dans un 1-calcul typé du second ordre, en utilisant la traduction de Gödel de la logique classique en logique intuitionniste, on peut trouver un type (spécification) très simple pour les opérateurs de mise en mémoire. Il donne donc aussi un moyen d'obtenir ces opérateurs, à savoir de démontrer ce type dans le calcul des prédicats intuitionniste du second ordre.

---

In-calculus, the strategy of leftmost reduction (call-by-name) is known to have good mathematical properties; in particular, it always terminates when applied to a normalizable term. On the other hand, with this strategy, the argument of a function is re-evaluated at each time it is used.To avoid this drawback, we define the notion of storage operator, for each data type. IfT is a storage operator for integers, for example, let us replace the evaluation, by leftmost reduction, of (where is an integer, and any-term) by the evaluation oft. Then, this computation is the same as the following: first compute up to some reduced form ₀, and then apply to ₀. So, we have simulated call-by-value evaluation within the strategy of leftmost reduction.The main theorem of the paper (Corollary of Theorem 4.1) shows that, in a second order-calculus, using Gödel's translation of classical intuitionistic logic, we can find a very simple type (or specification) for storage operators. Thus, it gives a way to get such operators, which is to prove this type in second order intuitionistic predicate calculus.