| Thread | Last Post | Replies |
|
| The problem of action | 31 Jan 2008 19:39 GMT | 2 |
Action implies a close connection between objects. All persons are entitled to act; but the manner of action of each is different. The actor maybe described as a man; but the term "man" refers to the whole human species, and so a woman is an actor too. But if the term "man"
|
| Godel AND Rosser in one easy step | 31 Jan 2008 16:37 GMT | 1 |
Consider the following five ways to specify the set of prime numbers between 1 and 100: 1. "It is a prime number between 1 and 100." 2. function primes(){ for ($a=2;$a<=100;++$a) { for ($b=2;$b<$a;++$b)
|
| Question regarding limit ordinals and transfinite cardinals. | 31 Jan 2008 12:53 GMT | 17 |
Hi: Have a question regarding limit ordinals and transfinite cardinals. If we use the von Neuman cardinal assignment, every transfinite cardinal is also a limit ordinal. If we hypothetically suppose limit ordinals do not exist, does that mean transfinite
|
| Karma and the method of interpretation: Mind, Intellect and the Soul | 30 Jan 2008 11:23 GMT | 1 |
We should read the text properly according to Krama and analyze words according to correct grammatical rules, when we shall get their real meaning. There are some who would include the mind in the intellect; but it is
|
| What's the weakest metatheory in which Goedel's theorem can be proved? | 29 Jan 2008 23:34 GMT | 5 |
In the silly elsiemelsi threads, the issue has come up of in what metatheory Goedel's theorem can be proved. I've been known to say such things as "Goedel's theorem can be proved in Bounded Arithmetic". I've been having a think about this lately. It seems to me that the
|
| LTL vs. CTL | 29 Jan 2008 17:06 GMT | 4 |
Let f be a CTL formula ang g an LTL formula (both only with future operators). Assume that there is an infinite transition system T (in which each state has a successor) that separates f and g, i.e. T is a model of f, but not of g, or T is a model of g, but not of f. Is there a
|
| Lexicographically ordering subsets of the natural numbers | 29 Jan 2008 11:22 GMT | 2 |
Forgive me is if this is a stupid question. A lexicographic ordering is usually defined on a cross -product of sets. However, it can also be defined on the subsets of a given set. For example, the subsets of {1,2,3} can be lexicographically ordered
|
| Torkel Franzen on truth | 28 Jan 2008 16:46 GMT | 574 |
In "Gödel's theorem" Torkel Franzen disputes that the theorem indicates that the human mind surpasses any computer.
>> ... the mistaken idea that "Gödel's theorem states that in any consistent system which is strong enough to produce simple arithmetic there are formulas which ... |
| unsatisfiable 3SAT puzzle | 28 Jan 2008 16:44 GMT | 4 |
Was puzelling with 3SAT a 3SAT formula is a formula that is an formula in CNF (Conjunctional Normal Form) where every clause consists of 3 terms in disjunction (A v B v ~C) & (~A v ~B vC) & (A v ~B v D) is a example of a 3SAT
|
| Krama and the method of interpretation (Part - 1) | 26 Jan 2008 17:22 GMT | 1 |
The text of the Vedas should be interpreted in accordance with the Krama method of its recitation, and we should assume that there is an intelligent plan underlying the whole, when we shall get the correct meaning of the entire text.
|
| Generalized inductive definition of theorems by Shoenfield | 26 Jan 2008 06:59 GMT | 41 |
On page 4 of Shoenfield's Mathematical Logic the author defines, after some preliminary definitions, theorems of a formal system F as those satisfying two laws: ---
|
| Inequality Question | 25 Jan 2008 23:49 GMT | 1 |
I am solving an inequality A(x) =< 6, where x is a natural number and A(x) is a function of x. For values x = 1, 2, ..., 8 the inequality holds (A(x) is a natural number less than 6). When I put x = 9, 10, ... the left hand side
|
| The proof of the inconsistency of UST | 25 Jan 2008 22:35 GMT | 12 |
In a previous post I build the set theory UST , which has the universal construction schema, you can see it at end of my website after type theory http://zaljohar.tripod.com/index.html#type
|
| Understanding statements without sense | 25 Jan 2008 05:31 GMT | 3 |
AN OBSERVATION: The term 'Dyslexia' or 'dyslexic' gives us an insight into the mechanism of language: -By saying 'I am dyslexic' we establish a communal response or understanding. What we do not do is convey a sense. For no-one can say
|
| Order and Disorder in Sign Strings | 24 Jan 2008 21:44 GMT | 1 |
All sign strings are random, including numbers. Some sign strings are memorable arrays. What makes a sign string memorable is entirely due to the contingencies (and contingencies are random) of human consensus or tradition.
|