In this paper, we first advocate for mathematical logic as an indispensable tool for the development of AI. Then we will introduce the concept of intermediate quantifiers and syllogisms with them. Furthermore, we will introduce the graded cube of opposition and suggest extended Peterson’s rules for verification of validity of syllogisms with negations. We will prove that all valid syllogisms with negations verify the extended Peterson’s rules.