scholarly journals Ideal Dasar Prima Dalam Aljabar Atas Suatu Ring Komutatif

2018 ◽  
Vol 7 (2) ◽  
pp. 79-86
Author(s):  
Khurul Wardati
Keyword(s):  
Commutative Ring ◽  
Free Algebra ◽  
Free Algebras

Definisi ideal dasar dan ideal bebas dalam aljabar bebas atas ring komutatif dengan elemen satuan adalah ekuivalen. Namun, ideal dasar dalam suatu aljabar tak bebas belum tentu merupakan ideal bebas, sementara ideal bebas pasti ideal dasar. Artikel ini membahas beberapa sifat ideal dasar prima dalam aljabar tak bebas atas ring komutatif dengan elemen satuan. [The definitions of basic ideal and free ideal in free algebras over a unital commutative ring are equivalen. However, a basic ideal in the non-free algebra is not neceearily a free ideal, while any free ideal is definitely a basic ideal. This paper will discuss some properties of prime basic ideal in non-free algebras over a unital commutative ring.]

Finitely generated free Heyting algebras

1986 ◽  
Vol 51 (1) ◽  
pp. 152-165 ◽  
Author(s):  
Fabio Bellissima
Keyword(s):  
Free Algebra ◽  
Kripke Semantics ◽  
Heyting Algebras ◽  
Free Algebras ◽  
Finitely Generated ◽  
Algebraic Properties

AbstractThe aim of this paper is to give, using the Kripke semantics for intuitionism, a representation of finitely generated free Heyting algebras. By means of the representation we determine in a constructive way some set of “special elements” of such algebras. Furthermore, we show that many algebraic properties which are satisfied by the free algebra on one generator are not satisfied by free algebras on more than one generator.

Finite Projective Distributive Lattices

1970 ◽  
Vol 13 (1) ◽  
pp. 139-140 ◽  
Author(s):  
G. Grätzer ◽  
B. Wolk
Keyword(s):  
Distributive Lattice ◽  
Free Algebra ◽  
Distributive Lattices ◽  
Free Algebras ◽  
Algebra Ii

The theorem stated below is due to R. Balbes. The present proof is direct; it uses only the following two well-known facts: (i) Let K be a category of algebras, and let free algebras exist in K; then an algebra is projective if and only if it is a retract of a free algebra, (ii) Let F be a free distributive lattice with basis {xi | i ∊ I}; then ∧(xi | i ∊ J0) ≤ ∨(xi | i ∊ J1) implies J0∩J1≠ϕ. Note that (ii) implies (iii): If for J0 ⊆ I, a, b ∊ F, ∧(xi | i ∊ J0)≤a ∨ b, then ∧ (xi | i ∊ J0)≤ a or b.

scholarly journals Computation of minimal homogeneous generating sets and minimal standard bases for ideals of free algebras

2018 ◽  
Vol 25 (3) ◽  
pp. 451-459
Author(s):  
Huishi Li
Keyword(s):  
Free Algebra ◽  
Standard Basis ◽  
Free Algebras ◽  
Grobner Basis ◽  
Finitely Generated ◽  
Generating Set ◽  
Standard Bases ◽  
Generating Sets ◽  
Monomial Ordering ◽  
Minimal Standard

AbstractLet {K\langle X\rangle=K\langle X_{1},\ldots,X_{n}\rangle} be the free algebra generated by {X=\{X_{1},\ldots,X_{n}\}} over a field K. It is shown that, with respect to any weighted {\mathbb{N}}-gradation attached to {K\langle X\rangle}, minimal homogeneous generating sets for finitely generated graded two-sided ideals of {K\langle X\rangle} can be algorithmically computed, and that if an ungraded two-sided ideal I of {K\langle X\rangle} has a finite Gröbner basis {{\mathcal{G}}} with respect to a graded monomial ordering on {K\langle X\rangle}, then a minimal standard basis for I can be computed via computing a minimal homogeneous generating set of the associated graded ideal {\langle\mathbf{LH}(I)\rangle}.

scholarly journals The persistence of universal formulae in free algebras

1987 ◽  
Vol 36 (1) ◽  
pp. 11-17 ◽  
Author(s):  
Anthony M. Gaglione ◽  
Dennis Spellman
Keyword(s):  
Wreath Product ◽  
Free Algebra ◽  
Variety Of Algebras ◽  
Free Algebras ◽  
Product Construction

Gilbert Baumslag, B.H. Neumann, Hanna Neumann, and Peter M. Neumann successfully exploited their concept of discrimination to obtain generating groups of product varieties via the wreath product construction. We have discovered this same underlying concept in a somewhat different context. Specifically, let V be a non-trivial variety of algebras. For each cardinal α let Fα(V) be a V-free algebra of rank α. Then for a fixed cardinal r one has the equivalence of the following two statements:(1) Fr(V) discriminates V. (1*) The Fs(V) satisfy the same universal sentences for all s≥r. Moreover, we have introduced the concept of strong discrimination in such a way that for a fixed finite cardinal r the following two statements are equivalent:(2) Fr(V) strongly discriminates V. (2*) The Fs(V) satisfy the same universal formulas for all s ≥ r whenever elements of Fr(V) are substituted for the unquantified variables. On the surface (2) and (2*) appear to be stronger conditions than (1) and (1*). However, we have shown that for particular varieties (of groups) (2) and (2*) are no stronger than (1) and (1*).

