CĂRȚI ÎN ENGLEZĂ ÎN LEGĂTURĂ CU «DERIVABLY»
Descoperă întrebuințarea
derivably în următoarea selecție bibliografică. Cărți în legătură cu
derivably și extrase din aceasta pentru a furniza contextul de întrebuințare al acestuia în literatura Engleză.
1
Process Algebra: Equational Theories of Communicating Processes
Thus, any term over the signature of BSP(A) that is not a term over the signature
of MPT(A) cannot be derivably equal to a term over the signature of MPT(A).
Observe that closed terms that are derivably equal must refer to the same
process in ...
J. C. M. Baeten, T. Basten, Twan Basten,
2010
2
Instruction Sequences for Computer Science
Each closed SPISA term is derivably equal to a closed SPISA term in first
canonical form. Lemma 2.2. For all closed SPISA terms t, there exists a closed
SPISA term t in first canonicalform such that t = t is derivablefrom the axioms
ofSPISA.
Jan A Bergstra, Cornelis A. Middelburg,
2012
3
Routledge Philosophy Guidebook to Leibniz and the Monadology
And that facet of the material world is derivably capturable in Leibniz's system if
among the monads a world contains there are infinities that have points of view
generating continuities in length, breadth and depth. In this way, from the
existence ...
4
Formal Methods for the Design of Real-Time Systems: ...
The process algebra MPTsrt is a sound axiomatisation of strong bisimilarity on
closed MPTsrt-terms. We define a notion of basic terms. These are useful in the
proofs to come. It turns out that every closed MPTsrt-term is derivably equal to a ...
Marco Bernardo, Flavio Corradini,
2004
5
Handbook of Process Algebra
In this case we will first show that every pair of derivably equal closed IWD(o)-
terms is IWD-bisimilar. This relation between an equational theory and its model
is usually referred to as soundness of the equational theory with respect to the ...
J.A. Bergstra, A. Ponse, S.A. Smolka,
2001
6
Computer Science Logic: 13th International Workshop, CSL'99, ...
Suppose ∃X.T[X] = SigSP in T〈SP,Obs〉 for some basic algebraic specification
SP and set of observable sorts Obs. Then, assuming Param, equality at
existential type is derivably equivalent to observational equivalence, i.e. the
following ...
Jörg Flum, Mario Rodriguez-Artalejo,
1999
7
Mixed motives and their realization in derived categories
Annette Huber. Proof: For a complex K of length 1, the assertions holds by
assumption and derivably strictness (cf. 2.1.2). Let (Ki,K2,K3) be a distinguished
triangle where the assertion holds for Ki and K3. We assume ...
8
An English-Welsh pronouncing dictionary: with an analysis of ...
usrwydd.gwatwaroldeb, gwatwargarwch, gwawdusrwydd, gwawdgarwch
Derivable, di-reif '-á-bl, a. deilliadwy, tarddiadwy, hanadwy, a ellir ei dynn
Derivably, di-rei'-fa-bli, ad. jn ddeffl- iadol, mewn modd deilliadol, yn darddiadol,
yn hanedig, ...
9
Popular and Complete English Dictionary: Exhibiting the ...
Derivably, d^-rl'vA-ble, ttde. By derivation. Derivatc, deVe-vate. «. f. T«> «Wrivo.—
[L. deriealtts,) a. A word derived from another Dkriv ited, de'r'e-va.t&i, p. p.
Derived. Dirivating, dcVfe-rfc-tlng, p. pr. Deriving. Derivation, deir-t-viY'shnn, ...
10
CONCUR '91: 2nd International Conference on Concurrency ...
Let p,q £ BPApSl p ±±q => BPApSl r- p = q We may restrict ourselves to basic
terms, since every term is derivably equal to a basic term and since we have
proved already soundess of BPApSl Proof. We prove that p C q by induction on
the size ...
Jos C.M. Baeten, Jan F. Groote,
1991