Deduction theorem for first order logic

AI Thread Summary
In first-order logic (FOL), if P entails Q and P is closed, it is valid to infer P implies Q. To infer T implies S from T entails S, certain restrictions on the formulas must be considered, particularly regarding their closure. The deduction theorem's validity is contingent on the specific rules of inference employed in the logical system. Understanding these dependencies is crucial for correctly applying the theorem in various contexts. Overall, the deduction theorem in FOL is influenced by the closure of formulas and the inference rules in use.
Jeroslaw
Messages
8
Reaction score
0
If I have P l- Q in FOL and P is closed, can I infer l- P -> Q. IIRC, this is valid as long as P is closed, but my memory is a little hazy. Is that how it works?
 
Mathematics news on Phys.org
Let me elaborate on my question. Say that we have T l- S. In order to infer l- T -> S, what restrictions must be placed on the formulas? How does the deduction theorem for first order logic depend upon the rules of inference that are allowed?
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...
Back
Top