Prime avoidance property

نویسندگان

چکیده

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

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

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

منابع مشابه

On the Prime Model Property

Assume T is superstable, Φ(x) is a formula over ∅, Q = Φ(M∗) is countable and KQ = {M : M is countable and Φ(M) = Q}. We investigate models in KQ assuming KQ has the prime model property. We prove some corollaries on the number of models inKQ. We show an example of an ω-stable T and Q with KQ having exactly 3 models. First we fix the general set-up. Throughout, T is a countable complete theory ...

متن کامل

Ela Multi - Agent Avoidance Control Using an M - Matrix Property ∗

In this paper a generalization of avoidance control for multi-agent dynamic systems is presented. Strategies for avoidance control for multiple agents are obtained using individual Liapunov-type functions. The overall system avoidance conditions are guaranteed using a vector Liapunov-type function via an M-matrix property.

متن کامل

Multi-agent avoidance control using an M-matrix property

In this paper a generalization of avoidance control for multi-agent dynamic systems is presented. Strategies for avoidance control for multiple agents are obtained using individual Liapunov-type functions. The overall system avoidance conditions are guaranteed using a vector Liapunov-type function via an M-matrix property.

متن کامل

On graded classical prime and graded prime submodules

‎Let $G$ be a group with identity $e.$ Let $R$ be a $G$-graded‎ ‎commutative ring and $M$ a graded $R$-module‎. ‎In this paper‎, ‎we‎ ‎introduce several results concerning graded classical prime‎ ‎submodules‎. ‎For example‎, ‎we give a characterization of graded‎ ‎classical prime submodules‎. ‎Also‎, ‎the relations between graded‎ ‎classical prime and graded prime submodules of $M$ are studied‎.‎

متن کامل

On the (Im)possibility of Projecting Property in Prime-Order Setting

Projecting bilinear pairings have frequently been used for designing cryptosystems since they were first derived from composite order bilinear groups. There have been only a few studies on the (im)possibility of projecting bilinear pairings. Groth and Sahai showed that projecting bilinear pairings can be achieved in the prime-order group setting. They constructed both projecting asymmetric bili...

متن کامل

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


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

ژورنال

عنوان ژورنال: Journal of Algebra and Its Applications

سال: 2020

ISSN: 0219-4988,1793-6829

DOI: 10.1142/s0219498822500347