133
click to vote
IANDC
2007
15 years 3 months ago
2007
We study words on a finite alphabet avoiding a finite collection of patterns. Given a pattern p in which every letter that occurs in p occurs at least twice, we show that the nu...
117
click to vote
BIRTHDAY
2009
Springer
15 years 10 months ago
2009
Springer
The numerical syllogistic is the extension of the traditional syllogistic with numerical quantifiers of the forms at least C and at most C. It is known that, for the traditional s...