Logic
in [Science]
|
Logic Researchers: Collaborate with over 14,300 Researchers at MyNetResearch.com Dear Researcher, Publishing quality academic papers engages a lot of our waking hours. In addition, many of us work hard to write compelling grant proposals. Research tools have changed a great deal over the years. To hear the Huffington Post put it in the article Science Goes Social, " scientists have so f... 27 Jun 2010 13:55
Computable reals This is from Wikipedia http://en.wikipedia.org/wiki/Computable_reals Although the set of real numbers is uncountable, the set of computable numbers is countable and thus almost all real numbers are not computable. The computable numbers can be counted by assigning a Gödel number to each Turing machine definitio... 6 Jul 2010 08:57
Better late than never Back in August 2008 (!) I claimed that the Church-Turing thesis, despite its name, was a definition of computable function (on N specifically, but given pairing and coding it doesn't matter much). Aatu Koskensilta and Chris Menzel said that it wasn't and I quoted something from Kleene in support of my opinion. I... 1 Jul 2010 00:12
math symbols in unicode collection ⢠Math Symbols in Unicode http://xahlee.org/comp/unicode_math_operators.html plain text version follows. The html version is much better because the symbols are enlarged with css. And with working links. --------------------------------------- Math Symbols in Unicode Xah Lee, 2010-06-26 This page collects math ... 29 Jun 2010 06:22
Wouldn’t It be Cool if These Were Equivalent? It would be cool if the following 3 things were equivalent: 1. |- (allX)P(X) 2. (allX) |- P(X) 3. ~ |- (existsX)~P(X) It would make a lot of things easier, you know? Like if I wanted to know if (allX) |- P(X) then all Id have to do is to look for a proof of (allX)P(X) and if I find one then I know that ... 3 Jul 2010 14:35
Cantor's First Proof Why are there still any questions about infinity? We have been able to prove infinity is inconsistent for millennia: http://en.wikipedia.org/wiki/Zeno's_paradoxes Even Aristotle couldn't refute Zeno's arguments. A more modern proof of this inconsistency: http://arxiv.org/PS_cache/arxiv/pdf/1004/1004.4461v1.pdf... 27 Jun 2010 06:19
Why the Ignorant / Stupid Are the First Responders to Good Math / Science / Tech OPs On Sat, 26 Jun 2010 14:04:23 -0700 (PDT), Cassidy Furlong <cassidyerinkat(a)gmail.com> wrote: well, there's phi of me to one o'you; go figure! 2. �The dumb outnumber the intelligent so the odds are that the first --the duke of oil! Rationale. In addition to political, economic, and mechanical feasibil... 26 Jun 2010 17:25
Herc does not understand any induction schema On Jun 25, 10:37 pm, Transfer Principle <lwal...(a)lausd.net> wrote: Notice that Cooper states that he is using a sort of induction schema, This is breathtakingly IRrelevant. I never heard him say that (he spawns far too many of these for all of us to keep up with all of them), but IF he did, EVERYbody who saw... 26 Jun 2010 14:07
How Can ZFC/PA do much of Math - it Can't Even Prove PA isConsistent (EASY PROOF) Chris Menzel wrote: On Sat, 26 Jun 2010 01:17:17 +0000 (UTC), Chris Menzel <cmenzel(a)remove-this.tamu.edu> said: On Fri, 25 Jun 2010 14:29:26 -0700 (PDT), George Greene <greeneg(a)email.unc.edu> said: ... on the grounds that one can prove "a certain sort of equivalence" between PA and ... 3 Jul 2010 16:47
How Can ZFC/PA do much of Math - it Can't Even Prove PA is Consistent(EASY PROOF) R. Srinivasan wrote: On Jun 26, 1:58 am, Frederick Williams <frederick.willia...(a)tesco.net> wrote: [...] You may wish to know that ZFC with the axiom of infinity replaced by its negation is a model of PA and vice versa. There are two notions of consistency, namely the syntactic and model... 10 Jul 2010 14:55 |