Deduction theorem for first order logic

Jeroslaw · Mar 13, 2008

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?

Jeroslaw · Mar 14, 2008

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?

Deduction theorem for first order logic

Graduate Expected numbers of cards of a last color remaining

Undergrad The problem of points

Graduate Probability puzzle

Undergrad The countability paradox of computable numbers

Undergrad How does axiom of foundation prevent infinite sequence of elements?

Insights Revisiting the Velocity-Time Function

Insights Remote Operated Gate Control System

Insights AI Enriched Problem Solving

Insights Thinking Outside The Box Versus Knowing What’s In The Box

Insights Why Entangled Photon-Polarization Qubits Violate Bell’s Inequality

Insights Quantum Entanglement is a Kinematic Fact, not a Dynamical Effect

Deduction theorem for first order logic

Similar threads