Alcides, that is, alce, vigor.
"Ten Years Later" by Alexandre Dumas, Pere
Alcides, that is, alce, vigor.
"The Vicomte de Bragelonne" by Alexandre Dumas, Pere
ALCES`TIS, the wife of Admetus, who gave herself up to death to save her husband.
"The Nuttall Encyclopaedia" by Edited by Rev. James Wood
Alce curtsied, but Molly, at whom he had looked, saw him not, because her eyes were full of tears.
"Audrey" by Mary Johnston
He wondered if the one would make up for the other to Arthur Alce or whoever had married her by this time next year.
"Joanna Godden" by Sheila Kaye-Smith
The terrified people assembled, and voted to exile Megacles and all his family, the Alc-mae-on'i-dae.
"The Story of the Greeks" by H. A. Guerber
ALCES'TIS, in Greek mythology, wife of Admetus, King of Thessaly.
"The New Gresham Encyclopedia. Vol. 1 Part 1" by Various
***
Fans cheer as New York Yankees third baseman Alex Rodriguez (center) welcomes first baseman Mark Teixeira (25) back to the dugout during Game 1 of the 2012 ALCS against the Detroit Tigers at Yankee Stadium.
Tigers lead Yankees 3-0 in ALCS.
George Bush , Nolan Ryan tell ALCS Game 1 story.
If you missed Game 1 of the ALCS, these pictures tell you all you need to know.
Michael Young with the American League trophy after the Tigers play the Rangers in Game 6 of the ALCS in Arlington,TX, Saturday, Oct 15, 2011.
A day after Mike Napoli's throwing error led to two unearned runs, Mitch Moreland is back at first base for the Texas Rangers, making his first postseason start since Game 5 of the ALCS and only his second since Game 2 of the ALCS.
But the Lakers star did try and cheer up his friend, Yankees slugger Alex Rodriguez, who was not in the lineup for Game 5 of the ALDS or Game 3 of the ALCS.
John Steptoe, Author, ALC, Editor Mulberry Books $3.95 (1p) ISBN 978-0-688-11855-6.
Tigers notch first win in ALCS.
ALC Develops Open-Source Co-op Database.
Oct 17, 2012 Justin Verlander talks about Detroit's win in Game 3 of the ALCS.
They are preparing the field for play on a cool, cloudy and blustery afternoon for Game 4 of this ALCS.
ALCS preview, Yankees vs Tigers: How the teams match up.
Yankees fall in 3-0 hole against Tigers in ALCS.
His 122- pitch gem gave him his first career postseason complete game, his first postseason shutout, and more importantly, helped his team advance to the ALCS by defeating the A's 6-0.
***
Then aRbRcRd (the semigroup is right simple), aLc and bLd.
On generalized inverses and Green's relations
To see this, consider an A∞ -isomorphism η η : A → Adc := AH ⊕ Alc to the direct sum of the minimal A∞ -algebra AH and the linear contractible Alc .
Potentials of homotopy cyclic $\AI$-algebras
Structures that conﬁne electrons are made by changing the aluminum fraction c during crystal growth, leading to a compositionally graded alloy of the form Alc(r)Ga1−c(r)As, where c varies spatially.
Quantum Phenomena in Low-Dimensional Systems
On these grounds Fiorentini et al. (Fiorentini et al., 2005d) adopt for the abundance in the lower crust of Japan aLC (U ) = (0.85 ± 0.23) ppm.
Geo-neutrinos and Earth's interior
Assume that in (1.7), for each pair 1 ≤ α < β ≤ T the category of complete contractions indexed in Lβ is “worse” than the category of complete contractions indexed in Lα . (Therefore, in particular the “worst” category of complete contractions in (1.7) is the category Pl∈LT alC l (g )).
The decomposition of Global Conformal Invariants I: On a conjecture of Deser and Schwimmer
RHS of the above belong to categories that are all “better” than the category of Pl∈LT alC l (g ).
The decomposition of Global Conformal Invariants I: On a conjecture of Deser and Schwimmer
In the introduction we spoke of a “piece” of Pl∈L alC l , for simplicity. 37The reader should note that this convention was not adopted in and .
The decomposition of Global Conformal Invariants I: On a conjecture of Deser and Schwimmer
The basic Boolean description logic ALC has as its constructors the Boolean connectives and the universal restriction ∀r, which, for a concept C and a binary relation symbol r, gives the concept ∀r.C containing precisely those ob jects x from the underlying domain for which y ∈ C whenever xry .
Undecidability of the unification and admissibility problems for modal and description logics
The language ALC is a notational variant of the basic modal logic K with inﬁnitely many modal operators: propositional variables correspond to atomic concepts, while ∀r.C is interpreted in a relational structure in the same way as 2r (the modal box interpreted by the accessibility relation r).
Undecidability of the unification and admissibility problems for modal and description logics
We refer the reader to [Baader et al. 2003] for precise deﬁnitions and a discussion of syntax and semantics of ALC and other description logics.
Undecidability of the unification and admissibility problems for modal and description logics
Baader and Kuesters [2001] and Baader and Narendran [2001] develop decision procedures for the concept uniﬁcation problem for a number of sub-Boolean DLs, that is, DLs which do not have all the Boolean connectives as constructors and are, therefore, either properly less expressive than ALC or incomparable with ALC .
Undecidability of the unification and admissibility problems for modal and description logics
Boolean DLs, that is, ALC and its extensions, is left as an open research problem.
Undecidability of the unification and admissibility problems for modal and description logics
It should be clear that we have to leave open the decidability status for the concept uniﬁcation problem for ALC as well.
Undecidability of the unification and admissibility problems for modal and description logics
However, we obtain the undecidability of this problem for extensions of ALC with nominals.
Undecidability of the unification and admissibility problems for modal and description logics
The smallest description logic containing ALC and nominals is known as ALCO, and by extending the mapping between modal and description languages indicated above, one can see that ALCO is a straightforward notational variant of the modal logic with inﬁnitely many modal operators and nominals.
Undecidability of the unification and admissibility problems for modal and description logics
***