Timeline for Are inference laws consistent?
Current License: CC BY-SA 3.0
8 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jun 22, 2011 at 18:09 | answer | added | Gyorgy Sereny | timeline score: 1 | |
Jun 22, 2011 at 17:35 | answer | added | Timothy Chow | timeline score: 5 | |
Jun 22, 2011 at 16:32 | answer | added | Joel David Hamkins | timeline score: 5 | |
Jun 22, 2011 at 15:48 | comment | added | Emil Jeřábek | @Ricky: a Hilbert–Frege deduction system is a proof system whose proofs are sequences (or trees, depending on the context) of formulas, where each formula in the sequence is an axiom, or is derived from previous formulas by an inference rule. There are also some conditions on how the inference rules may look like. In practice, Hilbert systems typically consist of a list of axiom schemata together with the rules of modus ponens and, in the first-order case, one or two generalization rules. The OP may have a concrete system in mind, but the choice does not really matter. | |
Jun 22, 2011 at 15:43 | comment | added | Stefan Geschke | What do you mean by the consistency of the rules of inference? That from the empty theory you cannot derive a contradiction? | |
Jun 22, 2011 at 15:42 | answer | added | Emil Jeřábek | timeline score: 8 | |
Jun 22, 2011 at 15:30 | comment | added | user5810 | What is the "Hilbert-Frege deduction system"? | |
Jun 22, 2011 at 15:18 | history | asked | Qfwfq | CC BY-SA 3.0 |