Froggy Problem coded using Carroll's Dictionary
This is the symbolic representation of Lewis Carroll's Froggy problem using the Dictionary given by Lewis Carroll. Regrettably the dictionary is the only fragment that remains of Example 30 in Book XIV in Part II of Symbolic Logic and is taken from "Lewis Carroll's Symbolic Logic" Edited by William Warren Bartley, III Published by Harvester Press 1977 ISBN 0-85527-984-2.
I have produced a representation using the subscript notation, explained by Carroll in his book, which you can find here. From that I have produced the Register of Attributes according to the rules set out in Chapter III of Book XII of "Symbolic Logic". This process reveals that there are four Retinends, these being E, a, b, d.
Carroll requires the Complete Conclusion which he explains (Book XIII Chapter I) means stating "all the relations, among the Retinends only, which can be deduced from the Premisses."
01.   ~s ⇒ r
02.   ~m & h ⇒ ~d
03.   E ⇒ a & ~k
04.   l & n ⇒ v
05.   z & m ⇒ ~c
06.   t ⇒ A
07.   ~s & ~n & c ⇒ ~r
08.   z & v ⇒ m
09.   E ⇒ w
10.   v & k & m ⇒ t
11.   E ⇒ s & c & ~n
12.   A ⇒ ~B
13.   k & ~h ⇒ n
14.   r ⇒ c
15.   ~v & ~a & ~h ⇒ l
16.   w & ~t & s ⇒ n
17.   d ⇒ e & k
18.   s & n & ~b ⇒ B
19.   w & e ⇒ z
20.   ~t & ~A & ~r & ~c ⇒ ~n