I had Discrete math in my undergrad CompSci program, I am now in grad school and having to use it again and I am a bit rusty: Need help with verifying some predicate logic translations.
English: Notevery airport has a runway for large jets.
hasrunwayfor(x,j,l): true if airport x has a runway for jet j, that is large l, false otherwise
My Formula: ∃x:Airport|∀j:Jet|Runway(j,l)
Do my translation and formula look correct?
Help is greatly appreciated. Thanks in advance
Plato. There should be a computer program for this- and there is isn't there? Prolog or something?
Anyway, I was way off the mark... so what about: "Some airports have a runway not for large jets?"
can this type of statement (?) always be replaced by a simpler statement?