Combining Philosophers
Ideas for Eucleides, Marcus Rossberg and Feferman / Feferman
expand these ideas
|
start again
|
choose
another area for these philosophers
display all the ideas for this combination of philosophers
5 ideas
5. Theory of Logic / K. Features of Logics / 4. Completeness
10161
|
If a sentence holds in every model of a theory, then it is logically derivable from the theory [Feferman/Feferman]
|
10761
|
Completeness can always be achieved by cunning model-design [Rossberg]
|
5. Theory of Logic / K. Features of Logics / 5. Incompleteness
10755
|
A deductive system is only incomplete with respect to a formal semantics [Rossberg]
|
5. Theory of Logic / K. Features of Logics / 7. Decidability
10156
|
'Recursion theory' concerns what can be solved by computing machines [Feferman/Feferman]
|
10155
|
Both Principia Mathematica and Peano Arithmetic are undecidable [Feferman/Feferman]
|