| Thread | Last Post | Replies |
|
| Confused about Intuitionistic provability | 31 Jan 2006 20:53 GMT | 22 |
Someone please show me the error(s) in the following proof outline: (1) Following Goedel, in Intuitionistic PA we can define the predicate IPR(s) which is true iff s is the Godel number of a formula which has some proof in Intuitionistic PA.
|
| Is there an answer to this logic riddle? | 31 Jan 2006 14:04 GMT | 13 |
A professor walked into class on Monday and stated, "We will have a suprise exam sometime this week. On the morning of the exam you will not know that the exam will be that day." A logic student reasoned with himself like this: "We can't have
|
| Formal proof of 0<1 for ordered field | 31 Jan 2006 08:44 GMT | 10 |
Making use of advice from readers at sci.math, here is my formal proof of 0<1 for an ordered fields. Thanks to all who replied http://www.dcproof.com/0lessthan1.html This was generated using my DC Proof software, a PC-based proof
|
| CH yet again. | 30 Jan 2006 07:18 GMT | 1 |
>>Now and again I propose the PoV that CH is both true and false, >>depending on how it is worded, there being two non-equivalent ways >>for this in ZF without choice. > Would you say what the two non-equivalent formulas are? |
| Proof of the Kepler Packing Problem, using my proof of 4 Color Mapping as guide | 30 Jan 2006 00:32 GMT | 2 |
Since I recently proved the 4 Color Mapping in one paragraph relying on the nonexistence of 5 adjacent countries, made me realize that the same mechanism of proving 4 Color Mapping is within the Kepler Packing Problem. So I must review and revise my Kepler Packing proof.
|
| Can anyone explain the following disappearances | 29 Jan 2006 21:48 GMT | 1 |
The Vanishing Prisoner - This first account is an excellent case in point because it defies any rational explanation for one simple reason: it occurred in full view of witnesses. The year was 1815 and the
|
| ZFC means? | 29 Jan 2006 16:25 GMT | 145 |
In the area of set theory, 'ZF' stands for Zermelo-Fraenkel... 1) but what does the 'C' standard for, in 'ZFC' which I see quite often? also, 'CH' stands for Continuum Hypothesis...
|
| Poetential infinity | 29 Jan 2006 05:35 GMT | 2 |
MoeBlee writes:
>>the only access we have to the infinite is through the notion of limits. > Limits are of functions. Functions have domains. At least in the most > salient cases, the domains are infinite sets. |
| find a counterexample | 27 Jan 2006 20:22 GMT | 8 |
Find a counterexample to disprove
|/= (forall x phi(x) -> forall x psi(x)) -> forall x (phi(x) -> psi(x)). Does the following example work?
|
| compactness theorem of propositional logic | 27 Jan 2006 12:10 GMT | 1 |
The Compactness Theorem says that, A set of wffs is satisfatiable iff every finite subset is satisfiable, or equivalently, If S |= p then there is a finite S_0 subset S such that S_0 |= p.
|
| a word for the concept "write him off" or "I know thee not" | 27 Jan 2006 00:16 GMT | 13 |
For years now I have on and off wondered whether there is a single word that encompasses the concept of "write him/her off". When we no longer care about a person and who upsets us too much. So we no longer want to see them, hear them, or have anything to do with them. So we say ...
|
| What is known about ZF + cf(kappa) <= omega for all kappa? | 26 Jan 2006 19:28 GMT | 8 |
Kunen states in his An Introduction to Independence Proofs that it's not known whether one can prove in ZF that there is a cardinal with cofinality > omega. Is this still so? What sort of things follow from the assumption that cf(kappa) <= omega for all kappa? (Not assuming
|
| reflexivity and idempotence. | 26 Jan 2006 19:26 GMT | 23 |
R is reflexive if xRx is a tautology. what do we call R if xRx is a contradiction? antireflexive? R is idempotent if xRx is equivalent to x. what do we call it if it is equivalent to not-x? idemimpotent?
|
| logically implication and tautologically implication | 26 Jan 2006 14:22 GMT | 1 |
In Enderson's book(second edition), section 2.4, subsection Tautologies. In the third remark, the author says forall x Px logically implies Pc
|
| first order logic - dummy | 26 Jan 2006 14:18 GMT | 1 |
Suppose x does not occur free in Q. Show that
|= exists x Q <-> Q. I do really have no idea about how to prove this.
|