display all the ideas for this combination of texts
3 ideas
10161 | If a sentence holds in every model of a theory, then it is logically derivable from the theory [Feferman/Feferman] |
10156 | 'Recursion theory' concerns what can be solved by computing machines [Feferman/Feferman] |
10155 | Both Principia Mathematica and Peano Arithmetic are undecidable [Feferman/Feferman] |