scholarly journals ON FREE IDEALS IN FREE ALGEBRAS OVER A COMMUTATIVE RING

2015 ◽  
Vol 21 (1) ◽  
Author(s):  
Khurul Wardati ◽  
Indah Emilia Wijayanti ◽  
Sri Wahyuni
Keyword(s):  
Commutative Ring ◽  
Free Algebras

scholarly journals Primitive recursion in the abstract

2020 ◽  
Vol 30 (1) ◽  
pp. 33-43
Author(s):  
Daniel Leivant ◽  
Jean-Yves Marion
Keyword(s):  
Computational Complexity ◽  
Free Algebra ◽  
Generic Programming ◽  
Underlying Structure ◽  
Free Algebras ◽  
Primitive Recursion ◽  
Function Definition ◽  
Primitive Recursive

AbstractRecurrence can be used as a function definition schema for any nontrivial free algebra, yielding the same computational complexity in all cases. We show that primitive-recursive computing is in fact independent of free algebras altogether, and can be characterized by a generic programming principle, namely the control of iteration by the depletion of finite components of the underlying structure.

STABLE EQUIVALENCE PROBLEMS FOR FREE ALGEBRAS WITH THE NIELSEN-SCHREIER PROPERTY

2001 ◽  
Vol 11 (06) ◽  
pp. 779-786 ◽  
Author(s):  
ALEXANDER A. MIKHALEV ◽  
JIE-TAI YU
Keyword(s):  
Free Algebra ◽  
Maximal Rank ◽  
Variety Of Algebras ◽  
Free Algebras ◽  
Stable Equivalence ◽  
Two Systems ◽  
Equivalence Problems ◽  
Injective Endomorphism

A variety of algebras is said to be Schreier if any subalgebra of a free algebra of this variety is free in the same variety of algebras. For free algebras of finite ranks of Schreier varieties we prove that if two systems of elements are stably equivalent, then they are equivalent. We define the rank of an endomorphism of a free algebra of a Schreier variety and prove that an injective endomorphism of maximal rank does not change the rank of elements of maximal rank.

Homogeneous elements of free algebras have free idealizers

1985 ◽  
Vol 97 (1) ◽  
pp. 7-26 ◽  
Author(s):  
Warren Dicks
Keyword(s):  
Free Algebra ◽  
Free Algebras

AbstractLet k be a field, X a set, F = k 〈X〉 the free associative k-algebra, and b an element of F that is homogeneous with respect to the grading of F induced by some map . We show that the idealizer of b in F, S = {f∈F|fb∈bF}, is a free algebra.

Varieties generated by languages with poset operations

1997 ◽  
Vol 7 (6) ◽  
pp. 701-713 ◽  
Author(s):  
STEPHEN L. BLOOM ◽  
ZOLTÁN ÉSIK
Keyword(s):  
Free Algebra ◽  
Current Paper ◽  
Free Algebras ◽  
Letter Alphabet ◽  
Union Operation

A V-labelled poset P can induce an operation on the languages on any fixed alphabet, as well as an operation on labelled posets (as noticed by Pratt and Gischer (Pratt 1986; Gischer 1988)). For any collection X of V-labelled posets and any alphabet Σ we obtain an X-algebra ΣX of languages on Σ. We consider the variety Lang(X) generated by these algebras when X is a collection of nonempty ‘traceable posets’. The current paper contains several observations about this variety. First, we use one of the basic results in Bloom and Ésik (1996) to show that a concrete description of the A-generated free algebra in Lang(X) is the X-subalgebra generated by the singletons (labelled a∈A) in the X-algebra of all A-labelled posets. Equipped with an appropriate ordering, these same algebras are the free ordered algebras in the variety Lang(X)[les ] of ordered language X-algebras. Further, if one enriches the language algebras by adding either a binary or infinitary union operation, the free algebras in the resulting variety are described by certain ‘closed’ subsets of the original free algebras. Second, we show that for ‘reasonable sets’ X, the variety Lang(X) has the property that for each n[ges ]2, the n-generated free algebra is a subalgebra of the 1-generated free algebra. Third, knowing the free algebras enables us to show that these varieties are generated by the finite languages on a two-letter alphabet.

scholarly journals Free Algebras Over a Poset in Varieties of Łukasiewicz–Moisil Algebras

2015 ◽  
Vol 48 (3) ◽  
Author(s):  
A. Figallo Orellano ◽  
C. Gallardo
Keyword(s):  
Free Algebra ◽  
General Construction ◽  
Free Algebras ◽  
Finitely Generated ◽  
Finite Poset

AbstractA general construction of the free algebra over a poset in varieties finitely generated is given in [8]. In this paper, we apply this to the varieties of Łukasiewicz-Moisil algebras, giving a detailed description of the free algebra over a finite poset (X, ≤) , Free

Sign in / Sign up

Export Citation Format

Share Document