## Search found 696 matches

- Sun Apr 21, 2019 2:37 am
- Forum: Logic and Philosophy of Mathematics
- Topic: Eliminating Undecidability and Incompleteness in Formal Systems
- Replies:
**62** - Views:
**601**

### Re: Eliminating Undecidability and Incompleteness in Formal Systems

elif person.surname.lower() == "bachelor": You have to check all possible alternate spellings too, like "batchelor". a young knight serving under another's banner Which illustrates my point that you can't axiomatize natural language. And when Carl Sandburg wrote that the fog creeps in on little cat...

- Sun Apr 21, 2019 1:23 am
- Forum: Logic and Philosophy of Mathematics
- Topic: Eliminating Undecidability and Incompleteness in Formal Systems
- Replies:
**62** - Views:
**601**

### Re: Eliminating Undecidability and Incompleteness in Formal Systems

The trivial counter-example is the married bachelor of sciences. LOL. Good one! But then again I don't believe natural language can be axiomatized. PeteOlcott does, if I understand him correctly. ps -- How about this guy? http://johnbatchelorshow.com/ How critical is the exact spelling of a word? T...

- Sat Apr 20, 2019 11:21 pm
- Forum: Logic and Philosophy of Mathematics
- Topic: Eliminating Undecidability and Incompleteness in Formal Systems
- Replies:
**62** - Views:
**601**

### Re: Eliminating Undecidability and Incompleteness in Formal Systems

You are only giving the same word another meaning, the meanings themselves remain distinct. No, I used the original meanings. A circle is a set of points equidistant from a given point. You agree, right? And a square is a 4-sided quadrilateral with all sides equal and all angles equal. Right? Right...

- Sat Apr 20, 2019 10:55 pm
- Forum: Logic and Philosophy of Mathematics
- Topic: Eliminating Undecidability and Incompleteness in Formal Systems
- Replies:
**62** - Views:
**601**

### Re: Eliminating Undecidability and Incompleteness in Formal Systems

The fact that the same finite string is associated with different meanings does not coherently combine the [geometric object of a circle] with the {geometric object of a square} such that a [geometric square circle] is formed. This is TOTALLY IMPOSSIBLE because they are mutually exclusive classes. ...

- Sat Apr 20, 2019 10:29 pm
- Forum: Logic and Philosophy of Mathematics
- Topic: Eliminating Undecidability and Incompleteness in Formal Systems
- Replies:
**62** - Views:
**601**

### Re: Eliminating Undecidability and Incompleteness in Formal Systems

The unit circle is a square in the taxicab metric. The Wiki page has a picture of it.PeteOlcott wrote: ↑Sat Apr 20, 2019 10:14 pmI tried and tried and tried to make a square circle to test this concept.

https://en.wikipedia.org/wiki/Taxicab_geometry

- Thu Apr 18, 2019 7:02 pm
- Forum: Logic and Philosophy of Mathematics
- Topic: Eliminating Undecidability and Incompleteness in Formal Systems
- Replies:
**62** - Views:
**601**

### Re: Eliminating Undecidability and Incompleteness in Formal Systems

The elementary statements which belong to T are called the elementary theorems of T and said to be true. Right. They are SAID to be true. Like in chess, the fact that the knight can jump over other pieces is SAID to be true. It's not a law of nature. It's colloquially said to be true to get the gam...

- Thu Apr 18, 2019 3:23 am
- Forum: Logic and Philosophy of Mathematics
- Topic: Eliminating Undecidability and Incompleteness in Formal Systems
- Replies:
**62** - Views:
**601**

### Re: Eliminating Undecidability and Incompleteness in Formal Systems

We can bypass all of this whole separate interpretation step and specify the semantic meaning directly in the formal system as relations between and among finite strings. Can you please explain this point to me? How can marks drawn in sand or on paper or in a web browser's edit window have inherent...

- Thu Apr 18, 2019 2:33 am
- Forum: Logic and Philosophy of Mathematics
- Topic: Eliminating Undecidability and Incompleteness in Formal Systems
- Replies:
**62** - Views:
**601**

### Re: Eliminating Undecidability and Incompleteness in Formal Systems

At the purely conceptual level one does not equal zero no matter what you call them. The string of symbols "0 = 1" has no truth value in isolation. When we supply an interpretation, it does in fact acquire a truth value. Some interpretations render it false; and others render it true. I gave an int...

- Thu Apr 18, 2019 1:51 am
- Forum: Logic and Philosophy of Mathematics
- Topic: Eliminating Undecidability and Incompleteness in Formal Systems
- Replies:
**62** - Views:
**601**

### Re: Eliminating Undecidability and Incompleteness in Formal Systems

How did you manage to not understand a word I wrote?

And how did you use the word "semantic" without the slightest clue what it means?

- Thu Apr 18, 2019 1:17 am
- Forum: Logic and Philosophy of Mathematics
- Topic: Eliminating Undecidability and Incompleteness in Formal Systems
- Replies:
**62** - Views:
**601**

### Re: Eliminating Undecidability and Incompleteness in Formal Systems

So essentially you are denying the foundation of all logic that 1 != 0. You are saying that we can not take the fact that 1 does not equal 0 as a given or define it as a truth. I should know better than to get involved here, but can you explain to me why 1 can't equal 0? For example in the zero rin...

- Wed Apr 17, 2019 9:28 pm
- Forum: Logic and Philosophy of Mathematics
- Topic: Paradoxes of Material Implication
- Replies:
**62** - Views:
**538**

- Wed Apr 17, 2019 7:08 am
- Forum: Logic and Philosophy of Mathematics
- Topic: Eliminating Undecidability and Incompleteness in Formal Systems
- Replies:
**62** - Views:
**601**

### Re: Eliminating Undecidability and Incompleteness in Formal Systems

OK, first click on the link and verify that I am right about Curry. There is absolutely nothing on that page that supports your false claim that axioms are regarded as unconditionally true. Evidently you misunderstood something you read 22 years ago and have been obsessively fixated on your error a...

- Wed Apr 17, 2019 5:38 am
- Forum: Logic and Philosophy of Mathematics
- Topic: Eliminating Undecidability and Incompleteness in Formal Systems
- Replies:
**62** - Views:
**601**

### Re: Eliminating Undecidability and Incompleteness in Formal Systems

OK, first click on the link and verify that I am right about Curry. LOL. I did and you're wrong. He makes the exact same point I did; that a sentence has no truth value until you choose an interpretation. He uses the example of "He is a jackass," which is neither true nor false until you define "ja...

- Wed Apr 17, 2019 5:08 am
- Forum: Logic and Philosophy of Mathematics
- Topic: Eliminating Undecidability and Incompleteness in Formal Systems
- Replies:
**62** - Views:
**601**

### Re: Eliminating Undecidability and Incompleteness in Formal Systems

No it is more like I say "I am go to eat some lunch" and people quibble endlessly over what "to" really means, and have to go home when the restaurant closes without even looking at the menu. Axioms aren't true or false. They're simply statements accepted without proof in order to get some axiomati...

- Wed Apr 17, 2019 4:09 am
- Forum: Logic and Philosophy of Mathematics
- Topic: Eliminating Undecidability and Incompleteness in Formal Systems
- Replies:
**62** - Views:
**601**

### Re: Eliminating Undecidability and Incompleteness in Formal Systems

No it is more like I say "I am go to eat some lunch" and people quibble endlessly over what "to" really means, and have to go home when the restaurant closes without even looking at the menu. No. Seriously, dude. When I pointed out to you earlier that examples like set theory with and without the a...