PL Olcott

Analytic TRUE is a constant property of some expressions of language defined in terms of its relation to other expressions of language. An expression ...

There is a great debate about whether an expression of language can be true without a truth maker. Truthmaker Maximalism defended GONZALO RODRIGUEZ-PE...

For formalizing the entire body of human knowledge that can be expressed using language we need this: There seems to be a finite limit to the number o...

A knowledge ontology inheritance hierarchy capable of formalizing the entire body of human knowledge that can be expressed using language need not be ...

It would seem that for every n order or logic there would necessarily be an n+1 order of logic provability predicate for this N order of logic.

Yes, definitely. One metalanguage that can refer to one of more elements at any level within the type hierarchy.

For every nth order logic that can be shown to be incomplete there is an n+1 order logic that completes it.

When we envision the inherent structure of the set of all knowledge that can be expressed using language then we can see that "incompleteness" and "un...

...14 Every epistemological antinomy can likewise be used for a similar undecidability proof... (Gödel 1931:43-44) Epistemological antinomies (AKA sel...

Anything that can't be proved in one order of logical can be proved or refuted in the next. A formal system having every order of logic cannot be inco...

There is always an unprovable expression in one order of logic that is provable in the next order. When all orders of logic are included in the same f...

That a formal system can be defined with a single order of logic seems isomorphic to an encyclopedia defined with only the "C" volume. Of course such ...

It seems that all of the formal systems that these two apply to only have a single order of logic. When we define a formal system that simultaneously ...

It has always seemed to me that Tarski's Undefinability theorem fails when applied to a knowledge ontology inheritance hierarchy (KOIH). It has only o...

I had forgotten that this was also Kripke's analysis. Thanks for reminding me. This same analysis equally applies to an expression of formal language ...

I examine many original sources and then quote Wikipedia as a verified summation of the technical ideas involved. The key point here is that the Tarsk...

The Cyc project converts the words of the users into multiple GUIDs and then from context narrows down to list to the intended meanings.

I always go on the basis that his true predicate struggles with the Liar Paradox. and concludes that no True (Language, Expression) can exists because...

Personally I love Wikipedia it always gives me a succinct clear gist of the whole idea in the first couple of sentences. When used this way it seems t...

Most people can't understand his original proof https://liarparadox.org/Tarski_275_276.pdf so I use the Wikipedia simplification. This is where Tarski...

This correctly recognizes that the Liar Paradox is not a truth bearer. LP = "This sentence is not true." Boolean True(English, LP) is false Boolean Tr...

Is the question associated with every formal proof or lack thereof.

That is a degree of detail that is totally irrelevant to my point so I did not examine it at all. My point is the Tarski anchored his Undefinability T...

I have found that it always succinctly and clearly presents an accurate view of every technical subject that I have ever referenced as measured by its...

Proofs always have the provability question associated with them: Whether or not a proof exists is.

The decision problem form of a formal proof <is> a yes/no question about an input. The formal proof shows the steps of how X is derived from Y in Z. T...

The key issue with decision theory is that deciders are required to correctly answer a self-contradictory (thus incorrect) questions. The key difficul...

My post is about a single coherent way around all of these issues. The key mistake of decision theory is that the notion of decidability requires a de...

When we ask the question: Does a barber shave everyone that does not shave themselves? is allowed to be rejected as an incorrect question then the par...

You just contradicted yourself. I will be more precise. ZFC eliminates the possibility of inconsistency that is caused by allowing sets to be members ...

I have studied these things in my mind continuously for decades. Mathematics uses the term "theory" to mean a set of axioms. Everyone else means a set...

I would estimate that the users use ordinary English and the Cyc lexical analyzer converts words into GUIDs. The parser can determine which of the mul...

That you can hear dogs actually barking with your ears is a sense input from your ears to your mind. Hearing dogs bark is the sense meaning of "dogs b...

I am providing the means for a computer to compute Boolean True(L, x) where L is a language such as English and x is an expression of that language. W...

The whole Idea as I present it is whether or not the computable function Boolean True(String Language, String Expression) can correctly and consistent...

I think that it does a decent job. Here is the most relevant part As always diagonalization shows THAT an expression is unprovable and ignores the rea...

The current model of the actual world (that can be periodically updated) that includes all knowledge of mathematics and logic and is able to perform a...

A 128-bit integer GUID refers to a single unique sense meaning, thus the class living animal {dog} has its own unique GUID. A particular individual {d...

3ab2c577-7d38-4a3c-adc9-c5eff8491282 stands for the living animal dog, this is the same way that the Cyc project identifies unique sense meanings,

Not at all, exactly the opposite. Dogs are animals is absolutely true no matter what. It is true in the same sort of way that we know that 5 is numeri...

Dogs exist as conceptual objects even if all of reality is a mere figment of the imagination. My purpose is to provide the foundation such that Boolea...

ChatGPT is the huge breakthrough that makes populating the Cyc project's knowledge ontology feasible. They spent about 1000 labor years manually encod...

In theory is can process any knowledge known to humankind that can be encoded as text strings.

The original version of CycL was a frame language, but the modern version is not. Rather, it is a declarative language based on classical first-order ...

I have understood that beliefs are a very terrible measure measure of knowledge when I was 16, 56 years ago. When I was 16 I saw this as the woeful fa...

Once a system like Cyc acquires all of the general knowledge of the world then it can disambiguate these things exactly as well as the best human expe...

The database is currently hypothetical as merely the set of finite strings that encode semantic truth. The set of finites strings that encode semantic...

Not at all the system rejects the incorrect use of {Cat} as a type mismatch error or is able to determine from context which {Cat} is being referred t...

Referring to a "Cat Palm" as a "Cat" is a type mismatch error that can be overridden by a temporary idiomatic expression. Just like the Cyc project ea...

At some point everyone must some how be told the semantic meanings of otherwise meaningless finite strings. That "cats are animals" is stipulated to b...