display all the ideas for this combination of philosophers
5 ideas
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) |
10761 | Completeness can always be achieved by cunning model-design [Rossberg] |
Full Idea: All that should be required to get a semantics relative to which a given deductive system is complete is a sufficiently cunning model-theorist. | |
From: Marcus Rossberg (First-order Logic, 2nd-order, Completeness [2004], §5) |
10755 | A deductive system is only incomplete with respect to a formal semantics [Rossberg] |
Full Idea: No deductive system is semantically incomplete in and of itself; rather a deductive system is incomplete with respect to a specified formal semantics. | |
From: Marcus Rossberg (First-order Logic, 2nd-order, Completeness [2004], §3) | |
A reaction: This important point indicates that a system might be complete with one semantics and incomplete with another. E.g. second-order logic can be made complete by employing a 'Henkin semantics'. |
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) |