Re: Transforming formal proofs into the sound deductive logicalinference model

By peteolcott on Thu Apr 25 14:36:19 2019

Latest reply by =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?= on Thu Apr 25 14:40:54 2019

Formal specification of the semantic notion of Truth

By peteolcott on Wed Apr 24 21:57:34 2019

Latest reply by peteolcott on Wed Apr 24 21:57:34 2019

=?UTF-8?Q?EXTENDED_DEADLINE_FOR_ABSTRACT_SUBMISSIONS_Conferenc?==?UTF-8?Q?e_Kurt_Goedel=E2=80=99s_Legacy=3A_Does_Future_lie_in_the_Past=3F=2C_July?==?UTF-8?Q?_25=2D27=2C_2019=2C_VIENNA?=

By vcla.tuwien on Wed Apr 24 01:34:33 2019

Latest reply by vcla.tuwien on Wed Apr 24 01:34:33 2019

=?UTF-8?Q?G=c3=b6del=27s_Incompleteness_is_refuted_because_math_its?==?UTF-8?Q?elf_had_a_math_error?=

By peteolcott on Wed Apr 24 00:45:13 2019

Latest reply by peteolcott on Wed Apr 24 00:45:13 2019

Re: Eliminating Undecidability from Formal Systems

By peteolcott on Sat Apr 13 00:46:49 2019

Latest reply by temakoutera62 on Tue Apr 23 06:27:05 2019

Was Tarski wrong or not?

By peteolcott on Sat Apr 13 12:01:50 2019

Latest reply by temakoutera62 on Tue Apr 23 06:24:06 2019

Was Tarski Wrong or Not? (v2)

By peteolcott on Sun Apr 14 09:06:41 2019

Latest reply by temakoutera62 on Tue Apr 23 06:23:50 2019

Was Tarski Wrong or Not? (v3)

By peteolcott on Mon Apr 15 00:16:06 2019

Latest reply by temakoutera62 on Tue Apr 23 06:23:39 2019

Was Tarski Wrong or Not? (v4)

By peteolcott on Mon Apr 15 10:55:50 2019

Latest reply by temakoutera62 on Tue Apr 23 06:23:27 2019

Eliminating incompleteness and undecidability in formal systems

By peteolcott on Mon Apr 15 15:11:13 2019

Latest reply by temakoutera62 on Tue Apr 23 06:23:14 2019

Eliminating Undecidability and Incompleteness in Formal SystemsVersion(5)

By peteolcott on Mon Apr 15 18:07:49 2019

Latest reply by temakoutera62 on Tue Apr 23 06:23:00 2019

=?UTF-8?Q?Tarski_and_G=c3=b6del_really_were_Wrong?=

By peteolcott on Mon Apr 15 14:09:49 2019

Latest reply by temakoutera62 on Tue Apr 23 06:22:44 2019

=?UTF-8?Q?Tarski_and_G=c3=b6del_really_were_Wrong_Version=283=29?=

By peteolcott on Thu Apr 18 22:33:13 2019

Latest reply by temakoutera62 on Tue Apr 23 06:22:22 2019

=?UTF-8?Q?Philosophy_of_Logic_=e2=80=93_Reexamining_the_Formalized_?==?UTF-8?Q?Notion_of_Truth?=

By peteolcott on Fri Apr 19 13:20:45 2019

Latest reply by temakoutera62 on Tue Apr 23 06:22:11 2019

Eliminating Undecidability and Incompleteness in Formal Systems[---Final Version--- ???]

By peteolcott on Sat Apr 20 14:28:32 2019

Latest reply by temakoutera62 on Tue Apr 23 06:21:58 2019

In other news...

By DV on Sun Apr 21 15:50:07 2019

Latest reply by DV on Sun Apr 21 15:50:07 2019

Proof that P != NP and P = NP are formally independent.

By DV on Sun Apr 21 14:17:31 2019

Latest reply by DV on Sun Apr 21 14:17:31 2019

