| Thread | Last Post | Replies |
|
| Logic in USSR | 31 Jul 2006 22:55 GMT | 32 |
As we all know, it was comrade Stalin's brilliant and objective article _Marxism and linguistics_ in 1951 (IIRC) that established conclusively that language is not a part of the superstructure, and hence formal logic is a legitimate non-ideological discipline. I'm wondering ...
|
| Some ambiguities about the Busy Beaver sequence. | 31 Jul 2006 00:15 GMT | 7 |
Hello everyone. There are some things that are unclear to me about the fascinating Busy Beaver sequence. I will explain my reasoning, and please correct me if I made any mistake.
|
| WORDS THAT DESTROYED RATIONALITY IN SCIENCE | 30 Jul 2006 18:13 GMT | 2 |
http://web.lemoyne.edu/~giunta/Clausius.html http://www.mdpi.org/lin/clausius/clausius.htm Rudolf Clausius, Ueber die bewegende Kraft der Wärme, Annalen der Physik und Chemie, 79, 368-97, 500-24 (1850):
|
| Set theory ZFC is inconsistent. | 30 Jul 2006 09:11 GMT | 161 |
Theorem.Set theory ZFC is inconsistent. The proof of it the unexpected fact, leans on that standard assumption (SA), that: set of all formulas of the canonical set theory ZFC is an infinite countable ZFC-set.
|
| The mathematicians Magic Hat. | 30 Jul 2006 04:00 GMT | 6 |
Nothing can be 'too numerous to count'. Either it is counted or it is not. There is no 'numerous' middle road. Take as example the infinite series, e.g. 1,2,3,4, ... Here, the injunction "and so on", or, " ..." , as it is popularly
|
| Definablity of substructures and undecidable theories | 29 Jul 2006 20:02 GMT | 3 |
Pleese help me prove the following: Let S be a structure, while S* is a substructure of S, that's definable in S by a first order formula. Prove that if the theory of S* is undecidable, then the theory of S is undecidable as well.
|
| Arbitrary subsets of omega | 29 Jul 2006 13:40 GMT | 7 |
Can someone give me some advice on this problem. I have no ideas on how to even start it. Let A_n be arbitrary subsets of omega for every n in omega. Prove that there is some subset B of omega such that A_n is turing reducible to B
|
| :: every belief is a nation without borders :: | 29 Jul 2006 13:26 GMT | 7 |
dans sci.logic,soc.history.science <KI2xg.24060$cO7.9846@reader1.news.jippii.net> aatu perlenspiel: As we all know, it was comrade Stalin's
|
| OPEN Invitation | 29 Jul 2006 05:34 GMT | 1 |
Hi how r u ....I hope u like our community.... there's real fun so came & post there ..... This is my web ...http://chatandforums.net
|
| Linear Ordering vs Well Ordering | 27 Jul 2006 17:07 GMT | 8 |
Could someone help me understand this problem: Let L be a language containing (at least) a binary predicate symbol <. Let [gothic A] be an L-structure such that < is a linear order of A. Prove that [gothic A} has an elementary extension [gothic B] such that
|
| Elementary substructures. | 27 Jul 2006 14:06 GMT | 15 |
Is (R \ 0, <) an elementary substructure of (R, <), where R represents the reals? I think so for the mere purpose that (Q \ 0, <) is an elementary substructure of (Q, <), where Q represents the rationals. So shouldn't
|
| Curing ulcers, IBS, CROHNS, DEPRESSION, ANXIETY, SCHIZOPHRENIA, CANCER...? | 27 Jul 2006 12:01 GMT | 3 |
Curing ulcers, IBS, CROHNS, DEPRESSION, ANXIETY, SCHIZOPHRENIA, CANCER...? I heard about your mothers suffering from Ulcers and bring forth the following logical possibility that relates to a great many other
|
| POSTSCIENTISM AND 2+2=5 | 27 Jul 2006 10:52 GMT | 2 |
Pentcho Valev wrote:
> In a sense, Einstein's theory is Newton's theory where a true premise - > the speed of light does depend on the speed of the light source - has > been temporarily replaced with its negation - the speed of light is |
| A universal introduction rule | 27 Jul 2006 10:07 GMT | 21 |
Dirk van Dalen's book Logic and Structure (4th edition) p.188 gives "a slightly changed AI-rule" (where A is the universal quantifier), in words the rule says: from a formula F you can derive Ax F[x/y], where y does not occur free in F or in a hypothesis of the derivation of F, and ...
|
| Question on Conservative Extensions | 27 Jul 2006 03:46 GMT | 5 |
Let L and L' be languages such that L' = L U {c}, where c is a constant symbol not in L. What is the difference between these two statements: (1) T' is a finitely axiomatizable theory of L', and T = T' [intersect]
|