The Boolean ring universal over a meet semilattice

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The canonical topology on a meet-semilattice

Considering the lattice of properties of a physical system, it has been argued elsewhere that – to build a calculus of propositions having a well-behaved notion of disjunction (and implication) – one should consider a very particular frame completion of this lattice. We show that the pertinent frame completion is obtained as sheafification of the presheaves on the given meet-semilattice with re...

متن کامل

The Universal Semilattice Compactification of a Semigroup

The universal abelian, band, and semilattice compactifications of a semitopological semigroup are characterized in terms of three function algebras. Some relationships among these function algebras and some well-known ones, from the universal compactification point of view, are also discussed.

متن کامل

The Monomial Ideal of a Finite Meet-semilattice

Squarefree monomial ideals arising from finite meet-semilattices and their free resolutions are studied. For the squarefree monomial ideals corresponding to poset ideals in a distributive lattice the Alexander dual is computed.

متن کامل

On Skew Cyclic Codes over a Finite Ring

In this paper, we classify the skew cyclic codes over Fp + vF_p + v^2F_p, where p is a prime number and v^3 = v. Each skew cyclic code is a F_p+vF_p+v^2F_p-submodule of the (F_p+vF_p+v^2F_p)[x;alpha], where v^3 = v and alpha(v) = -v. Also, we give an explicit forms for the generator of these codes. Moreover, an algorithm of encoding and decoding for these codes is presented.

متن کامل

Universal Boolean Systems

Boolean interaction systems and hard interaction systems define nets of interacting cells. They are based on the same local interaction principle between two cells as interaction nets but do not allow that the structure of nets may evolve. With boolean nets, it is not possible to create or destroy cells or links between existing cells. They are very similar to hardware circuits but based on an ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Australian Mathematical Society

سال: 1977

ISSN: 1446-7887,1446-8107

DOI: 10.1017/s1446788700019558