Why do I have to complain very vociferously to get any sort ofprotection or help?

By DV on Wed Apr 3 15:30:03 2019

Latest reply by DV on Wed Apr 17 15:25:43 2019

A proof that ZFC is inconsistent.

By DV on Sat Apr 6 06:05:25 2019

Latest reply by DV on Wed Apr 17 11:10:46 2019

Re: The Tarski Undefinability proof fails [when this one sentence is proved false]

By Ben Bacarisse on Fri Apr 12 21:24:51 2019

Latest reply by Ben Bacarisse on Fri Apr 12 21:24:51 2019

Re: Prolog already refutes the Tarski Undefinability TheoremVersion(2)

By peteolcott on Fri Apr 12 16:40:37 2019

Latest reply by peteolcott on Fri Apr 12 16:49:47 2019

Re: The Tarski Undefinability proof fails [when this one sentence isproved false]

By peteolcott on Thu Apr 11 00:23:08 2019

Latest reply by peteolcott on Fri Apr 12 16:38:22 2019

Prolog already refutes the Tarski Undefinability Theorem Version(3)

By peteolcott on Fri Apr 12 14:25:38 2019

Latest reply by peteolcott on Fri Apr 12 14:25:38 2019

Re: Semantics and Anaphora (PO was right all along)

By peteolcott on Fri Apr 12 12:59:38 2019

Latest reply by peteolcott on Fri Apr 12 12:59:38 2019

Prolog already refutes the Tarski Undefinability Theorem Version(2)

By peteolcott on Fri Apr 12 12:17:26 2019

Latest reply by peteolcott on Fri Apr 12 12:17:26 2019

Prolog already refutes the Tarski Undefinability Theorem

By peteolcott on Fri Apr 12 12:12:55 2019

Latest reply by peteolcott on Fri Apr 12 12:12:55 2019

Re: The Tarski Undefinability proof fails [Prolog already refutesTarski]

By peteolcott on Fri Apr 12 11:56:43 2019

Latest reply by peteolcott on Fri Apr 12 11:56:43 2019

Eliminating undecidability from Formal Systems Version(4)

By peteolcott on Thu Apr 11 21:49:33 2019

Latest reply by peteolcott on Thu Apr 11 21:49:33 2019

Call for Papers: World Congress on Engineering and Computer ScienceWCECS 2019

By iaeng_imecs_wce_wcecs_c on Thu Apr 11 20:42:30 2019

Latest reply by iaeng_imecs_wce_wcecs_c on Thu Apr 11 20:42:30 2019

Refuting the third line of Tarski Undefinability another way

By peteolcott on Wed Apr 10 22:39:34 2019

Latest reply by peteolcott on Thu Apr 11 00:20:01 2019

Basis for refuting the 1931 Incompleteness Theorem

By peteolcott on Wed Apr 10 17:30:45 2019

Latest reply by peteolcott on Wed Apr 10 17:30:45 2019

Eliminating undecidability in formal systems

By peteolcott on Mon Apr 8 20:28:58 2019

Latest reply by peteolcott on Wed Apr 10 16:21:44 2019

Refuting Tarski Undefinability Version(7) sci.lang

By peteolcott on Wed Apr 10 11:02:26 2019

Latest reply by peteolcott on Wed Apr 10 11:02:26 2019

Reformulating the notion of a formal system to eliminateundecidability

By peteolcott on Wed Apr 10 09:00:52 2019

Latest reply by peteolcott on Wed Apr 10 09:00:52 2019

Re: The Tarski Undefinability proof [--Fails to hold up underalternate assumptions--]

By peteolcott on Tue Apr 9 23:21:48 2019

Latest reply by peteolcott on Tue Apr 9 23:21:48 2019

Re: Tarski Undefinability Theorem Succinctly Refuted Version(2)(sci.lang)

By peteolcott on Mon Apr 8 00:23:45 2019

Latest reply by peteolcott on Mon Apr 8 00:23:45 2019

