نتایج جستجو برای: equivalences

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

Journal: :Topology and its Applications 2000

Journal: :Theoretical Computer Science 2014

Journal: :Information & Software Technology 1997
Daniel K. C. Chan Philip W. Trinder

In order to execute database queries eeciently, they are usually translated into an algebra: a small set of operations together with some equivalences. The operations are implemented very eeciently by the database engine, and the equivalences are used to optimise the query. Since query languages for object-oriented databases are more complex than their relational counterparts , the algebra and ...

2008
Wei Hu

In a recent paper [5], we introduced a classes of derived equivalences called almost ν-stable derived equivalences. The most important property is that an almost ν-stable derived equivalence always induces a stable equivalence of Morita type, which generalizes a well-known result of Rickard: derived-equivalent self-injective algebras are stably equivalent of Morita type. In this paper, we shall...

2012
F. GUILLÉN

In this paper we propose an approach to homotopical algebra where the basic ingredient is a category with two classes of distinguished morphisms: strong and weak equivalences. These data determine the cofibrant objects by an extension property analogous to the classical lifting property of projective modules. We define a Cartan-Eilenberg category as a category with strong and weak equivalences ...

Journal: :J. Log. Algebr. Program. 2010
Roberto Barbuti Andrea Maggiolo-Schettini Paolo Milazzo Simone Tini

The aim of the paper is to give a formal compositional semantics for Spiking Neural P systems (SNP systems) by following the Structural Operational Semantics (SOS) approach. A process algebra is introduced whose terms represent SNP systems. The algebra is equipped with a semantics, given as a labelled transition system. This semantics allows notions of behavioural equivalences over SNP systems ...

2008
Manuel Núñez Luis Llana

We study several process equivalences on a probabilistic process algebra. First, we define an operational semantics. Afterwards we introduce the notion of passing a test with a probability. We consider three families of tests according to the intended behavior of an external observer: Reactive (sequential tests), generative (branching tests), and limited generative (equitable branching tests). ...

2007
Luciano Stramaccia L. STRAMACCIA

The class of shape equivalences for a pair (C,K) of categories is the orthogonal of K, that is Σ = K. Then Σ is internally saturated (Σ = Σ). On the other hand, every internally saturated class of morphisms Σ ⊂ Mor(C), is the class of shape equivalences for some pair (C,K). Moreover, every class of shape equivalences Σ enjoys a calculus of left fractions and such a fact allows one to use techni...

Journal: :Advances in Mathematics 2022

We establish a large class of homotopy coherent Morita-equivalences Dold-Kan type relating diagrams with values in any weakly idempotent complete additive $\infty$-category; the guiding example is an $\infty$-categorical correspondence between $\infty$-categories simplicial objects and connective chain complexes. Our results generalize many known 1-categorical equivalences such as classical cor...

Journal: :Algebraic & Geometric Topology 2022

Our aim is to compare three nerve functors for strict $n$-categories: the Street nerve, cellular and multi-simplicial nerve. We show that these are equivalent in some appropriate sense. In particular, classes of $n$-categorical weak equivalences they define coincide: Thomason equivalences. give two applications this result: first one states a Dyer-Kan-type equivalence equivalence; second one, f...

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

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