Results 1  10
of
874,890
THE ACCESSIBILITY RANK OF WEAK EQUIVALENCES
"... Abstract. We study the accessibility properties of trivial cofibrations and weak equivalences in a combinatorial model category and prove an estimate for the accessibility rank of weak equivalences. In particular, we show that the class of weak equivalences between simplicial sets is finitely acces ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. We study the accessibility properties of trivial cofibrations and weak equivalences in a combinatorial model category and prove an estimate for the accessibility rank of weak equivalences. In particular, we show that the class of weak equivalences between simplicial sets is finitely
Weak equivalence for constraint sets
 In Proc. 12th Int. Conf. on Artificial Intelligence (IJCAI
, 1991
"... We describe a generalization of equivalence between constraint sets, called weak equivalence. This new equivalence relation takes into account that not all variables have the same function in a constraint set and therefore distinguishes between restriction variables and intermediate variables. We ex ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We describe a generalization of equivalence between constraint sets, called weak equivalence. This new equivalence relation takes into account that not all variables have the same function in a constraint set and therefore distinguishes between restriction variables and intermediate variables. We
Weakly Equivalent Arrays
"... The (extensional) theory of arrays is widely used to model systems. Hence, efficient decision procedures are needed to model check such systems. Current decision procedures for the theory of arrays saturate the readoverwrite and extensionality axioms originally proposed by McCarthy. Various filte ..."
Abstract
 Add to MetaCart
filters are used to limit the number of axiom instantiations while preserving completeness. We present an algorithm that lazily instantiates lemmas based on weak equivalence classes. These lemmas are easier to interpolate as they only contain existing terms. We formally define weak equivalence and show
WEAK EQUIVALENCES OF SIMPLICIAL PRESHEAVES
"... Abstract. Weak equivalences of simplicial presheaves are usually defined in terms of sheaves of homotopy groups. We give another characterization using relativehomotopyliftings, and develop the tools necessary to prove that this agrees with the usual definition. From our lifting criteria we are ab ..."
Abstract
 Add to MetaCart
Abstract. Weak equivalences of simplicial presheaves are usually defined in terms of sheaves of homotopy groups. We give another characterization using relativehomotopyliftings, and develop the tools necessary to prove that this agrees with the usual definition. From our lifting criteria we
Invariants of weak equivalence in primitive matrices
 Ergod. Th. & Dynam. Sys
"... Abstract. Weak equivalence of primitive matrices is a known invariant arising naturally from the study of inverse limit spaces. Several new invariants for weak equivalence are described. It is proved that a positive dimension group isomorphism is a complete invariant for weak equivalence. For the tr ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. Weak equivalence of primitive matrices is a known invariant arising naturally from the study of inverse limit spaces. Several new invariants for weak equivalence are described. It is proved that a positive dimension group isomorphism is a complete invariant for weak equivalence
Weak Equivalences in Psicalculi
"... Psicalculi extend the picalculus with nominal datatypes to represent data, communication channels, and logics for facts and conditions. This general framework admits highly expressive formalisms such as concurrent higherorder constraints and advanced cryptographic primitives. We here establish th ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
demonstrate that the complications mainly stem from psicalculi where the associated logic does not satisfy weakening. We prove that weak bisimulation equivalence has the expected algebraic properties and that the corresponding observation congruence is preserved by all operators. These proofs have been
WEAKLY EQUIVALENT EXTENSIONS OF TOPOLOGIES
"... Let (X,T) be a topological space. An extension of T is a topology T ' for X such that T ' ~ T. If a is a collec tion of subsets of X, then the extension of T by a, denoted by T(a), is the topology for X having T U a as a subbase. ..."
Abstract
 Add to MetaCart
Let (X,T) be a topological space. An extension of T is a topology T ' for X such that T ' ~ T. If a is a collec tion of subsets of X, then the extension of T by a, denoted by T(a), is the topology for X having T U a as a subbase.
Metric fluctuations and the Weak Equivalence Principle
, 2008
"... We describe space–time fluctuations by means of small fluctuations of the metric on a given background metric. From a minimally coupled Klein–Gordon equation we obtain within a weakfield approximation up to second order and an averaging procedure over a finite space–time scale given by the quantum p ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
and gives an existence proof for the violation of the weak equivalence principle and, in general, to a violation of Lorentz invariance. 1
7 Weak Equivalence in Propositional Calculus
"... Abstract. The main purpose of this paper is to present a new algorithm (NEWSAT) for deciding the (un)satisfiability of propositional formulae. It is based on a somehow dual (versus resolution) idea: we succesively add complementary literals to already obtained clauses instead of solving them. Hence ..."
Abstract
 Add to MetaCart
. Hence, the unsatisfiability of a formula is detected by reaching “a complete set of maximal clauses ” instead of reaching the empty clause. Only weak (semantical) equivalence is preserved. In fact, although the strong equivalence is not preserved, we have something more than a simple weak equivalence
Quasiweak equivalences in complicial exact categories
, 2010
"... We introduce a notion of quasiweak equivalences associated with weakequivalences in an exact category. It gives us a delooping for (idempotent complete) exact categories and a condition that the negative Kgroup of an exact category becomes trivial. ..."
Abstract
 Add to MetaCart
We introduce a notion of quasiweak equivalences associated with weakequivalences in an exact category. It gives us a delooping for (idempotent complete) exact categories and a condition that the negative Kgroup of an exact category becomes trivial.
Results 1  10
of
874,890