Tarski Undefinability Theorem Succinctly Refuted Version(2)

By peteolcott on Sat Apr 6 16:37:11 2019

Latest reply by peteolcott on Sat Apr 6 16:51:24 2019

Re: The Epimenides paradox

By peteolcott on Sat Apr 6 10:41:07 2019

Latest reply by peteolcott on Sat Apr 6 10:41:07 2019

Liar Paradox reexamined (reply to marko)

By peteolcott on Sat Apr 6 10:36:10 2019

Latest reply by peteolcott on Sat Apr 6 10:36:10 2019

Re: A simple refutation of Tarski Undefinability for linguists (v2)(sci.lang)(Tarski (3) is unsatisfiable)

By peteolcott on Wed Mar 27 22:23:53 2019

Latest reply by peteolcott on Fri Apr 5 22:54:26 2019

LCCOMP news 04.04.2019

By Genaro JM on Fri Apr 5 09:16:09 2019

Latest reply by Genaro JM on Fri Apr 5 09:16:09 2019

Re: I think...

By peteolcott on Fri Apr 5 00:00:05 2019

Latest reply by peteolcott on Fri Apr 5 00:00:05 2019

Tarski Undefinability is unequivocally refuted

By peteolcott on Wed Apr 3 19:40:40 2019

Latest reply by peteolcott on Wed Apr 3 19:40:40 2019

=?UTF-8?Q?Re=3a_Refuting_the_conclusion_of_G=c3=b6del=e2=80=99s_193?==?UTF-8?Q?1_Incompleteness_Theorem_=282017=29?=

By peteolcott on Wed Apr 3 09:21:24 2019

Latest reply by peteolcott on Wed Apr 3 09:21:24 2019

=?UTF-8?Q?The_G=c3=b6del/Tarski_view_of_incompleteness?=

By peteolcott on Sat Mar 30 22:59:29 2019

Latest reply by peteolcott on Tue Apr 2 11:33:22 2019

=?UTF-8?Q?Re=3a_The_G=c3=b6del/Tarski_view_of_incompleteness_=28sci?==?UTF-8?B?LmxhbmcpIChwcmUtcmVxdSk=?=

By peteolcott on Mon Apr 1 21:43:43 2019

Latest reply by peteolcott on Mon Apr 1 21:43:43 2019

=?UTF-8?Q?Re=3a_Refuting_G=c3=b6del=27s_1931_Incompleteness_Theorem?==?UTF-8?Q?=3a?=

By peteolcott on Sat Mar 30 23:10:49 2019

Latest reply by peteolcott on Mon Apr 1 09:27:29 2019

Re: Olcott True(x) removes incompleteness from every formal systemthus proving itself correct

By peteolcott on Sat Mar 30 18:14:58 2019

Latest reply by peteolcott on Sat Mar 30 18:14:58 2019

Olcott True(x) removes incompleteness from every formal system thusproving itself correct

By peteolcott on Sat Mar 30 16:59:29 2019

Latest reply by peteolcott on Sat Mar 30 16:59:29 2019

=?UTF-8?B?Q2FuIHRoaXM6IOKIg0biiINHKEcg4oaUIH4oRiDiiqIgRykpIGJlIHNo?==?UTF-8?Q?own_to_be_satisfiable_without_G=c3=b6del_numbers_=3f?=

By peteolcott on Thu Mar 28 16:40:29 2019

Latest reply by peteolcott on Sat Mar 30 16:13:34 2019

Formalizing Truth Version(2) (sci.lang)

By peteolcott on Fri Mar 29 11:21:18 2019

Latest reply by peteolcott on Fri Mar 29 12:41:08 2019

=?UTF-8?B?SXMgdGhpcyBzYXRpc2ZpYWJsZTog4oiDRuKIg0coRyDihpQgfihGIA==?==?UTF-8?B?4oqiIEcpKSBbIE5vIEfDtmRlbCBudW1iZXJzIF0gPw==?=

By peteolcott on Thu Mar 28 16:23:28 2019

