display all the ideas for this combination of texts
7 ideas
| 16866 | Tracing inference backwards closes in on a small set of axioms and postulates [Frege] |
| Full Idea: We can trace the chains of inference backwards, …and the circle of theorems closes in more and more. ..We must eventually come to an end by arriving at truths can cannot be inferred, …which are the axioms and postulates. | |
| From: Gottlob Frege (Logic in Mathematics [1914], p.204) | |
| A reaction: The rival (more modern) view is that that all theorems are equal in status, and axioms are selected for convenience. |
| 16868 | The essence of mathematics is the kernel of primitive truths on which it rests [Frege] |
| Full Idea: Science must endeavour to make the circle of unprovable primitive truths as small as possible, for the whole of mathematics is contained in this kernel. The essence of mathematics has to be defined by this kernel of truths. | |
| From: Gottlob Frege (Logic in Mathematics [1914], p.204-5) | |
| A reaction: [compressed] I will make use of this thought, by arguing that mathematics may be 'explained' by this kernel. |
| 16871 | A truth can be an axiom in one system and not in another [Frege] |
| Full Idea: It is possible for a truth to be an axiom in one system and not in another. | |
| From: Gottlob Frege (Logic in Mathematics [1914], p.205) | |
| A reaction: Frege aspired to one huge single system, so this is a begrudging concession, one which modern thinkers would probably take for granted. |
| 16870 | Axioms are truths which cannot be doubted, and for which no proof is needed [Frege] |
| Full Idea: The axioms are theorems, but truths for which no proof can be given in our system, and no proof is needed. It follows from this that there are no false axioms, and we cannot accept a thought as an axiom if we are in doubt about its truth. | |
| From: Gottlob Frege (Logic in Mathematics [1914], p.205) | |
| A reaction: He struggles to be as objective as possible, but has to concede that whether we can 'doubt' the axiom is one of the criteria. |
| 10161 | If a sentence holds in every model of a theory, then it is logically derivable from the theory [Feferman/Feferman] |
| Full Idea: Completeness is when, if a sentences holds in every model of a theory, then it is logically derivable from that theory. | |
| From: Feferman / Feferman (Alfred Tarski: life and logic [2004], Int V) |
| 10156 | 'Recursion theory' concerns what can be solved by computing machines [Feferman/Feferman] |
| Full Idea: 'Recursion theory' is the subject of what can and cannot be solved by computing machines | |
| From: Feferman / Feferman (Alfred Tarski: life and logic [2004], Ch.9) | |
| A reaction: This because 'recursion' will grind out a result step-by-step, as long as the steps will 'halt' eventually. |
| 10155 | Both Principia Mathematica and Peano Arithmetic are undecidable [Feferman/Feferman] |
| Full Idea: In 1936 Church showed that Principia Mathematica is undecidable if it is ω-consistent, and a year later Rosser showed that Peano Arithmetic is undecidable, and any consistent extension of it. | |
| From: Feferman / Feferman (Alfred Tarski: life and logic [2004], Int IV) |