# Translate English Sentences into First-Order Logic without quantifiers

I have to translate the following English sentences into First-Order Logic without using quantifiers:

1. Everyone on flight 815 has a story.
2. No one knows what is inside the hatch.
3. Someone on the island isn’t on the flight manifest.


I have tried it, but can't translate without using ∀ and ∃:

1. ∀x fight815(x) → story(x)
OR
¬ ∃x Knows(x, inside hatch)
3. ∃x island(x) Λ ⌐(flight manifest(x))


Is it possible to do it. If not, why?

Refer chapter 8 of Artificial Intelligence: A Modern Approach (3rd edition). Stuart Russell and Peter Norvig, Prentice Hall (2010)

• It's not possible to do it since the sentences which you gave are complex sentences. Words like "Everyone", "All", "Somebody", "At least", etc. are supported only by FOL and not by simple propositional logic! – kiner_shah Feb 24 '17 at 4:55
• Set Theory is probably a workable alternative for expressing this as a formula. – DukeZhou Feb 24 '17 at 21:31
• @kiner_shah Thank so so much. Do you think I have translated it correctly to FOL. I am confused about the second sentence. – New_Coder Feb 25 '17 at 13:31
• @New_Coder, I am not sure about the second FOL sentence. Try forming the sentence: "Everybody knows what's inside the hatch" (It could be something like "for all x, if knows(x) then there exists y such that y is inside the hatch") and then figuring out how to modify the FOL to fit your second sentence. – kiner_shah Feb 26 '17 at 5:29
• @kiner_shah Is this looks better for 2nd sentence: ∀x ⌐(knows(x) → ∃y inside hatch(y)) I have also changed the 1st sentence: ∀x fight815(x) → ∃y story(y) What do you think now? There's an example I found at: uobabylon.edu.iq/eprints/publication_5_29514_1380.pdf No student loves Bill: ¬ ∃ x ( Student(x) ∧ Loves(x, Bill) ) – New_Coder Feb 26 '17 at 14:24