Latest reply by peteolcott on Thu Mar 28 16:23:28 2019

Re: Any C++ compiler will tell you the exact error of the Liar Paradox (English added for sci.lang)

By Ben Bacarisse on Wed Mar 27 21:53:55 2019

Latest reply by Ben Bacarisse on Thu Mar 28 15:31:56 2019

=?UTF-8?Q?Re=3a_The_Notion_of_Truth_in_Natural_and_Formal_Languages?==?UTF-8?B?IOKIgHggVHJ1ZSh4KSDihpQg4oqieA==?=

By peteolcott on Thu Mar 28 08:40:49 2019

Latest reply by peteolcott on Thu Mar 28 12:07:22 2019

Re: A simple refutation of Tarski Undefinability for linguists (easyas 1,2,3) (3)

By peteolcott on Thu Mar 28 11:59:34 2019

Latest reply by peteolcott on Thu Mar 28 11:59:34 2019

Re: A simple refutation of Tarski Undefinability for linguists (easyas 1,2,3) (2)

By peteolcott on Thu Mar 28 11:40:40 2019

Latest reply by peteolcott on Thu Mar 28 11:40:40 2019

Re: A simple refutation of Tarski Undefinability for linguists (easyas 1,2,3) (1)

By peteolcott on Thu Mar 28 11:35:21 2019

Latest reply by peteolcott on Thu Mar 28 11:35:21 2019

Re: Any C++ compiler will tell you the exact error of the LiarParadox (English added for sci.lang)

By peteolcott on Wed Mar 27 16:29:03 2019

Latest reply by peteolcott on Thu Mar 28 08:53:48 2019

Re: Off-topic: Price of SDI for companies

By DV on Wed Mar 27 13:29:38 2019

Latest reply by DV on Thu Mar 28 06:02:41 2019

Re: Converting Truth to math (Universal Truth Predicate)

By peteolcott on Wed Mar 27 11:22:24 2019

Latest reply by Ben Bacarisse on Thu Mar 28 03:38:54 2019

Any C++ compiler will tell you the exact error of the Liar Paradox

By peteolcott on Tue Mar 26 16:24:41 2019

Latest reply by Ben Bacarisse on Wed Mar 27 21:19:34 2019

Truth Bearers (copyright notice)

By peteolcott on Wed Mar 27 20:35:55 2019

Latest reply by peteolcott on Wed Mar 27 20:35:55 2019

Re: The simplest way to eliminate Russell's Paradox (No ZFCrequired). (Venn Diagrams)

By peteolcott on Wed Mar 27 19:56:29 2019

Latest reply by peteolcott on Wed Mar 27 19:56:29 2019

The Notion of Truth in Natural and Formal Languages

By peteolcott on Tue Mar 19 14:00:48 2019

Latest reply by peteolcott on Wed Mar 27 18:51:06 2019

The logical error of the Liar Paradox Version(4)

By peteolcott on Wed Mar 27 12:49:30 2019

Latest reply by peteolcott on Wed Mar 27 16:24:24 2019

Re: The logical error of the Liar Paradox Version(5)

By peteolcott on Wed Mar 27 15:06:52 2019

Latest reply by peteolcott on Wed Mar 27 15:06:52 2019

The logical error of the Liar Paradox Version(2)

By peteolcott on Tue Mar 26 23:34:02 2019

Latest reply by peteolcott on Wed Mar 27 12:39:25 2019

The logical error of the Liar Paradox Version(3)

By peteolcott on Wed Mar 27 12:22:33 2019

Latest reply by peteolcott on Wed Mar 27 12:22:33 2019

Re: The simplest way to eliminate Russell's Paradox (No ZFCrequired).

By peteolcott on Wed Mar 27 11:54:11 2019

Latest reply by peteolcott on Wed Mar 27 11:54:11 2019

The logical error of the Liar Paradox

By peteolcott on Tue Mar 26 22:45:31 2019

