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
This may be a surprise, but that statement is logically equivalent to:
Originally Posted by jds80021
Some airport does not have a runway for large jets.
is it possible to use a conjunction in this case. Such as:
Although this would be true for airports without large runways - something different.
Thanks Plato, Yes, I can see the logical equivalent , but what is the predicate logic statement and formula?
Originally Posted by bmp05
That tranlates as "All airports have a runway not for large jets."
Is that logically equivalent to “Not every airport has a runway for large jets.”?
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?
If is the predicate “x has a runway for large jets” and
is the predicate “x is an airport”.
Then the translation is .