A partial word is a word that is a partial mapping into an alphabet. We prove a variant of Fine and Wilf's theorem for partial words, and give extensions of some general combinatorial properties of words.
Isotropies of Partial Connections and a Theorem of Morimoto
✍ Scribed by H.R. Fischer; R.J. Fisher
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 371 KB
- Volume
- 174
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract Connections between partially ordered connectives and Henkin quantifiers are considered. It is proved that the logic with all partially ordered connectives and the logic with all Henkin quantifiers coincide. This implies that the hierarchy of partially ordered connectives is strongly hi
## Abstract In 1966, Chartrand proved that if the minimum degree of a graph is at least the floor of half the number of nodes, then its edge‐connectivity equals its minimum degree. A more discriminating notion of edge‐connectivity is introduced, called the __k__‐component order edge‐connectivity, w