Latest reply by peteolcott on Tue Mar 26 22:45:31 2019

=?UTF-8?Q?Re=3a_Various_versions_of_G=c3=b6del=27s_sentence_=28for_?==?UTF-8?Q?David_Kleinecke=29_we_can_move_this_back_to_comp=2etheory?=

By peteolcott on Tue Mar 26 22:25:49 2019

Latest reply by peteolcott on Tue Mar 26 22:25:49 2019

Within symbolic logic True(X) and ~Provable(X) is impossible...

By peteolcott on Mon Mar 25 17:15:29 2019

Latest reply by peteolcott on Mon Mar 25 17:15:29 2019

The simplest way to eliminate Russell's Paradox (No ZFC required).

By peteolcott on Mon Mar 25 12:10:24 2019

Latest reply by peteolcott on Mon Mar 25 12:10:24 2019

P/NP oracle theorem

By Newberry on Thu Mar 21 21:51:36 2019

Latest reply by Newberry on Sat Mar 23 10:12:19 2019

Is the following expression unsatisfiable because it isself-contradictory?

By peteolcott on Wed Mar 20 10:21:47 2019

Latest reply by Peter Percival on Thu Mar 21 01:01:19 2019

Refutation of simplification of 1931 Incompleteness Theorem

By peteolcott on Tue Mar 19 01:18:28 2019

Latest reply by peteolcott on Tue Mar 19 17:28:53 2019

Re: Sound deduction and formal proof are necessarily isomorphic

By peteolcott on Mon Feb 25 09:38:56 2019

Latest reply by Peter Percival on Tue Mar 19 16:28:53 2019

=?UTF-8?B?VXMgY29uZ3Jlc3MgaGVhcmluZyBvZiBtYWFuIGFsc2FhbiBNb25leSBsYXVuZHJ5INmC?==?UTF-8?B?2LbZitipINin2YTZg9mI2YbYutis2LHYsyDZhNi62LPZitmEINin2YTYo9mF2YjYp9mEINmE2YTZhdmE?==?UTF-8?B?2YrYp9iv2YrYsSDZhdi52YYg2KfZhNi12KfZhti5?=

By single.formal on Tue Mar 19 14:31:10 2019

Latest reply by single.formal on Tue Mar 19 14:31:10 2019

Minimal Type Theory (YACC BNF)

By peteolcott on Tue Mar 19 00:33:42 2019

Latest reply by peteolcott on Tue Mar 19 00:46:55 2019

Is any encryption scheme based on an NP complete problem?

By Newberry on Sun Mar 17 17:12:18 2019

Latest reply by Ben Bacarisse on Mon Mar 18 01:25:26 2019

This proves that truth can exist directly within a formal systemwithout any need for model theory

By peteolcott on Thu Mar 14 09:48:21 2019

Latest reply by Peter Percival on Sat Mar 16 14:51:01 2019

Re: This proves that truth can exist directly within a formal system without any need for model theory

By Ben Bacarisse on Fri Mar 15 16:05:07 2019

Latest reply by Ben Bacarisse on Fri Mar 15 16:05:07 2019

