نتایج جستجو برای: strongly blended dually quasi

تعداد نتایج: 313972  

Journal: :Order 2011
Guram Bezhanishvili Ramon Jansana

We introduce generalized Priestley quasi-orders and show that subalgebras of bounded distributive meet-semilattices are dually characterized by means of generalized Priestley quasi-orders. This generalizes the well-known characterization of subalgebras of bounded distributive lattices by means of Priestley quasiorders (Adams, Algebra Univers 3:216–228, 1973; Cignoli et al., Order 8(3):299– 315,...

Journal: :categories and general algebraic structures with applications 2014
mohammad roueentan majid ershad

in this paper $s$ is a monoid with a left zero and $a_s$ (or $a$) is a unitary right $s$-act. it is shown that a monoid $s$ is right perfect (semiperfect) if and only if every (finitely generated) strongly flat right $s$-act is quasi-projective. also it is shown that if every right $s$-act has a unique zero element, then the existence of a quasi-projective cover for each right act implies that ...

Introduction: Despite evidences revealing the development of electronic education in Mashhad University of Medical Sciences, there is not much information about productivity and probable challenges in virtual (online) education. This study investigates the viewpoints of bachelor science students toward advantages and disadvantages of blended online with face to face education method. Methods: ...

2007
Rafail V. Abramov Andrew J. Majda

In a recent paper the authors developed and tested two novel computational algorithms for predicting the mean linear response of a chaotic dynamical system to small changes in external forcing via the fluctuation-dissipation theorem (FDT): the short-time FDT (ST-FDT), and the hybrid Axiom A FDT (hA-FDT). Unlike the earlier work in developing fluctuation-dissipation theorem-type computational st...

Journal: :Discrete Mathematics 2013
Mei Lu Yubao Guo Michel Surmacs

A semicomplete multipartite or semicomplete c-partite digraph D is a biorientation of a c-partite graph. A semicomplete multipartite digraph D is called strongly quasiHamiltonian-connected, if for any two distinct vertices x and y of D, there is a path P from x to y such that P contains at least one vertex from each partite set of D. In this paper we show that every 4-strong semicomplete multip...

2004
Marcus Bluhm Gerhard Soff

The successful quasi-particle model is compared with recent lattice data of the coefficients in the Taylor series expansion of the excess pressure at finite temperature and baryon density. A chain of approximations, starting from QCD to arrive at the model expressions for the entropy density, is presented.

2002
Salvador Romaguera Michel Schellekens

We introduce and study the notions of a strongly completable and of a strongly complete quasi-uniform space. A quasi-uniform space (X,U) is said to be strongly complete if every Cauchy filter (in the sense of Sieber and Pervin) clusters in the uniform space (X,U ∨ U−1). An interesting motivation for the study of this notion of completeness is the fact, proved here, that the quasi-uniformity ind...

2009
TAREK SAYED AHMED

Let α be an infinite ordinal. There are non-isomorphic representable algebras of dimension α each of which is a generating subreduct of the same β dimensional algebra. Dually there exists a representable algebra A of dimension , α such that A is a generating subreduct of B and , B′ however, B and B′ are not isomorphic. The above was proven to hold for infinite dimensional cylindric algebras (CA...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید