The odour must not be mistaken for that due to decomposition of sordes on the teeth and gums of a debilitated patient.
"Manual of Surgery" by Alexis Thomson and Alexander Miles
Let our sords be drawn together in the caus of freedom and an outraged country, my own.
"Prince Ricardo of Pantouflia being the adventures of Prince Prigio's son" by Andrew Lang
Being a disciple of Krist i can not take up the sord.
"Incidents of the War: Humorous, Pathetic, and Descriptive" by Alf Burnett
Num sensum, cultumque Dei tenet Anglia clausum, Lumine caeca suo, sorde sepulta suo?
"Biographia Scoticana (Scots Worthies)" by John Howie
Ipsae o te faciunt nitere sordes: Sordes o tibi gratulamur ipsas.
"The Complete Works of Richard Crashaw, Volume II (of 2)" by Richard Crashaw
Masochismus Larvatus est species hujus degenerationis in qua sordes physicae sordibus adduntur moralibus.
"Essays In Pastoral Medicine" by Austin ÓMalley
Sordes collect about the teeth and lips, and the surface exhales a peculiar odor.
"A System of Practical Medicine by American Authors, Vol. I" by Various
Did a whole sord of mallard come over, or were those three stragglers?
"The Drunkard" by Cyril Arthur Edward Ranger Gull
***
Ord and SOrd are unary predicates, <, = and ∈ are binary predicates and G is a two-place function.
The Theory of Sets of Ordinals
To simplify notation, we use lower case greek letters to range over elements of Ord and lower case roman letters to range over elements of SOrd, so, e.g., ∀αφ stands for ∀α(Ord(α) → φ).
The Theory of Sets of Ordinals
Assume SO for the rest of this chapter. α is an ordinal and a is a set will mean that Ord(α) and SOrd(a) respectively.
The Theory of Sets of Ordinals
To distinguish the set of ordinals {α|α < β} from the ordinal β , we interpret the SO-sets of ordinals by the class SOrd := {x ∪ {Ω}|x ⊂ Ord}, i.e., we “mark” the sets of ordinals by a ﬁxed set Ω which is not an ordinal, e.g., Ω := {{
The Theory of Sets of Ordinals
SOrd∗ is the class of ∗-recursively deﬁnable (in short ∗-deﬁnable) sets. N is the class of (minimal) names for ∗-deﬁnable sets.
The Theory of Sets of Ordinals
We say that a class SOrd′ ⊂ SOrd deﬁnes an inner model of SO if S ′ := Ord∪ SOrd′ satisﬁes SO under the obvious interpretation (here we use the symbol S ′ to denote the LSO -substructure with domain S ′ ).
The Theory of Sets of Ordinals
SOrd∗ deﬁnes an inner model which we denote by S ∗ .
The Theory of Sets of Ordinals
We choose a reasonable numbering of all formulas including constants for ordinal numbers and elements of SOrd∗ (represented by their names).
The Theory of Sets of Ordinals
This can be seen quite easily by the absoluteness of the deﬁnition of FUN which implies the absoluteness of all classes I(δ), hence of SOrd∗ which therefore must be included in all inner models.
The Theory of Sets of Ordinals
***