[CALL FOR PAPERS] IEEE/WIC/ACM International Conference on WebIntelligence (WI'19) 14-17 OCTOBER 2019 Thessaloniki, GREECE

By gigglelmt on Fri Mar 15 01:21:13 2019

Latest reply by gigglelmt on Fri Mar 15 01:21:13 2019

*[CALL FOR PAPERS] IEEE/WIC/ACM International Conference on WebIntelligence (WI'19) 14-17 OCTOBER 2019 Thessaloniki, GREECE*

By gigglelmt on Fri Mar 15 01:20:35 2019

Latest reply by gigglelmt on Fri Mar 15 01:20:35 2019

Call for Nominations: VCLA INTERNATIONAL STUDENT AWARDS 2019 w/Extended submission deadline: 25.3.2019

By vcla.tuwien on Thu Mar 14 06:54:15 2019

Latest reply by vcla.tuwien on Thu Mar 14 06:54:15 2019

Re: A simple refutation of Tarski Undefinability for linguists (v2)

By peteolcott on Wed Mar 6 19:52:05 2019

Latest reply by Peter Percival on Tue Mar 12 04:34:30 2019

My Projects

By wesperich on Mon Mar 11 22:28:32 2019

Latest reply by wesperich on Mon Mar 11 22:28:32 2019

Wikipedia agrees with Axiom(Olcott) and WFF directly expressingsemantics

By peteolcott on Tue Mar 5 17:24:49 2019

Latest reply by Peter Percival on Fri Mar 8 21:11:00 2019

Re: Are there any living beings out there? (David is one)

By peteolcott on Tue Mar 5 20:26:39 2019

Latest reply by peteolcott on Thu Mar 7 10:16:45 2019

This says the same thing that I have been saying all along

By peteolcott on Tue Mar 5 13:40:37 2019

Latest reply by Peter Percival on Wed Mar 6 08:03:02 2019

Are there any living beings out there?

By peteolcott on Mon Mar 4 13:26:14 2019

Latest reply by Peter Percival on Wed Mar 6 07:50:47 2019

Re: Are there any living beings out there? (David is one?)

By peteolcott on Tue Mar 5 23:14:37 2019

Latest reply by peteolcott on Tue Mar 5 23:14:37 2019

Re: Are there any living beings out there? (at least one, maybe two)

By peteolcott on Tue Mar 5 22:24:52 2019

Latest reply by peteolcott on Tue Mar 5 22:24:52 2019

Re: Declarative Sentences without Truth Value (Liar Paradox)

By peteolcott on Mon Mar 4 11:04:06 2019

Latest reply by peteolcott on Mon Mar 4 22:24:32 2019

Simplest refutation of the 1931 Incompleteness Theorem

By peteolcott on Wed Feb 27 11:04:23 2019

Latest reply by Peter Percival on Mon Mar 4 21:06:25 2019

Re: Sound deduction and formal proof are necessarily isomorphic(PROVABILITY)

By peteolcott on Tue Feb 26 00:00:06 2019

Latest reply by Peter Percival on Mon Mar 4 20:32:02 2019

Re: Fallacy of equivocation error of the 1931 Incompleteness Theorem(Satisfiability of G)

By peteolcott on Fri Mar 1 10:01:51 2019

Latest reply by Peter Percival on Mon Mar 4 20:28:33 2019

Fallacy of equivocation error of the 1931 Incompleteness Theorem

By peteolcott on Thu Feb 28 09:33:46 2019

Latest reply by Peter Percival on Mon Mar 4 20:25:16 2019

Refuting the essence of the 1931 Incompleteness Theorem

By peteolcott on Fri Mar 1 13:04:13 2019

Latest reply by Peter Percival on Mon Mar 4 20:21:19 2019

A simple refutation of Tarski Undefinability for linguists

By peteolcott on Sun Mar 3 21:18:27 2019

Latest reply by peteolcott on Mon Mar 4 10:19:47 2019

Re: Simplest refutation of the 1931 Incompleteness Theorem (sci.lang)

By peteolcott on Mon Mar 4 09:25:13 2019

Latest reply by peteolcott on Mon Mar 4 09:25:13 2019

Re: Simplest refutation of the 1931 Incompleteness Theorem (sci.langrelevant)

By peteolcott on Fri Mar 1 22:42:46 2019

Latest reply by peteolcott on Sat Mar 2 00:52:22 2019

Re: Refuting the Halting Problem proofs (Via a refutation of the Peter Linz proof)

By Ben Bacarisse on Mon Feb 25 17:45:30 2019

Latest reply by Ben Bacarisse on Wed Feb 27 19:02:15 2019

Re: Refuting the Halting Problem proofs (Via a refutation of thePeter Linz proof)

By peteolcott on Mon Feb 25 00:12:09 2019

Latest reply by peteolcott on Wed Feb 27 10:53:54 2019