Abstract
Abstract Lewis Carroll has been credited for developing a “Method of Trees” for solving multi-literal sorites problems, which anticipates several aspects of contemporary “tableau” or tree systems of logical proof. In particular, Carroll’s method pioneers the use of branching paths as a means of displaying or illustrating inclusive disjunction. However, rather than focusing on the respects in which Carroll’s tree diagrams resemble contemporary tree systems, I propose to focus instead on significant aspects in which they differ. In particular, I will show how the sorts of multi-literal sorites problems that Carroll’s method of trees is designed to solve are particularly ill-suited for resolution by more contemporary tree methods. I will also show how Carroll likely used something like this method, not only to solve but also to craft some of the trickier logical puzzles for which he is also famous.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.