|
You are here |
ncatlab.org | ||
| | | | |
unstableontology.com
|
|
| | | | | (note: some readers may find the LaTeX more readable on LessWrong.) In this post I prove a variant of Gödel's completeness theorem. My intention has been to really understand the theorem, so that I am not simply shuffling symbols around, but am actually understanding why it is true. I hope it is helpful for at... | |
| | | | |
www.logicmatters.net
|
|
| | | | | Logical notes and papers Some logical blog pieces Philosophy of maths: a reading list Does mathematics need a philosophy? Philosophical logic: five books from the back catalogue On Frege seeing what is in front of his nose. Begriffsschrift and absolutely unrestricted quantification What Frege didnt tell you Tarski on Truth, a thumbnail sketch Partial functions [] | |
| | | | |
www.umsu.de
|
|
| | | | | [AI summary] The discussion centers on the interpretation of higher-order logic and the role of metaphysical domains. Andrew Bacon argues that higher-order logic doesn't require a metaphysical commitment to domains of objects, properties, or propositions. Instead, he emphasizes the use of stipulative definitions and logical connections between sentences to interpret expressions. He contrasts this with the idea that models must be interpreted in a way that reflects a metaphysical structure of reality. The conversation also touches on the nature of provability operators and their relationship to logical frameworks, highlighting the distinction between formal languages and their interpretations in different contexts. | |
| | | | |
boldandgreen.wordpress.com
|
|
| | | I tried a new background color for my windows as shown here. Instead of the light grey suggested, I picked a very light brown: R 230 Y 222 B 188 (as shown on picture). The best thing is to change the background in Word first and test the color. | ||