2 search results - page 1 / 1 » On the refined lecture hall theorem |
128
click to vote
DM
2002
15 years 4 months ago
2002
Abstract. A lecture hall partition of length n is a sequence (1, 2, . . . , n) of nonnegative integers satisfying 0 1/1
168
Voted
TPHOL
1997
IEEE
15 years 8 months ago
1997
IEEE
This note lists references which address –in some way or another– the problems relating to formal manipulation of logical expressions where terms can fail to denote. Reference...