Tree proofs for syllogistic

This paper presents a tree method for testing the validity of inferences, including syllogisms, in a simple term logic. The method is given in the form of an algorithm and is shown to be sound and complete with respect to the obvious denotational semantics. The primitive logical constants of the system, which is indebted to the logical works of Jevons, Brentano and Lewis Carroll, are term negation, polyadic term conjunction, and functors affirming and denying existence, and use is also made of a metalinguistic concept of formal synonymy. It is indicated briefly how the method may be extended to other systems.To the memory of Jerzy Supecki