This concludes my analysis of the hitherto unsolved Eight Problems from Part II in the appendix to Dodgson's Symbolic Logic. Links to all the articles are collected here for easy reference:
Symbolic Logic, Eight Problems from Part II, p. 185 
Don't ask Alice, I don't think she'll know  Symbolic Logic, p. 186 
Don't ask Alice  Part the Second  Symbolic Logic, p. 187 
Don't ask Alice  Part the Third  Symbolic Logic, p. 188 
Don't ask Alice  Part the Fourth  Symbolic Logic, p. 190 
Don't ask Alice  Part the Fifth  Symbolic Logic, p. 191 
Don't ask Alice  Part the Sixth  Symbolic Logic, p. 192 
Don't ask Alice  Part the Seventh  Symbolic Logic, p. 193 
Don't ask Alice  Part the Eighth  Symbolic Logic, p. 194 
And an analysis of an old nursery rhyme not composed by Dodgson: 
Don't ask Alice  Part the Rhyme  Symbolic Logic, p. 194 
The purpose of these articles is to provide the solutions for the first time, and to demonstrate that a relatively simple, yet powerful, boolean algebra is capable of solving these advanced problems easily. In the process, it was discovered that the premise set of
Problem 2 was redundant, that Dodgson begged the question in
Problem 7, and that the
nursery rhyme is not a vallid syllogism. Problems 6 and 8 are, by far, the most difficult ones.
My strange journey to these topics began in 1972 with the acquisition of Laws of Form by G. Spencer Brown. The book is a very difficult read, and I do not recommend it  Brown's literary style is eclectic and obscure, his unusual notation and interpretation are deficient, and he has a decidedly mixed reputation. However, he suggested a very simple method for solving Dodgson's last example sorites (No. 60, p. 124) in Appendix 2, Interpretative Theorem 1, p. 123, which caught my interest and led me to read and reread the book over a period of several years, trying to understand it. [Note: I am an Electrical Engineer with training in Boolean algebra, logic design, and symbolic logic, and still I found the book exceptionally difficult.] Eventually, I reformulated Brown's system into a more conventional notation while retaining Brown's basic structure and axioms/initials. In the process of studying Aristotlean Logic and Syllogism, I discovered the proper form (Syllogistic Theorem below) for Brown's Interpretative Theorem 1 which did not have Brown's difficulties with invalid syllogisms (which he tried unsucessfully to explain away), and the proper form for the Existential Syllogisms (see below), making all 24 valid Aristotlean syllogisms substitutional instances of only two fundamental forms. As mentioned in Problem 2, I first encountered Dodgson's Eight Problems on a blog, applied my newly discovered methods to it, solved it in 30 minutes, asked the blog writer if the answer was correct, and was surprised to learn no one apparently knew the answers to these eight problems.
For those wishing to follow the calculations in the analysis of Dodgson' Eight Problems, I here present that part of my formal system necessary for understanding. There are only two operations: disjunction, indicated by the concatenation of symbols, and complementation, indicated by a postfix tilde "^{~}".
The binary logical operations are defined as:
[X_{1} ∨ X_{2}] = [X_{1} + X_{2}] = X_{1}X_{2} Disjunction (Or)
[X_{1} ∧ X_{2}] = [X_{1} · X_{2}] = (X_{1}^{~}X_{2}^{~})^{~} Conjunction (And)
[X_{1} ⇒ X_{2}] = X_{1}^{~}X_{2} Material Implication
[X_{1}  X_{2}] = (X_{1}^{~}X_{2})^{~} Difference
[X_{1} ≡ X_{2}] = (X_{1}X_{2})^{~}(X_{1}^{~}X_{2}^{~})^{~} Material Equivalence
[X_{1} ^ X_{2}] = [X_{1} ⊕ X_{2}] = (X_{1}^{~}X_{2})^{~}(X_{1}X_{2}^{~})^{~} Exclusive Or
[X_{1}  X_{2}] = X_{1}^{~}X_{2}^{~} Stroke (Nand)

Syllogistic Inference 
For all substitutions of real variables R_{1}, R_{2} and R_{3} :
a) ρ(R_{1}R_{2})^{~}ρ(R_{2}^{~}R_{3})^{~}ρ(R_{1}R_{3}) = U or, written as an implication:
ρ(R_{1}R_{2}) · ρ(R_{2}^{~}R_{3}) ⇒ ρ(R_{1}R_{3}) Hypothetical Syllogism
and, by appropriate substitution and rearrangement, the corollary:
ρ(R_{1}R_{2}) · ρ(R_{2}R_{3})^{~} ⇒ ρ(R_{1}^{~}R_{3})^{~}
b) ρ(R_{1}R_{2})^{~}ρ(R_{2}R_{3})^{~}ρ(R_{1}^{~}R_{3}^{~})^{~}ρ(R_{2}) = U or, written as an implication:
ρ(R_{1}R_{2}) · ρ(R_{2}R_{3}) · ρ(R_{2})^{~} ⇒ ρ(R_{1}^{~}R_{3}^{~})^{~} Existential Syllogism

The propositional operator ρ(...) is defined as ρ(R) = U if R = U, and ρ(R) = U^{~} otherwise, converting the class or set content of the distinction R to a binary propositional value. 
This theorem is the tool which was used in the solution of Dodgson's eight problems (with the exception of Problem 6)  its repeated application eliminates all terms which appear both complemented and uncomplemented. The interested reader should now be able to follow, in detail, the calculations in the eight articles on Dodgson's sorites.
Dodgson had three such rules (Fig. I, II, and III here), but his notation was so peculiar that he failed to realize that his Fig. I and II were equivalent. Brown, on the other hand, failed to explain the Existential Syllogisms at all, and had difficulties with invalid syllogisms because of his defective formulation and interpretation, confusing classes and propositions..