A lot depends on exactly how we move from (ambiguous) English to (unambiguous) logic.
If some Smaugs are Thors and some Thors are Thrains, then some Smaugs are definitely Thrains
The first way we can do it is to treat it as a syllogism.
Some Smaugs are Thors.
Some Thors are Thrains.
Therefore some Smaugs are definitely Thrains.
Syllogisms aren't true or false; they just contain valid or invalid reasoning. In this case, it's invalid: the last line does not follow from the first two. But in colloquial English, it's perfectly reasonable to say that invalid reasoning is false reasoning.
Alternately, we can translate it to a symbolic logical statement:
"Some Smaugs are Thors" would be "∃ a : Smaug(a) ∧ Thor(a)
" - There exists at least one a such that a is both a Smaug and a Thor.
Similarly, "Some Thors are Thrains" is "∃ a : Thor(a) ∧ Thrain(a)
" and "some Smaugs are definitely Thrains" is "∃ a : Smaug(a) ∧ Thrain(a)
"; "definitely" doesn't add anything except emphasis.
So the full statement becomes (∃ a : Smaug(a) ∧ Thor(a)) ∧ (∃ a : Thor(a) ∧ Thrain(a)) ⇒ (∃ a : Smaug(a) ∧ Thrain(a))
.
Again, the last clause doesn't follow from the first two, however the statement as a whole can be trivially true in the degenerate case where either (∃ a : Smaug(a) ∧ Thor(a)) ∧ (∃ a : Thor(a) ∧ Thrain(a))
is always false or (∃ a : Smaug(a) ∧ Thrain(a))
is always true.
Effectively, the statement P ⇒ Q is equivalent to saying that Q is true in all situations where P is true, so as long as P is never true, or as long as Q is always true, no counterexamples can exist.
So the truth value of (∃ a : Smaug(a) ∧ Thor(a)) ∧ (∃ a : Thor(a) ∧ Thrain(a)) ⇒ (∃ a : Smaug(a) ∧ Thrain(a))
is unknown without further information, but we can state the circumstances under which it is true or false. (A specific case in which it would be true is if there exist no Thrains.)
(Which is to say, just in case this hasn't been unreadable enough yet, that ((∃ a : Smaug(a) ∧ Thor(a)) ∧ (∃ a : Thor(a) ∧ Thrain(a)) ⇒ (∃ a : Smaug(a) ∧ Thrain(a))) ⇔ (~[(∃ a : Smaug(a) ∧ Thor(a)) ∧ (∃ a : Thor(a) ∧ Thrain(a))] ∨ [∀ a : Smaug(a) ∧ Thrain(a)])
is necessarily true.)