Outer Web | Explore

/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.

You are here		www.lesswrong.com Self-Referential Probabilistic Logic Admits the Payor's Lemma - LessWrong
\|	\|	unstableontology.com Dequantifying first-order theories - Unstable Ontology (note: one may find the embedded LaTeX more readable on LessWrong) The Löwenheim-Skolem theorem implies, among other things, that any first-order theory whose symbols are countable, and which has an infinite model, has a countably infinite model. This means that, in attempting to refer to uncountably infinite structures (such as in set theory), one "may...	4.2 parsecs Travel
\|	\|
\|	\|	blog.sigfpe.com A Neighborhood of Infinity: Self-referential logic via self-referential circuits	2.8 parsecs Travel
\|	\|
\|	\|	pavpanchekha.com What is Modal Logic?	3.4 parsecs Travel
\|	\|
\|	\|	xorshammer.com But Why Is Proof by Contradiction Non-Constructive? - XOR's Hammer We think of a proof as being non-constructive if it proves "There exists an $latex x$ such that $latex P(x)$ without ever actually exhibiting such an $latex x$. If you want to form a system of mathematics where all proofs are constructive, one thing you can do is remove the principle of proof by contradiction:...	25.1 parsecs Travel
\|