/explore
|
You are here 
|
www.cs.uic.edu | ||
| | | | |
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. | |
| | | | |
www.lesswrong.com
|
|
| | | | | The Löwenheim-Skolem theorem implies, among other things, that any first-order theory whose symbols are countable, and which has an infinite model, h... | |
| | | | |
thehousecarpenter.wordpress.com
|
|
| | | | | NB: I've opted to just get straight to the point with this post rather than attempting to introduce the subject first, so it may be of little interest to readers who aren't already interested in proving the completeness theorem for propositional logic. A PDF version of this document is available here. The key thing I... | |
| | | | |
mikespivey.wordpress.com
|
|
| | | The Riemann zeta function $latex \zeta(s)$ can be expressed as $latex \zeta(s) = \sum_{n=1}^{\infty} \frac{1}{n^s}$, for complex numbers s whose real part is greater than 1. By analytic continuation, $latex \zeta(s)$ can be extended to all complex numbers except where $latex s = 1$. The power sum $latex S_a(M)$ is given by $latex S_a(M) =... | ||
