Explore >> Select a destination


You are here

www.umsu.de
| | www.logicmatters.net
3.8 parsecs away

Travel
| | Yuri Manin who died last year was a seriously distinguished mathematician, being - for instance - one of the first recipients of the Schock Prize for mathematics. His interests ranged very widely, from algebra and topology to quantum field theory. So A Course in Mathematical Logic for Mathematicians (1977 translation, Springer) is written by an [...]
| | xorshammer.com
4.4 parsecs away

Travel
| | Let $latex \mathrm{PA}$ be Peano Arithmetic. Gödel's Second Incompleteness Theorem says that no consistent theory $latex T$ extending $latex \mathrm{PA}$ can prove its own consistency. (I'll write $latex \mathrm{Con}(T)$ for the statement asserting $latex T$'s consistency; more on this later.) In particular, $latex \mathrm{PA} + \mathrm{Con}(\mathrm{PA})$ is stronger than $latex \mathrm{PA}$. But certainly, given that...
| | thehousecarpenter.wordpress.com
5.3 parsecs away

Travel
| | 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...
| | inquiryintoinquiry.com
20.4 parsecs away

Travel
| Introduction The praeclarum theorema, or splendid theorem, is a theorem of propositional calculus noted and named by G.W.Leibniz, who stated and proved it in the following manner. If a is b and d is c, then ad will be bc. This is a fine theorem, which is proved in this way: a is b, therefore...