Explore >> Select a destination
|
You are here 
|
blog.computationalcomplexity.org | ||
| | | | |
aeon.co
|
|
| | | | | Some have thought that logic will one day be completed and all its problems solved. Now we know it is an endless task | |
| | | | |
gowers.wordpress.com
|
|
| | | | | It's been a while since I have written a post in the "somewhat philosophical" category, which is where I put questions like "How can one statement be stronger than an another, equivalent, statement?" This post is about a question that I've intended for a long time to sort out in my mind but have found... | |
| | | | |
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. | |
| | | | |
kevinventullo.com
|
|
| | | Suppose you knew that 9,273,284,218,074,431 was a perfect 7th power. How would you compute the 7th root? This is a long overdue sequel to the previous post, in which the author promised to derive an efficient algorithm for computing exact k-th roots of integers. That is, computing the k-th root of an integer assumed to... | ||
