/explore
|
You are here 
|
reasonableapproximation.net | ||
| | | | |
lawrencecpaulson.github.io
|
|
| | | | | ||
| | | | |
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. | |
| | | | |
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 | |
| | | | |
bartoszmilewski.com
|
|
| | | Categories for Programmers. Previously Products and Coproducts. See the Table of Contents. We've seen two basic ways of combining types: using a product and a coproduct. It turns out that a lot of data structures in everyday programming can be built using just these two mechanisms. This fact has important practical consequences. Many properties of... | ||
