Timeline for FOPL and equational logic
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 22, 2011 at 18:18 | comment | added | Andreas Blass | My answers to your questions would be: (1) Depends on what you mean by "can represent". (2) One doesn't infer logics from other logics. One infers statements from other statements. The Skolem form (a universal formula, which you therefore call equational) of a first-order formula $A$ cannot (in general) be inferred from $A$ in any correct logical system, because it is not (semantically) a consequence of $A$. (3) No; what you call EL is a part of FOPL. (4) Yes; some things provable in FOPL cannot even be formulated in EL. Anything provable in FOPL and statable in EL is provable in EL. | |
| Apr 19, 2011 at 7:24 | history | answered | Patrick Browne | CC BY-SA 3.0 |