• Re: William T. Parry gets rid of Disjunction introduction

    From Mikko@mikko.levanto@iki.fi to sci.logic,sci.math,comp.theory,comp.ai.philosophy on Tue Jun 30 11:10:22 2026
    From Newsgroup: comp.ai.philosophy

    On 29/06/2026 16:55, olcott wrote:
    On 6/28/2026 4:32 AM, Mikko wrote:
    On 27/06/2026 21:29, olcott wrote:
    On 6/27/2026 1:24 PM, dbush wrote:
    On 6/27/2026 2:03 PM, olcott wrote:
    On 6/27/2026 12:54 PM, dbush wrote:
    On 6/27/2026 11:11 AM, polcott wrote:
    On 6/27/2026 2:08 AM, Mikko wrote:
    On 26/06/2026 15:49, olcott wrote:
    On 6/26/2026 1:49 AM, Mikko wrote:
    On 26/06/2026 04:32, olcott wrote:
    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for
    Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many >>>>>>>>>>> systems of analytic implication belonging to its ilk) is >>>>>>>>>>> the rejection of the classically valid principle of Addition, >>>>>>>>>>> sometimes also referred to as Disjunction Introduction. In >>>>>>>>>>> other words, the principle leading from a formula ϕ to a >>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary >>>>>>>>>>> formula. Parry blamed on this principle the derivability >>>>>>>>>>> of the paradoxes of strict implication—given that it is >>>>>>>>>>> famously featured in Lewis’ derivation of an arbitrary >>>>>>>>>>> formula ψ from a contradiction of the form ϕ ∧ ¬ϕ. >>>>>>>>>>>
    https://philarchive.org/archive/SZMASL

    He also gets rid of an efficient way to convince people who don't >>>>>>>>>> understand much of logic.

    As I recently showed in another post. I figured
    all this out on my own. I didn't even know that
    anyone else ever did this. I just knew that when
    trying to find out what is deduced from a set of
    premises that you cannot pop in another sentence
    from out of nowhere and get a correct conclusion.

    By popping in another sentence from out of nowhere
    (as it shows above) the principle of explosion is
    derived.

    The usual meaning of proof is a sequence of statement where
    eachstatement either is a premis or follows from one or more
    earlier
    statements

    Except with Disjunction introduction, that is its problem.

    So you're saying that in the following natural language statement: >>>>>>

    It is a key issue in that it creates the
    psychotic break from reality known as the
    Principle of Explosion, otherwise it may
    make no difference at all.

    Stay on topic or I will block you.

    Explain in detail how the below which you dishonestly trimmed is
    off- topic.


    The topic is how Disjunction introduction enables the
    Principle of Explosion.

    It does not. In any sensible logic every tautology is provable.
    Then the principle of explosion follows.

    POE is unprovable in both of these more sensible systems
    of logic.

    THe expression "these system" above does not denote.

    The POE is an actual psychotic break from
    reality when one pays full and complete attention to
    the underlying semantics and does not stupidly take
    semantics out of logic and put it in a separate model.

    No, it is not. The principle of explosion is about consequencies
    of a false premise, which already is a break from reality even
    when no consequence is inferred.

    Model theory was created only because keeping semantics
    directly within logic at the time was too complicated.
    It did make logic easier to work with and it also made
    logic diverge from correct reasoning.

    In a formal context the formal system specifies what reasoning is
    correct. In real world application the sules of ordinary logic are
    empirically correct, i.e., no situation is observed where the rules
    of logic are violated.

    Only people having actual psychosis would conclude
    that "The Moon is made from green cheese" AND
    "The Moon is NOT made from green cheese" SEMANTICALLY
    PROVES that Donald Trump is the one and only Lord
    and Savior Jesus Christ.

    A proof in a formal system is a finite string that satisfies certain
    syntactic rules specifiec for the system. There is no reference to
    any semantics.
    --
    Mikko

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,sci.math,comp.ai.philosophy on Tue Jun 30 08:45:32 2026
    From Newsgroup: comp.ai.philosophy

    On 6/30/2026 2:55 AM, Mikko wrote:
    On 29/06/2026 16:23, dbush wrote:
    On 6/29/2026 9:17 AM, polcott wrote:
    On 6/29/2026 7:08 AM, dbush wrote:
    On 6/29/2026 12:13 AM, olcott wrote:
    On 6/28/2026 10:56 PM, dbush wrote:
    On 6/27/2026 11:34 PM, dbush wrote:
    On 6/27/2026 11:23 PM, olcott wrote:
    On 6/27/2026 9:02 PM, dbush wrote:
    On 6/27/2026 9:53 PM, dbush wrote:
    On 6/27/2026 9:49 PM, olcott wrote:
    On 6/27/2026 8:42 PM, dbush wrote:
    On 6/27/2026 9:40 PM, olcott wrote:
    On 6/27/2026 8:29 PM, dbush wrote:
    On 6/27/2026 9:24 PM, olcott wrote:
    On 6/27/2026 8:08 PM, dbush wrote:
    On 6/27/2026 7:56 PM, olcott wrote:
    On 6/27/2026 6:30 PM, dbush wrote:
    On 6/27/2026 7:22 PM, olcott wrote:
    On 6/27/2026 5:52 PM, dbush wrote:
    On 6/27/2026 6:40 PM, olcott wrote:
    On 6/27/2026 1:34 PM, dbush wrote:
    On 6/27/2026 2:29 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 1:24 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:03 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 12:54 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 11:11 AM, polcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:08 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>> On 26/06/2026 15:49, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/26/2026 1:49 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 26/06/2026 04:32, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> William T. Parry, Entailment Logics >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> gets rid of Disjunction introduction >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> to prevent the principle of explosion >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    A simple logical matrix and sequent >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> calculus for
    Parry’s logic of Analytic Implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    The main and distinctive feature of PAI >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> (and of the many >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> systems of analytic implication belonging >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> to its ilk) is
    the rejection of the classically valid >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> principle of Addition, >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> sometimes also referred to as Disjunction >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Introduction. In >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> other words, the principle leading from a >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formula ϕ to a
    disjunction of the form ϕ ∨ ψ, where ψ is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> an arbitrary
    formula. Parry blamed on this principle >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> the derivability >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of the paradoxes of strict implication— >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> given that it is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> famously featured in Lewis’ derivation of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> an arbitrary
    formula ψ from a contradiction of the >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> form ϕ ∧ ¬ϕ. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    He also gets rid of an efficient way to >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> convince people who don't >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> understand much of logic. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    As I recently showed in another post. I >>>>>>>>>>>>>>>>>>>>>>>>>>>>> figured
    all this out on my own. I didn't even know >>>>>>>>>>>>>>>>>>>>>>>>>>>>> that
    anyone else ever did this. I just knew that >>>>>>>>>>>>>>>>>>>>>>>>>>>>> when
    trying to find out what is deduced from a >>>>>>>>>>>>>>>>>>>>>>>>>>>>> set of
    premises that you cannot pop in another >>>>>>>>>>>>>>>>>>>>>>>>>>>>> sentence
    from out of nowhere and get a correct >>>>>>>>>>>>>>>>>>>>>>>>>>>>> conclusion.

    By popping in another sentence from out of >>>>>>>>>>>>>>>>>>>>>>>>>>>>> nowhere
    (as it shows above) the principle of >>>>>>>>>>>>>>>>>>>>>>>>>>>>> explosion is
    derived.

    The usual meaning of proof is a sequence of >>>>>>>>>>>>>>>>>>>>>>>>>>>> statement where eachstatement either is a >>>>>>>>>>>>>>>>>>>>>>>>>>>> premis or follows from one or more earlier >>>>>>>>>>>>>>>>>>>>>>>>>>>> statements

    Except with Disjunction introduction, that is >>>>>>>>>>>>>>>>>>>>>>>>>>> its problem.

    So you're saying that in the following natural >>>>>>>>>>>>>>>>>>>>>>>>>> language statement:


    It is a key issue in that it creates the >>>>>>>>>>>>>>>>>>>>>>>>> psychotic break from reality known as the >>>>>>>>>>>>>>>>>>>>>>>>> Principle of Explosion, otherwise it may >>>>>>>>>>>>>>>>>>>>>>>>> make no difference at all.

    Stay on topic or I will block you. >>>>>>>>>>>>>>>>>>>>>>>>
    Explain in detail how the below which you >>>>>>>>>>>>>>>>>>>>>>>> dishonestly trimmed is off- topic. >>>>>>>>>>>>>>>>>>>>>>>>

    The topic is how Disjunction introduction enables >>>>>>>>>>>>>>>>>>>>>>> the
    Principle of Explosion.


    Rejected, as you not liking the result doesn't >>>>>>>>>>>>>>>>>>>>>> make it invalid.

    Through a series of truth preserving operations, >>>>>>>>>>>>>>>>>>>>>> when a contradiction is given as true, any >>>>>>>>>>>>>>>>>>>>>> statement can be proven as true.

    The principle of explosion is a demonstration of >>>>>>>>>>>>>>>>>>>>>> *why* a formal system whose axioms lead to a >>>>>>>>>>>>>>>>>>>>>> contradiction is useless.

    The only reason someone would want to get rid of >>>>>>>>>>>>>>>>>>>>>> the principle of explosion is to be able to use a >>>>>>>>>>>>>>>>>>>>>> system that has a contradiction.


    My reason to get rid of the principle of explosion >>>>>>>>>>>>>>>>>>>>> it to get rid of anything and everything that prevents >>>>>>>>>>>>>>>>>>>>> infallibly correct reasoning.


    If you get rid of the principle of explosion, the >>>>>>>>>>>>>>>>>>>> law of non- contradiction goes away as it looses its >>>>>>>>>>>>>>>>>>>> basis.


    You keep failing to pay close enough attention. >>>>>>>>>>>>>>>>>>> I only get rid of the POE by getting rid of >>>>>>>>>>>>>>>>>>> Disjunction introduction.

    Which you can't do because it's a truth-preserving >>>>>>>>>>>>>>>>>> operation.

    1) P ∧ ¬P    // Premise
    2) P          // Conjunction elimination >>>>>>>>>>>>>>>>> 3) ¬P        // Conjunction elimination >>>>>>>>>>>>>>>>> 4) P ∨ Q      // Disjunction introduction >>>>>>>>>>>>>>>>> 5) Q          // Disjunctive syllogism >>>>>>>>>>>>>>>>> https://en.wikipedia.org/wiki/Principle_of_explosion#Proof >>>>>>>>>>>>>>>>>
    When you insert English meanings into the
    propositional variables it is as obvious
    as a pie in the fact the DI IS NOT TRUTH PRESERVING. >>>>>>>>>>>>>>>>
    So you're saying that in the following natural language >>>>>>>>>>>>>>>> statement:

    --------------------------------------
    At least one of the following statements is true: >>>>>>>>>>>>>>>> - Earth is the third planet from the sun.
    - <X>
    --------------------------------------

    Where <X> is any natural language statement, there >>>>>>>>>>>>>>>> exists a statement X such that the condition "At least >>>>>>>>>>>>>>>> one of the following statements is true" is false. >>>>>>>>>>>>>>>>
    Name it.


    That is not Disjunction introduction combined with >>>>>>>>>>>>>>> Disjunctive syllogism, it is bare Disjunction.


    Let me spell it out more explicitly then.

    Given that the following natural language statement is true: >>>>>>>>>>>>>>
    --------------------------------------
    Earth is the third planet from the sun.
    --------------------------------------

    In the following natural language statement:

    --------------------------------------
    At least one of the following statements is true:
    - Earth is the third planet from the sun.
    - <X>
    --------------------------------------

    Where <X> is any natural language statement, does there >>>>>>>>>>>>>> exist a statement X such that the condition "At least one >>>>>>>>>>>>>> of the following statements is true" is false?


    Where X is "What time is it?"



    Is the statement "Earth is the third planet from the sun" true? >>>>>>>>>>>
    We have a type mismatch error.



    The statement you gave isn't a truth-bearing statement, so it >>>>>>>>>> can't be used in logic.  I didn't think I had to make that >>>>>>>>>> explicit.

    However, let's go with it anyway because it still illustrates >>>>>>>>>> the point.

    So I'll ask again:

    Is the statement "Earth is the third planet from the sun" true? >>>>>>>>>>

    On second though, let's back up as that might confuse you.

    Given that <X> is any *truth bearing* natural language
    statement, does there exist a statement X such that the
    condition "At least one of the following statements is true" is >>>>>>>>> false?


    Head games will be ignored.
    That you did so well on the other things
    so I will not block you.


    Explain in detail how this is a head game.

    Failure to either answer the above question or explain how it is >>>>>>> a head game in your next reply or within one hour of you next
    post in this newsgroup will be taken as your official, on-the-
    record admission that Disjunction introduction is in fact truth >>>>>>> preserving and valid, and therefore so is the Principle of
    Explosion.


    Let the record show that Peter Olcott made the following post in
    this newsgroup:

    On 6/28/2026 10:52 PM, olcott wrote:
    Q also can't bake a birthday cake, this does not make
    Q in any way "incomplete" relative to what it was
    defined to do.
    ...

    And more that one hour has passed with no attempt to answer the
    above question or explain why it is a head game.  Therefore, as
    per the above criteria:

    Let The Record Show

    That Peter Olcott

    Has *Officially* Admitted:

    That Disjunction introduction is in fact truth preserving and
    valid, and therefore so is the Principle of Explosion.



    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for
    Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many
    systems of analytic implication belonging to its ilk) is

    the rejection of the classically valid principle of Addition,
    sometimes also referred to as Disjunction Introduction. In

    other words, the principle leading from a formula ϕ to a
    disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary
    formula. Parry blamed on this principle the derivability
    of the paradoxes of strict implication—given that it is
    famously featured in Lewis’ derivation of an arbitrary
    formula ψ from a contradiction of the form ϕ ∧ ¬ϕ.

    https://philarchive.org/archive/SZMASL


    So someone came up with a different system that has different rules.
    That has no bearing on existing systems.


    The bearing that it has on existing systems is

    None, as you can't remove a truth-preserving operation.

    One can construct a system where a truth-preserving operation is not
    valid, and must if one wants to construct a paraconsistent system,
    where some but not every sentence can be both PTS-true and PTS-false.


    Current semantic entailment is the only inference step allowed.
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,sci.math,comp.theory,comp.ai.philosophy on Tue Jun 30 08:55:47 2026
    From Newsgroup: comp.ai.philosophy

    On 6/30/2026 3:10 AM, Mikko wrote:
    On 29/06/2026 16:55, olcott wrote:
    On 6/28/2026 4:32 AM, Mikko wrote:
    On 27/06/2026 21:29, olcott wrote:
    On 6/27/2026 1:24 PM, dbush wrote:
    On 6/27/2026 2:03 PM, olcott wrote:
    On 6/27/2026 12:54 PM, dbush wrote:
    On 6/27/2026 11:11 AM, polcott wrote:
    On 6/27/2026 2:08 AM, Mikko wrote:
    On 26/06/2026 15:49, olcott wrote:
    On 6/26/2026 1:49 AM, Mikko wrote:
    On 26/06/2026 04:32, olcott wrote:
    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for
    Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many >>>>>>>>>>>> systems of analytic implication belonging to its ilk) is >>>>>>>>>>>> the rejection of the classically valid principle of Addition, >>>>>>>>>>>> sometimes also referred to as Disjunction Introduction. In >>>>>>>>>>>> other words, the principle leading from a formula ϕ to a >>>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary >>>>>>>>>>>> formula. Parry blamed on this principle the derivability >>>>>>>>>>>> of the paradoxes of strict implication—given that it is >>>>>>>>>>>> famously featured in Lewis’ derivation of an arbitrary >>>>>>>>>>>> formula ψ from a contradiction of the form ϕ ∧ ¬ϕ. >>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL

    He also gets rid of an efficient way to convince people who >>>>>>>>>>> don't
    understand much of logic.

    As I recently showed in another post. I figured
    all this out on my own. I didn't even know that
    anyone else ever did this. I just knew that when
    trying to find out what is deduced from a set of
    premises that you cannot pop in another sentence
    from out of nowhere and get a correct conclusion.

    By popping in another sentence from out of nowhere
    (as it shows above) the principle of explosion is
    derived.

    The usual meaning of proof is a sequence of statement where >>>>>>>>> eachstatement either is a premis or follows from one or more >>>>>>>>> earlier
    statements

    Except with Disjunction introduction, that is its problem.

    So you're saying that in the following natural language statement: >>>>>>>

    It is a key issue in that it creates the
    psychotic break from reality known as the
    Principle of Explosion, otherwise it may
    make no difference at all.

    Stay on topic or I will block you.

    Explain in detail how the below which you dishonestly trimmed is
    off- topic.


    The topic is how Disjunction introduction enables the
    Principle of Explosion.

    It does not. In any sensible logic every tautology is provable.
    Then the principle of explosion follows.

    POE is unprovable in both of these more sensible systems
    of logic.

    THe expression "these system" above does not denote.


    Parry’s logic of Analytic Implication

    Relevance Logic
    https://plato.stanford.edu/entries/logic-relevance/

    The POE is an actual psychotic break from
    reality when one pays full and complete attention to
    the underlying semantics and does not stupidly take
    semantics out of logic and put it in a separate model.

    No, it is not. The principle of explosion is about consequencies
    of a false premise, which already is a break from reality even
    when no consequence is inferred.


    Only because semantics is ignored.
    There is nothing semantically meaningful about a
    contradiction that derives anything at all besides FALSE.

    There is nothing semantically meaningful about FALSE
    that derives anything at all besides FALSE.

    Model theory was created only because keeping semantics
    directly within logic at the time was too complicated.
    It did make logic easier to work with and it also made
    logic diverge from correct reasoning.

    In a formal context the formal system specifies what reasoning is
    correct. In real world application the sules of ordinary logic are empirically correct, i.e., no situation is observed where the rules
    of logic are violated.


    The POE derives that Donald Trump is the one and only Lord
    and Savior Jesus Christ and Trump is not Christ therefore
    the POE is incorrect reasoning.

    Only people having actual psychosis would conclude
    that "The Moon is made from green cheese" AND
    "The Moon is NOT made from green cheese" SEMANTICALLY
    PROVES that Donald Trump is the one and only Lord
    and Savior Jesus Christ.

    A proof in a formal system is a finite string that satisfies certain syntactic rules specifiec for the system. There is no reference to
    any semantics.


    It makes the huge mistake of ignoring semantics.
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From dbush@dbush.mobile@gmail.com to sci.logic,sci.math,comp.theory,comp.ai.philosophy on Tue Jun 30 10:01:15 2026
    From Newsgroup: comp.ai.philosophy

    On 6/30/2026 9:55 AM, olcott wrote:
    On 6/30/2026 3:10 AM, Mikko wrote:
    On 29/06/2026 16:55, olcott wrote:
    On 6/28/2026 4:32 AM, Mikko wrote:
    On 27/06/2026 21:29, olcott wrote:
    On 6/27/2026 1:24 PM, dbush wrote:
    On 6/27/2026 2:03 PM, olcott wrote:
    On 6/27/2026 12:54 PM, dbush wrote:
    On 6/27/2026 11:11 AM, polcott wrote:
    On 6/27/2026 2:08 AM, Mikko wrote:
    On 26/06/2026 15:49, olcott wrote:
    On 6/26/2026 1:49 AM, Mikko wrote:
    On 26/06/2026 04:32, olcott wrote:
    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for
    Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many >>>>>>>>>>>>> systems of analytic implication belonging to its ilk) is >>>>>>>>>>>>> the rejection of the classically valid principle of Addition, >>>>>>>>>>>>> sometimes also referred to as Disjunction Introduction. In >>>>>>>>>>>>> other words, the principle leading from a formula ϕ to a >>>>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary >>>>>>>>>>>>> formula. Parry blamed on this principle the derivability >>>>>>>>>>>>> of the paradoxes of strict implication—given that it is >>>>>>>>>>>>> famously featured in Lewis’ derivation of an arbitrary >>>>>>>>>>>>> formula ψ from a contradiction of the form ϕ ∧ ¬ϕ. >>>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL

    He also gets rid of an efficient way to convince people who >>>>>>>>>>>> don't
    understand much of logic.

    As I recently showed in another post. I figured
    all this out on my own. I didn't even know that
    anyone else ever did this. I just knew that when
    trying to find out what is deduced from a set of
    premises that you cannot pop in another sentence
    from out of nowhere and get a correct conclusion.

    By popping in another sentence from out of nowhere
    (as it shows above) the principle of explosion is
    derived.

    The usual meaning of proof is a sequence of statement where >>>>>>>>>> eachstatement either is a premis or follows from one or more >>>>>>>>>> earlier
    statements

    Except with Disjunction introduction, that is its problem.

    So you're saying that in the following natural language statement: >>>>>>>>

    It is a key issue in that it creates the
    psychotic break from reality known as the
    Principle of Explosion, otherwise it may
    make no difference at all.

    Stay on topic or I will block you.

    Explain in detail how the below which you dishonestly trimmed is
    off- topic.


    The topic is how Disjunction introduction enables the
    Principle of Explosion.

    It does not. In any sensible logic every tautology is provable.
    Then the principle of explosion follows.

    POE is unprovable in both of these more sensible systems
    of logic.

    THe expression "these system" above does not denote.


    Parry’s logic of Analytic Implication

    Relevance Logic
    https://plato.stanford.edu/entries/logic-relevance/

    The POE is an actual psychotic break from
    reality when one pays full and complete attention to
    the underlying semantics and does not stupidly take
    semantics out of logic and put it in a separate model.

    No, it is not. The principle of explosion is about consequencies
    of a false premise, which already is a break from reality even
    when no consequence is inferred.


    Only because semantics is ignored.
    There is nothing semantically meaningful about a
    contradiction that derives anything at all besides FALSE.

    There is nothing semantically meaningful about FALSE
    that derives anything at all besides FALSE.

    False, as you have admitted otherwise on the record (see below):

    On 6/28/2026 11:56 PM, dbush wrote:
    On 6/27/2026 11:34 PM, dbush wrote:
    On 6/27/2026 11:23 PM, olcott wrote:
    On 6/27/2026 9:02 PM, dbush wrote:
    On 6/27/2026 9:53 PM, dbush wrote:
    On 6/27/2026 9:49 PM, olcott wrote:
    On 6/27/2026 8:42 PM, dbush wrote:
    On 6/27/2026 9:40 PM, olcott wrote:
    On 6/27/2026 8:29 PM, dbush wrote:
    Given that the following natural language statement is true:

    --------------------------------------
    Earth is the third planet from the sun.
    --------------------------------------

    In the following natural language statement:

    --------------------------------------
    At least one of the following statements is true:
    - Earth is the third planet from the sun.
    - <X>
    --------------------------------------

    Given that <X> is any *truth bearing* natural language statement,
    does there exist a statement X such that the condition "At least one
    of the following statements is true" is false?


    Head games will be ignored.


    Explain in detail how this is a head game.

    Failure to either answer the above question or explain how it is a
    head game in your next reply or within one hour of you next post in
    this newsgroup will be taken as your official, on-the-record admission
    that Disjunction introduction is in fact truth preserving and valid,
    and therefore so is the Principle of Explosion.


    Let the record show that Peter Olcott made the following post in this newsgroup:

    On 6/28/2026 10:52 PM, olcott wrote:
    Q also can't bake a birthday cake, this does not make
    Q in any way "incomplete" relative to what it was
    defined to do.
    ...

    And more that one hour has passed with no attempt to answer the above question or explain why it is a head game. Therefore, as per the above criteria:

    Let The Record Show

    That Peter Olcott

    Has *Officially* Admitted:

    That Disjunction introduction is in fact truth preserving and valid, and therefore so is the Principle of Explosion.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,sci.math,comp.ai.philosophy on Tue Jun 30 09:37:53 2026
    From Newsgroup: comp.ai.philosophy

    On 6/30/2026 3:48 AM, Mikko wrote:
    On 29/06/2026 17:00, olcott wrote:
    On 6/29/2026 8:23 AM, dbush wrote:
    On 6/29/2026 9:17 AM, polcott wrote:
    On 6/29/2026 7:08 AM, dbush wrote:
    On 6/29/2026 12:13 AM, olcott wrote:
    On 6/28/2026 10:56 PM, dbush wrote:
    On 6/27/2026 11:34 PM, dbush wrote:
    On 6/27/2026 11:23 PM, olcott wrote:
    On 6/27/2026 9:02 PM, dbush wrote:
    On 6/27/2026 9:53 PM, dbush wrote:
    On 6/27/2026 9:49 PM, olcott wrote:
    On 6/27/2026 8:42 PM, dbush wrote:
    On 6/27/2026 9:40 PM, olcott wrote:
    On 6/27/2026 8:29 PM, dbush wrote:
    On 6/27/2026 9:24 PM, olcott wrote:
    On 6/27/2026 8:08 PM, dbush wrote:
    On 6/27/2026 7:56 PM, olcott wrote:
    On 6/27/2026 6:30 PM, dbush wrote:
    On 6/27/2026 7:22 PM, olcott wrote:
    On 6/27/2026 5:52 PM, dbush wrote:
    On 6/27/2026 6:40 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 1:34 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:29 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 1:24 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:03 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 12:54 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 11:11 AM, polcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:08 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 26/06/2026 15:49, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/26/2026 1:49 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 26/06/2026 04:32, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> William T. Parry, Entailment Logics >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> gets rid of Disjunction introduction >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> to prevent the principle of explosion >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    A simple logical matrix and sequent >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> calculus for
    Parry’s logic of Analytic Implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    The main and distinctive feature of PAI >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> (and of the many >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> systems of analytic implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> belonging to its ilk) is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> the rejection of the classically valid >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> principle of Addition, >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> sometimes also referred to as >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Disjunction Introduction. In >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> other words, the principle leading from >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> a formula ϕ to a >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where ψ >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> is an arbitrary >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formula. Parry blamed on this principle >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> the derivability >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of the paradoxes of strict implication— >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> given that it is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> famously featured in Lewis’ derivation >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of an arbitrary >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formula ψ from a contradiction of the >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> form ϕ ∧ ¬ϕ. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    He also gets rid of an efficient way to >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> convince people who don't >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> understand much of logic. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    As I recently showed in another post. I >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> figured
    all this out on my own. I didn't even know >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> that
    anyone else ever did this. I just knew >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> that when
    trying to find out what is deduced from a >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> set of
    premises that you cannot pop in another >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> sentence
    from out of nowhere and get a correct >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> conclusion.

    By popping in another sentence from out of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> nowhere
    (as it shows above) the principle of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> explosion is
    derived.

    The usual meaning of proof is a sequence of >>>>>>>>>>>>>>>>>>>>>>>>>>>>> statement where eachstatement either is a >>>>>>>>>>>>>>>>>>>>>>>>>>>>> premis or follows from one or more earlier >>>>>>>>>>>>>>>>>>>>>>>>>>>>> statements

    Except with Disjunction introduction, that >>>>>>>>>>>>>>>>>>>>>>>>>>>> is its problem.

    So you're saying that in the following >>>>>>>>>>>>>>>>>>>>>>>>>>> natural language statement: >>>>>>>>>>>>>>>>>>>>>>>>>>>

    It is a key issue in that it creates the >>>>>>>>>>>>>>>>>>>>>>>>>> psychotic break from reality known as the >>>>>>>>>>>>>>>>>>>>>>>>>> Principle of Explosion, otherwise it may >>>>>>>>>>>>>>>>>>>>>>>>>> make no difference at all. >>>>>>>>>>>>>>>>>>>>>>>>>>
    Stay on topic or I will block you. >>>>>>>>>>>>>>>>>>>>>>>>>
    Explain in detail how the below which you >>>>>>>>>>>>>>>>>>>>>>>>> dishonestly trimmed is off- topic. >>>>>>>>>>>>>>>>>>>>>>>>>

    The topic is how Disjunction introduction >>>>>>>>>>>>>>>>>>>>>>>> enables the
    Principle of Explosion.


    Rejected, as you not liking the result doesn't >>>>>>>>>>>>>>>>>>>>>>> make it invalid.

    Through a series of truth preserving operations, >>>>>>>>>>>>>>>>>>>>>>> when a contradiction is given as true, any >>>>>>>>>>>>>>>>>>>>>>> statement can be proven as true. >>>>>>>>>>>>>>>>>>>>>>>
    The principle of explosion is a demonstration of >>>>>>>>>>>>>>>>>>>>>>> *why* a formal system whose axioms lead to a >>>>>>>>>>>>>>>>>>>>>>> contradiction is useless.

    The only reason someone would want to get rid of >>>>>>>>>>>>>>>>>>>>>>> the principle of explosion is to be able to use a >>>>>>>>>>>>>>>>>>>>>>> system that has a contradiction. >>>>>>>>>>>>>>>>>>>>>>>

    My reason to get rid of the principle of explosion >>>>>>>>>>>>>>>>>>>>>> it to get rid of anything and everything that >>>>>>>>>>>>>>>>>>>>>> prevents
    infallibly correct reasoning.


    If you get rid of the principle of explosion, the >>>>>>>>>>>>>>>>>>>>> law of non- contradiction goes away as it looses >>>>>>>>>>>>>>>>>>>>> its basis.


    You keep failing to pay close enough attention. >>>>>>>>>>>>>>>>>>>> I only get rid of the POE by getting rid of >>>>>>>>>>>>>>>>>>>> Disjunction introduction.

    Which you can't do because it's a truth-preserving >>>>>>>>>>>>>>>>>>> operation.

    1) P ∧ ¬P    // Premise
    2) P          // Conjunction elimination >>>>>>>>>>>>>>>>>> 3) ¬P        // Conjunction elimination >>>>>>>>>>>>>>>>>> 4) P ∨ Q      // Disjunction introduction >>>>>>>>>>>>>>>>>> 5) Q          // Disjunctive syllogism >>>>>>>>>>>>>>>>>> https://en.wikipedia.org/wiki/
    Principle_of_explosion#Proof

    When you insert English meanings into the
    propositional variables it is as obvious
    as a pie in the fact the DI IS NOT TRUTH PRESERVING. >>>>>>>>>>>>>>>>>
    So you're saying that in the following natural language >>>>>>>>>>>>>>>>> statement:

    --------------------------------------
    At least one of the following statements is true: >>>>>>>>>>>>>>>>> - Earth is the third planet from the sun.
    - <X>
    --------------------------------------

    Where <X> is any natural language statement, there >>>>>>>>>>>>>>>>> exists a statement X such that the condition "At least >>>>>>>>>>>>>>>>> one of the following statements is true" is false. >>>>>>>>>>>>>>>>>
    Name it.


    That is not Disjunction introduction combined with >>>>>>>>>>>>>>>> Disjunctive syllogism, it is bare Disjunction. >>>>>>>>>>>>>>>>

    Let me spell it out more explicitly then.

    Given that the following natural language statement is true: >>>>>>>>>>>>>>>
    --------------------------------------
    Earth is the third planet from the sun.
    --------------------------------------

    In the following natural language statement:

    --------------------------------------
    At least one of the following statements is true: >>>>>>>>>>>>>>> - Earth is the third planet from the sun.
    - <X>
    --------------------------------------

    Where <X> is any natural language statement, does there >>>>>>>>>>>>>>> exist a statement X such that the condition "At least one >>>>>>>>>>>>>>> of the following statements is true" is false?


    Where X is "What time is it?"



    Is the statement "Earth is the third planet from the sun" >>>>>>>>>>>>> true?

    We have a type mismatch error.



    The statement you gave isn't a truth-bearing statement, so it >>>>>>>>>>> can't be used in logic.  I didn't think I had to make that >>>>>>>>>>> explicit.

    However, let's go with it anyway because it still illustrates >>>>>>>>>>> the point.

    So I'll ask again:

    Is the statement "Earth is the third planet from the sun" true? >>>>>>>>>>>

    On second though, let's back up as that might confuse you. >>>>>>>>>>
    Given that <X> is any *truth bearing* natural language
    statement, does there exist a statement X such that the
    condition "At least one of the following statements is true" >>>>>>>>>> is false?


    Head games will be ignored.
    That you did so well on the other things
    so I will not block you.


    Explain in detail how this is a head game.

    Failure to either answer the above question or explain how it is >>>>>>>> a head game in your next reply or within one hour of you next >>>>>>>> post in this newsgroup will be taken as your official, on-the- >>>>>>>> record admission that Disjunction introduction is in fact truth >>>>>>>> preserving and valid, and therefore so is the Principle of
    Explosion.


    Let the record show that Peter Olcott made the following post in >>>>>>> this newsgroup:

    On 6/28/2026 10:52 PM, olcott wrote:
    Q also can't bake a birthday cake, this does not make
    Q in any way "incomplete" relative to what it was
    defined to do.
    ...

    And more that one hour has passed with no attempt to answer the >>>>>>> above question or explain why it is a head game.  Therefore, as >>>>>>> per the above criteria:

    Let The Record Show

    That Peter Olcott

    Has *Officially* Admitted:

    That Disjunction introduction is in fact truth preserving and
    valid, and therefore so is the Principle of Explosion.



    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for
    Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many
    systems of analytic implication belonging to its ilk) is

    the rejection of the classically valid principle of Addition,
    sometimes also referred to as Disjunction Introduction. In

    other words, the principle leading from a formula ϕ to a
    disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary
    formula. Parry blamed on this principle the derivability
    of the paradoxes of strict implication—given that it is
    famously featured in Lewis’ derivation of an arbitrary
    formula ψ from a contradiction of the form ϕ ∧ ¬ϕ.

    https://philarchive.org/archive/SZMASL


    So someone came up with a different system that has different
    rules. That has no bearing on existing systems.


    The bearing that it has on existing systems is

    None, as you can't remove a truth-preserving operation.



    that
    it corrects their psychotic break from reality that
    allows one to prove that Donald Trump is the one and
    only Lord and Savior on the basis of a totally irrelevant
    contradiction.

    It follows from a series of truth-preserving operations starting with
    the precondition that a contradiction has been proven, as you have
    admitted above on the record.

    Only people having actual psychosis would conclude
    that "The Moon is made from green cheese" AND
    "The Moon is NOT made from green cheese" SEMANTICALLY
    PROVES that Donald Trump is the one and only Lord
    and Savior Jesus Christ.

    How do you know that somewhere the Moon is made from green cheese and
    the Moon is not made from green cheese and Donald Trump is not the one
    and only Lord and Savior Jesus Christ?


    Counter-factual
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to sci.logic,comp.theory,sci.math,comp.ai.philosophy on Wed Jul 1 09:46:49 2026
    From Newsgroup: comp.ai.philosophy

    On 30/06/2026 17:37, olcott wrote:
    On 6/30/2026 3:48 AM, Mikko wrote:
    On 29/06/2026 17:00, olcott wrote:
    On 6/29/2026 8:23 AM, dbush wrote:
    On 6/29/2026 9:17 AM, polcott wrote:
    On 6/29/2026 7:08 AM, dbush wrote:
    On 6/29/2026 12:13 AM, olcott wrote:
    On 6/28/2026 10:56 PM, dbush wrote:
    On 6/27/2026 11:34 PM, dbush wrote:
    On 6/27/2026 11:23 PM, olcott wrote:
    On 6/27/2026 9:02 PM, dbush wrote:
    On 6/27/2026 9:53 PM, dbush wrote:
    On 6/27/2026 9:49 PM, olcott wrote:
    On 6/27/2026 8:42 PM, dbush wrote:
    On 6/27/2026 9:40 PM, olcott wrote:
    On 6/27/2026 8:29 PM, dbush wrote:
    On 6/27/2026 9:24 PM, olcott wrote:
    On 6/27/2026 8:08 PM, dbush wrote:
    On 6/27/2026 7:56 PM, olcott wrote:
    On 6/27/2026 6:30 PM, dbush wrote:
    On 6/27/2026 7:22 PM, olcott wrote:
    On 6/27/2026 5:52 PM, dbush wrote:
    On 6/27/2026 6:40 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 1:34 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:29 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 1:24 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:03 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 12:54 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 11:11 AM, polcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:08 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 26/06/2026 15:49, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/26/2026 1:49 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 26/06/2026 04:32, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> William T. Parry, Entailment Logics >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> gets rid of Disjunction introduction >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> to prevent the principle of explosion >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    A simple logical matrix and sequent >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> calculus for >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Parry’s logic of Analytic Implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    The main and distinctive feature of PAI >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> (and of the many >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> systems of analytic implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> belonging to its ilk) is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> the rejection of the classically valid >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> principle of Addition, >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> sometimes also referred to as >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Disjunction Introduction. In >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> other words, the principle leading from >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> a formula ϕ to a >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where ψ >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> is an arbitrary >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formula. Parry blamed on this principle >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> the derivability >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of the paradoxes of strict implication— >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> given that it is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> famously featured in Lewis’ derivation >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of an arbitrary >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formula ψ from a contradiction of the >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> form ϕ ∧ ¬ϕ. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    He also gets rid of an efficient way to >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> convince people who don't >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> understand much of logic. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    As I recently showed in another post. I >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> figured
    all this out on my own. I didn't even >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> know that
    anyone else ever did this. I just knew >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> that when
    trying to find out what is deduced from a >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> set of
    premises that you cannot pop in another >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> sentence
    from out of nowhere and get a correct >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> conclusion.

    By popping in another sentence from out >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of nowhere
    (as it shows above) the principle of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> explosion is
    derived.

    The usual meaning of proof is a sequence >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of statement where eachstatement either is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> a premis or follows from one or more earlier >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> statements

    Except with Disjunction introduction, that >>>>>>>>>>>>>>>>>>>>>>>>>>>>> is its problem.

    So you're saying that in the following >>>>>>>>>>>>>>>>>>>>>>>>>>>> natural language statement: >>>>>>>>>>>>>>>>>>>>>>>>>>>>

    It is a key issue in that it creates the >>>>>>>>>>>>>>>>>>>>>>>>>>> psychotic break from reality known as the >>>>>>>>>>>>>>>>>>>>>>>>>>> Principle of Explosion, otherwise it may >>>>>>>>>>>>>>>>>>>>>>>>>>> make no difference at all. >>>>>>>>>>>>>>>>>>>>>>>>>>>
    Stay on topic or I will block you. >>>>>>>>>>>>>>>>>>>>>>>>>>
    Explain in detail how the below which you >>>>>>>>>>>>>>>>>>>>>>>>>> dishonestly trimmed is off- topic. >>>>>>>>>>>>>>>>>>>>>>>>>>

    The topic is how Disjunction introduction >>>>>>>>>>>>>>>>>>>>>>>>> enables the
    Principle of Explosion.


    Rejected, as you not liking the result doesn't >>>>>>>>>>>>>>>>>>>>>>>> make it invalid.

    Through a series of truth preserving operations, >>>>>>>>>>>>>>>>>>>>>>>> when a contradiction is given as true, any >>>>>>>>>>>>>>>>>>>>>>>> statement can be proven as true. >>>>>>>>>>>>>>>>>>>>>>>>
    The principle of explosion is a demonstration of >>>>>>>>>>>>>>>>>>>>>>>> *why* a formal system whose axioms lead to a >>>>>>>>>>>>>>>>>>>>>>>> contradiction is useless.

    The only reason someone would want to get rid of >>>>>>>>>>>>>>>>>>>>>>>> the principle of explosion is to be able to use >>>>>>>>>>>>>>>>>>>>>>>> a system that has a contradiction. >>>>>>>>>>>>>>>>>>>>>>>>

    My reason to get rid of the principle of explosion >>>>>>>>>>>>>>>>>>>>>>> it to get rid of anything and everything that >>>>>>>>>>>>>>>>>>>>>>> prevents
    infallibly correct reasoning.


    If you get rid of the principle of explosion, the >>>>>>>>>>>>>>>>>>>>>> law of non- contradiction goes away as it looses >>>>>>>>>>>>>>>>>>>>>> its basis.


    You keep failing to pay close enough attention. >>>>>>>>>>>>>>>>>>>>> I only get rid of the POE by getting rid of >>>>>>>>>>>>>>>>>>>>> Disjunction introduction.

    Which you can't do because it's a truth-preserving >>>>>>>>>>>>>>>>>>>> operation.

    1) P ∧ ¬P    // Premise
    2) P          // Conjunction elimination >>>>>>>>>>>>>>>>>>> 3) ¬P        // Conjunction elimination >>>>>>>>>>>>>>>>>>> 4) P ∨ Q      // Disjunction introduction >>>>>>>>>>>>>>>>>>> 5) Q          // Disjunctive syllogism >>>>>>>>>>>>>>>>>>> https://en.wikipedia.org/wiki/
    Principle_of_explosion#Proof

    When you insert English meanings into the >>>>>>>>>>>>>>>>>>> propositional variables it is as obvious >>>>>>>>>>>>>>>>>>> as a pie in the fact the DI IS NOT TRUTH PRESERVING. >>>>>>>>>>>>>>>>>>
    So you're saying that in the following natural >>>>>>>>>>>>>>>>>> language statement:

    --------------------------------------
    At least one of the following statements is true: >>>>>>>>>>>>>>>>>> - Earth is the third planet from the sun.
    - <X>
    --------------------------------------

    Where <X> is any natural language statement, there >>>>>>>>>>>>>>>>>> exists a statement X such that the condition "At least >>>>>>>>>>>>>>>>>> one of the following statements is true" is false. >>>>>>>>>>>>>>>>>>
    Name it.


    That is not Disjunction introduction combined with >>>>>>>>>>>>>>>>> Disjunctive syllogism, it is bare Disjunction. >>>>>>>>>>>>>>>>>

    Let me spell it out more explicitly then.

    Given that the following natural language statement is >>>>>>>>>>>>>>>> true:

    --------------------------------------
    Earth is the third planet from the sun.
    --------------------------------------

    In the following natural language statement:

    --------------------------------------
    At least one of the following statements is true: >>>>>>>>>>>>>>>> - Earth is the third planet from the sun.
    - <X>
    --------------------------------------

    Where <X> is any natural language statement, does there >>>>>>>>>>>>>>>> exist a statement X such that the condition "At least >>>>>>>>>>>>>>>> one of the following statements is true" is false? >>>>>>>>>>>>>>>>

    Where X is "What time is it?"



    Is the statement "Earth is the third planet from the sun" >>>>>>>>>>>>>> true?

    We have a type mismatch error.



    The statement you gave isn't a truth-bearing statement, so >>>>>>>>>>>> it can't be used in logic.  I didn't think I had to make >>>>>>>>>>>> that explicit.

    However, let's go with it anyway because it still
    illustrates the point.

    So I'll ask again:

    Is the statement "Earth is the third planet from the sun" true? >>>>>>>>>>>>

    On second though, let's back up as that might confuse you. >>>>>>>>>>>
    Given that <X> is any *truth bearing* natural language
    statement, does there exist a statement X such that the >>>>>>>>>>> condition "At least one of the following statements is true" >>>>>>>>>>> is false?


    Head games will be ignored.
    That you did so well on the other things
    so I will not block you.


    Explain in detail how this is a head game.

    Failure to either answer the above question or explain how it >>>>>>>>> is a head game in your next reply or within one hour of you >>>>>>>>> next post in this newsgroup will be taken as your official, on- >>>>>>>>> the- record admission that Disjunction introduction is in fact >>>>>>>>> truth preserving and valid, and therefore so is the Principle >>>>>>>>> of Explosion.


    Let the record show that Peter Olcott made the following post in >>>>>>>> this newsgroup:

    On 6/28/2026 10:52 PM, olcott wrote:
    Q also can't bake a birthday cake, this does not make
    Q in any way "incomplete" relative to what it was
    defined to do.
    ...

    And more that one hour has passed with no attempt to answer the >>>>>>>> above question or explain why it is a head game.  Therefore, as >>>>>>>> per the above criteria:

    Let The Record Show

    That Peter Olcott

    Has *Officially* Admitted:

    That Disjunction introduction is in fact truth preserving and >>>>>>>> valid, and therefore so is the Principle of Explosion.



    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for
    Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many
    systems of analytic implication belonging to its ilk) is

    the rejection of the classically valid principle of Addition,
    sometimes also referred to as Disjunction Introduction. In

    other words, the principle leading from a formula ϕ to a
    disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary
    formula. Parry blamed on this principle the derivability
    of the paradoxes of strict implication—given that it is
    famously featured in Lewis’ derivation of an arbitrary
    formula ψ from a contradiction of the form ϕ ∧ ¬ϕ.

    https://philarchive.org/archive/SZMASL


    So someone came up with a different system that has different
    rules. That has no bearing on existing systems.


    The bearing that it has on existing systems is

    None, as you can't remove a truth-preserving operation.



    that
    it corrects their psychotic break from reality that
    allows one to prove that Donald Trump is the one and
    only Lord and Savior on the basis of a totally irrelevant
    contradiction.

    It follows from a series of truth-preserving operations starting
    with the precondition that a contradiction has been proven, as you
    have admitted above on the record.

    Only people having actual psychosis would conclude
    that "The Moon is made from green cheese" AND
    "The Moon is NOT made from green cheese" SEMANTICALLY
    PROVES that Donald Trump is the one and only Lord
    and Savior Jesus Christ.

    How do you know that somewhere the Moon is made from green cheese and
    the Moon is not made from green cheese and Donald Trump is not the one
    and only Lord and Savior Jesus Christ?


    Counter-factual

    For logic the distinction between factual and counter-factual is not
    as imortant as the distinction between consistent and contradictory.
    As long as the premises are consistent they may be true about
    somesituation even if they are false in the intended interpretation. Contradictory premises cannot be all true in any interpretation.
    From contradictory or otherwise false premises it is possible to
    infer both true and false conclusions.
    --
    Mikko
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to sci.logic,comp.theory,sci.math,comp.ai.philosophy on Wed Jul 1 09:50:02 2026
    From Newsgroup: comp.ai.philosophy

    On 30/06/2026 16:45, olcott wrote:
    On 6/30/2026 2:55 AM, Mikko wrote:
    On 29/06/2026 16:23, dbush wrote:
    On 6/29/2026 9:17 AM, polcott wrote:
    On 6/29/2026 7:08 AM, dbush wrote:
    On 6/29/2026 12:13 AM, olcott wrote:
    On 6/28/2026 10:56 PM, dbush wrote:
    On 6/27/2026 11:34 PM, dbush wrote:
    On 6/27/2026 11:23 PM, olcott wrote:
    On 6/27/2026 9:02 PM, dbush wrote:
    On 6/27/2026 9:53 PM, dbush wrote:
    On 6/27/2026 9:49 PM, olcott wrote:
    On 6/27/2026 8:42 PM, dbush wrote:
    On 6/27/2026 9:40 PM, olcott wrote:
    On 6/27/2026 8:29 PM, dbush wrote:
    On 6/27/2026 9:24 PM, olcott wrote:
    On 6/27/2026 8:08 PM, dbush wrote:
    On 6/27/2026 7:56 PM, olcott wrote:
    On 6/27/2026 6:30 PM, dbush wrote:
    On 6/27/2026 7:22 PM, olcott wrote:
    On 6/27/2026 5:52 PM, dbush wrote:
    On 6/27/2026 6:40 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 1:34 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:29 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 1:24 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:03 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 12:54 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 11:11 AM, polcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:08 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 26/06/2026 15:49, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/26/2026 1:49 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 26/06/2026 04:32, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> William T. Parry, Entailment Logics >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> gets rid of Disjunction introduction >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> to prevent the principle of explosion >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    A simple logical matrix and sequent >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> calculus for
    Parry’s logic of Analytic Implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    The main and distinctive feature of PAI >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> (and of the many >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> systems of analytic implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> belonging to its ilk) is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> the rejection of the classically valid >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> principle of Addition, >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> sometimes also referred to as >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Disjunction Introduction. In >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> other words, the principle leading from >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> a formula ϕ to a >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where ψ >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> is an arbitrary >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formula. Parry blamed on this principle >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> the derivability >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of the paradoxes of strict implication— >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> given that it is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> famously featured in Lewis’ derivation >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of an arbitrary >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formula ψ from a contradiction of the >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> form ϕ ∧ ¬ϕ. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    He also gets rid of an efficient way to >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> convince people who don't >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> understand much of logic. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    As I recently showed in another post. I >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> figured
    all this out on my own. I didn't even know >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> that
    anyone else ever did this. I just knew >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> that when
    trying to find out what is deduced from a >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> set of
    premises that you cannot pop in another >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> sentence
    from out of nowhere and get a correct >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> conclusion.

    By popping in another sentence from out of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> nowhere
    (as it shows above) the principle of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> explosion is
    derived.

    The usual meaning of proof is a sequence of >>>>>>>>>>>>>>>>>>>>>>>>>>>>> statement where eachstatement either is a >>>>>>>>>>>>>>>>>>>>>>>>>>>>> premis or follows from one or more earlier >>>>>>>>>>>>>>>>>>>>>>>>>>>>> statements

    Except with Disjunction introduction, that >>>>>>>>>>>>>>>>>>>>>>>>>>>> is its problem.

    So you're saying that in the following >>>>>>>>>>>>>>>>>>>>>>>>>>> natural language statement: >>>>>>>>>>>>>>>>>>>>>>>>>>>

    It is a key issue in that it creates the >>>>>>>>>>>>>>>>>>>>>>>>>> psychotic break from reality known as the >>>>>>>>>>>>>>>>>>>>>>>>>> Principle of Explosion, otherwise it may >>>>>>>>>>>>>>>>>>>>>>>>>> make no difference at all. >>>>>>>>>>>>>>>>>>>>>>>>>>
    Stay on topic or I will block you. >>>>>>>>>>>>>>>>>>>>>>>>>
    Explain in detail how the below which you >>>>>>>>>>>>>>>>>>>>>>>>> dishonestly trimmed is off- topic. >>>>>>>>>>>>>>>>>>>>>>>>>

    The topic is how Disjunction introduction >>>>>>>>>>>>>>>>>>>>>>>> enables the
    Principle of Explosion.


    Rejected, as you not liking the result doesn't >>>>>>>>>>>>>>>>>>>>>>> make it invalid.

    Through a series of truth preserving operations, >>>>>>>>>>>>>>>>>>>>>>> when a contradiction is given as true, any >>>>>>>>>>>>>>>>>>>>>>> statement can be proven as true. >>>>>>>>>>>>>>>>>>>>>>>
    The principle of explosion is a demonstration of >>>>>>>>>>>>>>>>>>>>>>> *why* a formal system whose axioms lead to a >>>>>>>>>>>>>>>>>>>>>>> contradiction is useless.

    The only reason someone would want to get rid of >>>>>>>>>>>>>>>>>>>>>>> the principle of explosion is to be able to use a >>>>>>>>>>>>>>>>>>>>>>> system that has a contradiction. >>>>>>>>>>>>>>>>>>>>>>>

    My reason to get rid of the principle of explosion >>>>>>>>>>>>>>>>>>>>>> it to get rid of anything and everything that >>>>>>>>>>>>>>>>>>>>>> prevents
    infallibly correct reasoning.


    If you get rid of the principle of explosion, the >>>>>>>>>>>>>>>>>>>>> law of non- contradiction goes away as it looses >>>>>>>>>>>>>>>>>>>>> its basis.


    You keep failing to pay close enough attention. >>>>>>>>>>>>>>>>>>>> I only get rid of the POE by getting rid of >>>>>>>>>>>>>>>>>>>> Disjunction introduction.

    Which you can't do because it's a truth-preserving >>>>>>>>>>>>>>>>>>> operation.

    1) P ∧ ¬P    // Premise
    2) P          // Conjunction elimination >>>>>>>>>>>>>>>>>> 3) ¬P        // Conjunction elimination >>>>>>>>>>>>>>>>>> 4) P ∨ Q      // Disjunction introduction >>>>>>>>>>>>>>>>>> 5) Q          // Disjunctive syllogism >>>>>>>>>>>>>>>>>> https://en.wikipedia.org/wiki/
    Principle_of_explosion#Proof

    When you insert English meanings into the
    propositional variables it is as obvious
    as a pie in the fact the DI IS NOT TRUTH PRESERVING. >>>>>>>>>>>>>>>>>
    So you're saying that in the following natural language >>>>>>>>>>>>>>>>> statement:

    --------------------------------------
    At least one of the following statements is true: >>>>>>>>>>>>>>>>> - Earth is the third planet from the sun.
    - <X>
    --------------------------------------

    Where <X> is any natural language statement, there >>>>>>>>>>>>>>>>> exists a statement X such that the condition "At least >>>>>>>>>>>>>>>>> one of the following statements is true" is false. >>>>>>>>>>>>>>>>>
    Name it.


    That is not Disjunction introduction combined with >>>>>>>>>>>>>>>> Disjunctive syllogism, it is bare Disjunction. >>>>>>>>>>>>>>>>

    Let me spell it out more explicitly then.

    Given that the following natural language statement is true: >>>>>>>>>>>>>>>
    --------------------------------------
    Earth is the third planet from the sun.
    --------------------------------------

    In the following natural language statement:

    --------------------------------------
    At least one of the following statements is true: >>>>>>>>>>>>>>> - Earth is the third planet from the sun.
    - <X>
    --------------------------------------

    Where <X> is any natural language statement, does there >>>>>>>>>>>>>>> exist a statement X such that the condition "At least one >>>>>>>>>>>>>>> of the following statements is true" is false?


    Where X is "What time is it?"



    Is the statement "Earth is the third planet from the sun" >>>>>>>>>>>>> true?

    We have a type mismatch error.



    The statement you gave isn't a truth-bearing statement, so it >>>>>>>>>>> can't be used in logic.  I didn't think I had to make that >>>>>>>>>>> explicit.

    However, let's go with it anyway because it still illustrates >>>>>>>>>>> the point.

    So I'll ask again:

    Is the statement "Earth is the third planet from the sun" true? >>>>>>>>>>>

    On second though, let's back up as that might confuse you. >>>>>>>>>>
    Given that <X> is any *truth bearing* natural language
    statement, does there exist a statement X such that the
    condition "At least one of the following statements is true" >>>>>>>>>> is false?


    Head games will be ignored.
    That you did so well on the other things
    so I will not block you.


    Explain in detail how this is a head game.

    Failure to either answer the above question or explain how it is >>>>>>>> a head game in your next reply or within one hour of you next >>>>>>>> post in this newsgroup will be taken as your official, on-the- >>>>>>>> record admission that Disjunction introduction is in fact truth >>>>>>>> preserving and valid, and therefore so is the Principle of
    Explosion.


    Let the record show that Peter Olcott made the following post in >>>>>>> this newsgroup:

    On 6/28/2026 10:52 PM, olcott wrote:
    Q also can't bake a birthday cake, this does not make
    Q in any way "incomplete" relative to what it was
    defined to do.
    ...

    And more that one hour has passed with no attempt to answer the >>>>>>> above question or explain why it is a head game.  Therefore, as >>>>>>> per the above criteria:

    Let The Record Show

    That Peter Olcott

    Has *Officially* Admitted:

    That Disjunction introduction is in fact truth preserving and
    valid, and therefore so is the Principle of Explosion.



    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for
    Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many
    systems of analytic implication belonging to its ilk) is

    the rejection of the classically valid principle of Addition,
    sometimes also referred to as Disjunction Introduction. In

    other words, the principle leading from a formula ϕ to a
    disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary
    formula. Parry blamed on this principle the derivability
    of the paradoxes of strict implication—given that it is
    famously featured in Lewis’ derivation of an arbitrary
    formula ψ from a contradiction of the form ϕ ∧ ¬ϕ.

    https://philarchive.org/archive/SZMASL


    So someone came up with a different system that has different
    rules. That has no bearing on existing systems.


    The bearing that it has on existing systems is

    None, as you can't remove a truth-preserving operation.

    One can construct a system where a truth-preserving operation is not
    valid, and must if one wants to construct a paraconsistent system,
    where some but not every sentence can be both PTS-true and PTS-false.


    Current semantic entailment is the only inference step allowed.

    Every truth-prserving transformation is a correct semantic entailment.
    In particular, disjunction introduction is.
    --
    Mikko

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to sci.logic,sci.math,comp.theory,comp.ai.philosophy on Wed Jul 1 09:53:39 2026
    From Newsgroup: comp.ai.philosophy

    On 30/06/2026 16:55, olcott wrote:
    On 6/30/2026 3:10 AM, Mikko wrote:
    On 29/06/2026 16:55, olcott wrote:
    On 6/28/2026 4:32 AM, Mikko wrote:
    On 27/06/2026 21:29, olcott wrote:
    On 6/27/2026 1:24 PM, dbush wrote:
    On 6/27/2026 2:03 PM, olcott wrote:
    On 6/27/2026 12:54 PM, dbush wrote:
    On 6/27/2026 11:11 AM, polcott wrote:
    On 6/27/2026 2:08 AM, Mikko wrote:
    On 26/06/2026 15:49, olcott wrote:
    On 6/26/2026 1:49 AM, Mikko wrote:
    On 26/06/2026 04:32, olcott wrote:
    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for
    Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many >>>>>>>>>>>>> systems of analytic implication belonging to its ilk) is >>>>>>>>>>>>> the rejection of the classically valid principle of Addition, >>>>>>>>>>>>> sometimes also referred to as Disjunction Introduction. In >>>>>>>>>>>>> other words, the principle leading from a formula ϕ to a >>>>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary >>>>>>>>>>>>> formula. Parry blamed on this principle the derivability >>>>>>>>>>>>> of the paradoxes of strict implication—given that it is >>>>>>>>>>>>> famously featured in Lewis’ derivation of an arbitrary >>>>>>>>>>>>> formula ψ from a contradiction of the form ϕ ∧ ¬ϕ. >>>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL

    He also gets rid of an efficient way to convince people who >>>>>>>>>>>> don't
    understand much of logic.

    As I recently showed in another post. I figured
    all this out on my own. I didn't even know that
    anyone else ever did this. I just knew that when
    trying to find out what is deduced from a set of
    premises that you cannot pop in another sentence
    from out of nowhere and get a correct conclusion.

    By popping in another sentence from out of nowhere
    (as it shows above) the principle of explosion is
    derived.

    The usual meaning of proof is a sequence of statement where >>>>>>>>>> eachstatement either is a premis or follows from one or more >>>>>>>>>> earlier
    statements

    Except with Disjunction introduction, that is its problem.

    So you're saying that in the following natural language statement: >>>>>>>>

    It is a key issue in that it creates the
    psychotic break from reality known as the
    Principle of Explosion, otherwise it may
    make no difference at all.

    Stay on topic or I will block you.

    Explain in detail how the below which you dishonestly trimmed is
    off- topic.


    The topic is how Disjunction introduction enables the
    Principle of Explosion.

    It does not. In any sensible logic every tautology is provable.
    Then the principle of explosion follows.

    POE is unprovable in both of these more sensible systems
    of logic.

    THe expression "these system" above does not denote.


    Parry’s logic of Analytic Implication

    Relevance Logic
    https://plato.stanford.edu/entries/logic-relevance/

    The POE is an actual psychotic break from
    reality when one pays full and complete attention to
    the underlying semantics and does not stupidly take
    semantics out of logic and put it in a separate model.

    No, it is not. The principle of explosion is about consequencies
    of a false premise, which already is a break from reality even
    when no consequence is inferred.

    Only because semantics is ignored.

    A break from reality is a break from reality, no matter whether
    the semantics is ignored or considered. Though if there is no
    semantics, even any ignored one, there is no connection to
    reality to break.
    --
    Mikko
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to sci.logic,sci.math,comp.theory,comp.ai.philosophy on Wed Jul 1 10:32:18 2026
    From Newsgroup: comp.ai.philosophy

    On 30/06/2026 16:55, olcott wrote:
    On 6/30/2026 3:10 AM, Mikko wrote:
    On 29/06/2026 16:55, olcott wrote:
    On 6/28/2026 4:32 AM, Mikko wrote:
    On 27/06/2026 21:29, olcott wrote:
    On 6/27/2026 1:24 PM, dbush wrote:
    On 6/27/2026 2:03 PM, olcott wrote:
    On 6/27/2026 12:54 PM, dbush wrote:
    On 6/27/2026 11:11 AM, polcott wrote:
    On 6/27/2026 2:08 AM, Mikko wrote:
    On 26/06/2026 15:49, olcott wrote:
    On 6/26/2026 1:49 AM, Mikko wrote:
    On 26/06/2026 04:32, olcott wrote:
    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for
    Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many >>>>>>>>>>>>> systems of analytic implication belonging to its ilk) is >>>>>>>>>>>>> the rejection of the classically valid principle of Addition, >>>>>>>>>>>>> sometimes also referred to as Disjunction Introduction. In >>>>>>>>>>>>> other words, the principle leading from a formula ϕ to a >>>>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary >>>>>>>>>>>>> formula. Parry blamed on this principle the derivability >>>>>>>>>>>>> of the paradoxes of strict implication—given that it is >>>>>>>>>>>>> famously featured in Lewis’ derivation of an arbitrary >>>>>>>>>>>>> formula ψ from a contradiction of the form ϕ ∧ ¬ϕ. >>>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL

    He also gets rid of an efficient way to convince people who >>>>>>>>>>>> don't
    understand much of logic.

    As I recently showed in another post. I figured
    all this out on my own. I didn't even know that
    anyone else ever did this. I just knew that when
    trying to find out what is deduced from a set of
    premises that you cannot pop in another sentence
    from out of nowhere and get a correct conclusion.

    By popping in another sentence from out of nowhere
    (as it shows above) the principle of explosion is
    derived.

    The usual meaning of proof is a sequence of statement where >>>>>>>>>> eachstatement either is a premis or follows from one or more >>>>>>>>>> earlier
    statements

    Except with Disjunction introduction, that is its problem.

    So you're saying that in the following natural language statement: >>>>>>>>

    It is a key issue in that it creates the
    psychotic break from reality known as the
    Principle of Explosion, otherwise it may
    make no difference at all.

    Stay on topic or I will block you.

    Explain in detail how the below which you dishonestly trimmed is
    off- topic.


    The topic is how Disjunction introduction enables the
    Principle of Explosion.

    It does not. In any sensible logic every tautology is provable.
    Then the principle of explosion follows.

    POE is unprovable in both of these more sensible systems
    of logic.

    THe expression "these system" above does not denote.

    Parry’s logic of Analytic Implication

    If the intent was to include that in the denotation you failed
    to say something important.
    --
    Mikko
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,sci.math,comp.ai.philosophy on Wed Jul 1 10:01:12 2026
    From Newsgroup: comp.ai.philosophy

    On 7/1/2026 1:46 AM, Mikko wrote:
    On 30/06/2026 17:37, olcott wrote:
    On 6/30/2026 3:48 AM, Mikko wrote:
    On 29/06/2026 17:00, olcott wrote:
    On 6/29/2026 8:23 AM, dbush wrote:
    On 6/29/2026 9:17 AM, polcott wrote:
    On 6/29/2026 7:08 AM, dbush wrote:
    On 6/29/2026 12:13 AM, olcott wrote:
    On 6/28/2026 10:56 PM, dbush wrote:
    On 6/27/2026 11:34 PM, dbush wrote:
    On 6/27/2026 11:23 PM, olcott wrote:
    On 6/27/2026 9:02 PM, dbush wrote:
    On 6/27/2026 9:53 PM, dbush wrote:
    On 6/27/2026 9:49 PM, olcott wrote:
    On 6/27/2026 8:42 PM, dbush wrote:
    On 6/27/2026 9:40 PM, olcott wrote:
    On 6/27/2026 8:29 PM, dbush wrote:
    On 6/27/2026 9:24 PM, olcott wrote:
    On 6/27/2026 8:08 PM, dbush wrote:
    On 6/27/2026 7:56 PM, olcott wrote:
    On 6/27/2026 6:30 PM, dbush wrote:
    On 6/27/2026 7:22 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 5:52 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 6:40 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 1:34 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:29 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 1:24 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:03 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 12:54 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 11:11 AM, polcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:08 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 26/06/2026 15:49, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/26/2026 1:49 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 26/06/2026 04:32, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> William T. Parry, Entailment Logics >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> gets rid of Disjunction introduction >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> to prevent the principle of explosion >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    A simple logical matrix and sequent >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> calculus for >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Parry’s logic of Analytic Implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    The main and distinctive feature of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> PAI (and of the many >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> systems of analytic implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> belonging to its ilk) is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> the rejection of the classically valid >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> principle of Addition, >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> sometimes also referred to as >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Disjunction Introduction. In >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> other words, the principle leading >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> from a formula ϕ to a >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where ψ >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> is an arbitrary >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formula. Parry blamed on this >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> principle the derivability >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of the paradoxes of strict implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> — given that it is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> famously featured in Lewis’ derivation >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of an arbitrary >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formula ψ from a contradiction of the >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> form ϕ ∧ ¬ϕ. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    He also gets rid of an efficient way to >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> convince people who don't >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> understand much of logic. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    As I recently showed in another post. I >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> figured
    all this out on my own. I didn't even >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> know that
    anyone else ever did this. I just knew >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> that when
    trying to find out what is deduced from >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> a set of
    premises that you cannot pop in another >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> sentence
    from out of nowhere and get a correct >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> conclusion.

    By popping in another sentence from out >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of nowhere
    (as it shows above) the principle of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> explosion is
    derived.

    The usual meaning of proof is a sequence >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of statement where eachstatement either >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> is a premis or follows from one or more >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> earlier
    statements

    Except with Disjunction introduction, that >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> is its problem.

    So you're saying that in the following >>>>>>>>>>>>>>>>>>>>>>>>>>>>> natural language statement: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>

    It is a key issue in that it creates the >>>>>>>>>>>>>>>>>>>>>>>>>>>> psychotic break from reality known as the >>>>>>>>>>>>>>>>>>>>>>>>>>>> Principle of Explosion, otherwise it may >>>>>>>>>>>>>>>>>>>>>>>>>>>> make no difference at all. >>>>>>>>>>>>>>>>>>>>>>>>>>>>
    Stay on topic or I will block you. >>>>>>>>>>>>>>>>>>>>>>>>>>>
    Explain in detail how the below which you >>>>>>>>>>>>>>>>>>>>>>>>>>> dishonestly trimmed is off- topic. >>>>>>>>>>>>>>>>>>>>>>>>>>>

    The topic is how Disjunction introduction >>>>>>>>>>>>>>>>>>>>>>>>>> enables the
    Principle of Explosion.


    Rejected, as you not liking the result doesn't >>>>>>>>>>>>>>>>>>>>>>>>> make it invalid.

    Through a series of truth preserving >>>>>>>>>>>>>>>>>>>>>>>>> operations, when a contradiction is given as >>>>>>>>>>>>>>>>>>>>>>>>> true, any statement can be proven as true. >>>>>>>>>>>>>>>>>>>>>>>>>
    The principle of explosion is a demonstration >>>>>>>>>>>>>>>>>>>>>>>>> of *why* a formal system whose axioms lead to a >>>>>>>>>>>>>>>>>>>>>>>>> contradiction is useless.

    The only reason someone would want to get rid >>>>>>>>>>>>>>>>>>>>>>>>> of the principle of explosion is to be able to >>>>>>>>>>>>>>>>>>>>>>>>> use a system that has a contradiction. >>>>>>>>>>>>>>>>>>>>>>>>>

    My reason to get rid of the principle of explosion >>>>>>>>>>>>>>>>>>>>>>>> it to get rid of anything and everything that >>>>>>>>>>>>>>>>>>>>>>>> prevents
    infallibly correct reasoning.


    If you get rid of the principle of explosion, the >>>>>>>>>>>>>>>>>>>>>>> law of non- contradiction goes away as it looses >>>>>>>>>>>>>>>>>>>>>>> its basis.


    You keep failing to pay close enough attention. >>>>>>>>>>>>>>>>>>>>>> I only get rid of the POE by getting rid of >>>>>>>>>>>>>>>>>>>>>> Disjunction introduction.

    Which you can't do because it's a truth-preserving >>>>>>>>>>>>>>>>>>>>> operation.

    1) P ∧ ¬P    // Premise
    2) P          // Conjunction elimination >>>>>>>>>>>>>>>>>>>> 3) ¬P        // Conjunction elimination >>>>>>>>>>>>>>>>>>>> 4) P ∨ Q      // Disjunction introduction >>>>>>>>>>>>>>>>>>>> 5) Q          // Disjunctive syllogism >>>>>>>>>>>>>>>>>>>> https://en.wikipedia.org/wiki/
    Principle_of_explosion#Proof

    When you insert English meanings into the >>>>>>>>>>>>>>>>>>>> propositional variables it is as obvious >>>>>>>>>>>>>>>>>>>> as a pie in the fact the DI IS NOT TRUTH PRESERVING. >>>>>>>>>>>>>>>>>>>
    So you're saying that in the following natural >>>>>>>>>>>>>>>>>>> language statement:

    --------------------------------------
    At least one of the following statements is true: >>>>>>>>>>>>>>>>>>> - Earth is the third planet from the sun. >>>>>>>>>>>>>>>>>>> - <X>
    --------------------------------------

    Where <X> is any natural language statement, there >>>>>>>>>>>>>>>>>>> exists a statement X such that the condition "At >>>>>>>>>>>>>>>>>>> least one of the following statements is true" is false. >>>>>>>>>>>>>>>>>>>
    Name it.


    That is not Disjunction introduction combined with >>>>>>>>>>>>>>>>>> Disjunctive syllogism, it is bare Disjunction. >>>>>>>>>>>>>>>>>>

    Let me spell it out more explicitly then.

    Given that the following natural language statement is >>>>>>>>>>>>>>>>> true:

    --------------------------------------
    Earth is the third planet from the sun.
    --------------------------------------

    In the following natural language statement: >>>>>>>>>>>>>>>>>
    --------------------------------------
    At least one of the following statements is true: >>>>>>>>>>>>>>>>> - Earth is the third planet from the sun.
    - <X>
    --------------------------------------

    Where <X> is any natural language statement, does there >>>>>>>>>>>>>>>>> exist a statement X such that the condition "At least >>>>>>>>>>>>>>>>> one of the following statements is true" is false? >>>>>>>>>>>>>>>>>

    Where X is "What time is it?"



    Is the statement "Earth is the third planet from the sun" >>>>>>>>>>>>>>> true?

    We have a type mismatch error.



    The statement you gave isn't a truth-bearing statement, so >>>>>>>>>>>>> it can't be used in logic.  I didn't think I had to make >>>>>>>>>>>>> that explicit.

    However, let's go with it anyway because it still
    illustrates the point.

    So I'll ask again:

    Is the statement "Earth is the third planet from the sun" >>>>>>>>>>>>> true?


    On second though, let's back up as that might confuse you. >>>>>>>>>>>>
    Given that <X> is any *truth bearing* natural language >>>>>>>>>>>> statement, does there exist a statement X such that the >>>>>>>>>>>> condition "At least one of the following statements is true" >>>>>>>>>>>> is false?


    Head games will be ignored.
    That you did so well on the other things
    so I will not block you.


    Explain in detail how this is a head game.

    Failure to either answer the above question or explain how it >>>>>>>>>> is a head game in your next reply or within one hour of you >>>>>>>>>> next post in this newsgroup will be taken as your official, >>>>>>>>>> on- the- record admission that Disjunction introduction is in >>>>>>>>>> fact truth preserving and valid, and therefore so is the
    Principle of Explosion.


    Let the record show that Peter Olcott made the following post >>>>>>>>> in this newsgroup:

    On 6/28/2026 10:52 PM, olcott wrote:
    Q also can't bake a birthday cake, this does not make
    Q in any way "incomplete" relative to what it was
    defined to do.
    ...

    And more that one hour has passed with no attempt to answer the >>>>>>>>> above question or explain why it is a head game.  Therefore, as >>>>>>>>> per the above criteria:

    Let The Record Show

    That Peter Olcott

    Has *Officially* Admitted:

    That Disjunction introduction is in fact truth preserving and >>>>>>>>> valid, and therefore so is the Principle of Explosion.



    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for
    Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many
    systems of analytic implication belonging to its ilk) is

    the rejection of the classically valid principle of Addition,
    sometimes also referred to as Disjunction Introduction. In

    other words, the principle leading from a formula ϕ to a
    disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary
    formula. Parry blamed on this principle the derivability
    of the paradoxes of strict implication—given that it is
    famously featured in Lewis’ derivation of an arbitrary
    formula ψ from a contradiction of the form ϕ ∧ ¬ϕ.

    https://philarchive.org/archive/SZMASL


    So someone came up with a different system that has different
    rules. That has no bearing on existing systems.


    The bearing that it has on existing systems is

    None, as you can't remove a truth-preserving operation.



    that
    it corrects their psychotic break from reality that
    allows one to prove that Donald Trump is the one and
    only Lord and Savior on the basis of a totally irrelevant
    contradiction.

    It follows from a series of truth-preserving operations starting
    with the precondition that a contradiction has been proven, as you
    have admitted above on the record.

    Only people having actual psychosis would conclude
    that "The Moon is made from green cheese" AND
    "The Moon is NOT made from green cheese" SEMANTICALLY
    PROVES that Donald Trump is the one and only Lord
    and Savior Jesus Christ.

    How do you know that somewhere the Moon is made from green cheese and
    the Moon is not made from green cheese and Donald Trump is not the one
    and only Lord and Savior Jesus Christ?


    Counter-factual

    For logic the distinction between factual and counter-factual is not
    as imortant as the distinction between consistent and contradictory.

    Counter-factual may indicate a psychotic break from reality.

    As long as the premises are consistent they may be true about
    some situation even if they are false in the intended interpretation. Contradictory premises cannot be all true in any interpretation.
    From contradictory or otherwise false premises it is possible to
    infer both true and false conclusions.

    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,sci.math,comp.ai.philosophy on Wed Jul 1 10:04:37 2026
    From Newsgroup: comp.ai.philosophy

    On 7/1/2026 1:50 AM, Mikko wrote:
    On 30/06/2026 16:45, olcott wrote:
    On 6/30/2026 2:55 AM, Mikko wrote:
    On 29/06/2026 16:23, dbush wrote:
    On 6/29/2026 9:17 AM, polcott wrote:
    On 6/29/2026 7:08 AM, dbush wrote:
    On 6/29/2026 12:13 AM, olcott wrote:
    On 6/28/2026 10:56 PM, dbush wrote:
    On 6/27/2026 11:34 PM, dbush wrote:
    On 6/27/2026 11:23 PM, olcott wrote:
    On 6/27/2026 9:02 PM, dbush wrote:
    On 6/27/2026 9:53 PM, dbush wrote:
    On 6/27/2026 9:49 PM, olcott wrote:
    On 6/27/2026 8:42 PM, dbush wrote:
    On 6/27/2026 9:40 PM, olcott wrote:
    On 6/27/2026 8:29 PM, dbush wrote:
    On 6/27/2026 9:24 PM, olcott wrote:
    On 6/27/2026 8:08 PM, dbush wrote:
    On 6/27/2026 7:56 PM, olcott wrote:
    On 6/27/2026 6:30 PM, dbush wrote:
    On 6/27/2026 7:22 PM, olcott wrote:
    On 6/27/2026 5:52 PM, dbush wrote:
    On 6/27/2026 6:40 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 1:34 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:29 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 1:24 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:03 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 12:54 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 11:11 AM, polcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:08 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 26/06/2026 15:49, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/26/2026 1:49 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 26/06/2026 04:32, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> William T. Parry, Entailment Logics >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> gets rid of Disjunction introduction >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> to prevent the principle of explosion >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    A simple logical matrix and sequent >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> calculus for >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Parry’s logic of Analytic Implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    The main and distinctive feature of PAI >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> (and of the many >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> systems of analytic implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> belonging to its ilk) is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> the rejection of the classically valid >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> principle of Addition, >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> sometimes also referred to as >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Disjunction Introduction. In >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> other words, the principle leading from >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> a formula ϕ to a >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where ψ >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> is an arbitrary >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formula. Parry blamed on this principle >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> the derivability >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of the paradoxes of strict implication— >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> given that it is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> famously featured in Lewis’ derivation >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of an arbitrary >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formula ψ from a contradiction of the >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> form ϕ ∧ ¬ϕ. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    He also gets rid of an efficient way to >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> convince people who don't >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> understand much of logic. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    As I recently showed in another post. I >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> figured
    all this out on my own. I didn't even >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> know that
    anyone else ever did this. I just knew >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> that when
    trying to find out what is deduced from a >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> set of
    premises that you cannot pop in another >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> sentence
    from out of nowhere and get a correct >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> conclusion.

    By popping in another sentence from out >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of nowhere
    (as it shows above) the principle of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> explosion is
    derived.

    The usual meaning of proof is a sequence >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of statement where eachstatement either is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> a premis or follows from one or more earlier >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> statements

    Except with Disjunction introduction, that >>>>>>>>>>>>>>>>>>>>>>>>>>>>> is its problem.

    So you're saying that in the following >>>>>>>>>>>>>>>>>>>>>>>>>>>> natural language statement: >>>>>>>>>>>>>>>>>>>>>>>>>>>>

    It is a key issue in that it creates the >>>>>>>>>>>>>>>>>>>>>>>>>>> psychotic break from reality known as the >>>>>>>>>>>>>>>>>>>>>>>>>>> Principle of Explosion, otherwise it may >>>>>>>>>>>>>>>>>>>>>>>>>>> make no difference at all. >>>>>>>>>>>>>>>>>>>>>>>>>>>
    Stay on topic or I will block you. >>>>>>>>>>>>>>>>>>>>>>>>>>
    Explain in detail how the below which you >>>>>>>>>>>>>>>>>>>>>>>>>> dishonestly trimmed is off- topic. >>>>>>>>>>>>>>>>>>>>>>>>>>

    The topic is how Disjunction introduction >>>>>>>>>>>>>>>>>>>>>>>>> enables the
    Principle of Explosion.


    Rejected, as you not liking the result doesn't >>>>>>>>>>>>>>>>>>>>>>>> make it invalid.

    Through a series of truth preserving operations, >>>>>>>>>>>>>>>>>>>>>>>> when a contradiction is given as true, any >>>>>>>>>>>>>>>>>>>>>>>> statement can be proven as true. >>>>>>>>>>>>>>>>>>>>>>>>
    The principle of explosion is a demonstration of >>>>>>>>>>>>>>>>>>>>>>>> *why* a formal system whose axioms lead to a >>>>>>>>>>>>>>>>>>>>>>>> contradiction is useless.

    The only reason someone would want to get rid of >>>>>>>>>>>>>>>>>>>>>>>> the principle of explosion is to be able to use >>>>>>>>>>>>>>>>>>>>>>>> a system that has a contradiction. >>>>>>>>>>>>>>>>>>>>>>>>

    My reason to get rid of the principle of explosion >>>>>>>>>>>>>>>>>>>>>>> it to get rid of anything and everything that >>>>>>>>>>>>>>>>>>>>>>> prevents
    infallibly correct reasoning.


    If you get rid of the principle of explosion, the >>>>>>>>>>>>>>>>>>>>>> law of non- contradiction goes away as it looses >>>>>>>>>>>>>>>>>>>>>> its basis.


    You keep failing to pay close enough attention. >>>>>>>>>>>>>>>>>>>>> I only get rid of the POE by getting rid of >>>>>>>>>>>>>>>>>>>>> Disjunction introduction.

    Which you can't do because it's a truth-preserving >>>>>>>>>>>>>>>>>>>> operation.

    1) P ∧ ¬P    // Premise
    2) P          // Conjunction elimination >>>>>>>>>>>>>>>>>>> 3) ¬P        // Conjunction elimination >>>>>>>>>>>>>>>>>>> 4) P ∨ Q      // Disjunction introduction >>>>>>>>>>>>>>>>>>> 5) Q          // Disjunctive syllogism >>>>>>>>>>>>>>>>>>> https://en.wikipedia.org/wiki/
    Principle_of_explosion#Proof

    When you insert English meanings into the >>>>>>>>>>>>>>>>>>> propositional variables it is as obvious >>>>>>>>>>>>>>>>>>> as a pie in the fact the DI IS NOT TRUTH PRESERVING. >>>>>>>>>>>>>>>>>>
    So you're saying that in the following natural >>>>>>>>>>>>>>>>>> language statement:

    --------------------------------------
    At least one of the following statements is true: >>>>>>>>>>>>>>>>>> - Earth is the third planet from the sun.
    - <X>
    --------------------------------------

    Where <X> is any natural language statement, there >>>>>>>>>>>>>>>>>> exists a statement X such that the condition "At least >>>>>>>>>>>>>>>>>> one of the following statements is true" is false. >>>>>>>>>>>>>>>>>>
    Name it.


    That is not Disjunction introduction combined with >>>>>>>>>>>>>>>>> Disjunctive syllogism, it is bare Disjunction. >>>>>>>>>>>>>>>>>

    Let me spell it out more explicitly then.

    Given that the following natural language statement is >>>>>>>>>>>>>>>> true:

    --------------------------------------
    Earth is the third planet from the sun.
    --------------------------------------

    In the following natural language statement:

    --------------------------------------
    At least one of the following statements is true: >>>>>>>>>>>>>>>> - Earth is the third planet from the sun.
    - <X>
    --------------------------------------

    Where <X> is any natural language statement, does there >>>>>>>>>>>>>>>> exist a statement X such that the condition "At least >>>>>>>>>>>>>>>> one of the following statements is true" is false? >>>>>>>>>>>>>>>>

    Where X is "What time is it?"



    Is the statement "Earth is the third planet from the sun" >>>>>>>>>>>>>> true?

    We have a type mismatch error.



    The statement you gave isn't a truth-bearing statement, so >>>>>>>>>>>> it can't be used in logic.  I didn't think I had to make >>>>>>>>>>>> that explicit.

    However, let's go with it anyway because it still
    illustrates the point.

    So I'll ask again:

    Is the statement "Earth is the third planet from the sun" true? >>>>>>>>>>>>

    On second though, let's back up as that might confuse you. >>>>>>>>>>>
    Given that <X> is any *truth bearing* natural language
    statement, does there exist a statement X such that the >>>>>>>>>>> condition "At least one of the following statements is true" >>>>>>>>>>> is false?


    Head games will be ignored.
    That you did so well on the other things
    so I will not block you.


    Explain in detail how this is a head game.

    Failure to either answer the above question or explain how it >>>>>>>>> is a head game in your next reply or within one hour of you >>>>>>>>> next post in this newsgroup will be taken as your official, on- >>>>>>>>> the- record admission that Disjunction introduction is in fact >>>>>>>>> truth preserving and valid, and therefore so is the Principle >>>>>>>>> of Explosion.


    Let the record show that Peter Olcott made the following post in >>>>>>>> this newsgroup:

    On 6/28/2026 10:52 PM, olcott wrote:
    Q also can't bake a birthday cake, this does not make
    Q in any way "incomplete" relative to what it was
    defined to do.
    ...

    And more that one hour has passed with no attempt to answer the >>>>>>>> above question or explain why it is a head game.  Therefore, as >>>>>>>> per the above criteria:

    Let The Record Show

    That Peter Olcott

    Has *Officially* Admitted:

    That Disjunction introduction is in fact truth preserving and >>>>>>>> valid, and therefore so is the Principle of Explosion.



    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for
    Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many
    systems of analytic implication belonging to its ilk) is

    the rejection of the classically valid principle of Addition,
    sometimes also referred to as Disjunction Introduction. In

    other words, the principle leading from a formula ϕ to a
    disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary
    formula. Parry blamed on this principle the derivability
    of the paradoxes of strict implication—given that it is
    famously featured in Lewis’ derivation of an arbitrary
    formula ψ from a contradiction of the form ϕ ∧ ¬ϕ.

    https://philarchive.org/archive/SZMASL


    So someone came up with a different system that has different
    rules. That has no bearing on existing systems.


    The bearing that it has on existing systems is

    None, as you can't remove a truth-preserving operation.

    One can construct a system where a truth-preserving operation is not
    valid, and must if one wants to construct a paraconsistent system,
    where some but not every sentence can be both PTS-true and PTS-false.


    Current semantic entailment is the only inference step allowed.

    Every truth-prserving transformation is a correct semantic entailment.
    In particular, disjunction introduction is.


    That is counter-factual. POE is misconstrued as truth preserving.
    Every element of logic is utterly discarded and only the underlying
    semantics is preserved.
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,sci.math,comp.theory,comp.ai.philosophy on Wed Jul 1 10:06:02 2026
    From Newsgroup: comp.ai.philosophy

    On 7/1/2026 1:53 AM, Mikko wrote:
    On 30/06/2026 16:55, olcott wrote:
    On 6/30/2026 3:10 AM, Mikko wrote:
    On 29/06/2026 16:55, olcott wrote:
    On 6/28/2026 4:32 AM, Mikko wrote:
    On 27/06/2026 21:29, olcott wrote:
    On 6/27/2026 1:24 PM, dbush wrote:
    On 6/27/2026 2:03 PM, olcott wrote:
    On 6/27/2026 12:54 PM, dbush wrote:
    On 6/27/2026 11:11 AM, polcott wrote:
    On 6/27/2026 2:08 AM, Mikko wrote:
    On 26/06/2026 15:49, olcott wrote:
    On 6/26/2026 1:49 AM, Mikko wrote:
    On 26/06/2026 04:32, olcott wrote:
    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for
    Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many >>>>>>>>>>>>>> systems of analytic implication belonging to its ilk) is >>>>>>>>>>>>>> the rejection of the classically valid principle of Addition, >>>>>>>>>>>>>> sometimes also referred to as Disjunction Introduction. In >>>>>>>>>>>>>> other words, the principle leading from a formula ϕ to a >>>>>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary >>>>>>>>>>>>>> formula. Parry blamed on this principle the derivability >>>>>>>>>>>>>> of the paradoxes of strict implication—given that it is >>>>>>>>>>>>>> famously featured in Lewis’ derivation of an arbitrary >>>>>>>>>>>>>> formula ψ from a contradiction of the form ϕ ∧ ¬ϕ. >>>>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL

    He also gets rid of an efficient way to convince people who >>>>>>>>>>>>> don't
    understand much of logic.

    As I recently showed in another post. I figured
    all this out on my own. I didn't even know that
    anyone else ever did this. I just knew that when
    trying to find out what is deduced from a set of
    premises that you cannot pop in another sentence
    from out of nowhere and get a correct conclusion.

    By popping in another sentence from out of nowhere
    (as it shows above) the principle of explosion is
    derived.

    The usual meaning of proof is a sequence of statement where >>>>>>>>>>> eachstatement either is a premis or follows from one or more >>>>>>>>>>> earlier
    statements

    Except with Disjunction introduction, that is its problem.

    So you're saying that in the following natural language statement: >>>>>>>>>

    It is a key issue in that it creates the
    psychotic break from reality known as the
    Principle of Explosion, otherwise it may
    make no difference at all.

    Stay on topic or I will block you.

    Explain in detail how the below which you dishonestly trimmed is >>>>>>> off- topic.


    The topic is how Disjunction introduction enables the
    Principle of Explosion.

    It does not. In any sensible logic every tautology is provable.
    Then the principle of explosion follows.

    POE is unprovable in both of these more sensible systems
    of logic.

    THe expression "these system" above does not denote.


    Parry’s logic of Analytic Implication

    Relevance Logic
    https://plato.stanford.edu/entries/logic-relevance/

    The POE is an actual psychotic break from
    reality when one pays full and complete attention to
    the underlying semantics and does not stupidly take
    semantics out of logic and put it in a separate model.

    No, it is not. The principle of explosion is about consequencies
    of a false premise, which already is a break from reality even
    when no consequence is inferred.

    Only because semantics is ignored.

    A break from reality is a break from reality, no matter whether
    the semantics is ignored or considered. Though if there is no
    semantics, even any ignored one, there is no connection to
    reality to break.


    Ignoring semantics is always a break from reality.
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,sci.math,comp.theory,comp.ai.philosophy on Wed Jul 1 10:25:09 2026
    From Newsgroup: comp.ai.philosophy

    On 7/1/2026 2:32 AM, Mikko wrote:
    On 30/06/2026 16:55, olcott wrote:
    On 6/30/2026 3:10 AM, Mikko wrote:
    On 29/06/2026 16:55, olcott wrote:
    On 6/28/2026 4:32 AM, Mikko wrote:
    On 27/06/2026 21:29, olcott wrote:
    On 6/27/2026 1:24 PM, dbush wrote:
    On 6/27/2026 2:03 PM, olcott wrote:
    On 6/27/2026 12:54 PM, dbush wrote:
    On 6/27/2026 11:11 AM, polcott wrote:
    On 6/27/2026 2:08 AM, Mikko wrote:
    On 26/06/2026 15:49, olcott wrote:
    On 6/26/2026 1:49 AM, Mikko wrote:
    On 26/06/2026 04:32, olcott wrote:
    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for
    Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many >>>>>>>>>>>>>> systems of analytic implication belonging to its ilk) is >>>>>>>>>>>>>> the rejection of the classically valid principle of Addition, >>>>>>>>>>>>>> sometimes also referred to as Disjunction Introduction. In >>>>>>>>>>>>>> other words, the principle leading from a formula ϕ to a >>>>>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary >>>>>>>>>>>>>> formula. Parry blamed on this principle the derivability >>>>>>>>>>>>>> of the paradoxes of strict implication—given that it is >>>>>>>>>>>>>> famously featured in Lewis’ derivation of an arbitrary >>>>>>>>>>>>>> formula ψ from a contradiction of the form ϕ ∧ ¬ϕ. >>>>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL

    He also gets rid of an efficient way to convince people who >>>>>>>>>>>>> don't
    understand much of logic.

    As I recently showed in another post. I figured
    all this out on my own. I didn't even know that
    anyone else ever did this. I just knew that when
    trying to find out what is deduced from a set of
    premises that you cannot pop in another sentence
    from out of nowhere and get a correct conclusion.

    By popping in another sentence from out of nowhere
    (as it shows above) the principle of explosion is
    derived.

    The usual meaning of proof is a sequence of statement where >>>>>>>>>>> eachstatement either is a premis or follows from one or more >>>>>>>>>>> earlier
    statements

    Except with Disjunction introduction, that is its problem.

    So you're saying that in the following natural language statement: >>>>>>>>>

    It is a key issue in that it creates the
    psychotic break from reality known as the
    Principle of Explosion, otherwise it may
    make no difference at all.

    Stay on topic or I will block you.

    Explain in detail how the below which you dishonestly trimmed is >>>>>>> off- topic.


    The topic is how Disjunction introduction enables the
    Principle of Explosion.

    It does not. In any sensible logic every tautology is provable.
    Then the principle of explosion follows.

    POE is unprovable in both of these more sensible systems
    of logic.

    THe expression "these system" above does not denote.

    Parry’s logic of Analytic Implication

    If the intent was to include that in the denotation you failed
    to say something important.


    Parry’s logic of Analytic Implication
    and Relevance logic are two sensible systems
    that get rid of the Principle of Explosion.

    It was dead-obviously correct to anyone paying
    any attention at all that every contradiction
    only semantically entails FALSE.

    The only reason that it took more than five minutes
    for everyone to agree to this is that logicians are
    a herd of sheep and mindlessly obey what they have
    been taught even if this means that they must jump
    off a cliff.
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From dbush@dbush.mobile@gmail.com to sci.logic,comp.theory,sci.math,comp.ai.philosophy on Wed Jul 1 13:34:58 2026
    From Newsgroup: comp.ai.philosophy

    On 7/1/2026 11:04 AM, olcott wrote:
    On 7/1/2026 1:50 AM, Mikko wrote:
    On 30/06/2026 16:45, olcott wrote:
    On 6/30/2026 2:55 AM, Mikko wrote:
    On 29/06/2026 16:23, dbush wrote:
    On 6/29/2026 9:17 AM, polcott wrote:
    On 6/29/2026 7:08 AM, dbush wrote:
    On 6/29/2026 12:13 AM, olcott wrote:
    On 6/28/2026 10:56 PM, dbush wrote:
    On 6/27/2026 11:34 PM, dbush wrote:
    On 6/27/2026 11:23 PM, olcott wrote:
    On 6/27/2026 9:02 PM, dbush wrote:
    On 6/27/2026 9:53 PM, dbush wrote:
    On 6/27/2026 9:49 PM, olcott wrote:
    On 6/27/2026 8:42 PM, dbush wrote:
    On 6/27/2026 9:40 PM, olcott wrote:
    On 6/27/2026 8:29 PM, dbush wrote:
    On 6/27/2026 9:24 PM, olcott wrote:
    On 6/27/2026 8:08 PM, dbush wrote:
    On 6/27/2026 7:56 PM, olcott wrote:
    On 6/27/2026 6:30 PM, dbush wrote:
    On 6/27/2026 7:22 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 5:52 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 6:40 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 1:34 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:29 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 1:24 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:03 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 12:54 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 11:11 AM, polcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:08 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 26/06/2026 15:49, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/26/2026 1:49 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 26/06/2026 04:32, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> William T. Parry, Entailment Logics >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> gets rid of Disjunction introduction >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> to prevent the principle of explosion >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    A simple logical matrix and sequent >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> calculus for >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Parry’s logic of Analytic Implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    The main and distinctive feature of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> PAI (and of the many >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> systems of analytic implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> belonging to its ilk) is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> the rejection of the classically valid >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> principle of Addition, >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> sometimes also referred to as >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Disjunction Introduction. In >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> other words, the principle leading >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> from a formula ϕ to a >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where ψ >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> is an arbitrary >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formula. Parry blamed on this >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> principle the derivability >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of the paradoxes of strict implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> — given that it is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> famously featured in Lewis’ derivation >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of an arbitrary >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formula ψ from a contradiction of the >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> form ϕ ∧ ¬ϕ. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    He also gets rid of an efficient way to >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> convince people who don't >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> understand much of logic. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    As I recently showed in another post. I >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> figured
    all this out on my own. I didn't even >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> know that
    anyone else ever did this. I just knew >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> that when
    trying to find out what is deduced from >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> a set of
    premises that you cannot pop in another >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> sentence
    from out of nowhere and get a correct >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> conclusion.

    By popping in another sentence from out >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of nowhere
    (as it shows above) the principle of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> explosion is
    derived.

    The usual meaning of proof is a sequence >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of statement where eachstatement either >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> is a premis or follows from one or more >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> earlier
    statements

    Except with Disjunction introduction, that >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> is its problem.

    So you're saying that in the following >>>>>>>>>>>>>>>>>>>>>>>>>>>>> natural language statement: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>

    It is a key issue in that it creates the >>>>>>>>>>>>>>>>>>>>>>>>>>>> psychotic break from reality known as the >>>>>>>>>>>>>>>>>>>>>>>>>>>> Principle of Explosion, otherwise it may >>>>>>>>>>>>>>>>>>>>>>>>>>>> make no difference at all. >>>>>>>>>>>>>>>>>>>>>>>>>>>>
    Stay on topic or I will block you. >>>>>>>>>>>>>>>>>>>>>>>>>>>
    Explain in detail how the below which you >>>>>>>>>>>>>>>>>>>>>>>>>>> dishonestly trimmed is off- topic. >>>>>>>>>>>>>>>>>>>>>>>>>>>

    The topic is how Disjunction introduction >>>>>>>>>>>>>>>>>>>>>>>>>> enables the
    Principle of Explosion.


    Rejected, as you not liking the result doesn't >>>>>>>>>>>>>>>>>>>>>>>>> make it invalid.

    Through a series of truth preserving >>>>>>>>>>>>>>>>>>>>>>>>> operations, when a contradiction is given as >>>>>>>>>>>>>>>>>>>>>>>>> true, any statement can be proven as true. >>>>>>>>>>>>>>>>>>>>>>>>>
    The principle of explosion is a demonstration >>>>>>>>>>>>>>>>>>>>>>>>> of *why* a formal system whose axioms lead to a >>>>>>>>>>>>>>>>>>>>>>>>> contradiction is useless.

    The only reason someone would want to get rid >>>>>>>>>>>>>>>>>>>>>>>>> of the principle of explosion is to be able to >>>>>>>>>>>>>>>>>>>>>>>>> use a system that has a contradiction. >>>>>>>>>>>>>>>>>>>>>>>>>

    My reason to get rid of the principle of explosion >>>>>>>>>>>>>>>>>>>>>>>> it to get rid of anything and everything that >>>>>>>>>>>>>>>>>>>>>>>> prevents
    infallibly correct reasoning.


    If you get rid of the principle of explosion, the >>>>>>>>>>>>>>>>>>>>>>> law of non- contradiction goes away as it looses >>>>>>>>>>>>>>>>>>>>>>> its basis.


    You keep failing to pay close enough attention. >>>>>>>>>>>>>>>>>>>>>> I only get rid of the POE by getting rid of >>>>>>>>>>>>>>>>>>>>>> Disjunction introduction.

    Which you can't do because it's a truth-preserving >>>>>>>>>>>>>>>>>>>>> operation.

    1) P ∧ ¬P    // Premise
    2) P          // Conjunction elimination >>>>>>>>>>>>>>>>>>>> 3) ¬P        // Conjunction elimination >>>>>>>>>>>>>>>>>>>> 4) P ∨ Q      // Disjunction introduction >>>>>>>>>>>>>>>>>>>> 5) Q          // Disjunctive syllogism >>>>>>>>>>>>>>>>>>>> https://en.wikipedia.org/wiki/
    Principle_of_explosion#Proof

    When you insert English meanings into the >>>>>>>>>>>>>>>>>>>> propositional variables it is as obvious >>>>>>>>>>>>>>>>>>>> as a pie in the fact the DI IS NOT TRUTH PRESERVING. >>>>>>>>>>>>>>>>>>>
    So you're saying that in the following natural >>>>>>>>>>>>>>>>>>> language statement:

    --------------------------------------
    At least one of the following statements is true: >>>>>>>>>>>>>>>>>>> - Earth is the third planet from the sun. >>>>>>>>>>>>>>>>>>> - <X>
    --------------------------------------

    Where <X> is any natural language statement, there >>>>>>>>>>>>>>>>>>> exists a statement X such that the condition "At >>>>>>>>>>>>>>>>>>> least one of the following statements is true" is false. >>>>>>>>>>>>>>>>>>>
    Name it.


    That is not Disjunction introduction combined with >>>>>>>>>>>>>>>>>> Disjunctive syllogism, it is bare Disjunction. >>>>>>>>>>>>>>>>>>

    Let me spell it out more explicitly then.

    Given that the following natural language statement is >>>>>>>>>>>>>>>>> true:

    --------------------------------------
    Earth is the third planet from the sun.
    --------------------------------------

    In the following natural language statement: >>>>>>>>>>>>>>>>>
    --------------------------------------
    At least one of the following statements is true: >>>>>>>>>>>>>>>>> - Earth is the third planet from the sun.
    - <X>
    --------------------------------------

    Where <X> is any natural language statement, does there >>>>>>>>>>>>>>>>> exist a statement X such that the condition "At least >>>>>>>>>>>>>>>>> one of the following statements is true" is false? >>>>>>>>>>>>>>>>>

    Where X is "What time is it?"



    Is the statement "Earth is the third planet from the sun" >>>>>>>>>>>>>>> true?

    We have a type mismatch error.



    The statement you gave isn't a truth-bearing statement, so >>>>>>>>>>>>> it can't be used in logic.  I didn't think I had to make >>>>>>>>>>>>> that explicit.

    However, let's go with it anyway because it still
    illustrates the point.

    So I'll ask again:

    Is the statement "Earth is the third planet from the sun" >>>>>>>>>>>>> true?


    On second though, let's back up as that might confuse you. >>>>>>>>>>>>
    Given that <X> is any *truth bearing* natural language >>>>>>>>>>>> statement, does there exist a statement X such that the >>>>>>>>>>>> condition "At least one of the following statements is true" >>>>>>>>>>>> is false?


    Head games will be ignored.
    That you did so well on the other things
    so I will not block you.


    Explain in detail how this is a head game.

    Failure to either answer the above question or explain how it >>>>>>>>>> is a head game in your next reply or within one hour of you >>>>>>>>>> next post in this newsgroup will be taken as your official, >>>>>>>>>> on- the- record admission that Disjunction introduction is in >>>>>>>>>> fact truth preserving and valid, and therefore so is the
    Principle of Explosion.


    Let the record show that Peter Olcott made the following post >>>>>>>>> in this newsgroup:

    On 6/28/2026 10:52 PM, olcott wrote:
    Q also can't bake a birthday cake, this does not make
    Q in any way "incomplete" relative to what it was
    defined to do.
    ...

    And more that one hour has passed with no attempt to answer the >>>>>>>>> above question or explain why it is a head game.  Therefore, as >>>>>>>>> per the above criteria:

    Let The Record Show

    That Peter Olcott

    Has *Officially* Admitted:

    That Disjunction introduction is in fact truth preserving and >>>>>>>>> valid, and therefore so is the Principle of Explosion.



    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for
    Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many
    systems of analytic implication belonging to its ilk) is

    the rejection of the classically valid principle of Addition,
    sometimes also referred to as Disjunction Introduction. In

    other words, the principle leading from a formula ϕ to a
    disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary
    formula. Parry blamed on this principle the derivability
    of the paradoxes of strict implication—given that it is
    famously featured in Lewis’ derivation of an arbitrary
    formula ψ from a contradiction of the form ϕ ∧ ¬ϕ.

    https://philarchive.org/archive/SZMASL


    So someone came up with a different system that has different
    rules. That has no bearing on existing systems.


    The bearing that it has on existing systems is

    None, as you can't remove a truth-preserving operation.

    One can construct a system where a truth-preserving operation is not
    valid, and must if one wants to construct a paraconsistent system,
    where some but not every sentence can be both PTS-true and PTS-false.


    Current semantic entailment is the only inference step allowed.

    Every truth-prserving transformation is a correct semantic entailment.
    In particular, disjunction introduction is.


    That is counter-factual. POE is misconstrued as truth preserving.

    False, as you have admitted on the record (see below):

    On 6/28/2026 11:56 PM, dbush wrote:
    On 6/27/2026 11:34 PM, dbush wrote:
    On 6/27/2026 11:23 PM, olcott wrote:
    On 6/27/2026 9:02 PM, dbush wrote:
    On 6/27/2026 9:53 PM, dbush wrote:
    On 6/27/2026 9:49 PM, olcott wrote:
    On 6/27/2026 8:42 PM, dbush wrote:
    On 6/27/2026 9:40 PM, olcott wrote:
    On 6/27/2026 8:29 PM, dbush wrote:
    Given that the following natural language statement is true:

    --------------------------------------
    Earth is the third planet from the sun.
    --------------------------------------

    In the following natural language statement:

    --------------------------------------
    At least one of the following statements is true:
    - Earth is the third planet from the sun.
    - <X>
    --------------------------------------

    Given that <X> is any *truth bearing* natural language statement,
    does there exist a statement X such that the condition "At least one
    of the following statements is true" is false?


    Head games will be ignored.


    Explain in detail how this is a head game.

    Failure to either answer the above question or explain how it is a
    head game in your next reply or within one hour of you next post in
    this newsgroup will be taken as your official, on-the-record admission
    that Disjunction introduction is in fact truth preserving and valid,
    and therefore so is the Principle of Explosion.


    Let the record show that Peter Olcott made the following post in this newsgroup:

    On 6/28/2026 10:52 PM, olcott wrote:
    Q also can't bake a birthday cake, this does not make
    Q in any way "incomplete" relative to what it was
    defined to do.
    ...

    And more that one hour has passed with no attempt to answer the above question or explain why it is a head game. Therefore, as per the above criteria:

    Let The Record Show

    That Peter Olcott

    Has *Officially* Admitted:

    That Disjunction introduction is in fact truth preserving and valid, and therefore so is the Principle of Explosion.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From dbush@dbush.mobile@gmail.com to sci.logic,sci.math,comp.theory,comp.ai.philosophy on Wed Jul 1 13:37:13 2026
    From Newsgroup: comp.ai.philosophy

    On 7/1/2026 11:25 AM, olcott wrote:
    On 7/1/2026 2:32 AM, Mikko wrote:
    On 30/06/2026 16:55, olcott wrote:
    On 6/30/2026 3:10 AM, Mikko wrote:
    On 29/06/2026 16:55, olcott wrote:
    On 6/28/2026 4:32 AM, Mikko wrote:
    On 27/06/2026 21:29, olcott wrote:
    On 6/27/2026 1:24 PM, dbush wrote:
    On 6/27/2026 2:03 PM, olcott wrote:
    On 6/27/2026 12:54 PM, dbush wrote:
    On 6/27/2026 11:11 AM, polcott wrote:
    On 6/27/2026 2:08 AM, Mikko wrote:
    On 26/06/2026 15:49, olcott wrote:
    On 6/26/2026 1:49 AM, Mikko wrote:
    On 26/06/2026 04:32, olcott wrote:
    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for >>>>>>>>>>>>>>> Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many >>>>>>>>>>>>>>> systems of analytic implication belonging to its ilk) is >>>>>>>>>>>>>>> the rejection of the classically valid principle of >>>>>>>>>>>>>>> Addition,
    sometimes also referred to as Disjunction Introduction. In >>>>>>>>>>>>>>> other words, the principle leading from a formula ϕ to a >>>>>>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary >>>>>>>>>>>>>>> formula. Parry blamed on this principle the derivability >>>>>>>>>>>>>>> of the paradoxes of strict implication—given that it is >>>>>>>>>>>>>>> famously featured in Lewis’ derivation of an arbitrary >>>>>>>>>>>>>>> formula ψ from a contradiction of the form ϕ ∧ ¬ϕ. >>>>>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL

    He also gets rid of an efficient way to convince people >>>>>>>>>>>>>> who don't
    understand much of logic.

    As I recently showed in another post. I figured
    all this out on my own. I didn't even know that
    anyone else ever did this. I just knew that when
    trying to find out what is deduced from a set of
    premises that you cannot pop in another sentence
    from out of nowhere and get a correct conclusion.

    By popping in another sentence from out of nowhere
    (as it shows above) the principle of explosion is
    derived.

    The usual meaning of proof is a sequence of statement where >>>>>>>>>>>> eachstatement either is a premis or follows from one or more >>>>>>>>>>>> earlier
    statements

    Except with Disjunction introduction, that is its problem. >>>>>>>>>>
    So you're saying that in the following natural language
    statement:


    It is a key issue in that it creates the
    psychotic break from reality known as the
    Principle of Explosion, otherwise it may
    make no difference at all.

    Stay on topic or I will block you.

    Explain in detail how the below which you dishonestly trimmed is >>>>>>>> off- topic.


    The topic is how Disjunction introduction enables the
    Principle of Explosion.

    It does not. In any sensible logic every tautology is provable.
    Then the principle of explosion follows.

    POE is unprovable in both of these more sensible systems
    of logic.

    THe expression "these system" above does not denote.

    Parry’s logic of Analytic Implication

    If the intent was to include that in the denotation you failed
    to say something important.


    Parry’s logic of Analytic Implication
    and Relevance logic are two sensible systems
    that get rid of the Principle of Explosion.

    It was dead-obviously correct to anyone paying
    any attention at all that every contradiction
    only semantically entails FALSE.

    False, as you have admitted on the record:

    On 6/28/2026 11:56 PM, dbush wrote:
    On 6/27/2026 11:34 PM, dbush wrote:
    On 6/27/2026 11:23 PM, olcott wrote:
    On 6/27/2026 9:02 PM, dbush wrote:
    On 6/27/2026 9:53 PM, dbush wrote:
    On 6/27/2026 9:49 PM, olcott wrote:
    On 6/27/2026 8:42 PM, dbush wrote:
    On 6/27/2026 9:40 PM, olcott wrote:
    On 6/27/2026 8:29 PM, dbush wrote:
    Given that the following natural language statement is true:

    --------------------------------------
    Earth is the third planet from the sun.
    --------------------------------------

    In the following natural language statement:

    --------------------------------------
    At least one of the following statements is true:
    - Earth is the third planet from the sun.
    - <X>
    --------------------------------------

    Given that <X> is any *truth bearing* natural language statement,
    does there exist a statement X such that the condition "At least one
    of the following statements is true" is false?


    Head games will be ignored.


    Explain in detail how this is a head game.

    Failure to either answer the above question or explain how it is a
    head game in your next reply or within one hour of you next post in
    this newsgroup will be taken as your official, on-the-record admission
    that Disjunction introduction is in fact truth preserving and valid,
    and therefore so is the Principle of Explosion.


    Let the record show that Peter Olcott made the following post in this newsgroup:

    On 6/28/2026 10:52 PM, olcott wrote:
    Q also can't bake a birthday cake, this does not make
    Q in any way "incomplete" relative to what it was
    defined to do.
    ...

    And more that one hour has passed with no attempt to answer the above question or explain why it is a head game. Therefore, as per the above criteria:

    Let The Record Show

    That Peter Olcott

    Has *Officially* Admitted:

    That Disjunction introduction is in fact truth preserving and valid, and therefore so is the Principle of Explosion.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,sci.math,comp.theory,comp.ai.philosophy on Wed Jul 1 13:02:21 2026
    From Newsgroup: comp.ai.philosophy

    On 7/1/2026 12:37 PM, dbush wrote:
    On 7/1/2026 11:25 AM, olcott wrote:
    On 7/1/2026 2:32 AM, Mikko wrote:
    On 30/06/2026 16:55, olcott wrote:
    On 6/30/2026 3:10 AM, Mikko wrote:
    On 29/06/2026 16:55, olcott wrote:
    On 6/28/2026 4:32 AM, Mikko wrote:
    On 27/06/2026 21:29, olcott wrote:
    On 6/27/2026 1:24 PM, dbush wrote:
    On 6/27/2026 2:03 PM, olcott wrote:
    On 6/27/2026 12:54 PM, dbush wrote:
    On 6/27/2026 11:11 AM, polcott wrote:
    On 6/27/2026 2:08 AM, Mikko wrote:
    On 26/06/2026 15:49, olcott wrote:
    On 6/26/2026 1:49 AM, Mikko wrote:
    On 26/06/2026 04:32, olcott wrote:
    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for >>>>>>>>>>>>>>>> Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many >>>>>>>>>>>>>>>> systems of analytic implication belonging to its ilk) is >>>>>>>>>>>>>>>> the rejection of the classically valid principle of >>>>>>>>>>>>>>>> Addition,
    sometimes also referred to as Disjunction Introduction. In >>>>>>>>>>>>>>>> other words, the principle leading from a formula ϕ to a >>>>>>>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary >>>>>>>>>>>>>>>> formula. Parry blamed on this principle the derivability >>>>>>>>>>>>>>>> of the paradoxes of strict implication—given that it is >>>>>>>>>>>>>>>> famously featured in Lewis’ derivation of an arbitrary >>>>>>>>>>>>>>>> formula ψ from a contradiction of the form ϕ ∧ ¬ϕ. >>>>>>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL

    He also gets rid of an efficient way to convince people >>>>>>>>>>>>>>> who don't
    understand much of logic.

    As I recently showed in another post. I figured
    all this out on my own. I didn't even know that
    anyone else ever did this. I just knew that when
    trying to find out what is deduced from a set of
    premises that you cannot pop in another sentence
    from out of nowhere and get a correct conclusion.

    By popping in another sentence from out of nowhere >>>>>>>>>>>>>> (as it shows above) the principle of explosion is
    derived.

    The usual meaning of proof is a sequence of statement where >>>>>>>>>>>>> eachstatement either is a premis or follows from one or >>>>>>>>>>>>> more earlier
    statements

    Except with Disjunction introduction, that is its problem. >>>>>>>>>>>
    So you're saying that in the following natural language >>>>>>>>>>> statement:


    It is a key issue in that it creates the
    psychotic break from reality known as the
    Principle of Explosion, otherwise it may
    make no difference at all.

    Stay on topic or I will block you.

    Explain in detail how the below which you dishonestly trimmed >>>>>>>>> is off- topic.


    The topic is how Disjunction introduction enables the
    Principle of Explosion.

    It does not. In any sensible logic every tautology is provable.
    Then the principle of explosion follows.

    POE is unprovable in both of these more sensible systems
    of logic.

    THe expression "these system" above does not denote.

    Parry’s logic of Analytic Implication

    If the intent was to include that in the denotation you failed
    to say something important.


    Parry’s logic of Analytic Implication
    and Relevance logic are two sensible systems
    that get rid of the Principle of Explosion.

    It was dead-obviously correct to anyone paying
    any attention at all that every contradiction
    only semantically entails FALSE.

    False, as you have admitted on the record:


    Liar

    On 6/28/2026 11:56 PM, dbush wrote:
    On 6/27/2026 11:34 PM, dbush wrote:
    On 6/27/2026 11:23 PM, olcott wrote:
    On 6/27/2026 9:02 PM, dbush wrote:
    On 6/27/2026 9:53 PM, dbush wrote:
    On 6/27/2026 9:49 PM, olcott wrote:
    On 6/27/2026 8:42 PM, dbush wrote:
    On 6/27/2026 9:40 PM, olcott wrote:
    On 6/27/2026 8:29 PM, dbush wrote:
    Given that the following natural language statement is true:

    --------------------------------------
    Earth is the third planet from the sun.
    --------------------------------------

    In the following natural language statement:

    --------------------------------------
    At least one of the following statements is true:
    - Earth is the third planet from the sun.
    - <X>
    --------------------------------------

    Given that <X> is any *truth bearing* natural language statement,
    does there exist a statement X such that the condition "At least one
    of the following statements is true" is false?


    Head games will be ignored.


    Explain in detail how this is a head game.

    Failure to either answer the above question or explain how it is a
    head game in your next reply or within one hour of you next post in
    this newsgroup will be taken as your official, on-the-record admission
    that Disjunction introduction is in fact truth preserving and valid,
    and therefore so is the Principle of Explosion.


    Let the record show that Peter Olcott made the following post in this newsgroup:

    On 6/28/2026 10:52 PM, olcott wrote:
      > Q also can't bake a birthday cake, this does not make
      > Q in any way "incomplete" relative to what it was
      > defined to do.
      > ...

    And more that one hour has passed with no attempt to answer the above question or explain why it is a head game.  Therefore, as per the above criteria:

    Let The Record Show

    That Peter Olcott

    Has *Officially* Admitted:

    That Disjunction introduction is in fact truth preserving and valid, and therefore so is the Principle of Explosion.

    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From dbush@dbush.mobile@gmail.com to sci.logic,sci.math,comp.theory,comp.ai.philosophy on Wed Jul 1 14:17:01 2026
    From Newsgroup: comp.ai.philosophy

    On 7/1/2026 2:02 PM, olcott wrote:
    On 7/1/2026 12:37 PM, dbush wrote:
    On 7/1/2026 11:25 AM, olcott wrote:
    On 7/1/2026 2:32 AM, Mikko wrote:
    On 30/06/2026 16:55, olcott wrote:
    On 6/30/2026 3:10 AM, Mikko wrote:
    On 29/06/2026 16:55, olcott wrote:
    On 6/28/2026 4:32 AM, Mikko wrote:
    On 27/06/2026 21:29, olcott wrote:
    On 6/27/2026 1:24 PM, dbush wrote:
    On 6/27/2026 2:03 PM, olcott wrote:
    On 6/27/2026 12:54 PM, dbush wrote:
    On 6/27/2026 11:11 AM, polcott wrote:
    On 6/27/2026 2:08 AM, Mikko wrote:
    On 26/06/2026 15:49, olcott wrote:
    On 6/26/2026 1:49 AM, Mikko wrote:
    On 26/06/2026 04:32, olcott wrote:
    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for >>>>>>>>>>>>>>>>> Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many >>>>>>>>>>>>>>>>> systems of analytic implication belonging to its ilk) is >>>>>>>>>>>>>>>>> the rejection of the classically valid principle of >>>>>>>>>>>>>>>>> Addition,
    sometimes also referred to as Disjunction Introduction. In >>>>>>>>>>>>>>>>> other words, the principle leading from a formula ϕ to a >>>>>>>>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary >>>>>>>>>>>>>>>>> formula. Parry blamed on this principle the derivability >>>>>>>>>>>>>>>>> of the paradoxes of strict implication—given that it is >>>>>>>>>>>>>>>>> famously featured in Lewis’ derivation of an arbitrary >>>>>>>>>>>>>>>>> formula ψ from a contradiction of the form ϕ ∧ ¬ϕ. >>>>>>>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL

    He also gets rid of an efficient way to convince people >>>>>>>>>>>>>>>> who don't
    understand much of logic.

    As I recently showed in another post. I figured
    all this out on my own. I didn't even know that
    anyone else ever did this. I just knew that when >>>>>>>>>>>>>>> trying to find out what is deduced from a set of >>>>>>>>>>>>>>> premises that you cannot pop in another sentence >>>>>>>>>>>>>>> from out of nowhere and get a correct conclusion. >>>>>>>>>>>>>>>
    By popping in another sentence from out of nowhere >>>>>>>>>>>>>>> (as it shows above) the principle of explosion is >>>>>>>>>>>>>>> derived.

    The usual meaning of proof is a sequence of statement >>>>>>>>>>>>>> where eachstatement either is a premis or follows from one >>>>>>>>>>>>>> or more earlier
    statements

    Except with Disjunction introduction, that is its problem. >>>>>>>>>>>>
    So you're saying that in the following natural language >>>>>>>>>>>> statement:


    It is a key issue in that it creates the
    psychotic break from reality known as the
    Principle of Explosion, otherwise it may
    make no difference at all.

    Stay on topic or I will block you.

    Explain in detail how the below which you dishonestly trimmed >>>>>>>>>> is off- topic.


    The topic is how Disjunction introduction enables the
    Principle of Explosion.

    It does not. In any sensible logic every tautology is provable. >>>>>>>> Then the principle of explosion follows.

    POE is unprovable in both of these more sensible systems
    of logic.

    THe expression "these system" above does not denote.

    Parry’s logic of Analytic Implication

    If the intent was to include that in the denotation you failed
    to say something important.


    Parry’s logic of Analytic Implication
    and Relevance logic are two sensible systems
    that get rid of the Principle of Explosion.

    It was dead-obviously correct to anyone paying
    any attention at all that every contradiction
    only semantically entails FALSE.

    False, as you have admitted on the record:


    Liar

    And now you lie about making such an admission when the evidence is
    right there below in black and white for all to see.

    Your dishonestly knows no bounds.


    On 6/28/2026 11:56 PM, dbush wrote:
    On 6/27/2026 11:34 PM, dbush wrote:
    On 6/27/2026 11:23 PM, olcott wrote:
    On 6/27/2026 9:02 PM, dbush wrote:
    On 6/27/2026 9:53 PM, dbush wrote:
    On 6/27/2026 9:49 PM, olcott wrote:
    On 6/27/2026 8:42 PM, dbush wrote:
    On 6/27/2026 9:40 PM, olcott wrote:
    On 6/27/2026 8:29 PM, dbush wrote:
    Given that the following natural language statement is true:
    ;
    --------------------------------------
    Earth is the third planet from the sun.
    --------------------------------------
    ;
    In the following natural language statement:
    ;
    --------------------------------------
    At least one of the following statements is true:
    - Earth is the third planet from the sun.
    - <X>
    --------------------------------------
    ;
    Given that <X> is any *truth bearing* natural language statement,
    does there exist a statement X such that the condition "At least
    one
    of the following statements is true" is false?
    ;
    ;
    Head games will be ignored.
    ;
    ;
    Explain in detail how this is a head game.
    ;
    Failure to either answer the above question or explain how it is a
    head game in your next reply or within one hour of you next post in
    this newsgroup will be taken as your official, on-the-record
    admission
    that Disjunction introduction is in fact truth preserving and valid,
    and therefore so is the Principle of Explosion.
    ;
    ;
    Let the record show that Peter Olcott made the following post in this
    newsgroup:
    ;
    On 6/28/2026 10:52 PM, olcott wrote:
    ;  > Q also can't bake a birthday cake, this does not make
    ;  > Q in any way "incomplete" relative to what it was
    ;  > defined to do.
    ;  > ...
    ;
    And more that one hour has passed with no attempt to answer the above
    question or explain why it is a head game.  Therefore, as per the
    above
    criteria:
    ;
    Let The Record Show
    ;
    That Peter Olcott
    ;
    Has *Officially* Admitted:
    ;
    That Disjunction introduction is in fact truth preserving and
    valid, and
    therefore so is the Principle of Explosion.




    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to sci.logic,comp.theory,sci.math,comp.ai.philosophy on Thu Jul 2 09:21:35 2026
    From Newsgroup: comp.ai.philosophy

    On 01/07/2026 18:01, olcott wrote:
    On 7/1/2026 1:46 AM, Mikko wrote:
    On 30/06/2026 17:37, olcott wrote:
    On 6/30/2026 3:48 AM, Mikko wrote:
    On 29/06/2026 17:00, olcott wrote:
    On 6/29/2026 8:23 AM, dbush wrote:
    On 6/29/2026 9:17 AM, polcott wrote:
    On 6/29/2026 7:08 AM, dbush wrote:
    On 6/29/2026 12:13 AM, olcott wrote:
    On 6/28/2026 10:56 PM, dbush wrote:
    On 6/27/2026 11:34 PM, dbush wrote:
    On 6/27/2026 11:23 PM, olcott wrote:
    On 6/27/2026 9:02 PM, dbush wrote:
    On 6/27/2026 9:53 PM, dbush wrote:
    On 6/27/2026 9:49 PM, olcott wrote:
    On 6/27/2026 8:42 PM, dbush wrote:
    On 6/27/2026 9:40 PM, olcott wrote:
    On 6/27/2026 8:29 PM, dbush wrote:
    On 6/27/2026 9:24 PM, olcott wrote:
    On 6/27/2026 8:08 PM, dbush wrote:
    On 6/27/2026 7:56 PM, olcott wrote:
    On 6/27/2026 6:30 PM, dbush wrote:
    On 6/27/2026 7:22 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 5:52 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 6:40 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 1:34 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:29 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 1:24 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:03 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 12:54 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 11:11 AM, polcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:08 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 26/06/2026 15:49, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/26/2026 1:49 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 26/06/2026 04:32, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> William T. Parry, Entailment Logics >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> gets rid of Disjunction introduction >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> to prevent the principle of explosion >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    A simple logical matrix and sequent >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> calculus for >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Parry’s logic of Analytic Implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    The main and distinctive feature of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> PAI (and of the many >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> systems of analytic implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> belonging to its ilk) is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> the rejection of the classically >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> valid principle of Addition, >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> sometimes also referred to as >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Disjunction Introduction. In >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> other words, the principle leading >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> from a formula ϕ to a >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> ψ is an arbitrary >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formula. Parry blamed on this >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> principle the derivability >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of the paradoxes of strict >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> implication — given that it is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> famously featured in Lewis’ >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> derivation of an arbitrary >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formula ψ from a contradiction of the >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> form ϕ ∧ ¬ϕ. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    He also gets rid of an efficient way >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> to convince people who don't >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> understand much of logic. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    As I recently showed in another post. I >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> figured
    all this out on my own. I didn't even >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> know that
    anyone else ever did this. I just knew >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> that when
    trying to find out what is deduced from >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> a set of
    premises that you cannot pop in another >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> sentence
    from out of nowhere and get a correct >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> conclusion.

    By popping in another sentence from out >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of nowhere
    (as it shows above) the principle of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> explosion is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> derived.

    The usual meaning of proof is a sequence >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of statement where eachstatement either >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> is a premis or follows from one or more >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> earlier
    statements

    Except with Disjunction introduction, >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> that is its problem. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    So you're saying that in the following >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> natural language statement: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>

    It is a key issue in that it creates the >>>>>>>>>>>>>>>>>>>>>>>>>>>>> psychotic break from reality known as the >>>>>>>>>>>>>>>>>>>>>>>>>>>>> Principle of Explosion, otherwise it may >>>>>>>>>>>>>>>>>>>>>>>>>>>>> make no difference at all. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    Stay on topic or I will block you. >>>>>>>>>>>>>>>>>>>>>>>>>>>>
    Explain in detail how the below which you >>>>>>>>>>>>>>>>>>>>>>>>>>>> dishonestly trimmed is off- topic. >>>>>>>>>>>>>>>>>>>>>>>>>>>>

    The topic is how Disjunction introduction >>>>>>>>>>>>>>>>>>>>>>>>>>> enables the
    Principle of Explosion.


    Rejected, as you not liking the result doesn't >>>>>>>>>>>>>>>>>>>>>>>>>> make it invalid.

    Through a series of truth preserving >>>>>>>>>>>>>>>>>>>>>>>>>> operations, when a contradiction is given as >>>>>>>>>>>>>>>>>>>>>>>>>> true, any statement can be proven as true. >>>>>>>>>>>>>>>>>>>>>>>>>>
    The principle of explosion is a demonstration >>>>>>>>>>>>>>>>>>>>>>>>>> of *why* a formal system whose axioms lead to >>>>>>>>>>>>>>>>>>>>>>>>>> a contradiction is useless. >>>>>>>>>>>>>>>>>>>>>>>>>>
    The only reason someone would want to get rid >>>>>>>>>>>>>>>>>>>>>>>>>> of the principle of explosion is to be able to >>>>>>>>>>>>>>>>>>>>>>>>>> use a system that has a contradiction. >>>>>>>>>>>>>>>>>>>>>>>>>>

    My reason to get rid of the principle of explosion >>>>>>>>>>>>>>>>>>>>>>>>> it to get rid of anything and everything that >>>>>>>>>>>>>>>>>>>>>>>>> prevents
    infallibly correct reasoning. >>>>>>>>>>>>>>>>>>>>>>>>>

    If you get rid of the principle of explosion, >>>>>>>>>>>>>>>>>>>>>>>> the law of non- contradiction goes away as it >>>>>>>>>>>>>>>>>>>>>>>> looses its basis.


    You keep failing to pay close enough attention. >>>>>>>>>>>>>>>>>>>>>>> I only get rid of the POE by getting rid of >>>>>>>>>>>>>>>>>>>>>>> Disjunction introduction.

    Which you can't do because it's a truth-preserving >>>>>>>>>>>>>>>>>>>>>> operation.

    1) P ∧ ¬P    // Premise
    2) P          // Conjunction elimination >>>>>>>>>>>>>>>>>>>>> 3) ¬P        // Conjunction elimination >>>>>>>>>>>>>>>>>>>>> 4) P ∨ Q      // Disjunction introduction >>>>>>>>>>>>>>>>>>>>> 5) Q          // Disjunctive syllogism >>>>>>>>>>>>>>>>>>>>> https://en.wikipedia.org/wiki/
    Principle_of_explosion#Proof

    When you insert English meanings into the >>>>>>>>>>>>>>>>>>>>> propositional variables it is as obvious >>>>>>>>>>>>>>>>>>>>> as a pie in the fact the DI IS NOT TRUTH PRESERVING. >>>>>>>>>>>>>>>>>>>>
    So you're saying that in the following natural >>>>>>>>>>>>>>>>>>>> language statement:

    -------------------------------------- >>>>>>>>>>>>>>>>>>>> At least one of the following statements is true: >>>>>>>>>>>>>>>>>>>> - Earth is the third planet from the sun. >>>>>>>>>>>>>>>>>>>> - <X>
    -------------------------------------- >>>>>>>>>>>>>>>>>>>>
    Where <X> is any natural language statement, there >>>>>>>>>>>>>>>>>>>> exists a statement X such that the condition "At >>>>>>>>>>>>>>>>>>>> least one of the following statements is true" is >>>>>>>>>>>>>>>>>>>> false.

    Name it.


    That is not Disjunction introduction combined with >>>>>>>>>>>>>>>>>>> Disjunctive syllogism, it is bare Disjunction. >>>>>>>>>>>>>>>>>>>

    Let me spell it out more explicitly then.

    Given that the following natural language statement is >>>>>>>>>>>>>>>>>> true:

    --------------------------------------
    Earth is the third planet from the sun.
    --------------------------------------

    In the following natural language statement: >>>>>>>>>>>>>>>>>>
    --------------------------------------
    At least one of the following statements is true: >>>>>>>>>>>>>>>>>> - Earth is the third planet from the sun.
    - <X>
    --------------------------------------

    Where <X> is any natural language statement, does >>>>>>>>>>>>>>>>>> there exist a statement X such that the condition "At >>>>>>>>>>>>>>>>>> least one of the following statements is true" is false? >>>>>>>>>>>>>>>>>>

    Where X is "What time is it?"



    Is the statement "Earth is the third planet from the >>>>>>>>>>>>>>>> sun" true?

    We have a type mismatch error.



    The statement you gave isn't a truth-bearing statement, so >>>>>>>>>>>>>> it can't be used in logic.  I didn't think I had to make >>>>>>>>>>>>>> that explicit.

    However, let's go with it anyway because it still >>>>>>>>>>>>>> illustrates the point.

    So I'll ask again:

    Is the statement "Earth is the third planet from the sun" >>>>>>>>>>>>>> true?


    On second though, let's back up as that might confuse you. >>>>>>>>>>>>>
    Given that <X> is any *truth bearing* natural language >>>>>>>>>>>>> statement, does there exist a statement X such that the >>>>>>>>>>>>> condition "At least one of the following statements is >>>>>>>>>>>>> true" is false?


    Head games will be ignored.
    That you did so well on the other things
    so I will not block you.


    Explain in detail how this is a head game.

    Failure to either answer the above question or explain how it >>>>>>>>>>> is a head game in your next reply or within one hour of you >>>>>>>>>>> next post in this newsgroup will be taken as your official, >>>>>>>>>>> on- the- record admission that Disjunction introduction is in >>>>>>>>>>> fact truth preserving and valid, and therefore so is the >>>>>>>>>>> Principle of Explosion.


    Let the record show that Peter Olcott made the following post >>>>>>>>>> in this newsgroup:

    On 6/28/2026 10:52 PM, olcott wrote:
    Q also can't bake a birthday cake, this does not make
    Q in any way "incomplete" relative to what it was
    defined to do.
    ...

    And more that one hour has passed with no attempt to answer >>>>>>>>>> the above question or explain why it is a head game.
    Therefore, as per the above criteria:

    Let The Record Show

    That Peter Olcott

    Has *Officially* Admitted:

    That Disjunction introduction is in fact truth preserving and >>>>>>>>>> valid, and therefore so is the Principle of Explosion.



    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for
    Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many
    systems of analytic implication belonging to its ilk) is

    the rejection of the classically valid principle of Addition, >>>>>>>>> sometimes also referred to as Disjunction Introduction. In

    other words, the principle leading from a formula ϕ to a
    disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary
    formula. Parry blamed on this principle the derivability
    of the paradoxes of strict implication—given that it is
    famously featured in Lewis’ derivation of an arbitrary
    formula ψ from a contradiction of the form ϕ ∧ ¬ϕ.

    https://philarchive.org/archive/SZMASL


    So someone came up with a different system that has different >>>>>>>> rules. That has no bearing on existing systems.


    The bearing that it has on existing systems is

    None, as you can't remove a truth-preserving operation.



    that
    it corrects their psychotic break from reality that
    allows one to prove that Donald Trump is the one and
    only Lord and Savior on the basis of a totally irrelevant
    contradiction.

    It follows from a series of truth-preserving operations starting
    with the precondition that a contradiction has been proven, as you >>>>>> have admitted above on the record.

    Only people having actual psychosis would conclude
    that "The Moon is made from green cheese" AND
    "The Moon is NOT made from green cheese" SEMANTICALLY
    PROVES that Donald Trump is the one and only Lord
    and Savior Jesus Christ.

    How do you know that somewhere the Moon is made from green cheese and
    the Moon is not made from green cheese and Donald Trump is not the one >>>> and only Lord and Savior Jesus Christ?


    Counter-factual

    For logic the distinction between factual and counter-factual is not
    as imortant as the distinction between consistent and contradictory.

    Counter-factual may indicate a psychotic break from reality.

    No, it does not. It is much more common than anything psychotic.
    Besudes, any mention of anything psychotic is off-topic in these
    groups.
    --
    Mikko

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to sci.logic,comp.theory,sci.math,comp.ai.philosophy on Thu Jul 2 09:27:07 2026
    From Newsgroup: comp.ai.philosophy

    On 01/07/2026 18:04, olcott wrote:
    On 7/1/2026 1:50 AM, Mikko wrote:
    On 30/06/2026 16:45, olcott wrote:
    On 6/30/2026 2:55 AM, Mikko wrote:
    On 29/06/2026 16:23, dbush wrote:
    On 6/29/2026 9:17 AM, polcott wrote:
    On 6/29/2026 7:08 AM, dbush wrote:
    On 6/29/2026 12:13 AM, olcott wrote:
    On 6/28/2026 10:56 PM, dbush wrote:
    On 6/27/2026 11:34 PM, dbush wrote:
    On 6/27/2026 11:23 PM, olcott wrote:
    On 6/27/2026 9:02 PM, dbush wrote:
    On 6/27/2026 9:53 PM, dbush wrote:
    On 6/27/2026 9:49 PM, olcott wrote:
    On 6/27/2026 8:42 PM, dbush wrote:
    On 6/27/2026 9:40 PM, olcott wrote:
    On 6/27/2026 8:29 PM, dbush wrote:
    On 6/27/2026 9:24 PM, olcott wrote:
    On 6/27/2026 8:08 PM, dbush wrote:
    On 6/27/2026 7:56 PM, olcott wrote:
    On 6/27/2026 6:30 PM, dbush wrote:
    On 6/27/2026 7:22 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 5:52 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 6:40 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 1:34 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:29 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 1:24 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:03 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 12:54 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 11:11 AM, polcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:08 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 26/06/2026 15:49, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/26/2026 1:49 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 26/06/2026 04:32, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> William T. Parry, Entailment Logics >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> gets rid of Disjunction introduction >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> to prevent the principle of explosion >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    A simple logical matrix and sequent >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> calculus for >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Parry’s logic of Analytic Implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    The main and distinctive feature of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> PAI (and of the many >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> systems of analytic implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> belonging to its ilk) is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> the rejection of the classically valid >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> principle of Addition, >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> sometimes also referred to as >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Disjunction Introduction. In >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> other words, the principle leading >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> from a formula ϕ to a >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where ψ >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> is an arbitrary >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formula. Parry blamed on this >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> principle the derivability >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of the paradoxes of strict implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> — given that it is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> famously featured in Lewis’ derivation >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of an arbitrary >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formula ψ from a contradiction of the >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> form ϕ ∧ ¬ϕ. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    He also gets rid of an efficient way to >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> convince people who don't >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> understand much of logic. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    As I recently showed in another post. I >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> figured
    all this out on my own. I didn't even >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> know that
    anyone else ever did this. I just knew >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> that when
    trying to find out what is deduced from >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> a set of
    premises that you cannot pop in another >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> sentence
    from out of nowhere and get a correct >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> conclusion.

    By popping in another sentence from out >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of nowhere
    (as it shows above) the principle of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> explosion is
    derived.

    The usual meaning of proof is a sequence >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of statement where eachstatement either >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> is a premis or follows from one or more >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> earlier
    statements

    Except with Disjunction introduction, that >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> is its problem.

    So you're saying that in the following >>>>>>>>>>>>>>>>>>>>>>>>>>>>> natural language statement: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>

    It is a key issue in that it creates the >>>>>>>>>>>>>>>>>>>>>>>>>>>> psychotic break from reality known as the >>>>>>>>>>>>>>>>>>>>>>>>>>>> Principle of Explosion, otherwise it may >>>>>>>>>>>>>>>>>>>>>>>>>>>> make no difference at all. >>>>>>>>>>>>>>>>>>>>>>>>>>>>
    Stay on topic or I will block you. >>>>>>>>>>>>>>>>>>>>>>>>>>>
    Explain in detail how the below which you >>>>>>>>>>>>>>>>>>>>>>>>>>> dishonestly trimmed is off- topic. >>>>>>>>>>>>>>>>>>>>>>>>>>>

    The topic is how Disjunction introduction >>>>>>>>>>>>>>>>>>>>>>>>>> enables the
    Principle of Explosion.


    Rejected, as you not liking the result doesn't >>>>>>>>>>>>>>>>>>>>>>>>> make it invalid.

    Through a series of truth preserving >>>>>>>>>>>>>>>>>>>>>>>>> operations, when a contradiction is given as >>>>>>>>>>>>>>>>>>>>>>>>> true, any statement can be proven as true. >>>>>>>>>>>>>>>>>>>>>>>>>
    The principle of explosion is a demonstration >>>>>>>>>>>>>>>>>>>>>>>>> of *why* a formal system whose axioms lead to a >>>>>>>>>>>>>>>>>>>>>>>>> contradiction is useless.

    The only reason someone would want to get rid >>>>>>>>>>>>>>>>>>>>>>>>> of the principle of explosion is to be able to >>>>>>>>>>>>>>>>>>>>>>>>> use a system that has a contradiction. >>>>>>>>>>>>>>>>>>>>>>>>>

    My reason to get rid of the principle of explosion >>>>>>>>>>>>>>>>>>>>>>>> it to get rid of anything and everything that >>>>>>>>>>>>>>>>>>>>>>>> prevents
    infallibly correct reasoning.


    If you get rid of the principle of explosion, the >>>>>>>>>>>>>>>>>>>>>>> law of non- contradiction goes away as it looses >>>>>>>>>>>>>>>>>>>>>>> its basis.


    You keep failing to pay close enough attention. >>>>>>>>>>>>>>>>>>>>>> I only get rid of the POE by getting rid of >>>>>>>>>>>>>>>>>>>>>> Disjunction introduction.

    Which you can't do because it's a truth-preserving >>>>>>>>>>>>>>>>>>>>> operation.

    1) P ∧ ¬P    // Premise
    2) P          // Conjunction elimination >>>>>>>>>>>>>>>>>>>> 3) ¬P        // Conjunction elimination >>>>>>>>>>>>>>>>>>>> 4) P ∨ Q      // Disjunction introduction >>>>>>>>>>>>>>>>>>>> 5) Q          // Disjunctive syllogism >>>>>>>>>>>>>>>>>>>> https://en.wikipedia.org/wiki/
    Principle_of_explosion#Proof

    When you insert English meanings into the >>>>>>>>>>>>>>>>>>>> propositional variables it is as obvious >>>>>>>>>>>>>>>>>>>> as a pie in the fact the DI IS NOT TRUTH PRESERVING. >>>>>>>>>>>>>>>>>>>
    So you're saying that in the following natural >>>>>>>>>>>>>>>>>>> language statement:

    --------------------------------------
    At least one of the following statements is true: >>>>>>>>>>>>>>>>>>> - Earth is the third planet from the sun. >>>>>>>>>>>>>>>>>>> - <X>
    --------------------------------------

    Where <X> is any natural language statement, there >>>>>>>>>>>>>>>>>>> exists a statement X such that the condition "At >>>>>>>>>>>>>>>>>>> least one of the following statements is true" is false. >>>>>>>>>>>>>>>>>>>
    Name it.


    That is not Disjunction introduction combined with >>>>>>>>>>>>>>>>>> Disjunctive syllogism, it is bare Disjunction. >>>>>>>>>>>>>>>>>>

    Let me spell it out more explicitly then.

    Given that the following natural language statement is >>>>>>>>>>>>>>>>> true:

    --------------------------------------
    Earth is the third planet from the sun.
    --------------------------------------

    In the following natural language statement: >>>>>>>>>>>>>>>>>
    --------------------------------------
    At least one of the following statements is true: >>>>>>>>>>>>>>>>> - Earth is the third planet from the sun.
    - <X>
    --------------------------------------

    Where <X> is any natural language statement, does there >>>>>>>>>>>>>>>>> exist a statement X such that the condition "At least >>>>>>>>>>>>>>>>> one of the following statements is true" is false? >>>>>>>>>>>>>>>>>

    Where X is "What time is it?"



    Is the statement "Earth is the third planet from the sun" >>>>>>>>>>>>>>> true?

    We have a type mismatch error.



    The statement you gave isn't a truth-bearing statement, so >>>>>>>>>>>>> it can't be used in logic.  I didn't think I had to make >>>>>>>>>>>>> that explicit.

    However, let's go with it anyway because it still
    illustrates the point.

    So I'll ask again:

    Is the statement "Earth is the third planet from the sun" >>>>>>>>>>>>> true?


    On second though, let's back up as that might confuse you. >>>>>>>>>>>>
    Given that <X> is any *truth bearing* natural language >>>>>>>>>>>> statement, does there exist a statement X such that the >>>>>>>>>>>> condition "At least one of the following statements is true" >>>>>>>>>>>> is false?


    Head games will be ignored.
    That you did so well on the other things
    so I will not block you.


    Explain in detail how this is a head game.

    Failure to either answer the above question or explain how it >>>>>>>>>> is a head game in your next reply or within one hour of you >>>>>>>>>> next post in this newsgroup will be taken as your official, >>>>>>>>>> on- the- record admission that Disjunction introduction is in >>>>>>>>>> fact truth preserving and valid, and therefore so is the
    Principle of Explosion.


    Let the record show that Peter Olcott made the following post >>>>>>>>> in this newsgroup:

    On 6/28/2026 10:52 PM, olcott wrote:
    Q also can't bake a birthday cake, this does not make
    Q in any way "incomplete" relative to what it was
    defined to do.
    ...

    And more that one hour has passed with no attempt to answer the >>>>>>>>> above question or explain why it is a head game.  Therefore, as >>>>>>>>> per the above criteria:

    Let The Record Show

    That Peter Olcott

    Has *Officially* Admitted:

    That Disjunction introduction is in fact truth preserving and >>>>>>>>> valid, and therefore so is the Principle of Explosion.



    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for
    Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many
    systems of analytic implication belonging to its ilk) is

    the rejection of the classically valid principle of Addition,
    sometimes also referred to as Disjunction Introduction. In

    other words, the principle leading from a formula ϕ to a
    disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary
    formula. Parry blamed on this principle the derivability
    of the paradoxes of strict implication—given that it is
    famously featured in Lewis’ derivation of an arbitrary
    formula ψ from a contradiction of the form ϕ ∧ ¬ϕ.

    https://philarchive.org/archive/SZMASL


    So someone came up with a different system that has different
    rules. That has no bearing on existing systems.


    The bearing that it has on existing systems is

    None, as you can't remove a truth-preserving operation.

    One can construct a system where a truth-preserving operation is not
    valid, and must if one wants to construct a paraconsistent system,
    where some but not every sentence can be both PTS-true and PTS-false.


    Current semantic entailment is the only inference step allowed.

    Every truth-prserving transformation is a correct semantic entailment.
    In particular, disjunction introduction is.

    That is counter-factual. POE is misconstrued as truth preserving.

    No, it is not. Nobody has claimed that POE preserves anythjing. The
    iimportance of POE is in what it reveals.

    POE is the equivalnet of the common understanding that a liar cannot
    be trusted even though a good liar tells the truth more often than a
    lie.
    --
    Mikko

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to sci.logic,sci.math,comp.theory,comp.ai.philosophy on Thu Jul 2 09:29:11 2026
    From Newsgroup: comp.ai.philosophy

    On 01/07/2026 18:06, olcott wrote:
    On 7/1/2026 1:53 AM, Mikko wrote:
    On 30/06/2026 16:55, olcott wrote:
    On 6/30/2026 3:10 AM, Mikko wrote:
    On 29/06/2026 16:55, olcott wrote:
    On 6/28/2026 4:32 AM, Mikko wrote:
    On 27/06/2026 21:29, olcott wrote:
    On 6/27/2026 1:24 PM, dbush wrote:
    On 6/27/2026 2:03 PM, olcott wrote:
    On 6/27/2026 12:54 PM, dbush wrote:
    On 6/27/2026 11:11 AM, polcott wrote:
    On 6/27/2026 2:08 AM, Mikko wrote:
    On 26/06/2026 15:49, olcott wrote:
    On 6/26/2026 1:49 AM, Mikko wrote:
    On 26/06/2026 04:32, olcott wrote:
    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for >>>>>>>>>>>>>>> Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many >>>>>>>>>>>>>>> systems of analytic implication belonging to its ilk) is >>>>>>>>>>>>>>> the rejection of the classically valid principle of >>>>>>>>>>>>>>> Addition,
    sometimes also referred to as Disjunction Introduction. In >>>>>>>>>>>>>>> other words, the principle leading from a formula ϕ to a >>>>>>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary >>>>>>>>>>>>>>> formula. Parry blamed on this principle the derivability >>>>>>>>>>>>>>> of the paradoxes of strict implication—given that it is >>>>>>>>>>>>>>> famously featured in Lewis’ derivation of an arbitrary >>>>>>>>>>>>>>> formula ψ from a contradiction of the form ϕ ∧ ¬ϕ. >>>>>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL

    He also gets rid of an efficient way to convince people >>>>>>>>>>>>>> who don't
    understand much of logic.

    As I recently showed in another post. I figured
    all this out on my own. I didn't even know that
    anyone else ever did this. I just knew that when
    trying to find out what is deduced from a set of
    premises that you cannot pop in another sentence
    from out of nowhere and get a correct conclusion.

    By popping in another sentence from out of nowhere
    (as it shows above) the principle of explosion is
    derived.

    The usual meaning of proof is a sequence of statement where >>>>>>>>>>>> eachstatement either is a premis or follows from one or more >>>>>>>>>>>> earlier
    statements

    Except with Disjunction introduction, that is its problem. >>>>>>>>>>
    So you're saying that in the following natural language
    statement:


    It is a key issue in that it creates the
    psychotic break from reality known as the
    Principle of Explosion, otherwise it may
    make no difference at all.

    Stay on topic or I will block you.

    Explain in detail how the below which you dishonestly trimmed is >>>>>>>> off- topic.


    The topic is how Disjunction introduction enables the
    Principle of Explosion.

    It does not. In any sensible logic every tautology is provable.
    Then the principle of explosion follows.

    POE is unprovable in both of these more sensible systems
    of logic.

    THe expression "these system" above does not denote.


    Parry’s logic of Analytic Implication

    Relevance Logic
    https://plato.stanford.edu/entries/logic-relevance/

    The POE is an actual psychotic break from
    reality when one pays full and complete attention to
    the underlying semantics and does not stupidly take
    semantics out of logic and put it in a separate model.

    No, it is not. The principle of explosion is about consequencies
    of a false premise, which already is a break from reality even
    when no consequence is inferred.

    Only because semantics is ignored.

    A break from reality is a break from reality, no matter whether
    the semantics is ignored or considered. Though if there is no
    semantics, even any ignored one, there is no connection to
    reality to break.


    Ignoring semantics is always a break from reality.

    So is any semantics other than real world semantics.
    --
    Mikko
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to sci.logic,sci.math,comp.theory,comp.ai.philosophy on Thu Jul 2 09:31:33 2026
    From Newsgroup: comp.ai.philosophy

    On 01/07/2026 18:25, olcott wrote:
    On 7/1/2026 2:32 AM, Mikko wrote:
    On 30/06/2026 16:55, olcott wrote:
    On 6/30/2026 3:10 AM, Mikko wrote:
    On 29/06/2026 16:55, olcott wrote:
    On 6/28/2026 4:32 AM, Mikko wrote:
    On 27/06/2026 21:29, olcott wrote:
    On 6/27/2026 1:24 PM, dbush wrote:
    On 6/27/2026 2:03 PM, olcott wrote:
    On 6/27/2026 12:54 PM, dbush wrote:
    On 6/27/2026 11:11 AM, polcott wrote:
    On 6/27/2026 2:08 AM, Mikko wrote:
    On 26/06/2026 15:49, olcott wrote:
    On 6/26/2026 1:49 AM, Mikko wrote:
    On 26/06/2026 04:32, olcott wrote:
    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for >>>>>>>>>>>>>>> Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many >>>>>>>>>>>>>>> systems of analytic implication belonging to its ilk) is >>>>>>>>>>>>>>> the rejection of the classically valid principle of >>>>>>>>>>>>>>> Addition,
    sometimes also referred to as Disjunction Introduction. In >>>>>>>>>>>>>>> other words, the principle leading from a formula ϕ to a >>>>>>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary >>>>>>>>>>>>>>> formula. Parry blamed on this principle the derivability >>>>>>>>>>>>>>> of the paradoxes of strict implication—given that it is >>>>>>>>>>>>>>> famously featured in Lewis’ derivation of an arbitrary >>>>>>>>>>>>>>> formula ψ from a contradiction of the form ϕ ∧ ¬ϕ. >>>>>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL

    He also gets rid of an efficient way to convince people >>>>>>>>>>>>>> who don't
    understand much of logic.

    As I recently showed in another post. I figured
    all this out on my own. I didn't even know that
    anyone else ever did this. I just knew that when
    trying to find out what is deduced from a set of
    premises that you cannot pop in another sentence
    from out of nowhere and get a correct conclusion.

    By popping in another sentence from out of nowhere
    (as it shows above) the principle of explosion is
    derived.

    The usual meaning of proof is a sequence of statement where >>>>>>>>>>>> eachstatement either is a premis or follows from one or more >>>>>>>>>>>> earlier
    statements

    Except with Disjunction introduction, that is its problem. >>>>>>>>>>
    So you're saying that in the following natural language
    statement:


    It is a key issue in that it creates the
    psychotic break from reality known as the
    Principle of Explosion, otherwise it may
    make no difference at all.

    Stay on topic or I will block you.

    Explain in detail how the below which you dishonestly trimmed is >>>>>>>> off- topic.


    The topic is how Disjunction introduction enables the
    Principle of Explosion.

    It does not. In any sensible logic every tautology is provable.
    Then the principle of explosion follows.

    POE is unprovable in both of these more sensible systems
    of logic.

    THe expression "these system" above does not denote.

    Parry’s logic of Analytic Implication

    If the intent was to include that in the denotation you failed
    to say something important.

    Parry’s logic of Analytic Implication
    and Relevance logic are two sensible systems
    that get rid of the Principle of Explosion.

    Getting rid of the principle of explosion makes as much sense as
    getting rid of fire alarms. It makes much more sense to get rid
    of fires and false premises.
    --
    Mikko
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,sci.math,comp.theory,comp.ai.philosophy on Thu Jul 2 09:37:54 2026
    From Newsgroup: comp.ai.philosophy

    On 7/2/2026 1:21 AM, Mikko wrote:
    On 01/07/2026 18:01, olcott wrote:
    On 7/1/2026 1:46 AM, Mikko wrote:
    On 30/06/2026 17:37, olcott wrote:
    On 6/30/2026 3:48 AM, Mikko wrote:
    On 29/06/2026 17:00, olcott wrote:
    On 6/29/2026 8:23 AM, dbush wrote:
    On 6/29/2026 9:17 AM, polcott wrote:
    On 6/29/2026 7:08 AM, dbush wrote:
    On 6/29/2026 12:13 AM, olcott wrote:
    On 6/28/2026 10:56 PM, dbush wrote:
    On 6/27/2026 11:34 PM, dbush wrote:
    On 6/27/2026 11:23 PM, olcott wrote:
    On 6/27/2026 9:02 PM, dbush wrote:
    On 6/27/2026 9:53 PM, dbush wrote:
    On 6/27/2026 9:49 PM, olcott wrote:
    On 6/27/2026 8:42 PM, dbush wrote:
    On 6/27/2026 9:40 PM, olcott wrote:
    On 6/27/2026 8:29 PM, dbush wrote:
    On 6/27/2026 9:24 PM, olcott wrote:
    On 6/27/2026 8:08 PM, dbush wrote:
    On 6/27/2026 7:56 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 6:30 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 7:22 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 5:52 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 6:40 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 1:34 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:29 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 1:24 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:03 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 12:54 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 11:11 AM, polcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:08 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 26/06/2026 15:49, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/26/2026 1:49 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 26/06/2026 04:32, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> William T. Parry, Entailment Logics >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> gets rid of Disjunction introduction >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> to prevent the principle of explosion >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    A simple logical matrix and sequent >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> calculus for >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Parry’s logic of Analytic Implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    The main and distinctive feature of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> PAI (and of the many >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> systems of analytic implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> belonging to its ilk) is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> the rejection of the classically >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> valid principle of Addition, >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> sometimes also referred to as >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Disjunction Introduction. In >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> other words, the principle leading >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> from a formula ϕ to a >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> ψ is an arbitrary >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formula. Parry blamed on this >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> principle the derivability >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of the paradoxes of strict >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> implication — given that it is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> famously featured in Lewis’ >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> derivation of an arbitrary >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formula ψ from a contradiction of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> the form ϕ ∧ ¬ϕ. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    He also gets rid of an efficient way >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> to convince people who don't >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> understand much of logic. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    As I recently showed in another post. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> I figured
    all this out on my own. I didn't even >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> know that
    anyone else ever did this. I just knew >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> that when
    trying to find out what is deduced >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> from a set of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> premises that you cannot pop in >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> another sentence >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> from out of nowhere and get a correct >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> conclusion. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    By popping in another sentence from >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> out of nowhere >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> (as it shows above) the principle of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> explosion is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> derived.

    The usual meaning of proof is a >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> sequence of statement where >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> eachstatement either is a premis or >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> follows from one or more earlier >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> statements

    Except with Disjunction introduction, >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> that is its problem. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    So you're saying that in the following >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> natural language statement: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>

    It is a key issue in that it creates the >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> psychotic break from reality known as the >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Principle of Explosion, otherwise it may >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> make no difference at all. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    Stay on topic or I will block you. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    Explain in detail how the below which you >>>>>>>>>>>>>>>>>>>>>>>>>>>>> dishonestly trimmed is off- topic. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>

    The topic is how Disjunction introduction >>>>>>>>>>>>>>>>>>>>>>>>>>>> enables the
    Principle of Explosion. >>>>>>>>>>>>>>>>>>>>>>>>>>>>

    Rejected, as you not liking the result >>>>>>>>>>>>>>>>>>>>>>>>>>> doesn't make it invalid. >>>>>>>>>>>>>>>>>>>>>>>>>>>
    Through a series of truth preserving >>>>>>>>>>>>>>>>>>>>>>>>>>> operations, when a contradiction is given as >>>>>>>>>>>>>>>>>>>>>>>>>>> true, any statement can be proven as true. >>>>>>>>>>>>>>>>>>>>>>>>>>>
    The principle of explosion is a demonstration >>>>>>>>>>>>>>>>>>>>>>>>>>> of *why* a formal system whose axioms lead to >>>>>>>>>>>>>>>>>>>>>>>>>>> a contradiction is useless. >>>>>>>>>>>>>>>>>>>>>>>>>>>
    The only reason someone would want to get rid >>>>>>>>>>>>>>>>>>>>>>>>>>> of the principle of explosion is to be able >>>>>>>>>>>>>>>>>>>>>>>>>>> to use a system that has a contradiction. >>>>>>>>>>>>>>>>>>>>>>>>>>>

    My reason to get rid of the principle of >>>>>>>>>>>>>>>>>>>>>>>>>> explosion
    it to get rid of anything and everything that >>>>>>>>>>>>>>>>>>>>>>>>>> prevents
    infallibly correct reasoning. >>>>>>>>>>>>>>>>>>>>>>>>>>

    If you get rid of the principle of explosion, >>>>>>>>>>>>>>>>>>>>>>>>> the law of non- contradiction goes away as it >>>>>>>>>>>>>>>>>>>>>>>>> looses its basis.


    You keep failing to pay close enough attention. >>>>>>>>>>>>>>>>>>>>>>>> I only get rid of the POE by getting rid of >>>>>>>>>>>>>>>>>>>>>>>> Disjunction introduction.

    Which you can't do because it's a truth- >>>>>>>>>>>>>>>>>>>>>>> preserving operation.

    1) P ∧ ¬P    // Premise
    2) P          // Conjunction elimination >>>>>>>>>>>>>>>>>>>>>> 3) ¬P        // Conjunction elimination >>>>>>>>>>>>>>>>>>>>>> 4) P ∨ Q      // Disjunction introduction >>>>>>>>>>>>>>>>>>>>>> 5) Q          // Disjunctive syllogism >>>>>>>>>>>>>>>>>>>>>> https://en.wikipedia.org/wiki/
    Principle_of_explosion#Proof

    When you insert English meanings into the >>>>>>>>>>>>>>>>>>>>>> propositional variables it is as obvious >>>>>>>>>>>>>>>>>>>>>> as a pie in the fact the DI IS NOT TRUTH PRESERVING. >>>>>>>>>>>>>>>>>>>>>
    So you're saying that in the following natural >>>>>>>>>>>>>>>>>>>>> language statement:

    -------------------------------------- >>>>>>>>>>>>>>>>>>>>> At least one of the following statements is true: >>>>>>>>>>>>>>>>>>>>> - Earth is the third planet from the sun. >>>>>>>>>>>>>>>>>>>>> - <X>
    -------------------------------------- >>>>>>>>>>>>>>>>>>>>>
    Where <X> is any natural language statement, there >>>>>>>>>>>>>>>>>>>>> exists a statement X such that the condition "At >>>>>>>>>>>>>>>>>>>>> least one of the following statements is true" is >>>>>>>>>>>>>>>>>>>>> false.

    Name it.


    That is not Disjunction introduction combined with >>>>>>>>>>>>>>>>>>>> Disjunctive syllogism, it is bare Disjunction. >>>>>>>>>>>>>>>>>>>>

    Let me spell it out more explicitly then. >>>>>>>>>>>>>>>>>>>
    Given that the following natural language statement >>>>>>>>>>>>>>>>>>> is true:

    --------------------------------------
    Earth is the third planet from the sun.
    --------------------------------------

    In the following natural language statement: >>>>>>>>>>>>>>>>>>>
    --------------------------------------
    At least one of the following statements is true: >>>>>>>>>>>>>>>>>>> - Earth is the third planet from the sun. >>>>>>>>>>>>>>>>>>> - <X>
    --------------------------------------

    Where <X> is any natural language statement, does >>>>>>>>>>>>>>>>>>> there exist a statement X such that the condition "At >>>>>>>>>>>>>>>>>>> least one of the following statements is true" is false? >>>>>>>>>>>>>>>>>>>

    Where X is "What time is it?"



    Is the statement "Earth is the third planet from the >>>>>>>>>>>>>>>>> sun" true?

    We have a type mismatch error.



    The statement you gave isn't a truth-bearing statement, >>>>>>>>>>>>>>> so it can't be used in logic.  I didn't think I had to >>>>>>>>>>>>>>> make that explicit.

    However, let's go with it anyway because it still >>>>>>>>>>>>>>> illustrates the point.

    So I'll ask again:

    Is the statement "Earth is the third planet from the sun" >>>>>>>>>>>>>>> true?


    On second though, let's back up as that might confuse you. >>>>>>>>>>>>>>
    Given that <X> is any *truth bearing* natural language >>>>>>>>>>>>>> statement, does there exist a statement X such that the >>>>>>>>>>>>>> condition "At least one of the following statements is >>>>>>>>>>>>>> true" is false?


    Head games will be ignored.
    That you did so well on the other things
    so I will not block you.


    Explain in detail how this is a head game.

    Failure to either answer the above question or explain how >>>>>>>>>>>> it is a head game in your next reply or within one hour of >>>>>>>>>>>> you next post in this newsgroup will be taken as your >>>>>>>>>>>> official, on- the- record admission that Disjunction
    introduction is in fact truth preserving and valid, and >>>>>>>>>>>> therefore so is the Principle of Explosion.


    Let the record show that Peter Olcott made the following post >>>>>>>>>>> in this newsgroup:

    On 6/28/2026 10:52 PM, olcott wrote:
    Q also can't bake a birthday cake, this does not make >>>>>>>>>>>  > Q in any way "incomplete" relative to what it was
    defined to do.
    ...

    And more that one hour has passed with no attempt to answer >>>>>>>>>>> the above question or explain why it is a head game.
    Therefore, as per the above criteria:

    Let The Record Show

    That Peter Olcott

    Has *Officially* Admitted:

    That Disjunction introduction is in fact truth preserving and >>>>>>>>>>> valid, and therefore so is the Principle of Explosion.



    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for
    Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many
    systems of analytic implication belonging to its ilk) is

    the rejection of the classically valid principle of Addition, >>>>>>>>>> sometimes also referred to as Disjunction Introduction. In >>>>>>>>>>
    other words, the principle leading from a formula ϕ to a
    disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary >>>>>>>>>> formula. Parry blamed on this principle the derivability
    of the paradoxes of strict implication—given that it is
    famously featured in Lewis’ derivation of an arbitrary
    formula ψ from a contradiction of the form ϕ ∧ ¬ϕ.

    https://philarchive.org/archive/SZMASL


    So someone came up with a different system that has different >>>>>>>>> rules. That has no bearing on existing systems.


    The bearing that it has on existing systems is

    None, as you can't remove a truth-preserving operation.



    that
    it corrects their psychotic break from reality that
    allows one to prove that Donald Trump is the one and
    only Lord and Savior on the basis of a totally irrelevant
    contradiction.

    It follows from a series of truth-preserving operations starting >>>>>>> with the precondition that a contradiction has been proven, as
    you have admitted above on the record.

    Only people having actual psychosis would conclude
    that "The Moon is made from green cheese" AND
    "The Moon is NOT made from green cheese" SEMANTICALLY
    PROVES that Donald Trump is the one and only Lord
    and Savior Jesus Christ.

    How do you know that somewhere the Moon is made from green cheese and >>>>> the Moon is not made from green cheese and Donald Trump is not the one >>>>> and only Lord and Savior Jesus Christ?


    Counter-factual

    For logic the distinction between factual and counter-factual is not
    as imortant as the distinction between consistent and contradictory.

    Counter-factual may indicate a psychotic break from reality.

    No, it does not. It is much more common than anything psychotic.
    Besudes, any mention of anything psychotic is off-topic in these
    groups.


    x = "The Moon is made from green cheese"
    y = "Donald Trump is the one and only Lord and Savior Jesus Christ:
    POE concludes (x ∧ ¬x) ⊢ y

    "the principle of explosion is the theorem according to
    which any statement can be proven from a contradiction" https://en.wikipedia.org/wiki/Principle_of_explosion

    When you pay attention to the meaning of the words
    and correctly apply correct semantic entailment on
    the basis of the meaning of those words then the
    principle of explosion is a PSYCHOTIC BREAK FROM REALITY.
    Relevance logic solved this by requiring relevance. https://plato.stanford.edu/entries/logic-relevance/

    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    https://philarchive.org/archive/SZMASL
    So that a new premise cannot be inserted in
    a chain-of-reasoning from out of nowhere

    The terrible mistake that logic made was to remove
    semantics from logical inference. This does result in
    a PSYCHOTIC BREAK FROM REALITY, making it relevant to
    these groups.

    Also the computation groups are relevant to sci.logic
    and sci.math because computation exposes gaps in the
    reasoning that logic and math assumes away.
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,sci.math,comp.theory,comp.ai.philosophy on Thu Jul 2 09:40:00 2026
    From Newsgroup: comp.ai.philosophy

    On 7/2/2026 1:29 AM, Mikko wrote:
    On 01/07/2026 18:06, olcott wrote:
    On 7/1/2026 1:53 AM, Mikko wrote:
    On 30/06/2026 16:55, olcott wrote:
    On 6/30/2026 3:10 AM, Mikko wrote:
    On 29/06/2026 16:55, olcott wrote:
    On 6/28/2026 4:32 AM, Mikko wrote:
    On 27/06/2026 21:29, olcott wrote:
    On 6/27/2026 1:24 PM, dbush wrote:
    On 6/27/2026 2:03 PM, olcott wrote:
    On 6/27/2026 12:54 PM, dbush wrote:
    On 6/27/2026 11:11 AM, polcott wrote:
    On 6/27/2026 2:08 AM, Mikko wrote:
    On 26/06/2026 15:49, olcott wrote:
    On 6/26/2026 1:49 AM, Mikko wrote:
    On 26/06/2026 04:32, olcott wrote:
    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for >>>>>>>>>>>>>>>> Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many >>>>>>>>>>>>>>>> systems of analytic implication belonging to its ilk) is >>>>>>>>>>>>>>>> the rejection of the classically valid principle of >>>>>>>>>>>>>>>> Addition,
    sometimes also referred to as Disjunction Introduction. In >>>>>>>>>>>>>>>> other words, the principle leading from a formula ϕ to a >>>>>>>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary >>>>>>>>>>>>>>>> formula. Parry blamed on this principle the derivability >>>>>>>>>>>>>>>> of the paradoxes of strict implication—given that it is >>>>>>>>>>>>>>>> famously featured in Lewis’ derivation of an arbitrary >>>>>>>>>>>>>>>> formula ψ from a contradiction of the form ϕ ∧ ¬ϕ. >>>>>>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL

    He also gets rid of an efficient way to convince people >>>>>>>>>>>>>>> who don't
    understand much of logic.

    As I recently showed in another post. I figured
    all this out on my own. I didn't even know that
    anyone else ever did this. I just knew that when
    trying to find out what is deduced from a set of
    premises that you cannot pop in another sentence
    from out of nowhere and get a correct conclusion.

    By popping in another sentence from out of nowhere >>>>>>>>>>>>>> (as it shows above) the principle of explosion is
    derived.

    The usual meaning of proof is a sequence of statement where >>>>>>>>>>>>> eachstatement either is a premis or follows from one or >>>>>>>>>>>>> more earlier
    statements

    Except with Disjunction introduction, that is its problem. >>>>>>>>>>>
    So you're saying that in the following natural language >>>>>>>>>>> statement:


    It is a key issue in that it creates the
    psychotic break from reality known as the
    Principle of Explosion, otherwise it may
    make no difference at all.

    Stay on topic or I will block you.

    Explain in detail how the below which you dishonestly trimmed >>>>>>>>> is off- topic.


    The topic is how Disjunction introduction enables the
    Principle of Explosion.

    It does not. In any sensible logic every tautology is provable.
    Then the principle of explosion follows.

    POE is unprovable in both of these more sensible systems
    of logic.

    THe expression "these system" above does not denote.


    Parry’s logic of Analytic Implication

    Relevance Logic
    https://plato.stanford.edu/entries/logic-relevance/

    The POE is an actual psychotic break from
    reality when one pays full and complete attention to
    the underlying semantics and does not stupidly take
    semantics out of logic and put it in a separate model.

    No, it is not. The principle of explosion is about consequencies
    of a false premise, which already is a break from reality even
    when no consequence is inferred.

    Only because semantics is ignored.

    A break from reality is a break from reality, no matter whether
    the semantics is ignored or considered. Though if there is no
    semantics, even any ignored one, there is no connection to
    reality to break.


    Ignoring semantics is always a break from reality.

    So is any semantics other than real world semantics.


    Hypotheticals are useful for making decisions.
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,sci.math,comp.theory,comp.ai.philosophy on Thu Jul 2 09:40:57 2026
    From Newsgroup: comp.ai.philosophy

    On 7/2/2026 1:31 AM, Mikko wrote:
    On 01/07/2026 18:25, olcott wrote:
    On 7/1/2026 2:32 AM, Mikko wrote:
    On 30/06/2026 16:55, olcott wrote:
    On 6/30/2026 3:10 AM, Mikko wrote:
    On 29/06/2026 16:55, olcott wrote:
    On 6/28/2026 4:32 AM, Mikko wrote:
    On 27/06/2026 21:29, olcott wrote:
    On 6/27/2026 1:24 PM, dbush wrote:
    On 6/27/2026 2:03 PM, olcott wrote:
    On 6/27/2026 12:54 PM, dbush wrote:
    On 6/27/2026 11:11 AM, polcott wrote:
    On 6/27/2026 2:08 AM, Mikko wrote:
    On 26/06/2026 15:49, olcott wrote:
    On 6/26/2026 1:49 AM, Mikko wrote:
    On 26/06/2026 04:32, olcott wrote:
    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for >>>>>>>>>>>>>>>> Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many >>>>>>>>>>>>>>>> systems of analytic implication belonging to its ilk) is >>>>>>>>>>>>>>>> the rejection of the classically valid principle of >>>>>>>>>>>>>>>> Addition,
    sometimes also referred to as Disjunction Introduction. In >>>>>>>>>>>>>>>> other words, the principle leading from a formula ϕ to a >>>>>>>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary >>>>>>>>>>>>>>>> formula. Parry blamed on this principle the derivability >>>>>>>>>>>>>>>> of the paradoxes of strict implication—given that it is >>>>>>>>>>>>>>>> famously featured in Lewis’ derivation of an arbitrary >>>>>>>>>>>>>>>> formula ψ from a contradiction of the form ϕ ∧ ¬ϕ. >>>>>>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL

    He also gets rid of an efficient way to convince people >>>>>>>>>>>>>>> who don't
    understand much of logic.

    As I recently showed in another post. I figured
    all this out on my own. I didn't even know that
    anyone else ever did this. I just knew that when
    trying to find out what is deduced from a set of
    premises that you cannot pop in another sentence
    from out of nowhere and get a correct conclusion.

    By popping in another sentence from out of nowhere >>>>>>>>>>>>>> (as it shows above) the principle of explosion is
    derived.

    The usual meaning of proof is a sequence of statement where >>>>>>>>>>>>> eachstatement either is a premis or follows from one or >>>>>>>>>>>>> more earlier
    statements

    Except with Disjunction introduction, that is its problem. >>>>>>>>>>>
    So you're saying that in the following natural language >>>>>>>>>>> statement:


    It is a key issue in that it creates the
    psychotic break from reality known as the
    Principle of Explosion, otherwise it may
    make no difference at all.

    Stay on topic or I will block you.

    Explain in detail how the below which you dishonestly trimmed >>>>>>>>> is off- topic.


    The topic is how Disjunction introduction enables the
    Principle of Explosion.

    It does not. In any sensible logic every tautology is provable.
    Then the principle of explosion follows.

    POE is unprovable in both of these more sensible systems
    of logic.

    THe expression "these system" above does not denote.

    Parry’s logic of Analytic Implication

    If the intent was to include that in the denotation you failed
    to say something important.

    Parry’s logic of Analytic Implication
    and Relevance logic are two sensible systems
    that get rid of the Principle of Explosion.

    Getting rid of the principle of explosion makes as much sense as
    getting rid of fire alarms. It makes much more sense to get rid
    of fires and false premises.


    Then you are irrational
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From dbush@dbush.mobile@gmail.com to sci.logic,sci.math,comp.theory,comp.ai.philosophy on Thu Jul 2 10:42:10 2026
    From Newsgroup: comp.ai.philosophy

    On 7/2/2026 10:37 AM, olcott wrote:
    On 7/2/2026 1:21 AM, Mikko wrote:
    On 01/07/2026 18:01, olcott wrote:
    On 7/1/2026 1:46 AM, Mikko wrote:
    On 30/06/2026 17:37, olcott wrote:
    On 6/30/2026 3:48 AM, Mikko wrote:
    On 29/06/2026 17:00, olcott wrote:
    On 6/29/2026 8:23 AM, dbush wrote:
    On 6/29/2026 9:17 AM, polcott wrote:
    On 6/29/2026 7:08 AM, dbush wrote:
    On 6/29/2026 12:13 AM, olcott wrote:
    On 6/28/2026 10:56 PM, dbush wrote:
    On 6/27/2026 11:34 PM, dbush wrote:
    On 6/27/2026 11:23 PM, olcott wrote:
    On 6/27/2026 9:02 PM, dbush wrote:
    On 6/27/2026 9:53 PM, dbush wrote:
    On 6/27/2026 9:49 PM, olcott wrote:
    On 6/27/2026 8:42 PM, dbush wrote:
    On 6/27/2026 9:40 PM, olcott wrote:
    On 6/27/2026 8:29 PM, dbush wrote:
    On 6/27/2026 9:24 PM, olcott wrote:
    On 6/27/2026 8:08 PM, dbush wrote:
    On 6/27/2026 7:56 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 6:30 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 7:22 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 5:52 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 6:40 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 1:34 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:29 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 1:24 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:03 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 12:54 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 11:11 AM, polcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:08 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 26/06/2026 15:49, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/26/2026 1:49 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 26/06/2026 04:32, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> William T. Parry, Entailment Logics >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> gets rid of Disjunction introduction >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> to prevent the principle of explosion >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    A simple logical matrix and sequent >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> calculus for >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Parry’s logic of Analytic Implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    The main and distinctive feature of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> PAI (and of the many >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> systems of analytic implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> belonging to its ilk) is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> the rejection of the classically >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> valid principle of Addition, >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> sometimes also referred to as >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Disjunction Introduction. In >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> other words, the principle leading >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> from a formula ϕ to a >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> disjunction of the form ϕ ∨ ψ, >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> where ψ is an arbitrary >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formula. Parry blamed on this >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> principle the derivability >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of the paradoxes of strict >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> implication — given that it is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> famously featured in Lewis’ >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> derivation of an arbitrary >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formula ψ from a contradiction of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> the form ϕ ∧ ¬ϕ. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    He also gets rid of an efficient way >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> to convince people who don't >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> understand much of logic. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    As I recently showed in another post. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> I figured >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> all this out on my own. I didn't even >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> know that >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> anyone else ever did this. I just >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> knew that when >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> trying to find out what is deduced >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> from a set of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> premises that you cannot pop in >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> another sentence >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> from out of nowhere and get a correct >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> conclusion. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    By popping in another sentence from >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> out of nowhere >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> (as it shows above) the principle of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> explosion is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> derived.

    The usual meaning of proof is a >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> sequence of statement where >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> eachstatement either is a premis or >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> follows from one or more earlier >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> statements >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    Except with Disjunction introduction, >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> that is its problem. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    So you're saying that in the following >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> natural language statement: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>

    It is a key issue in that it creates the >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> psychotic break from reality known as the >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Principle of Explosion, otherwise it may >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> make no difference at all. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    Stay on topic or I will block you. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    Explain in detail how the below which you >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> dishonestly trimmed is off- topic. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>

    The topic is how Disjunction introduction >>>>>>>>>>>>>>>>>>>>>>>>>>>>> enables the
    Principle of Explosion. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>

    Rejected, as you not liking the result >>>>>>>>>>>>>>>>>>>>>>>>>>>> doesn't make it invalid. >>>>>>>>>>>>>>>>>>>>>>>>>>>>
    Through a series of truth preserving >>>>>>>>>>>>>>>>>>>>>>>>>>>> operations, when a contradiction is given as >>>>>>>>>>>>>>>>>>>>>>>>>>>> true, any statement can be proven as true. >>>>>>>>>>>>>>>>>>>>>>>>>>>>
    The principle of explosion is a >>>>>>>>>>>>>>>>>>>>>>>>>>>> demonstration of *why* a formal system whose >>>>>>>>>>>>>>>>>>>>>>>>>>>> axioms lead to a contradiction is useless. >>>>>>>>>>>>>>>>>>>>>>>>>>>>
    The only reason someone would want to get >>>>>>>>>>>>>>>>>>>>>>>>>>>> rid of the principle of explosion is to be >>>>>>>>>>>>>>>>>>>>>>>>>>>> able to use a system that has a contradiction. >>>>>>>>>>>>>>>>>>>>>>>>>>>>

    My reason to get rid of the principle of >>>>>>>>>>>>>>>>>>>>>>>>>>> explosion
    it to get rid of anything and everything that >>>>>>>>>>>>>>>>>>>>>>>>>>> prevents
    infallibly correct reasoning. >>>>>>>>>>>>>>>>>>>>>>>>>>>

    If you get rid of the principle of explosion, >>>>>>>>>>>>>>>>>>>>>>>>>> the law of non- contradiction goes away as it >>>>>>>>>>>>>>>>>>>>>>>>>> looses its basis.


    You keep failing to pay close enough attention. >>>>>>>>>>>>>>>>>>>>>>>>> I only get rid of the POE by getting rid of >>>>>>>>>>>>>>>>>>>>>>>>> Disjunction introduction.

    Which you can't do because it's a truth- >>>>>>>>>>>>>>>>>>>>>>>> preserving operation.

    1) P ∧ ¬P    // Premise
    2) P          // Conjunction elimination >>>>>>>>>>>>>>>>>>>>>>> 3) ¬P        // Conjunction elimination >>>>>>>>>>>>>>>>>>>>>>> 4) P ∨ Q      // Disjunction introduction >>>>>>>>>>>>>>>>>>>>>>> 5) Q          // Disjunctive syllogism >>>>>>>>>>>>>>>>>>>>>>> https://en.wikipedia.org/wiki/
    Principle_of_explosion#Proof

    When you insert English meanings into the >>>>>>>>>>>>>>>>>>>>>>> propositional variables it is as obvious >>>>>>>>>>>>>>>>>>>>>>> as a pie in the fact the DI IS NOT TRUTH PRESERVING. >>>>>>>>>>>>>>>>>>>>>>
    So you're saying that in the following natural >>>>>>>>>>>>>>>>>>>>>> language statement:

    -------------------------------------- >>>>>>>>>>>>>>>>>>>>>> At least one of the following statements is true: >>>>>>>>>>>>>>>>>>>>>> - Earth is the third planet from the sun. >>>>>>>>>>>>>>>>>>>>>> - <X>
    -------------------------------------- >>>>>>>>>>>>>>>>>>>>>>
    Where <X> is any natural language statement, there >>>>>>>>>>>>>>>>>>>>>> exists a statement X such that the condition "At >>>>>>>>>>>>>>>>>>>>>> least one of the following statements is true" is >>>>>>>>>>>>>>>>>>>>>> false.

    Name it.


    That is not Disjunction introduction combined with >>>>>>>>>>>>>>>>>>>>> Disjunctive syllogism, it is bare Disjunction. >>>>>>>>>>>>>>>>>>>>>

    Let me spell it out more explicitly then. >>>>>>>>>>>>>>>>>>>>
    Given that the following natural language statement >>>>>>>>>>>>>>>>>>>> is true:

    -------------------------------------- >>>>>>>>>>>>>>>>>>>> Earth is the third planet from the sun. >>>>>>>>>>>>>>>>>>>> -------------------------------------- >>>>>>>>>>>>>>>>>>>>
    In the following natural language statement: >>>>>>>>>>>>>>>>>>>>
    -------------------------------------- >>>>>>>>>>>>>>>>>>>> At least one of the following statements is true: >>>>>>>>>>>>>>>>>>>> - Earth is the third planet from the sun. >>>>>>>>>>>>>>>>>>>> - <X>
    -------------------------------------- >>>>>>>>>>>>>>>>>>>>
    Where <X> is any natural language statement, does >>>>>>>>>>>>>>>>>>>> there exist a statement X such that the condition >>>>>>>>>>>>>>>>>>>> "At least one of the following statements is true" >>>>>>>>>>>>>>>>>>>> is false?


    Where X is "What time is it?"



    Is the statement "Earth is the third planet from the >>>>>>>>>>>>>>>>>> sun" true?

    We have a type mismatch error.



    The statement you gave isn't a truth-bearing statement, >>>>>>>>>>>>>>>> so it can't be used in logic.  I didn't think I had to >>>>>>>>>>>>>>>> make that explicit.

    However, let's go with it anyway because it still >>>>>>>>>>>>>>>> illustrates the point.

    So I'll ask again:

    Is the statement "Earth is the third planet from the >>>>>>>>>>>>>>>> sun" true?


    On second though, let's back up as that might confuse you. >>>>>>>>>>>>>>>
    Given that <X> is any *truth bearing* natural language >>>>>>>>>>>>>>> statement, does there exist a statement X such that the >>>>>>>>>>>>>>> condition "At least one of the following statements is >>>>>>>>>>>>>>> true" is false?


    Head games will be ignored.
    That you did so well on the other things
    so I will not block you.


    Explain in detail how this is a head game.

    Failure to either answer the above question or explain how >>>>>>>>>>>>> it is a head game in your next reply or within one hour of >>>>>>>>>>>>> you next post in this newsgroup will be taken as your >>>>>>>>>>>>> official, on- the- record admission that Disjunction >>>>>>>>>>>>> introduction is in fact truth preserving and valid, and >>>>>>>>>>>>> therefore so is the Principle of Explosion.


    Let the record show that Peter Olcott made the following >>>>>>>>>>>> post in this newsgroup:

    On 6/28/2026 10:52 PM, olcott wrote:
    Q also can't bake a birthday cake, this does not make >>>>>>>>>>>>  > Q in any way "incomplete" relative to what it was
    defined to do.
    ...

    And more that one hour has passed with no attempt to answer >>>>>>>>>>>> the above question or explain why it is a head game.
    Therefore, as per the above criteria:

    Let The Record Show

    That Peter Olcott

    Has *Officially* Admitted:

    That Disjunction introduction is in fact truth preserving >>>>>>>>>>>> and valid, and therefore so is the Principle of Explosion. >>>>>>>>>>>>


    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for
    Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many >>>>>>>>>>> systems of analytic implication belonging to its ilk) is >>>>>>>>>>>
    the rejection of the classically valid principle of Addition, >>>>>>>>>>> sometimes also referred to as Disjunction Introduction. In >>>>>>>>>>>
    other words, the principle leading from a formula ϕ to a >>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary >>>>>>>>>>> formula. Parry blamed on this principle the derivability >>>>>>>>>>> of the paradoxes of strict implication—given that it is >>>>>>>>>>> famously featured in Lewis’ derivation of an arbitrary >>>>>>>>>>> formula ψ from a contradiction of the form ϕ ∧ ¬ϕ. >>>>>>>>>>>
    https://philarchive.org/archive/SZMASL


    So someone came up with a different system that has different >>>>>>>>>> rules. That has no bearing on existing systems.


    The bearing that it has on existing systems is

    None, as you can't remove a truth-preserving operation.



    that
    it corrects their psychotic break from reality that
    allows one to prove that Donald Trump is the one and
    only Lord and Savior on the basis of a totally irrelevant
    contradiction.

    It follows from a series of truth-preserving operations starting >>>>>>>> with the precondition that a contradiction has been proven, as >>>>>>>> you have admitted above on the record.

    Only people having actual psychosis would conclude
    that "The Moon is made from green cheese" AND
    "The Moon is NOT made from green cheese" SEMANTICALLY
    PROVES that Donald Trump is the one and only Lord
    and Savior Jesus Christ.

    How do you know that somewhere the Moon is made from green cheese and >>>>>> the Moon is not made from green cheese and Donald Trump is not the >>>>>> one
    and only Lord and Savior Jesus Christ?


    Counter-factual

    For logic the distinction between factual and counter-factual is not
    as imortant as the distinction between consistent and contradictory.

    Counter-factual may indicate a psychotic break from reality.

    No, it does not. It is much more common than anything psychotic.
    Besudes, any mention of anything psychotic is off-topic in these
    groups.


    x = "The Moon is made from green cheese"
    y = "Donald Trump is the one and only Lord and Savior Jesus Christ:
    POE concludes (x ∧ ¬x) ⊢ y

    "the principle of explosion is the theorem according to
     which any statement can be proven from a contradiction" https://en.wikipedia.org/wiki/Principle_of_explosion

    Which you agreed on the record is a vaild truth preserving line of
    reasoning (see below):

    On 6/28/2026 11:56 PM, dbush wrote:
    On 6/27/2026 11:34 PM, dbush wrote:
    On 6/27/2026 11:23 PM, olcott wrote:
    On 6/27/2026 9:02 PM, dbush wrote:
    On 6/27/2026 9:53 PM, dbush wrote:
    On 6/27/2026 9:49 PM, olcott wrote:
    On 6/27/2026 8:42 PM, dbush wrote:
    On 6/27/2026 9:40 PM, olcott wrote:
    On 6/27/2026 8:29 PM, dbush wrote:
    Given that the following natural language statement is true:

    --------------------------------------
    Earth is the third planet from the sun.
    --------------------------------------

    In the following natural language statement:

    --------------------------------------
    At least one of the following statements is true:
    - Earth is the third planet from the sun.
    - <X>
    --------------------------------------

    Given that <X> is any *truth bearing* natural language statement,
    does there exist a statement X such that the condition "At least one
    of the following statements is true" is false?


    Head games will be ignored.


    Explain in detail how this is a head game.

    Failure to either answer the above question or explain how it is a
    head game in your next reply or within one hour of you next post in
    this newsgroup will be taken as your official, on-the-record admission
    that Disjunction introduction is in fact truth preserving and valid,
    and therefore so is the Principle of Explosion.


    Let the record show that Peter Olcott made the following post in this newsgroup:

    On 6/28/2026 10:52 PM, olcott wrote:
    Q also can't bake a birthday cake, this does not make
    Q in any way "incomplete" relative to what it was
    defined to do.
    ...

    And more that one hour has passed with no attempt to answer the above question or explain why it is a head game. Therefore, as per the above criteria:

    Let The Record Show

    That Peter Olcott

    Has *Officially* Admitted:

    That Disjunction introduction is in fact truth preserving and valid, and therefore so is the Principle of Explosion.


    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to sci.logic,sci.math,comp.theory,comp.ai.philosophy on Fri Jul 3 11:17:10 2026
    From Newsgroup: comp.ai.philosophy

    On 02/07/2026 17:37, olcott wrote:
    On 7/2/2026 1:21 AM, Mikko wrote:
    On 01/07/2026 18:01, olcott wrote:
    On 7/1/2026 1:46 AM, Mikko wrote:
    On 30/06/2026 17:37, olcott wrote:
    On 6/30/2026 3:48 AM, Mikko wrote:
    On 29/06/2026 17:00, olcott wrote:
    On 6/29/2026 8:23 AM, dbush wrote:
    On 6/29/2026 9:17 AM, polcott wrote:
    On 6/29/2026 7:08 AM, dbush wrote:
    On 6/29/2026 12:13 AM, olcott wrote:
    On 6/28/2026 10:56 PM, dbush wrote:
    On 6/27/2026 11:34 PM, dbush wrote:
    On 6/27/2026 11:23 PM, olcott wrote:
    On 6/27/2026 9:02 PM, dbush wrote:
    On 6/27/2026 9:53 PM, dbush wrote:
    On 6/27/2026 9:49 PM, olcott wrote:
    On 6/27/2026 8:42 PM, dbush wrote:
    On 6/27/2026 9:40 PM, olcott wrote:
    On 6/27/2026 8:29 PM, dbush wrote:
    On 6/27/2026 9:24 PM, olcott wrote:
    On 6/27/2026 8:08 PM, dbush wrote:
    On 6/27/2026 7:56 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 6:30 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 7:22 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 5:52 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 6:40 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 1:34 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:29 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 1:24 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:03 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 12:54 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 11:11 AM, polcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:08 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 26/06/2026 15:49, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/26/2026 1:49 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 26/06/2026 04:32, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> William T. Parry, Entailment Logics >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> gets rid of Disjunction introduction >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> to prevent the principle of explosion >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    A simple logical matrix and sequent >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> calculus for >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Parry’s logic of Analytic Implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    The main and distinctive feature of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> PAI (and of the many >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> systems of analytic implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> belonging to its ilk) is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> the rejection of the classically >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> valid principle of Addition, >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> sometimes also referred to as >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Disjunction Introduction. In >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> other words, the principle leading >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> from a formula ϕ to a >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> disjunction of the form ϕ ∨ ψ, >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> where ψ is an arbitrary >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formula. Parry blamed on this >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> principle the derivability >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of the paradoxes of strict >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> implication — given that it is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> famously featured in Lewis’ >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> derivation of an arbitrary >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formula ψ from a contradiction of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> the form ϕ ∧ ¬ϕ. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    He also gets rid of an efficient way >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> to convince people who don't >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> understand much of logic. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    As I recently showed in another post. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> I figured >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> all this out on my own. I didn't even >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> know that >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> anyone else ever did this. I just >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> knew that when >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> trying to find out what is deduced >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> from a set of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> premises that you cannot pop in >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> another sentence >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> from out of nowhere and get a correct >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> conclusion. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    By popping in another sentence from >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> out of nowhere >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> (as it shows above) the principle of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> explosion is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> derived.

    The usual meaning of proof is a >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> sequence of statement where >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> eachstatement either is a premis or >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> follows from one or more earlier >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> statements >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    Except with Disjunction introduction, >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> that is its problem. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    So you're saying that in the following >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> natural language statement: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>

    It is a key issue in that it creates the >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> psychotic break from reality known as the >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Principle of Explosion, otherwise it may >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> make no difference at all. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    Stay on topic or I will block you. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    Explain in detail how the below which you >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> dishonestly trimmed is off- topic. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>

    The topic is how Disjunction introduction >>>>>>>>>>>>>>>>>>>>>>>>>>>>> enables the
    Principle of Explosion. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>

    Rejected, as you not liking the result >>>>>>>>>>>>>>>>>>>>>>>>>>>> doesn't make it invalid. >>>>>>>>>>>>>>>>>>>>>>>>>>>>
    Through a series of truth preserving >>>>>>>>>>>>>>>>>>>>>>>>>>>> operations, when a contradiction is given as >>>>>>>>>>>>>>>>>>>>>>>>>>>> true, any statement can be proven as true. >>>>>>>>>>>>>>>>>>>>>>>>>>>>
    The principle of explosion is a >>>>>>>>>>>>>>>>>>>>>>>>>>>> demonstration of *why* a formal system whose >>>>>>>>>>>>>>>>>>>>>>>>>>>> axioms lead to a contradiction is useless. >>>>>>>>>>>>>>>>>>>>>>>>>>>>
    The only reason someone would want to get >>>>>>>>>>>>>>>>>>>>>>>>>>>> rid of the principle of explosion is to be >>>>>>>>>>>>>>>>>>>>>>>>>>>> able to use a system that has a contradiction. >>>>>>>>>>>>>>>>>>>>>>>>>>>>

    My reason to get rid of the principle of >>>>>>>>>>>>>>>>>>>>>>>>>>> explosion
    it to get rid of anything and everything that >>>>>>>>>>>>>>>>>>>>>>>>>>> prevents
    infallibly correct reasoning. >>>>>>>>>>>>>>>>>>>>>>>>>>>

    If you get rid of the principle of explosion, >>>>>>>>>>>>>>>>>>>>>>>>>> the law of non- contradiction goes away as it >>>>>>>>>>>>>>>>>>>>>>>>>> looses its basis.


    You keep failing to pay close enough attention. >>>>>>>>>>>>>>>>>>>>>>>>> I only get rid of the POE by getting rid of >>>>>>>>>>>>>>>>>>>>>>>>> Disjunction introduction.

    Which you can't do because it's a truth- >>>>>>>>>>>>>>>>>>>>>>>> preserving operation.

    1) P ∧ ¬P    // Premise
    2) P          // Conjunction elimination >>>>>>>>>>>>>>>>>>>>>>> 3) ¬P        // Conjunction elimination >>>>>>>>>>>>>>>>>>>>>>> 4) P ∨ Q      // Disjunction introduction >>>>>>>>>>>>>>>>>>>>>>> 5) Q          // Disjunctive syllogism >>>>>>>>>>>>>>>>>>>>>>> https://en.wikipedia.org/wiki/
    Principle_of_explosion#Proof

    When you insert English meanings into the >>>>>>>>>>>>>>>>>>>>>>> propositional variables it is as obvious >>>>>>>>>>>>>>>>>>>>>>> as a pie in the fact the DI IS NOT TRUTH PRESERVING. >>>>>>>>>>>>>>>>>>>>>>
    So you're saying that in the following natural >>>>>>>>>>>>>>>>>>>>>> language statement:

    -------------------------------------- >>>>>>>>>>>>>>>>>>>>>> At least one of the following statements is true: >>>>>>>>>>>>>>>>>>>>>> - Earth is the third planet from the sun. >>>>>>>>>>>>>>>>>>>>>> - <X>
    -------------------------------------- >>>>>>>>>>>>>>>>>>>>>>
    Where <X> is any natural language statement, there >>>>>>>>>>>>>>>>>>>>>> exists a statement X such that the condition "At >>>>>>>>>>>>>>>>>>>>>> least one of the following statements is true" is >>>>>>>>>>>>>>>>>>>>>> false.

    Name it.


    That is not Disjunction introduction combined with >>>>>>>>>>>>>>>>>>>>> Disjunctive syllogism, it is bare Disjunction. >>>>>>>>>>>>>>>>>>>>>

    Let me spell it out more explicitly then. >>>>>>>>>>>>>>>>>>>>
    Given that the following natural language statement >>>>>>>>>>>>>>>>>>>> is true:

    -------------------------------------- >>>>>>>>>>>>>>>>>>>> Earth is the third planet from the sun. >>>>>>>>>>>>>>>>>>>> -------------------------------------- >>>>>>>>>>>>>>>>>>>>
    In the following natural language statement: >>>>>>>>>>>>>>>>>>>>
    -------------------------------------- >>>>>>>>>>>>>>>>>>>> At least one of the following statements is true: >>>>>>>>>>>>>>>>>>>> - Earth is the third planet from the sun. >>>>>>>>>>>>>>>>>>>> - <X>
    -------------------------------------- >>>>>>>>>>>>>>>>>>>>
    Where <X> is any natural language statement, does >>>>>>>>>>>>>>>>>>>> there exist a statement X such that the condition >>>>>>>>>>>>>>>>>>>> "At least one of the following statements is true" >>>>>>>>>>>>>>>>>>>> is false?


    Where X is "What time is it?"



    Is the statement "Earth is the third planet from the >>>>>>>>>>>>>>>>>> sun" true?

    We have a type mismatch error.



    The statement you gave isn't a truth-bearing statement, >>>>>>>>>>>>>>>> so it can't be used in logic.  I didn't think I had to >>>>>>>>>>>>>>>> make that explicit.

    However, let's go with it anyway because it still >>>>>>>>>>>>>>>> illustrates the point.

    So I'll ask again:

    Is the statement "Earth is the third planet from the >>>>>>>>>>>>>>>> sun" true?


    On second though, let's back up as that might confuse you. >>>>>>>>>>>>>>>
    Given that <X> is any *truth bearing* natural language >>>>>>>>>>>>>>> statement, does there exist a statement X such that the >>>>>>>>>>>>>>> condition "At least one of the following statements is >>>>>>>>>>>>>>> true" is false?


    Head games will be ignored.
    That you did so well on the other things
    so I will not block you.


    Explain in detail how this is a head game.

    Failure to either answer the above question or explain how >>>>>>>>>>>>> it is a head game in your next reply or within one hour of >>>>>>>>>>>>> you next post in this newsgroup will be taken as your >>>>>>>>>>>>> official, on- the- record admission that Disjunction >>>>>>>>>>>>> introduction is in fact truth preserving and valid, and >>>>>>>>>>>>> therefore so is the Principle of Explosion.


    Let the record show that Peter Olcott made the following >>>>>>>>>>>> post in this newsgroup:

    On 6/28/2026 10:52 PM, olcott wrote:
    Q also can't bake a birthday cake, this does not make >>>>>>>>>>>>  > Q in any way "incomplete" relative to what it was
    defined to do.
    ...

    And more that one hour has passed with no attempt to answer >>>>>>>>>>>> the above question or explain why it is a head game.
    Therefore, as per the above criteria:

    Let The Record Show

    That Peter Olcott

    Has *Officially* Admitted:

    That Disjunction introduction is in fact truth preserving >>>>>>>>>>>> and valid, and therefore so is the Principle of Explosion. >>>>>>>>>>>>


    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for
    Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many >>>>>>>>>>> systems of analytic implication belonging to its ilk) is >>>>>>>>>>>
    the rejection of the classically valid principle of Addition, >>>>>>>>>>> sometimes also referred to as Disjunction Introduction. In >>>>>>>>>>>
    other words, the principle leading from a formula ϕ to a >>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary >>>>>>>>>>> formula. Parry blamed on this principle the derivability >>>>>>>>>>> of the paradoxes of strict implication—given that it is >>>>>>>>>>> famously featured in Lewis’ derivation of an arbitrary >>>>>>>>>>> formula ψ from a contradiction of the form ϕ ∧ ¬ϕ. >>>>>>>>>>>
    https://philarchive.org/archive/SZMASL


    So someone came up with a different system that has different >>>>>>>>>> rules. That has no bearing on existing systems.


    The bearing that it has on existing systems is

    None, as you can't remove a truth-preserving operation.



    that
    it corrects their psychotic break from reality that
    allows one to prove that Donald Trump is the one and
    only Lord and Savior on the basis of a totally irrelevant
    contradiction.

    It follows from a series of truth-preserving operations starting >>>>>>>> with the precondition that a contradiction has been proven, as >>>>>>>> you have admitted above on the record.

    Only people having actual psychosis would conclude
    that "The Moon is made from green cheese" AND
    "The Moon is NOT made from green cheese" SEMANTICALLY
    PROVES that Donald Trump is the one and only Lord
    and Savior Jesus Christ.

    How do you know that somewhere the Moon is made from green cheese and >>>>>> the Moon is not made from green cheese and Donald Trump is not the >>>>>> one
    and only Lord and Savior Jesus Christ?


    Counter-factual

    For logic the distinction between factual and counter-factual is not
    as imortant as the distinction between consistent and contradictory.

    Counter-factual may indicate a psychotic break from reality.

    No, it does not. It is much more common than anything psychotic.
    Besudes, any mention of anything psychotic is off-topic in these
    groups.

    x = "The Moon is made from green cheese"
    y = "Donald Trump is the one and only Lord and Savior Jesus Christ:
    POE concludes (x ∧ ¬x) ⊢ y

    "the principle of explosion is the theorem according to
     which any statement can be proven from a contradiction" https://en.wikipedia.org/wiki/Principle_of_explosion

    When you pay attention to the meaning of the words
    and correctly apply correct semantic entailment on
    the basis of the meaning of those words then the
    principle of explosion is a PSYCHOTIC BREAK FROM REALITY.

    No, it is not. The premise x above is a break from reality. But that
    is not in logic, it was introduced by you. Even without the principle
    of explosion it is possible to infer a false conclusion from a false
    premise. The principle of explosion merely facilitates tinding a
    conclusion that is so obviously false that it convincingly proves
    that the remise is false. But false is false even if the proof is
    something less obvious.
    --
    Mikko
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to sci.logic,sci.math,comp.theory,comp.ai.philosophy on Fri Jul 3 11:22:14 2026
    From Newsgroup: comp.ai.philosophy

    On 02/07/2026 17:40, olcott wrote:
    On 7/2/2026 1:29 AM, Mikko wrote:
    On 01/07/2026 18:06, olcott wrote:
    On 7/1/2026 1:53 AM, Mikko wrote:
    On 30/06/2026 16:55, olcott wrote:
    On 6/30/2026 3:10 AM, Mikko wrote:
    On 29/06/2026 16:55, olcott wrote:
    On 6/28/2026 4:32 AM, Mikko wrote:
    On 27/06/2026 21:29, olcott wrote:
    On 6/27/2026 1:24 PM, dbush wrote:
    On 6/27/2026 2:03 PM, olcott wrote:
    On 6/27/2026 12:54 PM, dbush wrote:
    On 6/27/2026 11:11 AM, polcott wrote:
    On 6/27/2026 2:08 AM, Mikko wrote:
    On 26/06/2026 15:49, olcott wrote:
    On 6/26/2026 1:49 AM, Mikko wrote:
    On 26/06/2026 04:32, olcott wrote:
    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for >>>>>>>>>>>>>>>>> Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many >>>>>>>>>>>>>>>>> systems of analytic implication belonging to its ilk) is >>>>>>>>>>>>>>>>> the rejection of the classically valid principle of >>>>>>>>>>>>>>>>> Addition,
    sometimes also referred to as Disjunction Introduction. In >>>>>>>>>>>>>>>>> other words, the principle leading from a formula ϕ to a >>>>>>>>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary >>>>>>>>>>>>>>>>> formula. Parry blamed on this principle the derivability >>>>>>>>>>>>>>>>> of the paradoxes of strict implication—given that it is >>>>>>>>>>>>>>>>> famously featured in Lewis’ derivation of an arbitrary >>>>>>>>>>>>>>>>> formula ψ from a contradiction of the form ϕ ∧ ¬ϕ. >>>>>>>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL

    He also gets rid of an efficient way to convince people >>>>>>>>>>>>>>>> who don't
    understand much of logic.

    As I recently showed in another post. I figured
    all this out on my own. I didn't even know that
    anyone else ever did this. I just knew that when >>>>>>>>>>>>>>> trying to find out what is deduced from a set of >>>>>>>>>>>>>>> premises that you cannot pop in another sentence >>>>>>>>>>>>>>> from out of nowhere and get a correct conclusion. >>>>>>>>>>>>>>>
    By popping in another sentence from out of nowhere >>>>>>>>>>>>>>> (as it shows above) the principle of explosion is >>>>>>>>>>>>>>> derived.

    The usual meaning of proof is a sequence of statement >>>>>>>>>>>>>> where eachstatement either is a premis or follows from one >>>>>>>>>>>>>> or more earlier
    statements

    Except with Disjunction introduction, that is its problem. >>>>>>>>>>>>
    So you're saying that in the following natural language >>>>>>>>>>>> statement:


    It is a key issue in that it creates the
    psychotic break from reality known as the
    Principle of Explosion, otherwise it may
    make no difference at all.

    Stay on topic or I will block you.

    Explain in detail how the below which you dishonestly trimmed >>>>>>>>>> is off- topic.


    The topic is how Disjunction introduction enables the
    Principle of Explosion.

    It does not. In any sensible logic every tautology is provable. >>>>>>>> Then the principle of explosion follows.

    POE is unprovable in both of these more sensible systems
    of logic.

    THe expression "these system" above does not denote.


    Parry’s logic of Analytic Implication

    Relevance Logic
    https://plato.stanford.edu/entries/logic-relevance/

    The POE is an actual psychotic break from
    reality when one pays full and complete attention to
    the underlying semantics and does not stupidly take
    semantics out of logic and put it in a separate model.

    No, it is not. The principle of explosion is about consequencies
    of a false premise, which already is a break from reality even
    when no consequence is inferred.

    Only because semantics is ignored.

    A break from reality is a break from reality, no matter whether
    the semantics is ignored or considered. Though if there is no
    semantics, even any ignored one, there is no connection to
    reality to break.


    Ignoring semantics is always a break from reality.

    So is any semantics other than real world semantics.

    Hypotheticals are useful for making decisions.

    Which is an example of the usefulness of a break from reality. It
    als shows that calling a break from reality "psychotic" without
    further consideration.
    --
    Mikko

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to sci.logic,sci.math,comp.theory,comp.ai.philosophy on Fri Jul 3 11:24:20 2026
    From Newsgroup: comp.ai.philosophy

    On 02/07/2026 17:40, olcott wrote:
    On 7/2/2026 1:31 AM, Mikko wrote:
    On 01/07/2026 18:25, olcott wrote:
    On 7/1/2026 2:32 AM, Mikko wrote:
    On 30/06/2026 16:55, olcott wrote:
    On 6/30/2026 3:10 AM, Mikko wrote:
    On 29/06/2026 16:55, olcott wrote:
    On 6/28/2026 4:32 AM, Mikko wrote:
    On 27/06/2026 21:29, olcott wrote:
    On 6/27/2026 1:24 PM, dbush wrote:
    On 6/27/2026 2:03 PM, olcott wrote:
    On 6/27/2026 12:54 PM, dbush wrote:
    On 6/27/2026 11:11 AM, polcott wrote:
    On 6/27/2026 2:08 AM, Mikko wrote:
    On 26/06/2026 15:49, olcott wrote:
    On 6/26/2026 1:49 AM, Mikko wrote:
    On 26/06/2026 04:32, olcott wrote:
    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for >>>>>>>>>>>>>>>>> Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many >>>>>>>>>>>>>>>>> systems of analytic implication belonging to its ilk) is >>>>>>>>>>>>>>>>> the rejection of the classically valid principle of >>>>>>>>>>>>>>>>> Addition,
    sometimes also referred to as Disjunction Introduction. In >>>>>>>>>>>>>>>>> other words, the principle leading from a formula ϕ to a >>>>>>>>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary >>>>>>>>>>>>>>>>> formula. Parry blamed on this principle the derivability >>>>>>>>>>>>>>>>> of the paradoxes of strict implication—given that it is >>>>>>>>>>>>>>>>> famously featured in Lewis’ derivation of an arbitrary >>>>>>>>>>>>>>>>> formula ψ from a contradiction of the form ϕ ∧ ¬ϕ. >>>>>>>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL

    He also gets rid of an efficient way to convince people >>>>>>>>>>>>>>>> who don't
    understand much of logic.

    As I recently showed in another post. I figured
    all this out on my own. I didn't even know that
    anyone else ever did this. I just knew that when >>>>>>>>>>>>>>> trying to find out what is deduced from a set of >>>>>>>>>>>>>>> premises that you cannot pop in another sentence >>>>>>>>>>>>>>> from out of nowhere and get a correct conclusion. >>>>>>>>>>>>>>>
    By popping in another sentence from out of nowhere >>>>>>>>>>>>>>> (as it shows above) the principle of explosion is >>>>>>>>>>>>>>> derived.

    The usual meaning of proof is a sequence of statement >>>>>>>>>>>>>> where eachstatement either is a premis or follows from one >>>>>>>>>>>>>> or more earlier
    statements

    Except with Disjunction introduction, that is its problem. >>>>>>>>>>>>
    So you're saying that in the following natural language >>>>>>>>>>>> statement:


    It is a key issue in that it creates the
    psychotic break from reality known as the
    Principle of Explosion, otherwise it may
    make no difference at all.

    Stay on topic or I will block you.

    Explain in detail how the below which you dishonestly trimmed >>>>>>>>>> is off- topic.


    The topic is how Disjunction introduction enables the
    Principle of Explosion.

    It does not. In any sensible logic every tautology is provable. >>>>>>>> Then the principle of explosion follows.

    POE is unprovable in both of these more sensible systems
    of logic.

    THe expression "these system" above does not denote.

    Parry’s logic of Analytic Implication

    If the intent was to include that in the denotation you failed
    to say something important.

    Parry’s logic of Analytic Implication
    and Relevance logic are two sensible systems
    that get rid of the Principle of Explosion.

    Getting rid of the principle of explosion makes as much sense as
    getting rid of fire alarms. It makes much more sense to get rid
    of fires and false premises.

    Then you are irrational

    Matter of opinion, but I think that most of people would consder
    getting rid of fires is more rational that getting rid of fire
    alarms.
    --
    Mikko

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,sci.math,comp.ai.philosophy on Fri Jul 3 09:46:43 2026
    From Newsgroup: comp.ai.philosophy

    On 7/3/2026 3:17 AM, Mikko wrote:
    On 02/07/2026 17:37, olcott wrote:

    x = "The Moon is made from green cheese"
    y = "Donald Trump is the one and only Lord and Savior Jesus Christ:
    POE concludes (x ∧ ¬x) ⊢ y

    "the principle of explosion is the theorem according to
      which any statement can be proven from a contradiction"
    https://en.wikipedia.org/wiki/Principle_of_explosion

    When you pay attention to the meaning of the words
    and correctly apply correct semantic entailment on
    the basis of the meaning of those words then the
    principle of explosion is a PSYCHOTIC BREAK FROM REALITY.

    No, it is not. The premise x above is a break from reality. But that
    is not in logic, it was introduced by you. Even without the principle
    of explosion it is possible to infer a false conclusion from a false
    premise.

    Yes. From "I am 35 feet tall" ⊢ "I am 35 feet tall"
    and as you said my premise is literally FALSE
    (P ∧ ~P) ⊢ FALSE

    The principle of explosion merely facilitates tinding a
    conclusion that is so obviously false that it convincingly proves
    that the remise is false.

    There is nothing semantically relevant that can be
    proven from a contradiction besides bare FALSE and
    bare FALSE only entails bare FALSE.

    But false is false even if the proof is
    something less obvious.

    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,sci.logic,comp.ai.philosophy on Fri Jul 3 09:50:26 2026
    From Newsgroup: comp.ai.philosophy

    On 7/3/2026 3:22 AM, Mikko wrote:
    On 02/07/2026 17:40, olcott wrote:
    On 7/2/2026 1:29 AM, Mikko wrote:
    On 01/07/2026 18:06, olcott wrote:
    On 7/1/2026 1:53 AM, Mikko wrote:
    On 30/06/2026 16:55, olcott wrote:
    On 6/30/2026 3:10 AM, Mikko wrote:
    On 29/06/2026 16:55, olcott wrote:
    On 6/28/2026 4:32 AM, Mikko wrote:
    On 27/06/2026 21:29, olcott wrote:
    On 6/27/2026 1:24 PM, dbush wrote:
    On 6/27/2026 2:03 PM, olcott wrote:
    On 6/27/2026 12:54 PM, dbush wrote:
    On 6/27/2026 11:11 AM, polcott wrote:
    On 6/27/2026 2:08 AM, Mikko wrote:
    On 26/06/2026 15:49, olcott wrote:
    On 6/26/2026 1:49 AM, Mikko wrote:
    On 26/06/2026 04:32, olcott wrote:
    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for >>>>>>>>>>>>>>>>>> Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many >>>>>>>>>>>>>>>>>> systems of analytic implication belonging to its ilk) is >>>>>>>>>>>>>>>>>> the rejection of the classically valid principle of >>>>>>>>>>>>>>>>>> Addition,
    sometimes also referred to as Disjunction >>>>>>>>>>>>>>>>>> Introduction. In
    other words, the principle leading from a formula ϕ to a >>>>>>>>>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary >>>>>>>>>>>>>>>>>> formula. Parry blamed on this principle the derivability >>>>>>>>>>>>>>>>>> of the paradoxes of strict implication—given that it is >>>>>>>>>>>>>>>>>> famously featured in Lewis’ derivation of an arbitrary >>>>>>>>>>>>>>>>>> formula ψ from a contradiction of the form ϕ ∧ ¬ϕ. >>>>>>>>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL

    He also gets rid of an efficient way to convince people >>>>>>>>>>>>>>>>> who don't
    understand much of logic.

    As I recently showed in another post. I figured >>>>>>>>>>>>>>>> all this out on my own. I didn't even know that >>>>>>>>>>>>>>>> anyone else ever did this. I just knew that when >>>>>>>>>>>>>>>> trying to find out what is deduced from a set of >>>>>>>>>>>>>>>> premises that you cannot pop in another sentence >>>>>>>>>>>>>>>> from out of nowhere and get a correct conclusion. >>>>>>>>>>>>>>>>
    By popping in another sentence from out of nowhere >>>>>>>>>>>>>>>> (as it shows above) the principle of explosion is >>>>>>>>>>>>>>>> derived.

    The usual meaning of proof is a sequence of statement >>>>>>>>>>>>>>> where eachstatement either is a premis or follows from >>>>>>>>>>>>>>> one or more earlier
    statements

    Except with Disjunction introduction, that is its problem. >>>>>>>>>>>>>
    So you're saying that in the following natural language >>>>>>>>>>>>> statement:


    It is a key issue in that it creates the
    psychotic break from reality known as the
    Principle of Explosion, otherwise it may
    make no difference at all.

    Stay on topic or I will block you.

    Explain in detail how the below which you dishonestly trimmed >>>>>>>>>>> is off- topic.


    The topic is how Disjunction introduction enables the
    Principle of Explosion.

    It does not. In any sensible logic every tautology is provable. >>>>>>>>> Then the principle of explosion follows.

    POE is unprovable in both of these more sensible systems
    of logic.

    THe expression "these system" above does not denote.


    Parry’s logic of Analytic Implication

    Relevance Logic
    https://plato.stanford.edu/entries/logic-relevance/

    The POE is an actual psychotic break from
    reality when one pays full and complete attention to
    the underlying semantics and does not stupidly take
    semantics out of logic and put it in a separate model.

    No, it is not. The principle of explosion is about consequencies >>>>>>> of a false premise, which already is a break from reality even
    when no consequence is inferred.

    Only because semantics is ignored.

    A break from reality is a break from reality, no matter whether
    the semantics is ignored or considered. Though if there is no
    semantics, even any ignored one, there is no connection to
    reality to break.


    Ignoring semantics is always a break from reality.

    So is any semantics other than real world semantics.

    Hypotheticals are useful for making decisions.

    Which is an example of the usefulness of a break from reality. It
    als shows that calling a break from reality "psychotic" without
    further consideration.


    That Donald Trump might start WW III is a hypothetical
    that can possibly be is useful. That Donald Trump is
    the one and only Lord and Savior Jesus Christ is a
    hypothetical that cannot possible be making it useless.
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,sci.math,comp.ai.philosophy on Fri Jul 3 10:04:51 2026
    From Newsgroup: comp.ai.philosophy

    On 7/3/2026 3:24 AM, Mikko wrote:
    On 02/07/2026 17:40, olcott wrote:
    On 7/2/2026 1:31 AM, Mikko wrote:

    Getting rid of the principle of explosion makes as much sense as
    getting rid of fire alarms. It makes much more sense to get rid
    of fires and false premises.

    Then you are irrational

    Matter of opinion,

    Matter of correctly and coherently computing the notion
    of truth. My correction to the Principle of Explosion:
    (P ∧ ~P) ⊢ FALSE
    FALSE ⊢ FALSE

    but I think that most of people would consder
    getting rid of fires is more rational that getting rid of fire
    alarms.


    It is not a fire alarm it is getting rid of semantics
    within inference. My correct reasoning correction to
    logic gets rid of every type of inference besides
    semantic entailment.

    Validity and Soundness
    A deductive argument is said to be valid if
    and only if it takes a form that makes it
    impossible for the premises to be true and
    the conclusion nevertheless to be false.
    Otherwise, a deductive argument is said to
    be invalid. https://iep.utm.edu/val-snd/

    *That big mistake is corrected thusly*
    A deductive argument is said to be valid if
    and only if its conclusion is a necessary
    consequence of all of its premises Otherwise,
    a deductive argument is said to be invalid.

    P ⇒ Q
    P → Q
    P ⊃ Q

    are all abolished and replaced with the binary
    form of logical necessity: P □ Q
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to sci.logic,comp.theory,sci.math,comp.ai.philosophy on Sat Jul 4 09:37:45 2026
    From Newsgroup: comp.ai.philosophy

    On 03/07/2026 17:46, olcott wrote:
    On 7/3/2026 3:17 AM, Mikko wrote:
    On 02/07/2026 17:37, olcott wrote:

    x = "The Moon is made from green cheese"
    y = "Donald Trump is the one and only Lord and Savior Jesus Christ:
    POE concludes (x ∧ ¬x) ⊢ y

    "the principle of explosion is the theorem according to
      which any statement can be proven from a contradiction"
    https://en.wikipedia.org/wiki/Principle_of_explosion

    When you pay attention to the meaning of the words
    and correctly apply correct semantic entailment on
    the basis of the meaning of those words then the
    principle of explosion is a PSYCHOTIC BREAK FROM REALITY.

    No, it is not. The premise x above is a break from reality. But that
    is not in logic, it was introduced by you. Even without the principle
    of explosion it is possible to infer a false conclusion from a false
    premise.

    Yes. From "I am 35 feet tall" ⊢ "I am 35 feet tall"
    and as you said my premise is literally FALSE
    (P ∧ ~P) ⊢ FALSE

    The principle of explosion merely facilitates tinding a
    conclusion that is so obviously false that it convincingly proves
    that the remise is false.

    There is nothing semantically relevant that can be
    proven from a contradiction besides bare FALSE and
    bare FALSE only entails bare FALSE.

    Yes, there is. From the contradiction "I have blue eyes and
    I don't have blue eyes" one can prove "I have blue eyes" and
    "I don't have blue eyes", both of which are semantically
    relevant, and one of which in addition is false.
    --
    Mikko
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to sci.logic,comp.theory,sci.math,comp.ai.philosophy on Sat Jul 4 09:47:28 2026
    From Newsgroup: comp.ai.philosophy

    On 03/07/2026 18:04, olcott wrote:
    On 7/3/2026 3:24 AM, Mikko wrote:
    On 02/07/2026 17:40, olcott wrote:
    On 7/2/2026 1:31 AM, Mikko wrote:

    Getting rid of the principle of explosion makes as much sense as
    getting rid of fire alarms. It makes much more sense to get rid
    of fires and false premises.

    Then you are irrational

    Matter of opinion,

    Matter of correctly and coherently computing the notion
    of truth. My correction to the Principle of Explosion:
    (P ∧ ~P) ⊢ FALSE
    FALSE ⊢ FALSE

    but I think that most of people would consder
    getting rid of fires is more rational that getting rid of fire
    alarms.

    It is not a fire alarm it is getting rid of semantics
    within inference. My correct reasoning correction to
    logic gets rid of every type of inference besides
    semantic entailment.

    Getting rid of any type of inference does not make much difference
    as long as you get the same conclusions through other inferences.
    Only getting rid of some conscusions it makes a significant
    difference. But you have never shown an example of getting rid of
    a conclusion without losing a semantic entailment.

    Validity and Soundness
    A deductive argument is said to be valid if
    and only if it takes a form that makes it
    impossible for the premises to be true and
    the conclusion nevertheless to be false.
    Otherwise, a deductive argument is said to
    be invalid. https://iep.utm.edu/val-snd/

    *That big mistake is corrected thusly*
    A deductive argument is said to be valid if
    and only if its conclusion is a necessary
    consequence of all of its premises Otherwise,
    a deductive argument is said to be invalid.

    P ⇒ Q
    P → Q
    P ⊃ Q

    are all abolished and replaced with the binary
    form of logical necessity: P □ Q

    You don't need any of above if you have ¬, ∨, and ∧.
    --
    Mikko

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to sci.logic,comp.theory,sci.logic,comp.ai.philosophy on Sat Jul 4 11:15:00 2026
    From Newsgroup: comp.ai.philosophy

    On 03/07/2026 17:50, olcott wrote:
    On 7/3/2026 3:22 AM, Mikko wrote:
    On 02/07/2026 17:40, olcott wrote:
    On 7/2/2026 1:29 AM, Mikko wrote:
    On 01/07/2026 18:06, olcott wrote:
    On 7/1/2026 1:53 AM, Mikko wrote:
    On 30/06/2026 16:55, olcott wrote:
    On 6/30/2026 3:10 AM, Mikko wrote:
    On 29/06/2026 16:55, olcott wrote:
    On 6/28/2026 4:32 AM, Mikko wrote:
    On 27/06/2026 21:29, olcott wrote:
    On 6/27/2026 1:24 PM, dbush wrote:
    On 6/27/2026 2:03 PM, olcott wrote:
    On 6/27/2026 12:54 PM, dbush wrote:
    On 6/27/2026 11:11 AM, polcott wrote:
    On 6/27/2026 2:08 AM, Mikko wrote:
    On 26/06/2026 15:49, olcott wrote:
    On 6/26/2026 1:49 AM, Mikko wrote:
    On 26/06/2026 04:32, olcott wrote:
    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for >>>>>>>>>>>>>>>>>>> Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many >>>>>>>>>>>>>>>>>>> systems of analytic implication belonging to its ilk) is >>>>>>>>>>>>>>>>>>> the rejection of the classically valid principle of >>>>>>>>>>>>>>>>>>> Addition,
    sometimes also referred to as Disjunction >>>>>>>>>>>>>>>>>>> Introduction. In
    other words, the principle leading from a formula ϕ to a >>>>>>>>>>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary >>>>>>>>>>>>>>>>>>> formula. Parry blamed on this principle the derivability >>>>>>>>>>>>>>>>>>> of the paradoxes of strict implication—given that it is >>>>>>>>>>>>>>>>>>> famously featured in Lewis’ derivation of an arbitrary >>>>>>>>>>>>>>>>>>> formula ψ from a contradiction of the form ϕ ∧ ¬ϕ. >>>>>>>>>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL

    He also gets rid of an efficient way to convince >>>>>>>>>>>>>>>>>> people who don't
    understand much of logic.

    As I recently showed in another post. I figured >>>>>>>>>>>>>>>>> all this out on my own. I didn't even know that >>>>>>>>>>>>>>>>> anyone else ever did this. I just knew that when >>>>>>>>>>>>>>>>> trying to find out what is deduced from a set of >>>>>>>>>>>>>>>>> premises that you cannot pop in another sentence >>>>>>>>>>>>>>>>> from out of nowhere and get a correct conclusion. >>>>>>>>>>>>>>>>>
    By popping in another sentence from out of nowhere >>>>>>>>>>>>>>>>> (as it shows above) the principle of explosion is >>>>>>>>>>>>>>>>> derived.

    The usual meaning of proof is a sequence of statement >>>>>>>>>>>>>>>> where eachstatement either is a premis or follows from >>>>>>>>>>>>>>>> one or more earlier
    statements

    Except with Disjunction introduction, that is its problem. >>>>>>>>>>>>>>
    So you're saying that in the following natural language >>>>>>>>>>>>>> statement:


    It is a key issue in that it creates the
    psychotic break from reality known as the
    Principle of Explosion, otherwise it may
    make no difference at all.

    Stay on topic or I will block you.

    Explain in detail how the below which you dishonestly >>>>>>>>>>>> trimmed is off- topic.


    The topic is how Disjunction introduction enables the
    Principle of Explosion.

    It does not. In any sensible logic every tautology is provable. >>>>>>>>>> Then the principle of explosion follows.

    POE is unprovable in both of these more sensible systems
    of logic.

    THe expression "these system" above does not denote.


    Parry’s logic of Analytic Implication

    Relevance Logic
    https://plato.stanford.edu/entries/logic-relevance/

    The POE is an actual psychotic break from
    reality when one pays full and complete attention to
    the underlying semantics and does not stupidly take
    semantics out of logic and put it in a separate model.

    No, it is not. The principle of explosion is about consequencies >>>>>>>> of a false premise, which already is a break from reality even >>>>>>>> when no consequence is inferred.

    Only because semantics is ignored.

    A break from reality is a break from reality, no matter whether
    the semantics is ignored or considered. Though if there is no
    semantics, even any ignored one, there is no connection to
    reality to break.


    Ignoring semantics is always a break from reality.

    So is any semantics other than real world semantics.

    Hypotheticals are useful for making decisions.

    Which is an example of the usefulness of a break from reality. It
    als shows that calling a break from reality "psychotic" without
    further consideration.

    That Donald Trump might start WW III is a hypothetical
    that can possibly be is useful.

    Whether Donald Trump will start WW III is not yet known, so that
    cannot be called an example of counter-factual.

    That Donald Trump is the one and only Lord and Savior Jesus Christ
    is a hypothetical that cannot possible be making it useless.

    Maybe, but irrelevent as you did not claim it be useful when you
    presented it.
    --
    Mikko

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to sci.logic,comp.theory,sci.math,comp.ai.philosophy on Sat Jul 4 11:16:55 2026
    From Newsgroup: comp.ai.philosophy

    On 03/07/2026 18:04, olcott wrote:
    On 7/3/2026 3:24 AM, Mikko wrote:
    On 02/07/2026 17:40, olcott wrote:
    On 7/2/2026 1:31 AM, Mikko wrote:

    Getting rid of the principle of explosion makes as much sense as
    getting rid of fire alarms. It makes much more sense to get rid
    of fires and false premises.

    Then you are irrational

    Matter of opinion,

    Matter of correctly and coherently computing the notion
    of truth.

    You did not compute correctely, let aloone coherently, whether
    I an irrational. You onlu presented your opinion about it.
    --
    Mikko
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,sci.math,comp.ai.philosophy on Sat Jul 4 08:15:52 2026
    From Newsgroup: comp.ai.philosophy

    On 7/4/2026 1:37 AM, Mikko wrote:
    On 03/07/2026 17:46, olcott wrote:
    On 7/3/2026 3:17 AM, Mikko wrote:
    On 02/07/2026 17:37, olcott wrote:

    x = "The Moon is made from green cheese"
    y = "Donald Trump is the one and only Lord and Savior Jesus Christ:
    POE concludes (x ∧ ¬x) ⊢ y

    "the principle of explosion is the theorem according to
      which any statement can be proven from a contradiction"
    https://en.wikipedia.org/wiki/Principle_of_explosion

    When you pay attention to the meaning of the words
    and correctly apply correct semantic entailment on
    the basis of the meaning of those words then the
    principle of explosion is a PSYCHOTIC BREAK FROM REALITY.

    No, it is not. The premise x above is a break from reality. But that
    is not in logic, it was introduced by you. Even without the principle
    of explosion it is possible to infer a false conclusion from a false
    premise.

    Yes. From "I am 35 feet tall" ⊢ "I am 35 feet tall"
    and as you said my premise is literally FALSE
    (P ∧ ~P) ⊢ FALSE

    The principle of explosion merely facilitates tinding a
    conclusion that is so obviously false that it convincingly proves
    that the remise is false.

    There is nothing semantically relevant that can be
    proven from a contradiction besides bare FALSE and
    bare FALSE only entails bare FALSE.

    Yes, there is. From the contradiction "I have blue eyes and
    I don't have blue eyes" one can prove "I have blue eyes" and
    "I don't have blue eyes", both of which are semantically
    relevant, and one of which in addition is false.


    That is greatly restricted from the POE.
    (P ∧ ~P) ⊢ FALSE // is what can really be proved semantically
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From dbush@dbush.mobile@gmail.com to sci.logic,comp.theory,sci.math,comp.ai.philosophy on Sat Jul 4 09:19:29 2026
    From Newsgroup: comp.ai.philosophy

    On 7/4/2026 9:15 AM, olcott wrote:
    On 7/4/2026 1:37 AM, Mikko wrote:
    On 03/07/2026 17:46, olcott wrote:
    On 7/3/2026 3:17 AM, Mikko wrote:
    On 02/07/2026 17:37, olcott wrote:

    x = "The Moon is made from green cheese"
    y = "Donald Trump is the one and only Lord and Savior Jesus Christ:
    POE concludes (x ∧ ¬x) ⊢ y

    "the principle of explosion is the theorem according to
      which any statement can be proven from a contradiction"
    https://en.wikipedia.org/wiki/Principle_of_explosion

    When you pay attention to the meaning of the words
    and correctly apply correct semantic entailment on
    the basis of the meaning of those words then the
    principle of explosion is a PSYCHOTIC BREAK FROM REALITY.

    No, it is not. The premise x above is a break from reality. But that
    is not in logic, it was introduced by you. Even without the principle
    of explosion it is possible to infer a false conclusion from a false
    premise.

    Yes. From "I am 35 feet tall" ⊢ "I am 35 feet tall"
    and as you said my premise is literally FALSE
    (P ∧ ~P) ⊢ FALSE

    The principle of explosion merely facilitates tinding a
    conclusion that is so obviously false that it convincingly proves
    that the remise is false.

    There is nothing semantically relevant that can be
    proven from a contradiction besides bare FALSE and
    bare FALSE only entails bare FALSE.

    Yes, there is. From the contradiction "I have blue eyes and
    I don't have blue eyes" one can prove "I have blue eyes" and
    "I don't have blue eyes", both of which are semantically
    relevant, and one of which in addition is false.


    That is greatly restricted from the POE.
     (P ∧ ~P) ⊢ FALSE // is what can really be proved semantically


    Nope, as you have admitted otherwise on the record (see below):

    On 6/28/2026 11:56 PM, dbush wrote:
    On 6/27/2026 11:34 PM, dbush wrote:
    On 6/27/2026 11:23 PM, olcott wrote:
    On 6/27/2026 9:02 PM, dbush wrote:
    On 6/27/2026 9:53 PM, dbush wrote:
    On 6/27/2026 9:49 PM, olcott wrote:
    On 6/27/2026 8:42 PM, dbush wrote:
    On 6/27/2026 9:40 PM, olcott wrote:
    On 6/27/2026 8:29 PM, dbush wrote:
    Given that the following natural language statement is true:

    --------------------------------------
    Earth is the third planet from the sun.
    --------------------------------------

    In the following natural language statement:

    --------------------------------------
    At least one of the following statements is true:
    - Earth is the third planet from the sun.
    - <X>
    --------------------------------------

    Given that <X> is any *truth bearing* natural language statement,
    does there exist a statement X such that the condition "At least one
    of the following statements is true" is false?


    Head games will be ignored.


    Explain in detail how this is a head game.

    Failure to either answer the above question or explain how it is a
    head game in your next reply or within one hour of you next post in
    this newsgroup will be taken as your official, on-the-record admission
    that Disjunction introduction is in fact truth preserving and valid,
    and therefore so is the Principle of Explosion.


    Let the record show that Peter Olcott made the following post in this newsgroup:

    On 6/28/2026 10:52 PM, olcott wrote:
    Q also can't bake a birthday cake, this does not make
    Q in any way "incomplete" relative to what it was
    defined to do.
    ...

    And more that one hour has passed with no attempt to answer the above question or explain why it is a head game. Therefore, as per the above criteria:

    Let The Record Show

    That Peter Olcott

    Has *Officially* Admitted:

    That Disjunction introduction is in fact truth preserving and valid, and therefore so is the Principle of Explosion.
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,sci.math,comp.ai.philosophy on Sat Jul 4 08:21:08 2026
    From Newsgroup: comp.ai.philosophy

    On 7/4/2026 1:47 AM, Mikko wrote:
    On 03/07/2026 18:04, olcott wrote:
    On 7/3/2026 3:24 AM, Mikko wrote:
    On 02/07/2026 17:40, olcott wrote:
    On 7/2/2026 1:31 AM, Mikko wrote:

    Getting rid of the principle of explosion makes as much sense as
    getting rid of fire alarms. It makes much more sense to get rid
    of fires and false premises.

    Then you are irrational

    Matter of opinion,

    Matter of correctly and coherently computing the notion
    of truth. My correction to the Principle of Explosion:
    (P ∧ ~P) ⊢ FALSE
    FALSE ⊢ FALSE

    but I think that most of people would consder
    getting rid of fires is more rational that getting rid of fire
    alarms.

    It is not a fire alarm it is getting rid of semantics
    within inference. My correct reasoning correction to
    logic gets rid of every type of inference besides
    semantic entailment.

    Getting rid of any type of inference does not make much difference
    as long as you get the same conclusions through other inferences.
    Only getting rid of some conscusions it makes a significant
    difference. But you have never shown an example of getting rid of
    a conclusion without losing a semantic entailment.


    POE always breaks semantic entailment

    Validity and Soundness
    A deductive argument is said to be valid if
    and only if it takes a form that makes it
    impossible for the premises to be true and
    the conclusion nevertheless to be false.
    Otherwise, a deductive argument is said to
    be invalid. https://iep.utm.edu/val-snd/

    *That big mistake is corrected thusly*
    A deductive argument is said to be valid if
    and only if its conclusion is a necessary
    consequence of all of its premises Otherwise,
    a deductive argument is said to be invalid.

    P ⇒ Q
    P → Q
    P ⊃ Q

    are all abolished and replaced with the binary
    form of logical necessity: P □ Q

    You don't need any of above if you have ¬, ∨, and ∧.


    The notion of valid inference that I just established
    is the foundation of all semantic entailment.
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,sci.math,comp.ai.philosophy on Sat Jul 4 09:08:03 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-04 07:21, olcott wrote:
    On 7/4/2026 1:47 AM, Mikko wrote:
    On 03/07/2026 18:04, olcott wrote:

    P ⇒ Q
    P → Q
    P ⊃ Q

    are all abolished and replaced with the binary
    form of logical necessity: P □ Q

    There is no 'binary form of logical necessity. □ is a unary operator and
    an expression like P □ Q makes absolutely no sense.

    If you want to use this as a binary operator you'd actually need to
    *define* it. You don't seem to grasp this. You can't just introduce a
    new operator and expect people to know what it means.

    Also, moving into the domain of modal logic would be an incredibly
    strange thing for you to do given that in previous posts you claimed to
    reject the idea of models. But modal logic is *replete* with models.
    Modal logic operates over a set of many models. □P means that P is true
    in all accessible models of the system.

    André
    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,sci.math,comp.ai.philosophy on Sat Jul 4 11:44:06 2026
    From Newsgroup: comp.ai.philosophy

    On 7/4/2026 10:08 AM, André G. Isaak wrote:
    On 2026-07-04 07:21, olcott wrote:
    On 7/4/2026 1:47 AM, Mikko wrote:
    On 03/07/2026 18:04, olcott wrote:

    P ⇒ Q
    P → Q
    P ⊃ Q

    are all abolished and replaced with the binary
    form of logical necessity: P □ Q

    There is no 'binary form of logical necessity.

    That is why I just created one.

    □ is a unary operator and
    an expression like P □ Q makes absolutely no sense.


    Q is a necessary consequence of P makes perfect sense
    and corrects a fundamental error in the definition of
    valid deductive inference.

    If you want to use this as a binary operator you'd actually need to
    *define* it. You don't seem to grasp this. You can't just introduce a
    new operator and expect people to know what it means.


    □ Already means necessity, it is not that hard unless
    one makes great effort to pretend to not understand
    what is already unequivocally clear.

    Also, moving into the domain of modal logic would be an incredibly
    strange thing for you to do given that in previous posts you claimed to

    The only thing that I am using is logical necessity.

    reject the idea of models. But modal logic is *replete* with models.
    Modal logic operates over a set of many models. □P means that P is true
    in all accessible models of the system.

    André

    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,sci.math,comp.ai.philosophy on Sat Jul 4 10:59:06 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-04 10:44, olcott wrote:
    On 7/4/2026 10:08 AM, André G. Isaak wrote:
    On 2026-07-04 07:21, olcott wrote:
    On 7/4/2026 1:47 AM, Mikko wrote:
    On 03/07/2026 18:04, olcott wrote:

    P ⇒ Q
    P → Q
    P ⊃ Q

    are all abolished and replaced with the binary
    form of logical necessity: P □ Q

    There is no 'binary form of logical necessity.

    That is why I just created one.

    But you didn't define it.

    □ is a unary operator and an expression like P □ Q makes absolutely no >> sense.


    Q is a necessary consequence of P makes perfect sense
    and corrects a fundamental error in the definition of
    valid deductive inference.

    That would normally be written as □(P → Q), not as the nonsensical P □ Q. But you claim to have gotten rid of →, so how this is to be
    interpreted remains a mystery (and getting rid of → makes no sense since
    → represents a specific truth table which still exists regardless of
    whether you've assigned a symbol to it or not)

    If you want to use this as a binary operator you'd actually need to
    *define* it. You don't seem to grasp this. You can't just introduce a
    new operator and expect people to know what it means.


    □ Already means necessity, it is not that hard unless
    one makes great effort to pretend to not understand
    what is already unequivocally clear. >
    Also, moving into the domain of modal logic would be an incredibly
    strange thing for you to do given that in previous posts you claimed to

    The only thing that I am using is logical necessity.

    So how would you interpret 'necessity' without models?

    André

    reject the idea of models. But modal logic is *replete* with models.
    Modal logic operates over a set of many models. □P means that P is
    true in all accessible models of the system.

    André



    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,comp.ai.philosophy,sci.math,alt.philosophy on Sat Jul 4 12:09:40 2026
    From Newsgroup: comp.ai.philosophy

    On 7/4/2026 3:15 AM, Mikko wrote:
    On 03/07/2026 17:50, olcott wrote:
    On 7/3/2026 3:22 AM, Mikko wrote:
    On 02/07/2026 17:40, olcott wrote:

    Hypotheticals are useful for making decisions.

    Which is an example of the usefulness of a break from reality. It
    als shows that calling a break from reality "psychotic" without
    further consideration.

    That Donald Trump might start WW III is a hypothetical
    that can possibly be is useful.

    Whether Donald Trump will start WW III is not yet known, so that
    cannot be called an example of counter-factual.


    It is an example of hypothetical. You did not pay attention.

    That Donald Trump is the one and only Lord and Savior Jesus Christ
    is a hypothetical that cannot possible be making it useless.

    Maybe, but irrelevent as you did not claim it be useful when you
    presented it.

    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,sci.math,comp.ai.philosophy,alt.philosophy on Sat Jul 4 12:11:13 2026
    From Newsgroup: comp.ai.philosophy

    On 7/4/2026 3:16 AM, Mikko wrote:
    On 03/07/2026 18:04, olcott wrote:
    On 7/3/2026 3:24 AM, Mikko wrote:
    On 02/07/2026 17:40, olcott wrote:
    On 7/2/2026 1:31 AM, Mikko wrote:

    Getting rid of the principle of explosion makes as much sense as
    getting rid of fire alarms. It makes much more sense to get rid
    of fires and false premises.

    Then you are irrational

    Matter of opinion,

    Matter of correctly and coherently computing the notion
    of truth.

    You did not compute correctely, let aloone coherently, whether
    I an irrational. You onlu presented your opinion about it.


    Merely rhetoric entirely bereft of a supporting basis.
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,sci.math,comp.ai.philosophy,alt.philosophy on Sat Jul 4 15:58:13 2026
    From Newsgroup: comp.ai.philosophy

    On 7/4/2026 11:59 AM, André G. Isaak wrote:
    On 2026-07-04 10:44, olcott wrote:
    On 7/4/2026 10:08 AM, André G. Isaak wrote:
    On 2026-07-04 07:21, olcott wrote:
    On 7/4/2026 1:47 AM, Mikko wrote:
    On 03/07/2026 18:04, olcott wrote:

    P ⇒ Q
    P → Q
    P ⊃ Q

    are all abolished and replaced with the binary
    form of logical necessity: P □ Q

    There is no 'binary form of logical necessity.

    That is why I just created one.

    But you didn't define it.

    □ is a unary operator and an expression like P □ Q makes absolutely >>> no sense.


    Q is a necessary consequence of P makes perfect sense
    and corrects a fundamental error in the definition of
    valid deductive inference.

    That would normally be written as □(P → Q),

    That does not perfectly preserve the complete
    necessity between P and Q.

    P □ Q P → Q
    0 ? 0 0 1 0
    0 ? 1 0 1 1
    1 0 0 1 0 0
    1 1 1 1 1 1
    Q is a necessary consequence of P
    is the same as English If P then Q
    (a) false when P is true and Q is false
    (b) true when P is true and Q is true
    (c) otherwise does not have a truth value.

    not as the nonsensical P □
    Q. But you claim to have gotten rid of →, so how this is to be
    interpreted remains a mystery (and getting rid of → makes no sense since → represents a specific truth table which still exists regardless of whether you've assigned a symbol to it or not)

    If you want to use this as a binary operator you'd actually need to
    *define* it. You don't seem to grasp this. You can't just introduce a
    new operator and expect people to know what it means.


    □ Already means necessity, it is not that hard unless
    one makes great effort to pretend to not understand
    what is already unequivocally clear. >
    Also, moving into the domain of modal logic would be an incredibly
    strange thing for you to do given that in previous posts you claimed to

    The only thing that I am using is logical necessity.

    So how would you interpret 'necessity' without models?


    To make it easy to understand we have the above
    propositional logic truth tables. They provide
    the framework.

    André

    reject the idea of models. But modal logic is *replete* with models.
    Modal logic operates over a set of many models. □P means that P is
    true in all accessible models of the system.

    André




    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,sci.math,comp.ai.philosophy,alt.philosophy on Sat Jul 4 15:29:31 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-04 14:58, olcott wrote:
    On 7/4/2026 11:59 AM, André G. Isaak wrote:
    On 2026-07-04 10:44, olcott wrote:
    On 7/4/2026 10:08 AM, André G. Isaak wrote:
    On 2026-07-04 07:21, olcott wrote:
    On 7/4/2026 1:47 AM, Mikko wrote:
    On 03/07/2026 18:04, olcott wrote:

    P ⇒ Q
    P → Q
    P ⊃ Q

    are all abolished and replaced with the binary
    form of logical necessity: P □ Q

    There is no 'binary form of logical necessity.

    That is why I just created one.

    But you didn't define it.

    □ is a unary operator and an expression like P □ Q makes absolutely >>>> no sense.


    Q is a necessary consequence of P makes perfect sense
    and corrects a fundamental error in the definition of
    valid deductive inference.

    That would normally be written as □(P → Q),

    That does not perfectly preserve the complete
    necessity between P and Q.

    What on earth does it mean for there to be a "complete necessity between
    P and Q". Necessity applies to propositions. It doesn't hold *between*
    things.

    □(P → Q) means that Q is necessarily implied by P. If you mean something other than that you're really going to have to clarify what you mean.

    P □ Q   P → Q
    0 ? 0   0 1 0
    0 ? 1   0 1 1
    1 0 0   1 0 0
    1 1 1   1 1 1
    Q is a necessary consequence of P
    is the same as English If P then Q
    (a) false when P is true and Q is false
    (b) true  when P is true and Q is true
    (c) otherwise does not have a truth value.

    So again your veering into the territory of three-valued logic. If a
    truth table contains any symbol other than T or F, you're dealing with a
    three or more valued logic which means you have to completely redefine
    every single logical operator before you can proceed.

    And there's nothing about the above table which in any way captures the meaning of 'necessity' so it's entirely unclear why you want to use the
    □ symbol here. Your '□' doesn't have any relation to necessity any more than '→' does above.

    Also note that formal logic is *not* c++. There's no such thing as
    operator overloading, so you can't take a unary operator and use it for
    some ill-defined binary operation as well. You need a new symbol since □
    is already taken.

    P □ Q makes as much sense as P ¬ Q or P ∀ Q

    So how would you interpret 'necessity' without models?

    I note you didn't answer this. The notion of necessity in modal logic is intrinsically tied to model theory.

    How exactly are you defining 'necessity' if you're not making use of models?

    André
    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,sci.math,comp.ai.philosophy,alt.philosophy on Sat Jul 4 16:36:14 2026
    From Newsgroup: comp.ai.philosophy

    On 7/4/2026 4:29 PM, André G. Isaak wrote:
    On 2026-07-04 14:58, olcott wrote:
    On 7/4/2026 11:59 AM, André G. Isaak wrote:
    On 2026-07-04 10:44, olcott wrote:
    On 7/4/2026 10:08 AM, André G. Isaak wrote:
    On 2026-07-04 07:21, olcott wrote:
    On 7/4/2026 1:47 AM, Mikko wrote:
    On 03/07/2026 18:04, olcott wrote:

    P ⇒ Q
    P → Q
    P ⊃ Q

    are all abolished and replaced with the binary
    form of logical necessity: P □ Q

    There is no 'binary form of logical necessity.

    That is why I just created one.

    But you didn't define it.

    □ is a unary operator and an expression like P □ Q makes absolutely >>>>> no sense.


    Q is a necessary consequence of P makes perfect sense
    and corrects a fundamental error in the definition of
    valid deductive inference.

    That would normally be written as □(P → Q),

    That does not perfectly preserve the complete
    necessity between P and Q.

    What on earth does it mean for there to be a "complete necessity between
    P and Q". Necessity applies to propositions. It doesn't hold *between* things.

    □(P → Q) means that Q is necessarily implied by P. If you mean something other than that you're really going to have to clarify what you mean.

    P □ Q   P → Q
    0 ? 0   0 1 0
    0 ? 1   0 1 1
    1 0 0   1 0 0
    1 1 1   1 1 1
    Q is a necessary consequence of P
    is the same as English If P then Q
    (a) false when P is true and Q is false
    (b) true  when P is true and Q is true
    (c) otherwise does not have a truth value.

    So again your veering into the territory of three-valued logic. If a
    truth table contains any symbol other than T or F, you're dealing with a three or more valued logic which means you have to completely redefine
    every single logical operator before you can proceed.


    The English if P then Q only actually tells you
    P(true) then necessarily Q(true)
    Q(false) then necessarily P(false)

    IT DOES NOT TELL YOU MORE THAN THIS AND
    IT IS STUPID MISTAKE TO ASSUME OTHERWISE
    THE WAY THAT IMPLICATION STUPIDLY DOES.

    And there's nothing about the above table which in any way captures the meaning of 'necessity' so it's entirely unclear why you want to use the
    □ symbol here. Your '□' doesn't have any relation to necessity any more than '→' does above.

    Also note that formal logic is *not* c++. There's no such thing as
    operator overloading, so you can't take a unary operator and use it for
    some ill-defined binary operation as well. You need a new symbol since □ is already taken.

    P □ Q makes as much sense as P ¬ Q or P ∀ Q

    So how would you interpret 'necessity' without models?

    I note you didn't answer this. The notion of necessity in modal logic is intrinsically tied to model theory.

    How exactly are you defining 'necessity' if you're not making use of
    models?

    André


    Do you know what propositional logic is?
    then that is one way to avoid models.
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,sci.math,comp.ai.philosophy,alt.philosophy on Sat Jul 4 16:11:52 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-04 15:36, olcott wrote:
    On 7/4/2026 4:29 PM, André G. Isaak wrote:
    On 2026-07-04 14:58, olcott wrote:
    On 7/4/2026 11:59 AM, André G. Isaak wrote:
    On 2026-07-04 10:44, olcott wrote:
    On 7/4/2026 10:08 AM, André G. Isaak wrote:
    On 2026-07-04 07:21, olcott wrote:
    On 7/4/2026 1:47 AM, Mikko wrote:
    On 03/07/2026 18:04, olcott wrote:

    P ⇒ Q
    P → Q
    P ⊃ Q

    are all abolished and replaced with the binary
    form of logical necessity: P □ Q

    There is no 'binary form of logical necessity.

    That is why I just created one.

    But you didn't define it.

    □ is a unary operator and an expression like P □ Q makes
    absolutely no sense.


    Q is a necessary consequence of P makes perfect sense
    and corrects a fundamental error in the definition of
    valid deductive inference.

    That would normally be written as □(P → Q),

    That does not perfectly preserve the complete
    necessity between P and Q.

    What on earth does it mean for there to be a "complete necessity
    between P and Q". Necessity applies to propositions. It doesn't hold
    *between* things.

    □(P → Q) means that Q is necessarily implied by P. If you mean
    something other than that you're really going to have to clarify what
    you mean.

    P □ Q   P → Q
    0 ? 0   0 1 0
    0 ? 1   0 1 1
    1 0 0   1 0 0
    1 1 1   1 1 1
    Q is a necessary consequence of P
    is the same as English If P then Q
    (a) false when P is true and Q is false
    (b) true  when P is true and Q is true
    (c) otherwise does not have a truth value.

    So again your veering into the territory of three-valued logic. If a
    truth table contains any symbol other than T or F, you're dealing with
    a three or more valued logic which means you have to completely
    redefine every single logical operator before you can proceed.


    The English if P then Q only actually tells you
    P(true) then necessarily Q(true)
    Q(false) then necessarily P(false)
    IT DOES NOT TELL YOU MORE THAN THIS AND
    IT IS STUPID MISTAKE TO ASSUME OTHERWISE
    THE WAY THAT IMPLICATION STUPIDLY DOES.

    You're introducing the word 'necessarily' here without any attempt to
    explain what is meant by this (by you).

    What is the difference between

    a) Q is a necessary consequence of P.
    b) Q is a consequence of P

    Give an example where b holds true but where a is false. If you can't do
    that, then your use of 'necessary' is completely meaningless verbiage.

    And there's nothing about the above table which in any way captures
    the meaning of 'necessity' so it's entirely unclear why you want to
    use the □ symbol here. Your '□' doesn't have any relation to necessity >> any more than '→' does above.

    Also note that formal logic is *not* c++. There's no such thing as
    operator overloading, so you can't take a unary operator and use it
    for some ill-defined binary operation as well. You need a new symbol
    since □ is already taken.

    P □ Q makes as much sense as P ¬ Q or P ∀ Q

    So how would you interpret 'necessity' without models?

    I note you didn't answer this. The notion of necessity in modal logic
    is intrinsically tied to model theory.

    How exactly are you defining 'necessity' if you're not making use of
    models?

    André


    Do you know what propositional logic is?
    then that is one way to avoid models.

    Propositional calculus uses models. It's also extremely limited.

    André
    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,sci.math,comp.ai.philosophy,alt.philosophy on Sat Jul 4 18:42:18 2026
    From Newsgroup: comp.ai.philosophy

    On 7/4/2026 5:11 PM, André G. Isaak wrote:
    On 2026-07-04 15:36, olcott wrote:
    On 7/4/2026 4:29 PM, André G. Isaak wrote:
    On 2026-07-04 14:58, olcott wrote:
    On 7/4/2026 11:59 AM, André G. Isaak wrote:
    On 2026-07-04 10:44, olcott wrote:
    On 7/4/2026 10:08 AM, André G. Isaak wrote:
    On 2026-07-04 07:21, olcott wrote:
    On 7/4/2026 1:47 AM, Mikko wrote:
    On 03/07/2026 18:04, olcott wrote:

    P ⇒ Q
    P → Q
    P ⊃ Q

    are all abolished and replaced with the binary
    form of logical necessity: P □ Q

    There is no 'binary form of logical necessity.

    That is why I just created one.

    But you didn't define it.

    □ is a unary operator and an expression like P □ Q makes
    absolutely no sense.


    Q is a necessary consequence of P makes perfect sense
    and corrects a fundamental error in the definition of
    valid deductive inference.

    That would normally be written as □(P → Q),

    That does not perfectly preserve the complete
    necessity between P and Q.

    What on earth does it mean for there to be a "complete necessity
    between P and Q". Necessity applies to propositions. It doesn't hold
    *between* things.

    □(P → Q) means that Q is necessarily implied by P. If you mean
    something other than that you're really going to have to clarify what
    you mean.

    P □ Q   P → Q
    0 ? 0   0 1 0
    0 ? 1   0 1 1
    1 0 0   1 0 0
    1 1 1   1 1 1
    Q is a necessary consequence of P
    is the same as English If P then Q
    (a) false when P is true and Q is false
    (b) true  when P is true and Q is true
    (c) otherwise does not have a truth value.

    So again your veering into the territory of three-valued logic. If a
    truth table contains any symbol other than T or F, you're dealing
    with a three or more valued logic which means you have to completely
    redefine every single logical operator before you can proceed.


    The English if P then Q only actually tells you
    P(true) then necessarily Q(true)
    Q(false) then necessarily P(false)
    IT DOES NOT TELL YOU MORE THAN THIS AND
    IT IS STUPID MISTAKE TO ASSUME OTHERWISE
    THE WAY THAT IMPLICATION STUPIDLY DOES.

    You're introducing the word 'necessarily' here without any attempt to explain what is meant by this (by you).


    I always use the ordinary English meaning.
    If P is true then Q is impossibly false.
    If Q is false the P is impossibly true.

    What is the difference between

    a) Q is a necessary consequence of P.
    b) Q is a consequence of P

    Give an example where b holds true but where a is false. If you can't do that, then your use of 'necessary' is completely meaningless verbiage.


    If someone smacks you in the face then
    you were hit in the face.

    If you were NOT hit in the face then
    someone did not smack you in the face.

    And there's nothing about the above table which in any way captures
    the meaning of 'necessity' so it's entirely unclear why you want to
    use the □ symbol here. Your '□' doesn't have any relation to
    necessity any more than '→' does above.

    Also note that formal logic is *not* c++. There's no such thing as
    operator overloading, so you can't take a unary operator and use it
    for some ill-defined binary operation as well. You need a new symbol
    since □ is already taken.

    P □ Q makes as much sense as P ¬ Q or P ∀ Q

    So how would you interpret 'necessity' without models?

    I note you didn't answer this. The notion of necessity in modal logic
    is intrinsically tied to model theory.

    How exactly are you defining 'necessity' if you're not making use of
    models?

    André


    Do you know what propositional logic is?
    then that is one way to avoid models.

    Propositional calculus uses models. It's also extremely limited.

    André


    Are you referring to truth tables as models?
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,sci.math,comp.ai.philosophy,alt.philosophy on Sat Jul 4 17:57:29 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-04 17:42, olcott wrote:
    On 7/4/2026 5:11 PM, André G. Isaak wrote:
    On 2026-07-04 15:36, olcott wrote:
    On 7/4/2026 4:29 PM, André G. Isaak wrote:
    On 2026-07-04 14:58, olcott wrote:
    On 7/4/2026 11:59 AM, André G. Isaak wrote:
    On 2026-07-04 10:44, olcott wrote:
    On 7/4/2026 10:08 AM, André G. Isaak wrote:
    On 2026-07-04 07:21, olcott wrote:
    On 7/4/2026 1:47 AM, Mikko wrote:
    On 03/07/2026 18:04, olcott wrote:

    P ⇒ Q
    P → Q
    P ⊃ Q

    are all abolished and replaced with the binary
    form of logical necessity: P □ Q

    There is no 'binary form of logical necessity.

    That is why I just created one.

    But you didn't define it.

    □ is a unary operator and an expression like P □ Q makes
    absolutely no sense.


    Q is a necessary consequence of P makes perfect sense
    and corrects a fundamental error in the definition of
    valid deductive inference.

    That would normally be written as □(P → Q),

    That does not perfectly preserve the complete
    necessity between P and Q.

    What on earth does it mean for there to be a "complete necessity
    between P and Q". Necessity applies to propositions. It doesn't hold
    *between* things.

    □(P → Q) means that Q is necessarily implied by P. If you mean
    something other than that you're really going to have to clarify
    what you mean.

    P □ Q   P → Q
    0 ? 0   0 1 0
    0 ? 1   0 1 1
    1 0 0   1 0 0
    1 1 1   1 1 1
    Q is a necessary consequence of P
    is the same as English If P then Q
    (a) false when P is true and Q is false
    (b) true  when P is true and Q is true
    (c) otherwise does not have a truth value.

    So again your veering into the territory of three-valued logic. If a
    truth table contains any symbol other than T or F, you're dealing
    with a three or more valued logic which means you have to completely
    redefine every single logical operator before you can proceed.


    The English if P then Q only actually tells you
    P(true) then necessarily Q(true)
    Q(false) then necessarily P(false)
    IT DOES NOT TELL YOU MORE THAN THIS AND
    IT IS STUPID MISTAKE TO ASSUME OTHERWISE
    THE WAY THAT IMPLICATION STUPIDLY DOES.

    You're introducing the word 'necessarily' here without any attempt to
    explain what is meant by this (by you).


    I always use the ordinary English meaning.
    If P is true then Q is impossibly false.
    If Q is false the P is impossibly true.

    'impossibly false' and 'impossibly true' aren't ordinary English.

    What is the difference between

    a) Q is a necessary consequence of P.
    b) Q is a consequence of P

    Give an example where b holds true but where a is false. If you can't
    do that, then your use of 'necessary' is completely meaningless verbiage.


    If someone smacks you in the face then
    you were hit in the face.

    If you were NOT hit in the face then
    someone did not smack you in the face.

    I asked for an example illustrating the different between 'necessary consequence' and mere 'consequence'. The two examples above don't even
    mention the word 'necessary'.

    And there's nothing about the above table which in any way captures
    the meaning of 'necessity' so it's entirely unclear why you want to
    use the □ symbol here. Your '□' doesn't have any relation to
    necessity any more than '→' does above.

    Also note that formal logic is *not* c++. There's no such thing as
    operator overloading, so you can't take a unary operator and use it
    for some ill-defined binary operation as well. You need a new symbol
    since □ is already taken.

    P □ Q makes as much sense as P ¬ Q or P ∀ Q

    So how would you interpret 'necessity' without models?

    I note you didn't answer this. The notion of necessity in modal
    logic is intrinsically tied to model theory.

    How exactly are you defining 'necessity' if you're not making use of
    models?

    André


    Do you know what propositional logic is?
    then that is one way to avoid models.

    Propositional calculus uses models. It's also extremely limited.

    André


    Are you referring to truth tables as models?

    No.

    André
    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,sci.math,comp.ai.philosophy,alt.philosophy on Sat Jul 4 19:08:05 2026
    From Newsgroup: comp.ai.philosophy

    On 7/4/2026 6:57 PM, André G. Isaak wrote:
    On 2026-07-04 17:42, olcott wrote:
    On 7/4/2026 5:11 PM, André G. Isaak wrote:
    On 2026-07-04 15:36, olcott wrote:
    On 7/4/2026 4:29 PM, André G. Isaak wrote:
    On 2026-07-04 14:58, olcott wrote:
    On 7/4/2026 11:59 AM, André G. Isaak wrote:
    On 2026-07-04 10:44, olcott wrote:
    On 7/4/2026 10:08 AM, André G. Isaak wrote:
    On 2026-07-04 07:21, olcott wrote:
    On 7/4/2026 1:47 AM, Mikko wrote:
    On 03/07/2026 18:04, olcott wrote:

    P ⇒ Q
    P → Q
    P ⊃ Q

    are all abolished and replaced with the binary
    form of logical necessity: P □ Q

    There is no 'binary form of logical necessity.

    That is why I just created one.

    But you didn't define it.

    □ is a unary operator and an expression like P □ Q makes >>>>>>>>> absolutely no sense.


    Q is a necessary consequence of P makes perfect sense
    and corrects a fundamental error in the definition of
    valid deductive inference.

    That would normally be written as □(P → Q),

    That does not perfectly preserve the complete
    necessity between P and Q.

    What on earth does it mean for there to be a "complete necessity
    between P and Q". Necessity applies to propositions. It doesn't
    hold *between* things.

    □(P → Q) means that Q is necessarily implied by P. If you mean
    something other than that you're really going to have to clarify
    what you mean.

    P □ Q   P → Q
    0 ? 0   0 1 0
    0 ? 1   0 1 1
    1 0 0   1 0 0
    1 1 1   1 1 1
    Q is a necessary consequence of P
    is the same as English If P then Q
    (a) false when P is true and Q is false
    (b) true  when P is true and Q is true
    (c) otherwise does not have a truth value.

    So again your veering into the territory of three-valued logic. If
    a truth table contains any symbol other than T or F, you're dealing >>>>> with a three or more valued logic which means you have to
    completely redefine every single logical operator before you can
    proceed.


    The English if P then Q only actually tells you
    P(true) then necessarily Q(true)
    Q(false) then necessarily P(false)
    IT DOES NOT TELL YOU MORE THAN THIS AND
    IT IS STUPID MISTAKE TO ASSUME OTHERWISE
    THE WAY THAT IMPLICATION STUPIDLY DOES.

    You're introducing the word 'necessarily' here without any attempt to
    explain what is meant by this (by you).


    I always use the ordinary English meaning.
    If P is true then Q is impossibly false.
    If Q is false the P is impossibly true.

    'impossibly false' and 'impossibly true' aren't ordinary English.


    Tell me whether or not the numerical square root
    of a dead chicken can exist and why or why not.
    You must not start with any numerical value such
    as the weight of the dead chicken. You are only
    allowed to use its actual dead body.

    What is the difference between

    a) Q is a necessary consequence of P.
    b) Q is a consequence of P

    Give an example where b holds true but where a is false. If you can't
    do that, then your use of 'necessary' is completely meaningless
    verbiage.


    If someone smacks you in the face then
    you were hit in the face.

    If you were NOT hit in the face then
    someone did not smack you in the face.

    I asked for an example illustrating the different between 'necessary consequence' and mere 'consequence'. The two examples above don't even mention the word 'necessary'.

    And there's nothing about the above table which in any way captures >>>>> the meaning of 'necessity' so it's entirely unclear why you want to >>>>> use the □ symbol here. Your '□' doesn't have any relation to
    necessity any more than '→' does above.

    Also note that formal logic is *not* c++. There's no such thing as
    operator overloading, so you can't take a unary operator and use it >>>>> for some ill-defined binary operation as well. You need a new
    symbol since □ is already taken.

    P □ Q makes as much sense as P ¬ Q or P ∀ Q

    So how would you interpret 'necessity' without models?

    I note you didn't answer this. The notion of necessity in modal
    logic is intrinsically tied to model theory.

    How exactly are you defining 'necessity' if you're not making use
    of models?

    André


    Do you know what propositional logic is?
    then that is one way to avoid models.

    Propositional calculus uses models. It's also extremely limited.

    André


    Are you referring to truth tables as models?

    No.

    André


    Truth Tables ARE Propositional Model Theory
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,sci.math,comp.ai.philosophy,alt.philosophy on Sat Jul 4 18:23:28 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-04 18:08, olcott wrote:
    On 7/4/2026 6:57 PM, André G. Isaak wrote:
    On 2026-07-04 17:42, olcott wrote:
    On 7/4/2026 5:11 PM, André G. Isaak wrote:
    On 2026-07-04 15:36, olcott wrote:
    On 7/4/2026 4:29 PM, André G. Isaak wrote:
    On 2026-07-04 14:58, olcott wrote:
    On 7/4/2026 11:59 AM, André G. Isaak wrote:
    On 2026-07-04 10:44, olcott wrote:
    On 7/4/2026 10:08 AM, André G. Isaak wrote:
    On 2026-07-04 07:21, olcott wrote:
    On 7/4/2026 1:47 AM, Mikko wrote:
    On 03/07/2026 18:04, olcott wrote:

    P ⇒ Q
    P → Q
    P ⊃ Q

    are all abolished and replaced with the binary
    form of logical necessity: P □ Q

    There is no 'binary form of logical necessity.

    That is why I just created one.

    But you didn't define it.

    □ is a unary operator and an expression like P □ Q makes >>>>>>>>>> absolutely no sense.


    Q is a necessary consequence of P makes perfect sense
    and corrects a fundamental error in the definition of
    valid deductive inference.

    That would normally be written as □(P → Q),

    That does not perfectly preserve the complete
    necessity between P and Q.

    What on earth does it mean for there to be a "complete necessity
    between P and Q". Necessity applies to propositions. It doesn't
    hold *between* things.

    □(P → Q) means that Q is necessarily implied by P. If you mean >>>>>> something other than that you're really going to have to clarify
    what you mean.

    P □ Q   P → Q
    0 ? 0   0 1 0
    0 ? 1   0 1 1
    1 0 0   1 0 0
    1 1 1   1 1 1
    Q is a necessary consequence of P
    is the same as English If P then Q
    (a) false when P is true and Q is false
    (b) true  when P is true and Q is true
    (c) otherwise does not have a truth value.

    So again your veering into the territory of three-valued logic. If >>>>>> a truth table contains any symbol other than T or F, you're
    dealing with a three or more valued logic which means you have to >>>>>> completely redefine every single logical operator before you can
    proceed.


    The English if P then Q only actually tells you
    P(true) then necessarily Q(true)
    Q(false) then necessarily P(false)
    IT DOES NOT TELL YOU MORE THAN THIS AND
    IT IS STUPID MISTAKE TO ASSUME OTHERWISE
    THE WAY THAT IMPLICATION STUPIDLY DOES.

    You're introducing the word 'necessarily' here without any attempt
    to explain what is meant by this (by you).


    I always use the ordinary English meaning.
    If P is true then Q is impossibly false.
    If Q is false the P is impossibly true.

    'impossibly false' and 'impossibly true' aren't ordinary English.


    Tell me whether or not the numerical square root
    of a dead chicken can exist and why or why not.
    You must not start with any numerical value such
    as the weight of the dead chicken. You are only
    allowed to use its actual dead body.

    What does the above have to do with my claim that neither 'impossibly
    false' nor 'impossibly true' are English. In English, 'impossibly x'
    does not mean 'not possible to be x'. 'Impossibly' is an *itensifier*
    with a meaning of extremely. So 'impossibly true' would mean 'extremely
    true', which makes no sense since true is not a gradient concept.

    What is the difference between

    a) Q is a necessary consequence of P.
    b) Q is a consequence of P

    Give an example where b holds true but where a is false. If you
    can't do that, then your use of 'necessary' is completely
    meaningless verbiage.


    If someone smacks you in the face then
    you were hit in the face.

    If you were NOT hit in the face then
    someone did not smack you in the face.

    I asked for an example illustrating the different between 'necessary
    consequence' and mere 'consequence'. The two examples above don't even
    mention the word 'necessary'.

    This question was the central point of my post and you have ignored it.
    I maintain that when you use the term 'necessary' your just tossing in a meaningless word for no reason. If you can answer the above question you
    will show me wrong.

    And there's nothing about the above table which in any way
    captures the meaning of 'necessity' so it's entirely unclear why
    you want to use the □ symbol here. Your '□' doesn't have any
    relation to necessity any more than '→' does above.

    Also note that formal logic is *not* c++. There's no such thing as >>>>>> operator overloading, so you can't take a unary operator and use
    it for some ill-defined binary operation as well. You need a new
    symbol since □ is already taken.

    P □ Q makes as much sense as P ¬ Q or P ∀ Q

    So how would you interpret 'necessity' without models?

    I note you didn't answer this. The notion of necessity in modal
    logic is intrinsically tied to model theory.

    How exactly are you defining 'necessity' if you're not making use >>>>>> of models?

    André


    Do you know what propositional logic is?
    then that is one way to avoid models.

    Propositional calculus uses models. It's also extremely limited.

    André


    Are you referring to truth tables as models?

    No.

    André


    Truth Tables ARE Propositional Model Theory

    No they're not. Truth tables are used to define the basic operators in a truth-functional logic.

    Please evaluate the propositional calculus expression P → Q. Without
    knowing what P or Q stand for you cannot do this. The model tells you
    what P and Q actually mean making it possible to assign a truth value to
    P → Q.

    André
    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,sci.math,comp.ai.philosophy,alt.philosophy on Sat Jul 4 19:33:02 2026
    From Newsgroup: comp.ai.philosophy

    On 7/4/2026 7:23 PM, André G. Isaak wrote:
    On 2026-07-04 18:08, olcott wrote:
    On 7/4/2026 6:57 PM, André G. Isaak wrote:
    On 2026-07-04 17:42, olcott wrote:
    On 7/4/2026 5:11 PM, André G. Isaak wrote:
    On 2026-07-04 15:36, olcott wrote:
    On 7/4/2026 4:29 PM, André G. Isaak wrote:
    On 2026-07-04 14:58, olcott wrote:
    On 7/4/2026 11:59 AM, André G. Isaak wrote:
    On 2026-07-04 10:44, olcott wrote:
    On 7/4/2026 10:08 AM, André G. Isaak wrote:
    On 2026-07-04 07:21, olcott wrote:
    On 7/4/2026 1:47 AM, Mikko wrote:
    On 03/07/2026 18:04, olcott wrote:

    P ⇒ Q
    P → Q
    P ⊃ Q

    are all abolished and replaced with the binary
    form of logical necessity: P □ Q

    There is no 'binary form of logical necessity.

    That is why I just created one.

    But you didn't define it.

    □ is a unary operator and an expression like P □ Q makes >>>>>>>>>>> absolutely no sense.


    Q is a necessary consequence of P makes perfect sense
    and corrects a fundamental error in the definition of
    valid deductive inference.

    That would normally be written as □(P → Q),

    That does not perfectly preserve the complete
    necessity between P and Q.

    What on earth does it mean for there to be a "complete necessity >>>>>>> between P and Q". Necessity applies to propositions. It doesn't >>>>>>> hold *between* things.

    □(P → Q) means that Q is necessarily implied by P. If you mean >>>>>>> something other than that you're really going to have to clarify >>>>>>> what you mean.

    P □ Q   P → Q
    0 ? 0   0 1 0
    0 ? 1   0 1 1
    1 0 0   1 0 0
    1 1 1   1 1 1
    Q is a necessary consequence of P
    is the same as English If P then Q
    (a) false when P is true and Q is false
    (b) true  when P is true and Q is true
    (c) otherwise does not have a truth value.

    So again your veering into the territory of three-valued logic. >>>>>>> If a truth table contains any symbol other than T or F, you're
    dealing with a three or more valued logic which means you have to >>>>>>> completely redefine every single logical operator before you can >>>>>>> proceed.


    The English if P then Q only actually tells you
    P(true) then necessarily Q(true)
    Q(false) then necessarily P(false)
    IT DOES NOT TELL YOU MORE THAN THIS AND
    IT IS STUPID MISTAKE TO ASSUME OTHERWISE
    THE WAY THAT IMPLICATION STUPIDLY DOES.

    You're introducing the word 'necessarily' here without any attempt
    to explain what is meant by this (by you).


    I always use the ordinary English meaning.
    If P is true then Q is impossibly false.
    If Q is false the P is impossibly true.

    'impossibly false' and 'impossibly true' aren't ordinary English.


    Tell me whether or not the numerical square root
    of a dead chicken can exist and why or why not.
    You must not start with any numerical value such
    as the weight of the dead chicken. You are only
    allowed to use its actual dead body.

    What does the above have to do with my claim that neither 'impossibly
    false' nor 'impossibly true' are English.

    You did not seem to understand the meaning of the word impossible.

    In English, 'impossibly x'
    does not mean 'not possible to be x'. 'Impossibly' is an *itensifier*
    with a meaning of extremely. So 'impossibly true' would mean 'extremely true', which makes no sense since true is not a gradient concept.

    What is the difference between

    a) Q is a necessary consequence of P.
    b) Q is a consequence of P

    Give an example where b holds true but where a is false. If you
    can't do that, then your use of 'necessary' is completely
    meaningless verbiage.


    If someone smacks you in the face then
    you were hit in the face.

    If you were NOT hit in the face then
    someone did not smack you in the face.

    I asked for an example illustrating the different between 'necessary
    consequence' and mere 'consequence'. The two examples above don't
    even mention the word 'necessary'.

    This question was the central point of my post and you have ignored it.
    I maintain that when you use the term 'necessary' your just tossing in a meaningless word for no reason. If you can answer the above question you will show me wrong.


    The modal operators □ and ◊

    P □ Q --- P → Q
    0 ? 0 --- 0 1 0
    0 ? 1 --- 0 1 1
    1 0 0 --- 1 0 0
    1 1 1 --- 1 1 1

    If Q is a necessary consequence of P then
    we are not allowed to infer anything from ~P

    And there's nothing about the above table which in any way
    captures the meaning of 'necessity' so it's entirely unclear why >>>>>>> you want to use the □ symbol here. Your '□' doesn't have any >>>>>>> relation to necessity any more than '→' does above.

    Also note that formal logic is *not* c++. There's no such thing >>>>>>> as operator overloading, so you can't take a unary operator and >>>>>>> use it for some ill-defined binary operation as well. You need a >>>>>>> new symbol since □ is already taken.

    P □ Q makes as much sense as P ¬ Q or P ∀ Q

    So how would you interpret 'necessity' without models?

    I note you didn't answer this. The notion of necessity in modal >>>>>>> logic is intrinsically tied to model theory.

    How exactly are you defining 'necessity' if you're not making use >>>>>>> of models?

    André


    Do you know what propositional logic is?
    then that is one way to avoid models.

    Propositional calculus uses models. It's also extremely limited.

    André


    Are you referring to truth tables as models?

    No.

    André


    Truth Tables ARE Propositional Model Theory

    No they're not. Truth tables are used to define the basic operators in a truth-functional logic.

    Please evaluate the propositional calculus expression P → Q. Without knowing what P or Q stand for you cannot do this. The model tells you
    what P and Q actually mean making it possible to assign a truth value to
    P → Q.

    André


    In propositional logic they are only Boolean variables
    with zero additional meaning besides true and false.
    If you think otherwise then cite a source.
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,sci.math,comp.ai.philosophy,alt.philosophy on Sat Jul 4 18:43:24 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-04 18:33, olcott wrote:
    On 7/4/2026 7:23 PM, André G. Isaak wrote:
    On 2026-07-04 18:08, olcott wrote:
    On 7/4/2026 6:57 PM, André G. Isaak wrote:
    On 2026-07-04 17:42, olcott wrote:
    On 7/4/2026 5:11 PM, André G. Isaak wrote:
    On 2026-07-04 15:36, olcott wrote:
    On 7/4/2026 4:29 PM, André G. Isaak wrote:
    On 2026-07-04 14:58, olcott wrote:
    On 7/4/2026 11:59 AM, André G. Isaak wrote:
    On 2026-07-04 10:44, olcott wrote:
    On 7/4/2026 10:08 AM, André G. Isaak wrote:
    On 2026-07-04 07:21, olcott wrote:
    On 7/4/2026 1:47 AM, Mikko wrote:
    On 03/07/2026 18:04, olcott wrote:

    P ⇒ Q
    P → Q
    P ⊃ Q

    are all abolished and replaced with the binary
    form of logical necessity: P □ Q

    There is no 'binary form of logical necessity.

    That is why I just created one.

    But you didn't define it.

    □ is a unary operator and an expression like P □ Q makes >>>>>>>>>>>> absolutely no sense.


    Q is a necessary consequence of P makes perfect sense
    and corrects a fundamental error in the definition of
    valid deductive inference.

    That would normally be written as □(P → Q),

    That does not perfectly preserve the complete
    necessity between P and Q.

    What on earth does it mean for there to be a "complete necessity >>>>>>>> between P and Q". Necessity applies to propositions. It doesn't >>>>>>>> hold *between* things.

    □(P → Q) means that Q is necessarily implied by P. If you mean >>>>>>>> something other than that you're really going to have to clarify >>>>>>>> what you mean.

    P □ Q   P → Q
    0 ? 0   0 1 0
    0 ? 1   0 1 1
    1 0 0   1 0 0
    1 1 1   1 1 1
    Q is a necessary consequence of P
    is the same as English If P then Q
    (a) false when P is true and Q is false
    (b) true  when P is true and Q is true
    (c) otherwise does not have a truth value.

    So again your veering into the territory of three-valued logic. >>>>>>>> If a truth table contains any symbol other than T or F, you're >>>>>>>> dealing with a three or more valued logic which means you have >>>>>>>> to completely redefine every single logical operator before you >>>>>>>> can proceed.


    The English if P then Q only actually tells you
    P(true) then necessarily Q(true)
    Q(false) then necessarily P(false)
    IT DOES NOT TELL YOU MORE THAN THIS AND
    IT IS STUPID MISTAKE TO ASSUME OTHERWISE
    THE WAY THAT IMPLICATION STUPIDLY DOES.

    You're introducing the word 'necessarily' here without any attempt >>>>>> to explain what is meant by this (by you).


    I always use the ordinary English meaning.
    If P is true then Q is impossibly false.
    If Q is false the P is impossibly true.

    'impossibly false' and 'impossibly true' aren't ordinary English.


    Tell me whether or not the numerical square root
    of a dead chicken can exist and why or why not.
    You must not start with any numerical value such
    as the weight of the dead chicken. You are only
    allowed to use its actual dead body.

    What does the above have to do with my claim that neither 'impossibly
    false' nor 'impossibly true' are English.

    You did not seem to understand the meaning of the word impossible.

    You didn't use the word 'impossible'. You used the word 'impossibly'
    which is a different word. I understand the meaning of both perfectly well.

    In English, 'impossibly x' does not mean 'not possible to be x'.
    'Impossibly' is an *itensifier* with a meaning of extremely. So
    'impossibly true' would mean 'extremely true', which makes no sense
    since true is not a gradient concept.

    What is the difference between

    a) Q is a necessary consequence of P.
    b) Q is a consequence of P

    Give an example where b holds true but where a is false. If you
    can't do that, then your use of 'necessary' is completely
    meaningless verbiage.


    If someone smacks you in the face then
    you were hit in the face.

    If you were NOT hit in the face then
    someone did not smack you in the face.

    I asked for an example illustrating the different between 'necessary
    consequence' and mere 'consequence'. The two examples above don't
    even mention the word 'necessary'.

    This question was the central point of my post and you have ignored
    it. I maintain that when you use the term 'necessary' your just
    tossing in a meaningless word for no reason. If you can answer the
    above question you will show me wrong.


    The modal operators □ and ◊

    P □ Q --- P → Q
    0 ? 0 --- 0 1 0
    0 ? 1 --- 0 1 1
    1 0 0 --- 1 0 0
    1 1 1 --- 1 1 1

    The modal operators don't *have* truth tables anymore than any other quantifier does, and whatever it is you're trying to convey by '□' above applies only to a three-valued logic and certainly has nothing to do
    with necessity.

    If Q is a necessary consequence of P then
    we are not allowed to infer anything from ~P

    Again, you're tossing out the word 'necessary' without any indication
    that it has any particular meaning in your usage. What you write above
    is just as applicable to plain ordinary implication without the word 'necessary. So again I ask, can you give an example where (a) hold true
    but where (b) does not.

    a) Q is a consequence of P
    b) Q is a necessary consequence of P.

    Unless it is possible for the above two statements to have different
    truth values, the word 'necessary' is serving absolutely no purpose.

    In modal logic, P → Q and □(P → Q) mean distinctly different things with distinctly different meanings and these meanings are well-defined within
    that framework. In your usage it is completely unclear what difference,
    if any, holds between the two.

    André

    And there's nothing about the above table which in any way
    captures the meaning of 'necessity' so it's entirely unclear why >>>>>>>> you want to use the □ symbol here. Your '□' doesn't have any >>>>>>>> relation to necessity any more than '→' does above.

    Also note that formal logic is *not* c++. There's no such thing >>>>>>>> as operator overloading, so you can't take a unary operator and >>>>>>>> use it for some ill-defined binary operation as well. You need a >>>>>>>> new symbol since □ is already taken.

    P □ Q makes as much sense as P ¬ Q or P ∀ Q

    So how would you interpret 'necessity' without models?

    I note you didn't answer this. The notion of necessity in modal >>>>>>>> logic is intrinsically tied to model theory.

    How exactly are you defining 'necessity' if you're not making >>>>>>>> use of models?

    André


    Do you know what propositional logic is?
    then that is one way to avoid models.

    Propositional calculus uses models. It's also extremely limited.

    André


    Are you referring to truth tables as models?

    No.

    André


    Truth Tables ARE Propositional Model Theory

    No they're not. Truth tables are used to define the basic operators in
    a truth-functional logic.

    Please evaluate the propositional calculus expression P → Q. Without
    knowing what P or Q stand for you cannot do this. The model tells you
    what P and Q actually mean making it possible to assign a truth value
    to P → Q.

    André


    In propositional logic they are only Boolean variables
    with zero additional meaning besides true and false.
    If you think otherwise then cite a source.

    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,sci.math,comp.ai.philosophy,alt.philosophy on Sat Jul 4 20:18:41 2026
    From Newsgroup: comp.ai.philosophy

    On 7/4/2026 7:43 PM, André G. Isaak wrote:
    On 2026-07-04 18:33, olcott wrote:
    On 7/4/2026 7:23 PM, André G. Isaak wrote:
    On 2026-07-04 18:08, olcott wrote:
    On 7/4/2026 6:57 PM, André G. Isaak wrote:
    On 2026-07-04 17:42, olcott wrote:
    On 7/4/2026 5:11 PM, André G. Isaak wrote:
    On 2026-07-04 15:36, olcott wrote:
    On 7/4/2026 4:29 PM, André G. Isaak wrote:
    On 2026-07-04 14:58, olcott wrote:
    On 7/4/2026 11:59 AM, André G. Isaak wrote:
    On 2026-07-04 10:44, olcott wrote:
    On 7/4/2026 10:08 AM, André G. Isaak wrote:
    On 2026-07-04 07:21, olcott wrote:
    On 7/4/2026 1:47 AM, Mikko wrote:
    On 03/07/2026 18:04, olcott wrote:

    P ⇒ Q
    P → Q
    P ⊃ Q

    are all abolished and replaced with the binary >>>>>>>>>>>>>>>> form of logical necessity: P □ Q

    There is no 'binary form of logical necessity.

    That is why I just created one.

    But you didn't define it.

    □ is a unary operator and an expression like P □ Q makes >>>>>>>>>>>>> absolutely no sense.


    Q is a necessary consequence of P makes perfect sense
    and corrects a fundamental error in the definition of
    valid deductive inference.

    That would normally be written as □(P → Q),

    That does not perfectly preserve the complete
    necessity between P and Q.

    What on earth does it mean for there to be a "complete
    necessity between P and Q". Necessity applies to propositions. >>>>>>>>> It doesn't hold *between* things.

    □(P → Q) means that Q is necessarily implied by P. If you mean >>>>>>>>> something other than that you're really going to have to
    clarify what you mean.

    P □ Q   P → Q
    0 ? 0   0 1 0
    0 ? 1   0 1 1
    1 0 0   1 0 0
    1 1 1   1 1 1
    Q is a necessary consequence of P
    is the same as English If P then Q
    (a) false when P is true and Q is false
    (b) true  when P is true and Q is true
    (c) otherwise does not have a truth value.

    So again your veering into the territory of three-valued logic. >>>>>>>>> If a truth table contains any symbol other than T or F, you're >>>>>>>>> dealing with a three or more valued logic which means you have >>>>>>>>> to completely redefine every single logical operator before you >>>>>>>>> can proceed.


    The English if P then Q only actually tells you
    P(true) then necessarily Q(true)
    Q(false) then necessarily P(false)
    IT DOES NOT TELL YOU MORE THAN THIS AND
    IT IS STUPID MISTAKE TO ASSUME OTHERWISE
    THE WAY THAT IMPLICATION STUPIDLY DOES.

    You're introducing the word 'necessarily' here without any
    attempt to explain what is meant by this (by you).


    I always use the ordinary English meaning.
    If P is true then Q is impossibly false.
    If Q is false the P is impossibly true.

    'impossibly false' and 'impossibly true' aren't ordinary English.


    Tell me whether or not the numerical square root
    of a dead chicken can exist and why or why not.
    You must not start with any numerical value such
    as the weight of the dead chicken. You are only
    allowed to use its actual dead body.

    What does the above have to do with my claim that neither 'impossibly
    false' nor 'impossibly true' are English.

    You did not seem to understand the meaning of the word impossible.

    You didn't use the word 'impossible'. You used the word 'impossibly'
    which is a different word. I understand the meaning of both perfectly well.

    In English, 'impossibly x' does not mean 'not possible to be x'.
    'Impossibly' is an *itensifier* with a meaning of extremely. So
    'impossibly true' would mean 'extremely true', which makes no sense
    since true is not a gradient concept.

    What is the difference between

    a) Q is a necessary consequence of P.
    b) Q is a consequence of P

    Give an example where b holds true but where a is false. If you >>>>>>> can't do that, then your use of 'necessary' is completely
    meaningless verbiage.


    If someone smacks you in the face then
    you were hit in the face.

    If you were NOT hit in the face then
    someone did not smack you in the face.

    I asked for an example illustrating the different between
    'necessary consequence' and mere 'consequence'. The two examples
    above don't even mention the word 'necessary'.

    This question was the central point of my post and you have ignored
    it. I maintain that when you use the term 'necessary' your just
    tossing in a meaningless word for no reason. If you can answer the
    above question you will show me wrong.


    The modal operators □ and ◊

    P □ Q --- P → Q
    0 ? 0 --- 0 1 0
    0 ? 1 --- 0 1 1
    1 0 0 --- 1 0 0
    1 1 1 --- 1 1 1

    The modal operators don't *have* truth tables
    I corrected this stipulative definition below.

    Validity and Soundness
    A deductive argument is said to be valid if and only
    if it takes a form that makes it impossible for the
    premises to be true and the conclusion nevertheless
    to be false. https://iep.utm.edu/val-snd/

    Is corrected to mean
    A deductive argument is said to be valid if and only
    if it takes a form that anything besides true
    premises and true conclusion is invalid.

    P □ Q means P(true) ∧ Q(true) is valid
    everything else is invalid.

    P □ Q
    0 0 0
    0 0 1
    1 0 0
    1 1 1

    I finally said it clearly
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,sci.math,comp.ai.philosophy,alt.philosophy on Sat Jul 4 19:28:28 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-04 19:18, olcott wrote:
    On 7/4/2026 7:43 PM, André G. Isaak wrote:
    On 2026-07-04 18:33, olcott wrote:
    On 7/4/2026 7:23 PM, André G. Isaak wrote:
    On 2026-07-04 18:08, olcott wrote:
    On 7/4/2026 6:57 PM, André G. Isaak wrote:
    On 2026-07-04 17:42, olcott wrote:
    On 7/4/2026 5:11 PM, André G. Isaak wrote:
    On 2026-07-04 15:36, olcott wrote:
    On 7/4/2026 4:29 PM, André G. Isaak wrote:
    On 2026-07-04 14:58, olcott wrote:
    On 7/4/2026 11:59 AM, André G. Isaak wrote:
    On 2026-07-04 10:44, olcott wrote:
    On 7/4/2026 10:08 AM, André G. Isaak wrote:
    On 2026-07-04 07:21, olcott wrote:
    On 7/4/2026 1:47 AM, Mikko wrote:
    On 03/07/2026 18:04, olcott wrote:

    P ⇒ Q
    P → Q
    P ⊃ Q

    are all abolished and replaced with the binary >>>>>>>>>>>>>>>>> form of logical necessity: P □ Q

    There is no 'binary form of logical necessity.

    That is why I just created one.

    But you didn't define it.

    □ is a unary operator and an expression like P □ Q makes >>>>>>>>>>>>>> absolutely no sense.


    Q is a necessary consequence of P makes perfect sense >>>>>>>>>>>>> and corrects a fundamental error in the definition of >>>>>>>>>>>>> valid deductive inference.

    That would normally be written as □(P → Q),

    That does not perfectly preserve the complete
    necessity between P and Q.

    What on earth does it mean for there to be a "complete
    necessity between P and Q". Necessity applies to propositions. >>>>>>>>>> It doesn't hold *between* things.

    □(P → Q) means that Q is necessarily implied by P. If you mean >>>>>>>>>> something other than that you're really going to have to
    clarify what you mean.

    P □ Q   P → Q
    0 ? 0   0 1 0
    0 ? 1   0 1 1
    1 0 0   1 0 0
    1 1 1   1 1 1
    Q is a necessary consequence of P
    is the same as English If P then Q
    (a) false when P is true and Q is false
    (b) true  when P is true and Q is true
    (c) otherwise does not have a truth value.

    So again your veering into the territory of three-valued
    logic. If a truth table contains any symbol other than T or F, >>>>>>>>>> you're dealing with a three or more valued logic which means >>>>>>>>>> you have to completely redefine every single logical operator >>>>>>>>>> before you can proceed.


    The English if P then Q only actually tells you
    P(true) then necessarily Q(true)
    Q(false) then necessarily P(false)
    IT DOES NOT TELL YOU MORE THAN THIS AND
    IT IS STUPID MISTAKE TO ASSUME OTHERWISE
    THE WAY THAT IMPLICATION STUPIDLY DOES.

    You're introducing the word 'necessarily' here without any
    attempt to explain what is meant by this (by you).


    I always use the ordinary English meaning.
    If P is true then Q is impossibly false.
    If Q is false the P is impossibly true.

    'impossibly false' and 'impossibly true' aren't ordinary English.


    Tell me whether or not the numerical square root
    of a dead chicken can exist and why or why not.
    You must not start with any numerical value such
    as the weight of the dead chicken. You are only
    allowed to use its actual dead body.

    What does the above have to do with my claim that neither
    'impossibly false' nor 'impossibly true' are English.

    You did not seem to understand the meaning of the word impossible.

    You didn't use the word 'impossible'. You used the word 'impossibly'
    which is a different word. I understand the meaning of both perfectly
    well.

    In English, 'impossibly x' does not mean 'not possible to be x'.
    'Impossibly' is an *itensifier* with a meaning of extremely. So
    'impossibly true' would mean 'extremely true', which makes no sense
    since true is not a gradient concept.

    What is the difference between

    a) Q is a necessary consequence of P.
    b) Q is a consequence of P

    Give an example where b holds true but where a is false. If you >>>>>>>> can't do that, then your use of 'necessary' is completely
    meaningless verbiage.


    If someone smacks you in the face then
    you were hit in the face.

    If you were NOT hit in the face then
    someone did not smack you in the face.

    I asked for an example illustrating the different between
    'necessary consequence' and mere 'consequence'. The two examples
    above don't even mention the word 'necessary'.

    This question was the central point of my post and you have ignored
    it. I maintain that when you use the term 'necessary' your just
    tossing in a meaningless word for no reason. If you can answer the
    above question you will show me wrong.


    The modal operators □ and ◊

    P □ Q --- P → Q
    0 ? 0 --- 0 1 0
    0 ? 1 --- 0 1 1
    1 0 0 --- 1 0 0
    1 1 1 --- 1 1 1

    The modal operators don't *have* truth tables
    I corrected this stipulative definition below.

    Your definitions are not coherent.

    Validity and Soundness
    A deductive argument is said to be valid if and only
    if it takes a form that makes it impossible for the
    premises to be true and the conclusion nevertheless
    to be false. https://iep.utm.edu/val-snd/

    Is corrected to mean
    A deductive argument is said to be valid if and only
    if it takes a form that anything besides true
    premises and true conclusion is invalid.

    P □ Q means P(true) ∧ Q(true) is valid
    everything else is invalid.

    P □ Q
    0 0 0
    0 0 1
    1 0 0
    1 1 1

    That's simply the truth table for 'and'. It sheds no light on what it is
    your trying to convey by your use of 'necessity'. And the operator □ is already taken and is not a truth-functional operator so reusing it for something else is just plain stupid.

    And snipping my question doesn't make it go away:

    Can you give an example where (a) hold true but where (b) does not. An
    example from ordinary English is fine.

    a) Q is a consequence of P
    b) Q is a necessary consequence of P.

    If you can't, your use of the term 'necessary' serves absolutely no purpose.

    André
    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,sci.math,comp.ai.philosophy,alt.philosophy on Sat Jul 4 21:17:22 2026
    From Newsgroup: comp.ai.philosophy

    On 7/4/2026 8:28 PM, André G. Isaak wrote:
    On 2026-07-04 19:18, olcott wrote:
    On 7/4/2026 7:43 PM, André G. Isaak wrote:
    On 2026-07-04 18:33, olcott wrote:
    On 7/4/2026 7:23 PM, André G. Isaak wrote:
    On 2026-07-04 18:08, olcott wrote:
    On 7/4/2026 6:57 PM, André G. Isaak wrote:
    On 2026-07-04 17:42, olcott wrote:
    On 7/4/2026 5:11 PM, André G. Isaak wrote:
    On 2026-07-04 15:36, olcott wrote:
    On 7/4/2026 4:29 PM, André G. Isaak wrote:
    On 2026-07-04 14:58, olcott wrote:
    On 7/4/2026 11:59 AM, André G. Isaak wrote:
    On 2026-07-04 10:44, olcott wrote:
    On 7/4/2026 10:08 AM, André G. Isaak wrote:
    On 2026-07-04 07:21, olcott wrote:
    On 7/4/2026 1:47 AM, Mikko wrote:
    On 03/07/2026 18:04, olcott wrote:

    P ⇒ Q
    P → Q
    P ⊃ Q

    are all abolished and replaced with the binary >>>>>>>>>>>>>>>>>> form of logical necessity: P □ Q

    There is no 'binary form of logical necessity.

    That is why I just created one.

    But you didn't define it.

    □ is a unary operator and an expression like P □ Q makes >>>>>>>>>>>>>>> absolutely no sense.


    Q is a necessary consequence of P makes perfect sense >>>>>>>>>>>>>> and corrects a fundamental error in the definition of >>>>>>>>>>>>>> valid deductive inference.

    That would normally be written as □(P → Q),

    That does not perfectly preserve the complete
    necessity between P and Q.

    What on earth does it mean for there to be a "complete
    necessity between P and Q". Necessity applies to
    propositions. It doesn't hold *between* things.

    □(P → Q) means that Q is necessarily implied by P. If you >>>>>>>>>>> mean something other than that you're really going to have to >>>>>>>>>>> clarify what you mean.

    P □ Q   P → Q
    0 ? 0   0 1 0
    0 ? 1   0 1 1
    1 0 0   1 0 0
    1 1 1   1 1 1
    Q is a necessary consequence of P
    is the same as English If P then Q
    (a) false when P is true and Q is false
    (b) true  when P is true and Q is true
    (c) otherwise does not have a truth value.

    So again your veering into the territory of three-valued >>>>>>>>>>> logic. If a truth table contains any symbol other than T or >>>>>>>>>>> F, you're dealing with a three or more valued logic which >>>>>>>>>>> means you have to completely redefine every single logical >>>>>>>>>>> operator before you can proceed.


    The English if P then Q only actually tells you
    P(true) then necessarily Q(true)
    Q(false) then necessarily P(false)
    IT DOES NOT TELL YOU MORE THAN THIS AND
    IT IS STUPID MISTAKE TO ASSUME OTHERWISE
    THE WAY THAT IMPLICATION STUPIDLY DOES.

    You're introducing the word 'necessarily' here without any
    attempt to explain what is meant by this (by you).


    I always use the ordinary English meaning.
    If P is true then Q is impossibly false.
    If Q is false the P is impossibly true.

    'impossibly false' and 'impossibly true' aren't ordinary English. >>>>>>>

    Tell me whether or not the numerical square root
    of a dead chicken can exist and why or why not.
    You must not start with any numerical value such
    as the weight of the dead chicken. You are only
    allowed to use its actual dead body.

    What does the above have to do with my claim that neither
    'impossibly false' nor 'impossibly true' are English.

    You did not seem to understand the meaning of the word impossible.

    You didn't use the word 'impossible'. You used the word 'impossibly'
    which is a different word. I understand the meaning of both perfectly
    well.

    In English, 'impossibly x' does not mean 'not possible to be x'.
    'Impossibly' is an *itensifier* with a meaning of extremely. So
    'impossibly true' would mean 'extremely true', which makes no sense >>>>> since true is not a gradient concept.

    What is the difference between

    a) Q is a necessary consequence of P.
    b) Q is a consequence of P

    Give an example where b holds true but where a is false. If you >>>>>>>>> can't do that, then your use of 'necessary' is completely
    meaningless verbiage.


    If someone smacks you in the face then
    you were hit in the face.

    If you were NOT hit in the face then
    someone did not smack you in the face.

    I asked for an example illustrating the different between
    'necessary consequence' and mere 'consequence'. The two examples >>>>>>> above don't even mention the word 'necessary'.

    This question was the central point of my post and you have ignored >>>>> it. I maintain that when you use the term 'necessary' your just
    tossing in a meaningless word for no reason. If you can answer the
    above question you will show me wrong.


    The modal operators □ and ◊

    P □ Q --- P → Q
    0 ? 0 --- 0 1 0
    0 ? 1 --- 0 1 1
    1 0 0 --- 1 0 0
    1 1 1 --- 1 1 1

    The modal operators don't *have* truth tables
    I corrected this stipulative definition below.

    Your definitions are not coherent.

    Validity and Soundness
    A deductive argument is said to be valid if and only
    if it takes a form that makes it impossible for the
    premises to be true and the conclusion nevertheless
    to be false. https://iep.utm.edu/val-snd/

    Is corrected to mean
    A deductive argument is said to be valid if and only
    if it takes a form that anything besides true
    premises and true conclusion is invalid.

    P □ Q means P(true) ∧ Q(true) is valid
    everything else is invalid.

    P □ Q
    0 0 0
    0 0 1
    1 0 0
    1 1 1

    That's simply the truth table for 'and'. It sheds no light on what it is your trying to convey by your use of 'necessity'. And the operator □ is already taken and is not a truth-functional operator so reusing it for something else is just plain stupid.


    Dogs are cats → Monkeys have wings
    ¬(Dogs are cats □ Monkeys have wings)
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,sci.math,comp.ai.philosophy,alt.philosophy on Sat Jul 4 20:22:27 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-04 20:17, olcott wrote:
    On 7/4/2026 8:28 PM, André G. Isaak wrote:
    On 2026-07-04 19:18, olcott wrote:
    On 7/4/2026 7:43 PM, André G. Isaak wrote:
    On 2026-07-04 18:33, olcott wrote:
    On 7/4/2026 7:23 PM, André G. Isaak wrote:
    On 2026-07-04 18:08, olcott wrote:
    On 7/4/2026 6:57 PM, André G. Isaak wrote:
    On 2026-07-04 17:42, olcott wrote:
    On 7/4/2026 5:11 PM, André G. Isaak wrote:
    On 2026-07-04 15:36, olcott wrote:
    On 7/4/2026 4:29 PM, André G. Isaak wrote:
    On 2026-07-04 14:58, olcott wrote:
    On 7/4/2026 11:59 AM, André G. Isaak wrote:
    On 2026-07-04 10:44, olcott wrote:
    On 7/4/2026 10:08 AM, André G. Isaak wrote:
    On 2026-07-04 07:21, olcott wrote:
    On 7/4/2026 1:47 AM, Mikko wrote:
    On 03/07/2026 18:04, olcott wrote:

    P ⇒ Q
    P → Q
    P ⊃ Q

    are all abolished and replaced with the binary >>>>>>>>>>>>>>>>>>> form of logical necessity: P □ Q

    There is no 'binary form of logical necessity.

    That is why I just created one.

    But you didn't define it.

    □ is a unary operator and an expression like P □ Q makes >>>>>>>>>>>>>>>> absolutely no sense.


    Q is a necessary consequence of P makes perfect sense >>>>>>>>>>>>>>> and corrects a fundamental error in the definition of >>>>>>>>>>>>>>> valid deductive inference.

    That would normally be written as □(P → Q),

    That does not perfectly preserve the complete
    necessity between P and Q.

    What on earth does it mean for there to be a "complete >>>>>>>>>>>> necessity between P and Q". Necessity applies to
    propositions. It doesn't hold *between* things.

    □(P → Q) means that Q is necessarily implied by P. If you >>>>>>>>>>>> mean something other than that you're really going to have >>>>>>>>>>>> to clarify what you mean.

    P □ Q   P → Q
    0 ? 0   0 1 0
    0 ? 1   0 1 1
    1 0 0   1 0 0
    1 1 1   1 1 1
    Q is a necessary consequence of P
    is the same as English If P then Q
    (a) false when P is true and Q is false
    (b) true  when P is true and Q is true
    (c) otherwise does not have a truth value.

    So again your veering into the territory of three-valued >>>>>>>>>>>> logic. If a truth table contains any symbol other than T or >>>>>>>>>>>> F, you're dealing with a three or more valued logic which >>>>>>>>>>>> means you have to completely redefine every single logical >>>>>>>>>>>> operator before you can proceed.


    The English if P then Q only actually tells you
    P(true) then necessarily Q(true)
    Q(false) then necessarily P(false)
    IT DOES NOT TELL YOU MORE THAN THIS AND
    IT IS STUPID MISTAKE TO ASSUME OTHERWISE
    THE WAY THAT IMPLICATION STUPIDLY DOES.

    You're introducing the word 'necessarily' here without any >>>>>>>>>> attempt to explain what is meant by this (by you).


    I always use the ordinary English meaning.
    If P is true then Q is impossibly false.
    If Q is false the P is impossibly true.

    'impossibly false' and 'impossibly true' aren't ordinary English. >>>>>>>>

    Tell me whether or not the numerical square root
    of a dead chicken can exist and why or why not.
    You must not start with any numerical value such
    as the weight of the dead chicken. You are only
    allowed to use its actual dead body.

    What does the above have to do with my claim that neither
    'impossibly false' nor 'impossibly true' are English.

    You did not seem to understand the meaning of the word impossible.

    You didn't use the word 'impossible'. You used the word 'impossibly'
    which is a different word. I understand the meaning of both
    perfectly well.

    In English, 'impossibly x' does not mean 'not possible to be x'.
    'Impossibly' is an *itensifier* with a meaning of extremely. So
    'impossibly true' would mean 'extremely true', which makes no
    sense since true is not a gradient concept.

    What is the difference between

    a) Q is a necessary consequence of P.
    b) Q is a consequence of P

    Give an example where b holds true but where a is false. If >>>>>>>>>> you can't do that, then your use of 'necessary' is completely >>>>>>>>>> meaningless verbiage.


    If someone smacks you in the face then
    you were hit in the face.

    If you were NOT hit in the face then
    someone did not smack you in the face.

    I asked for an example illustrating the different between
    'necessary consequence' and mere 'consequence'. The two examples >>>>>>>> above don't even mention the word 'necessary'.

    This question was the central point of my post and you have
    ignored it. I maintain that when you use the term 'necessary' your >>>>>> just tossing in a meaningless word for no reason. If you can
    answer the above question you will show me wrong.


    The modal operators □ and ◊

    P □ Q --- P → Q
    0 ? 0 --- 0 1 0
    0 ? 1 --- 0 1 1
    1 0 0 --- 1 0 0
    1 1 1 --- 1 1 1

    The modal operators don't *have* truth tables
    I corrected this stipulative definition below.

    Your definitions are not coherent.

    Validity and Soundness
    A deductive argument is said to be valid if and only
    if it takes a form that makes it impossible for the
    premises to be true and the conclusion nevertheless
    to be false. https://iep.utm.edu/val-snd/

    Is corrected to mean
    A deductive argument is said to be valid if and only
    if it takes a form that anything besides true
    premises and true conclusion is invalid.

    P □ Q means P(true) ∧ Q(true) is valid
    everything else is invalid.

    P □ Q
    0 0 0
    0 0 1
    1 0 0
    1 1 1

    That's simply the truth table for 'and'. It sheds no light on what it
    is your trying to convey by your use of 'necessity'. And the operator
    □ is already taken and is not a truth-functional operator so reusing
    it for something else is just plain stupid.


    Dogs are cats → Monkeys have wings
    ¬(Dogs are cats □ Monkeys have wings)

    I have no idea what point you're trying to make with this example. The
    truth table you gave for your poorly named □ is just the truth table for and. Giving it a different symbol achieves absolutely nothing. It
    certainly doesn't magically change the meaning of 'and' to anything
    involving the word 'necessary'.

    Playing around with truth tables isn't going to get you anywhere.
    Standard boolean logic is already truth-functionally complete, so there absolutely no new truth table you can produce that can't already be
    expressed using standard operators.

    André
    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,sci.math,comp.ai.philosophy,alt.philosophy on Sat Jul 4 21:29:58 2026
    From Newsgroup: comp.ai.philosophy

    On 7/4/2026 8:28 PM, André G. Isaak wrote:
    On 2026-07-04 19:18, olcott wrote:
    On 7/4/2026 7:43 PM, André G. Isaak wrote:
    On 2026-07-04 18:33, olcott wrote:
    On 7/4/2026 7:23 PM, André G. Isaak wrote:
    On 2026-07-04 18:08, olcott wrote:
    On 7/4/2026 6:57 PM, André G. Isaak wrote:
    On 2026-07-04 17:42, olcott wrote:
    On 7/4/2026 5:11 PM, André G. Isaak wrote:
    On 2026-07-04 15:36, olcott wrote:
    On 7/4/2026 4:29 PM, André G. Isaak wrote:
    On 2026-07-04 14:58, olcott wrote:
    On 7/4/2026 11:59 AM, André G. Isaak wrote:
    On 2026-07-04 10:44, olcott wrote:
    On 7/4/2026 10:08 AM, André G. Isaak wrote:
    On 2026-07-04 07:21, olcott wrote:
    On 7/4/2026 1:47 AM, Mikko wrote:
    On 03/07/2026 18:04, olcott wrote:

    P ⇒ Q
    P → Q
    P ⊃ Q

    are all abolished and replaced with the binary >>>>>>>>>>>>>>>>>> form of logical necessity: P □ Q

    There is no 'binary form of logical necessity.

    That is why I just created one.

    But you didn't define it.

    □ is a unary operator and an expression like P □ Q makes >>>>>>>>>>>>>>> absolutely no sense.


    Q is a necessary consequence of P makes perfect sense >>>>>>>>>>>>>> and corrects a fundamental error in the definition of >>>>>>>>>>>>>> valid deductive inference.

    That would normally be written as □(P → Q),

    That does not perfectly preserve the complete
    necessity between P and Q.

    What on earth does it mean for there to be a "complete
    necessity between P and Q". Necessity applies to
    propositions. It doesn't hold *between* things.

    □(P → Q) means that Q is necessarily implied by P. If you >>>>>>>>>>> mean something other than that you're really going to have to >>>>>>>>>>> clarify what you mean.

    P □ Q   P → Q
    0 ? 0   0 1 0
    0 ? 1   0 1 1
    1 0 0   1 0 0
    1 1 1   1 1 1
    Q is a necessary consequence of P
    is the same as English If P then Q
    (a) false when P is true and Q is false
    (b) true  when P is true and Q is true
    (c) otherwise does not have a truth value.

    So again your veering into the territory of three-valued >>>>>>>>>>> logic. If a truth table contains any symbol other than T or >>>>>>>>>>> F, you're dealing with a three or more valued logic which >>>>>>>>>>> means you have to completely redefine every single logical >>>>>>>>>>> operator before you can proceed.


    The English if P then Q only actually tells you
    P(true) then necessarily Q(true)
    Q(false) then necessarily P(false)
    IT DOES NOT TELL YOU MORE THAN THIS AND
    IT IS STUPID MISTAKE TO ASSUME OTHERWISE
    THE WAY THAT IMPLICATION STUPIDLY DOES.

    You're introducing the word 'necessarily' here without any
    attempt to explain what is meant by this (by you).


    I always use the ordinary English meaning.
    If P is true then Q is impossibly false.
    If Q is false the P is impossibly true.

    'impossibly false' and 'impossibly true' aren't ordinary English. >>>>>>>

    Tell me whether or not the numerical square root
    of a dead chicken can exist and why or why not.
    You must not start with any numerical value such
    as the weight of the dead chicken. You are only
    allowed to use its actual dead body.

    What does the above have to do with my claim that neither
    'impossibly false' nor 'impossibly true' are English.

    You did not seem to understand the meaning of the word impossible.

    You didn't use the word 'impossible'. You used the word 'impossibly'
    which is a different word. I understand the meaning of both perfectly
    well.

    In English, 'impossibly x' does not mean 'not possible to be x'.
    'Impossibly' is an *itensifier* with a meaning of extremely. So
    'impossibly true' would mean 'extremely true', which makes no sense >>>>> since true is not a gradient concept.

    What is the difference between

    a) Q is a necessary consequence of P.
    b) Q is a consequence of P

    Give an example where b holds true but where a is false. If you >>>>>>>>> can't do that, then your use of 'necessary' is completely
    meaningless verbiage.


    If someone smacks you in the face then
    you were hit in the face.

    If you were NOT hit in the face then
    someone did not smack you in the face.

    I asked for an example illustrating the different between
    'necessary consequence' and mere 'consequence'. The two examples >>>>>>> above don't even mention the word 'necessary'.

    This question was the central point of my post and you have ignored >>>>> it. I maintain that when you use the term 'necessary' your just
    tossing in a meaningless word for no reason. If you can answer the
    above question you will show me wrong.


    The modal operators □ and ◊

    P □ Q --- P → Q
    0 ? 0 --- 0 1 0
    0 ? 1 --- 0 1 1
    1 0 0 --- 1 0 0
    1 1 1 --- 1 1 1

    The modal operators don't *have* truth tables
    I corrected this stipulative definition below.

    Your definitions are not coherent.

    Validity and Soundness
    A deductive argument is said to be valid if and only
    if it takes a form that makes it impossible for the
    premises to be true and the conclusion nevertheless
    to be false. https://iep.utm.edu/val-snd/

    Is corrected to mean
    A deductive argument is said to be valid if and only
    if it takes a form that anything besides true
    premises and true conclusion is invalid.

    P □ Q means P(true) ∧ Q(true) is valid
    everything else is invalid.

    P □ Q
    0 0 0
    0 0 0
    1 0 0
    1 1 1

    That's simply the truth table for 'and'.

    It had a typo

    It sheds no light on what it is
    your trying to convey by your use of 'necessity'. And the operator □ is already taken and is not a truth-functional operator so reusing it for something else is just plain stupid.

    And snipping my question doesn't make it go away:

    Can you give an example where (a) hold true but where (b) does not. An example from ordinary English is fine.

    a) Q is a consequence of P
    b) Q is a necessary consequence of P.

    If you can't, your use of the term 'necessary' serves absolutely no
    purpose.

    André

    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,sci.math,comp.ai.philosophy,alt.philosophy on Sat Jul 4 20:50:15 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-04 20:29, olcott wrote:
    On 7/4/2026 8:28 PM, André G. Isaak wrote:
    On 2026-07-04 19:18, olcott wrote:
    On 7/4/2026 7:43 PM, André G. Isaak wrote:
    On 2026-07-04 18:33, olcott wrote:
    On 7/4/2026 7:23 PM, André G. Isaak wrote:
    On 2026-07-04 18:08, olcott wrote:
    On 7/4/2026 6:57 PM, André G. Isaak wrote:
    On 2026-07-04 17:42, olcott wrote:
    On 7/4/2026 5:11 PM, André G. Isaak wrote:
    On 2026-07-04 15:36, olcott wrote:
    On 7/4/2026 4:29 PM, André G. Isaak wrote:
    On 2026-07-04 14:58, olcott wrote:
    On 7/4/2026 11:59 AM, André G. Isaak wrote:
    On 2026-07-04 10:44, olcott wrote:
    On 7/4/2026 10:08 AM, André G. Isaak wrote:
    On 2026-07-04 07:21, olcott wrote:
    On 7/4/2026 1:47 AM, Mikko wrote:
    On 03/07/2026 18:04, olcott wrote:

    P ⇒ Q
    P → Q
    P ⊃ Q

    are all abolished and replaced with the binary >>>>>>>>>>>>>>>>>>> form of logical necessity: P □ Q

    There is no 'binary form of logical necessity.

    That is why I just created one.

    But you didn't define it.

    □ is a unary operator and an expression like P □ Q makes >>>>>>>>>>>>>>>> absolutely no sense.


    Q is a necessary consequence of P makes perfect sense >>>>>>>>>>>>>>> and corrects a fundamental error in the definition of >>>>>>>>>>>>>>> valid deductive inference.

    That would normally be written as □(P → Q),

    That does not perfectly preserve the complete
    necessity between P and Q.

    What on earth does it mean for there to be a "complete >>>>>>>>>>>> necessity between P and Q". Necessity applies to
    propositions. It doesn't hold *between* things.

    □(P → Q) means that Q is necessarily implied by P. If you >>>>>>>>>>>> mean something other than that you're really going to have >>>>>>>>>>>> to clarify what you mean.

    P □ Q   P → Q
    0 ? 0   0 1 0
    0 ? 1   0 1 1
    1 0 0   1 0 0
    1 1 1   1 1 1
    Q is a necessary consequence of P
    is the same as English If P then Q
    (a) false when P is true and Q is false
    (b) true  when P is true and Q is true
    (c) otherwise does not have a truth value.

    So again your veering into the territory of three-valued >>>>>>>>>>>> logic. If a truth table contains any symbol other than T or >>>>>>>>>>>> F, you're dealing with a three or more valued logic which >>>>>>>>>>>> means you have to completely redefine every single logical >>>>>>>>>>>> operator before you can proceed.


    The English if P then Q only actually tells you
    P(true) then necessarily Q(true)
    Q(false) then necessarily P(false)
    IT DOES NOT TELL YOU MORE THAN THIS AND
    IT IS STUPID MISTAKE TO ASSUME OTHERWISE
    THE WAY THAT IMPLICATION STUPIDLY DOES.

    You're introducing the word 'necessarily' here without any >>>>>>>>>> attempt to explain what is meant by this (by you).


    I always use the ordinary English meaning.
    If P is true then Q is impossibly false.
    If Q is false the P is impossibly true.

    'impossibly false' and 'impossibly true' aren't ordinary English. >>>>>>>>

    Tell me whether or not the numerical square root
    of a dead chicken can exist and why or why not.
    You must not start with any numerical value such
    as the weight of the dead chicken. You are only
    allowed to use its actual dead body.

    What does the above have to do with my claim that neither
    'impossibly false' nor 'impossibly true' are English.

    You did not seem to understand the meaning of the word impossible.

    You didn't use the word 'impossible'. You used the word 'impossibly'
    which is a different word. I understand the meaning of both
    perfectly well.

    In English, 'impossibly x' does not mean 'not possible to be x'.
    'Impossibly' is an *itensifier* with a meaning of extremely. So
    'impossibly true' would mean 'extremely true', which makes no
    sense since true is not a gradient concept.

    What is the difference between

    a) Q is a necessary consequence of P.
    b) Q is a consequence of P

    Give an example where b holds true but where a is false. If >>>>>>>>>> you can't do that, then your use of 'necessary' is completely >>>>>>>>>> meaningless verbiage.


    If someone smacks you in the face then
    you were hit in the face.

    If you were NOT hit in the face then
    someone did not smack you in the face.

    I asked for an example illustrating the different between
    'necessary consequence' and mere 'consequence'. The two examples >>>>>>>> above don't even mention the word 'necessary'.

    This question was the central point of my post and you have
    ignored it. I maintain that when you use the term 'necessary' your >>>>>> just tossing in a meaningless word for no reason. If you can
    answer the above question you will show me wrong.


    The modal operators □ and ◊

    P □ Q --- P → Q
    0 ? 0 --- 0 1 0
    0 ? 1 --- 0 1 1
    1 0 0 --- 1 0 0
    1 1 1 --- 1 1 1

    The modal operators don't *have* truth tables
    I corrected this stipulative definition below.

    Your definitions are not coherent.

    Validity and Soundness
    A deductive argument is said to be valid if and only
    if it takes a form that makes it impossible for the
    premises to be true and the conclusion nevertheless
    to be false. https://iep.utm.edu/val-snd/

    Is corrected to mean
    A deductive argument is said to be valid if and only
    if it takes a form that anything besides true
    premises and true conclusion is invalid.

    P □ Q means P(true) ∧ Q(true) is valid
    everything else is invalid.

    P □ Q
    0 0 0
    0 0 0
    1 0 0
    1 1 1

    That's simply the truth table for 'and'.

    It had a typo

    Don't correct it in the quoted text. By doing so you're claiming that
    the above is what you originally wrote which is simply dishonest.

    Now what you've got isn't even a valid truth-table since it has no value
    for when P is 0 and Q is 1. Instead you've got two entries for when both
    are 0.

    It sheds no light on what it is your trying to convey by your use of
    'necessity'. And the operator □ is already taken and is not a
    truth-functional operator so reusing it for something else is just
    plain stupid.

    And snipping my question doesn't make it go away:

    Can you give an example where (a) hold true but where (b) does not. An
    example from ordinary English is fine.

    a) Q is a consequence of P
    b) Q is a necessary consequence of P.

    If you can't, your use of the term 'necessary' serves absolutely no
    purpose.

    Still no answer to the above?

    If you're actually interesting in explaining what it is that you mean by 'necessary' you would answer the above.

    André
    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,sci.math,comp.ai.philosophy,alt.philosophy on Sat Jul 4 22:17:01 2026
    From Newsgroup: comp.ai.philosophy

    On 7/4/2026 8:28 PM, André G. Isaak wrote:
    Q is a necessary consequence of P

    seems best handled by
    https://en.wikipedia.org/wiki/Relevance_logic
    or Parry's Entailment Logic

    P □ Q
    0 0 0
    0 0 0
    1 0 0
    1 1 1

    Changes the notion of valid inference too much.
    I myself simply leap all the way to the end and
    say that the full natural language semantic meaning
    must be encoded for both P and Q such that P ⊢ Q
    by semantic entailment specified syntactically.
    This is accomplished in a language such as CycL. https://en.wikipedia.org/wiki/CycL
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,sci.math,comp.ai.philosophy,alt.philosophy on Sat Jul 4 21:23:44 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-04 21:17, olcott wrote:
    On 7/4/2026 8:28 PM, André G. Isaak wrote:
    Q is a necessary consequence of P

    seems best handled by
    https://en.wikipedia.org/wiki/Relevance_logic
    or Parry's Entailment Logic

    P □ Q
    0 0 0
    0 0 0
    1 0 0
    1 1 1


    That's *not* a valid truth table. It has no entry for P = 0 and Q = 1.

    And Parry is working in relevance logic. He doesn't deal with modal expressions like 'necessary'.

    André
    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,sci.math,comp.ai.philosophy,alt.philosophy on Sat Jul 4 22:45:21 2026
    From Newsgroup: comp.ai.philosophy

    On 7/4/2026 10:23 PM, André G. Isaak wrote:
    On 2026-07-04 21:17, olcott wrote:
    On 7/4/2026 8:28 PM, André G. Isaak wrote:
    Q is a necessary consequence of P

    seems best handled by
    https://en.wikipedia.org/wiki/Relevance_logic
    or Parry's Entailment Logic

    P Q □
    0 0 0
    0 1 0
    1 0 0
    1 1 1


    That's *not* a valid truth table. It has no entry for P = 0 and Q = 1.

    And Parry is working in relevance logic. He doesn't deal with modal expressions like 'necessary'.

    André


    You did not bother to notice that I just rejected
    that whole idea in the part that you ignored.
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,sci.math,comp.ai.philosophy,alt.philosophy on Sat Jul 4 21:52:04 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-04 21:17, olcott wrote:
    On 7/4/2026 8:28 PM, André G. Isaak wrote:
    Q is a necessary consequence of P

    seems best handled by
    https://en.wikipedia.org/wiki/Relevance_logic
    or Parry's Entailment Logic

    P □ Q
    0 0 0
    0 0 0
    1 0 0
    1 1 1

    Changes the notion of valid inference too much.

    It doesn't change anything. It's simply invalid since its not a
    well-formed truth table.

    I myself simply leap all the way to the end and
    say that the full natural language semantic meaning
    must be encoded for both P and Q such that P ⊢ Q
    by semantic entailment specified syntactically.
    This is accomplished in a language such as CycL. https://en.wikipedia.org/wiki/CycL

    The above sheds no light on anything. In particular it doesn't clarify
    what you think the difference between entailment and necessary
    entailment is which is the question I have been trying to get you to
    address.
    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,sci.math,comp.ai.philosophy,alt.philosophy on Sat Jul 4 23:05:14 2026
    From Newsgroup: comp.ai.philosophy

    On 7/4/2026 10:52 PM, André G. Isaak wrote:
    On 2026-07-04 21:17, olcott wrote:
    On 7/4/2026 8:28 PM, André G. Isaak wrote:
    Q is a necessary consequence of P

    seems best handled by
    https://en.wikipedia.org/wiki/Relevance_logic
    or Parry's Entailment Logic

    P □ Q
    0 0 0
    0 0 0
    1 0 0
    1 1 1

    Changes the notion of valid inference too much.

    It doesn't change anything. It's simply invalid since its not a well-
    formed truth table.

    I myself simply leap all the way to the end and
    say that the full natural language semantic meaning
    must be encoded for both P and Q such that P ⊢ Q
    by semantic entailment specified syntactically.
    This is accomplished in a language such as CycL.
    https://en.wikipedia.org/wiki/CycL

    The above sheds no light on anything. In particular it doesn't clarify
    what you think the difference between entailment and necessary
    entailment is which is the question I have been trying to get you to address.



    *This says the whole thing better*
    P ⊢ Q means: syntactic derivation implements semantic entailment encoded
    in the language. The inference rules are syntactic rules that realize
    semantic entailment. These are the only allowed inference steps. The entailment rules depend on the represented domain.

    Dogs are cats ⊢ Monkeys have wings // rejected
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,sci.math,comp.ai.philosophy,alt.philosophy on Sun Jul 5 14:40:47 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-04 22:05, olcott wrote:
    On 7/4/2026 10:52 PM, André G. Isaak wrote:
    On 2026-07-04 21:17, olcott wrote:
    On 7/4/2026 8:28 PM, André G. Isaak wrote:
    Q is a necessary consequence of P

    seems best handled by
    https://en.wikipedia.org/wiki/Relevance_logic
    or Parry's Entailment Logic

    P □ Q
    0 0 0
    0 0 0
    1 0 0
    1 1 1

    Changes the notion of valid inference too much.

    It doesn't change anything. It's simply invalid since its not a well-
    formed truth table.

    I myself simply leap all the way to the end and
    say that the full natural language semantic meaning
    must be encoded for both P and Q such that P ⊢ Q
    by semantic entailment specified syntactically.
    This is accomplished in a language such as CycL.
    https://en.wikipedia.org/wiki/CycL

    The above sheds no light on anything. In particular it doesn't clarify
    what you think the difference between entailment and necessary
    entailment is which is the question I have been trying to get you to
    address.



    *This says the whole thing better*
    P ⊢ Q means: syntactic derivation implements semantic entailment encoded in the language. The inference rules are syntactic rules that realize semantic entailment. These are the only allowed inference steps. The entailment rules depend on the represented domain.

    Dogs are cats ⊢ Monkeys have wings // rejected

    The topic under discussion was Q, which contains neither dogs, cats,
    monkeys, or wings.

    Why don't you illustrate your claim with an actual example from
    arithmetic. Say, for example 9 × 5 = 45. What exactly would be the
    "semantic entailments encoded in the language" involved here?

    André
    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,sci.math,comp.ai.philosophy,alt.philosophy on Sun Jul 5 15:51:56 2026
    From Newsgroup: comp.ai.philosophy

    On 7/5/2026 3:40 PM, André G. Isaak wrote:
    On 2026-07-04 22:05, olcott wrote:
    On 7/4/2026 10:52 PM, André G. Isaak wrote:
    On 2026-07-04 21:17, olcott wrote:
    On 7/4/2026 8:28 PM, André G. Isaak wrote:
    Q is a necessary consequence of P

    seems best handled by
    https://en.wikipedia.org/wiki/Relevance_logic
    or Parry's Entailment Logic

    P □ Q
    0 0 0
    0 0 0
    1 0 0
    1 1 1

    Changes the notion of valid inference too much.

    It doesn't change anything. It's simply invalid since its not a well-
    formed truth table.

    I myself simply leap all the way to the end and
    say that the full natural language semantic meaning
    must be encoded for both P and Q such that P ⊢ Q
    by semantic entailment specified syntactically.
    This is accomplished in a language such as CycL.
    https://en.wikipedia.org/wiki/CycL

    The above sheds no light on anything. In particular it doesn't
    clarify what you think the difference between entailment and
    necessary entailment is which is the question I have been trying to
    get you to address.



    *This says the whole thing better*
    P ⊢ Q means: syntactic derivation implements semantic entailment
    encoded in the language. The inference rules are syntactic rules that
    realize semantic entailment. These are the only allowed inference
    steps. The entailment rules depend on the represented domain.

    Dogs are cats ⊢ Monkeys have wings // rejected

    The topic under discussion was Q, which contains neither dogs, cats, monkeys, or wings.


    No it is: William T. Parry gets rid of Disjunction introduction

    Why don't you illustrate your claim with an actual example from
    arithmetic. Say, for example 9 × 5 = 45. What exactly would be the "semantic entailments encoded in the language" involved here?

    André


    PTS takes the inference steps of PA as semantic
    entailment in that case.
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to sci.logic,comp.theory,sci.math,comp.ai.philosophy on Mon Jul 6 10:16:11 2026
    From Newsgroup: comp.ai.philosophy

    On 04/07/2026 16:15, olcott wrote:
    On 7/4/2026 1:37 AM, Mikko wrote:
    On 03/07/2026 17:46, olcott wrote:
    On 7/3/2026 3:17 AM, Mikko wrote:
    On 02/07/2026 17:37, olcott wrote:

    x = "The Moon is made from green cheese"
    y = "Donald Trump is the one and only Lord and Savior Jesus Christ:
    POE concludes (x ∧ ¬x) ⊢ y

    "the principle of explosion is the theorem according to
      which any statement can be proven from a contradiction"
    https://en.wikipedia.org/wiki/Principle_of_explosion

    When you pay attention to the meaning of the words
    and correctly apply correct semantic entailment on
    the basis of the meaning of those words then the
    principle of explosion is a PSYCHOTIC BREAK FROM REALITY.

    No, it is not. The premise x above is a break from reality. But that
    is not in logic, it was introduced by you. Even without the principle
    of explosion it is possible to infer a false conclusion from a false
    premise.

    Yes. From "I am 35 feet tall" ⊢ "I am 35 feet tall"
    and as you said my premise is literally FALSE
    (P ∧ ~P) ⊢ FALSE

    The principle of explosion merely facilitates tinding a
    conclusion that is so obviously false that it convincingly proves
    that the remise is false.

    There is nothing semantically relevant that can be
    proven from a contradiction besides bare FALSE and
    bare FALSE only entails bare FALSE.

    Yes, there is. From the contradiction "I have blue eyes and
    I don't have blue eyes" one can prove "I have blue eyes" and
    "I don't have blue eyes", both of which are semantically
    relevant, and one of which in addition is false.

    That is greatly restricted from the POE.

    Restrictions from the POE make lie detection harder and therefore lying
    easier. You may like that but others have different preferencies.
    --
    Mikko
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to sci.logic,comp.theory,comp.ai.philosophy,sci.math,alt.philosophy on Mon Jul 6 10:20:27 2026
    From Newsgroup: comp.ai.philosophy

    On 04/07/2026 20:09, olcott wrote:
    On 7/4/2026 3:15 AM, Mikko wrote:
    On 03/07/2026 17:50, olcott wrote:
    On 7/3/2026 3:22 AM, Mikko wrote:
    On 02/07/2026 17:40, olcott wrote:

    Hypotheticals are useful for making decisions.

    Which is an example of the usefulness of a break from reality. It
    als shows that calling a break from reality "psychotic" without
    further consideration.

    That Donald Trump might start WW III is a hypothetical
    that can possibly be is useful.

    Whether Donald Trump will start WW III is not yet known, so that
    cannot be called an example of counter-factual.

    It is an example of hypothetical. You did not pay attention.

    I did. You did not. The topic of the discussion before the part shown
    above was counter-factual sentences.

    That Donald Trump is the one and only Lord and Savior Jesus Christ
    is a hypothetical that cannot possible be making it useless.

    Maybe, but irrelevent as you did not claim it be useful when you
    presented it.
    --
    Mikko
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to sci.logic,comp.theory,sci.math,comp.ai.philosophy on Mon Jul 6 10:40:20 2026
    From Newsgroup: comp.ai.philosophy

    On 04/07/2026 16:21, olcott wrote:
    On 7/4/2026 1:47 AM, Mikko wrote:
    On 03/07/2026 18:04, olcott wrote:
    On 7/3/2026 3:24 AM, Mikko wrote:
    On 02/07/2026 17:40, olcott wrote:
    On 7/2/2026 1:31 AM, Mikko wrote:

    Getting rid of the principle of explosion makes as much sense as
    getting rid of fire alarms. It makes much more sense to get rid
    of fires and false premises.

    Then you are irrational

    Matter of opinion,

    Matter of correctly and coherently computing the notion
    of truth. My correction to the Principle of Explosion:
    (P ∧ ~P) ⊢ FALSE
    FALSE ⊢ FALSE

    but I think that most of people would consder
    getting rid of fires is more rational that getting rid of fire
    alarms.

    It is not a fire alarm it is getting rid of semantics
    within inference. My correct reasoning correction to
    logic gets rid of every type of inference besides
    semantic entailment.

    Getting rid of any type of inference does not make much difference
    as long as you get the same conclusions through other inferences.
    Only getting rid of some conscusions it makes a significant
    difference. But you have never shown an example of getting rid of
    a conclusion without losing a semantic entailment.

    POE always breaks semantic entailment

    How does 2 < 0 ∧ 1 < 2 → 1 < 0 break semantic enteilment?

    Validity and Soundness
    A deductive argument is said to be valid if
    and only if it takes a form that makes it
    impossible for the premises to be true and
    the conclusion nevertheless to be false.
    Otherwise, a deductive argument is said to
    be invalid. https://iep.utm.edu/val-snd/

    *That big mistake is corrected thusly*
    A deductive argument is said to be valid if
    and only if its conclusion is a necessary
    consequence of all of its premises Otherwise,
    a deductive argument is said to be invalid.

    P ⇒ Q
    P → Q
    P ⊃ Q

    are all abolished and replaced with the binary
    form of logical necessity: P □ Q

    You don't need any of above if you have ¬, ∨, and ∧.

    The notion of valid inference that I just established
    is the foundation of all semantic entailment.

    Irrelevant to the fact that you don't need any implication
    symbol if you have symbols for negation, disjunction, and
    conjunction.

    If you have a symbol for implication then it does not matter
    how this symbol looks like, though an asymmetric symbol would
    be better because the operation is asymmetric.
    --
    Mikko

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to sci.logic,comp.theory,sci.math,comp.ai.philosophy,alt.philosophy on Mon Jul 6 10:53:01 2026
    From Newsgroup: comp.ai.philosophy

    On 04/07/2026 20:11, olcott wrote:
    On 7/4/2026 3:16 AM, Mikko wrote:
    On 03/07/2026 18:04, olcott wrote:
    On 7/3/2026 3:24 AM, Mikko wrote:
    On 02/07/2026 17:40, olcott wrote:
    On 7/2/2026 1:31 AM, Mikko wrote:

    Getting rid of the principle of explosion makes as much sense as
    getting rid of fire alarms. It makes much more sense to get rid
    of fires and false premises.

    Then you are irrational

    Matter of opinion,

    Matter of correctly and coherently computing the notion
    of truth.

    You did not compute correctely, let aloone coherently, whether
    I an irrational. You onlu presented your opinion about it.

    Merely rhetoric entirely bereft of a supporting basis.

    I agree, that is a much better descrition of your claim about me,
    and perfectly compatible with my "matter of opinion".
    --
    Mikko
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to sci.logic,comp.theory,sci.math,comp.ai.philosophy on Mon Jul 6 13:17:58 2026
    From Newsgroup: comp.ai.philosophy

    On 04/07/2026 16:15, olcott wrote:
    On 7/4/2026 1:37 AM, Mikko wrote:
    On 03/07/2026 17:46, olcott wrote:
    On 7/3/2026 3:17 AM, Mikko wrote:
    On 02/07/2026 17:37, olcott wrote:

    x = "The Moon is made from green cheese"
    y = "Donald Trump is the one and only Lord and Savior Jesus Christ:
    POE concludes (x ∧ ¬x) ⊢ y

    "the principle of explosion is the theorem according to
      which any statement can be proven from a contradiction"
    https://en.wikipedia.org/wiki/Principle_of_explosion

    When you pay attention to the meaning of the words
    and correctly apply correct semantic entailment on
    the basis of the meaning of those words then the
    principle of explosion is a PSYCHOTIC BREAK FROM REALITY.

    No, it is not. The premise x above is a break from reality. But that
    is not in logic, it was introduced by you. Even without the principle
    of explosion it is possible to infer a false conclusion from a false
    premise.

    Yes. From "I am 35 feet tall" ⊢ "I am 35 feet tall"
    and as you said my premise is literally FALSE
    (P ∧ ~P) ⊢ FALSE

    The principle of explosion merely facilitates tinding a
    conclusion that is so obviously false that it convincingly proves
    that the remise is false.

    There is nothing semantically relevant that can be
    proven from a contradiction besides bare FALSE and
    bare FALSE only entails bare FALSE.

    Yes, there is. From the contradiction "I have blue eyes and
    I don't have blue eyes" one can prove "I have blue eyes" and
    "I don't have blue eyes", both of which are semantically
    relevant, and one of which in addition is false.


    That is greatly restricted from the POE.
     (P ∧ ~P) ⊢ FALSE // is what can really be proved semantically

    If you can prove that FALSE is true then what is not true?
    --
    Mikko
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Tristan Wibberley@tristan.wibberley+netnews2@alumni.manchester.ac.uk to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Mon Jul 6 12:49:37 2026
    From Newsgroup: comp.ai.philosophy

    On 26/06/2026 02:32, olcott wrote:
    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for
    Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many
    systems of analytic implication belonging to its ilk) is
    the rejection of the classically valid principle of Addition,
    sometimes also referred to as Disjunction Introduction. In
    other words, the principle leading from a formula ϕ to a
    disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary
    formula. Parry blamed on this principle the derivability
    of the paradoxes of strict implication—given that it is
    famously featured in Lewis’ derivation of an arbitrary
    formula ψ from a contradiction of the form ϕ ∧ ¬ϕ.

    https://philarchive.org/archive/SZMASL


    Is that available elsewhere without requiring that I agree to terms such
    as this expansive lot of stuff that has nothing to do with reading
    something that I should expect either is Parry or is no better:

    https://www.cloudflare.com/privacypolicy/
    --
    Tristan Wibberley

    The message body is Copyright (C) 2026 Tristan Wibberley except
    citations and quotations noted. All Rights Reserved except that you may,
    of course, cite it academically giving credit to me, distribute it
    verbatim as part of a usenet system or its archives, and use it to
    promote my greatness and general superiority without misrepresentation
    of my opinions other than my opinion of my greatness and general
    superiority which you _may_ misrepresent. You definitely MAY NOT train
    any production AI system with it but you may train experimental AI that
    will only be used for evaluation of the AI methods it implements.
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Mon Jul 6 08:45:09 2026
    From Newsgroup: comp.ai.philosophy

    On 7/6/2026 6:49 AM, Tristan Wibberley wrote:
    On 26/06/2026 02:32, olcott wrote:
    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for
    Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many
    systems of analytic implication belonging to its ilk) is
    the rejection of the classically valid principle of Addition,
    sometimes also referred to as Disjunction Introduction. In
    other words, the principle leading from a formula ϕ to a
    disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary
    formula. Parry blamed on this principle the derivability
    of the paradoxes of strict implication—given that it is
    famously featured in Lewis’ derivation of an arbitrary
    formula ψ from a contradiction of the form ϕ ∧ ¬ϕ.

    https://philarchive.org/archive/SZMASL


    Is that available elsewhere without requiring that I agree to terms such
    as this expansive lot of stuff that has nothing to do with reading
    something that I should expect either is Parry or is no better:

    https://www.cloudflare.com/privacypolicy/



    I figured out the getting rid of disjunction introduction
    is required by myself. William T. Parry is merely a guy
    that agrees with me. He did carry this idea further.

    Google Scholar crashed or I would have found you
    a better article. https://scholar.google.com/
    [William T. Parry, Entailment Logics

    https://www.google.com/books/edition/Directions_in_Relevant_Logic/7lzuCAAAQBAJ?hl=en&gbpv=1&printsec=frontcover]
    page 101

    https://www.google.com/books/edition/Meaning_and_Proscription_in_Formal_Logic/NCpEDwAAQBAJ?hl=en&gbpv=1&dq=William+T.+Parry,+Entailment+Logics&pg=PP7&printsec=frontcover
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From dbush@dbush.mobile@gmail.com to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Mon Jul 6 09:50:34 2026
    From Newsgroup: comp.ai.philosophy

    On 7/6/2026 9:45 AM, olcott wrote:
    On 7/6/2026 6:49 AM, Tristan Wibberley wrote:
    On 26/06/2026 02:32, olcott wrote:
    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for
    Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many
    systems of analytic implication belonging to its ilk) is
    the rejection of the classically valid principle of Addition,
    sometimes also referred to as Disjunction Introduction. In
    other words, the principle leading from a formula ϕ to a
    disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary
    formula. Parry blamed on this principle the derivability
    of the paradoxes of strict implication—given that it is
    famously featured in Lewis’ derivation of an arbitrary
    formula ψ from a contradiction of the form ϕ ∧ ¬ϕ.

    https://philarchive.org/archive/SZMASL


    Is that available elsewhere without requiring that I agree to terms such
    as this expansive lot of stuff that has nothing to do with reading
    something that I should expect either is Parry or is no better:

    https://www.cloudflare.com/privacypolicy/



    I figured out the getting rid of disjunction introduction
    is required by myself.

    But why would you do that when you agreed on the record that it's truth preserving? (see below):


    On 6/28/2026 11:56 PM, dbush wrote:
    On 6/27/2026 11:34 PM, dbush wrote:
    On 6/27/2026 11:23 PM, olcott wrote:
    On 6/27/2026 9:02 PM, dbush wrote:
    On 6/27/2026 9:53 PM, dbush wrote:
    On 6/27/2026 9:49 PM, olcott wrote:
    On 6/27/2026 8:42 PM, dbush wrote:
    On 6/27/2026 9:40 PM, olcott wrote:
    On 6/27/2026 8:29 PM, dbush wrote:
    Given that the following natural language statement is true:

    --------------------------------------
    Earth is the third planet from the sun.
    --------------------------------------

    In the following natural language statement:

    --------------------------------------
    At least one of the following statements is true:
    - Earth is the third planet from the sun.
    - <X>
    --------------------------------------

    Given that <X> is any *truth bearing* natural language statement,
    does there exist a statement X such that the condition "At least one
    of the following statements is true" is false?


    Head games will be ignored.


    Explain in detail how this is a head game.

    Failure to either answer the above question or explain how it is a
    head game in your next reply or within one hour of you next post in
    this newsgroup will be taken as your official, on-the-record admission
    that Disjunction introduction is in fact truth preserving and valid,
    and therefore so is the Principle of Explosion.


    Let the record show that Peter Olcott made the following post in this newsgroup:

    On 6/28/2026 10:52 PM, olcott wrote:
    Q also can't bake a birthday cake, this does not make
    Q in any way "incomplete" relative to what it was
    defined to do.
    ...

    And more that one hour has passed with no attempt to answer the above question or explain why it is a head game. Therefore, as per the above criteria:

    Let The Record Show

    That Peter Olcott

    Has *Officially* Admitted:

    That Disjunction introduction is in fact truth preserving and valid, and therefore so is the Principle of Explosion.
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Mon Jul 6 12:54:02 2026
    From Newsgroup: comp.ai.philosophy

    On 7/6/2026 5:17 AM, Mikko wrote:
    On 04/07/2026 16:15, olcott wrote:
    On 7/4/2026 1:37 AM, Mikko wrote:
    On 03/07/2026 17:46, olcott wrote:
    On 7/3/2026 3:17 AM, Mikko wrote:
    On 02/07/2026 17:37, olcott wrote:

    x = "The Moon is made from green cheese"
    y = "Donald Trump is the one and only Lord and Savior Jesus Christ: >>>>>> POE concludes (x ∧ ¬x) ⊢ y

    "the principle of explosion is the theorem according to
      which any statement can be proven from a contradiction"
    https://en.wikipedia.org/wiki/Principle_of_explosion

    When you pay attention to the meaning of the words
    and correctly apply correct semantic entailment on
    the basis of the meaning of those words then the
    principle of explosion is a PSYCHOTIC BREAK FROM REALITY.

    No, it is not. The premise x above is a break from reality. But that >>>>> is not in logic, it was introduced by you. Even without the principle >>>>> of explosion it is possible to infer a false conclusion from a false >>>>> premise.

    Yes. From "I am 35 feet tall" ⊢ "I am 35 feet tall"
    and as you said my premise is literally FALSE
    (P ∧ ~P) ⊢ FALSE

    The principle of explosion merely facilitates tinding a
    conclusion that is so obviously false that it convincingly proves
    that the remise is false.

    There is nothing semantically relevant that can be
    proven from a contradiction besides bare FALSE and
    bare FALSE only entails bare FALSE.

    Yes, there is. From the contradiction "I have blue eyes and
    I don't have blue eyes" one can prove "I have blue eyes" and
    "I don't have blue eyes", both of which are semantically
    relevant, and one of which in addition is false.


    That is greatly restricted from the POE.
      (P ∧ ~P) ⊢ FALSE // is what can really be proved semantically

    If you can prove that FALSE is true then what is not true?


    That is not proving that false is true.
    It is stipulating that contradictions
    only derive bare FALSE.
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Mon Jul 6 12:57:17 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-06 11:54, olcott wrote:
    On 7/6/2026 5:17 AM, Mikko wrote:
    On 04/07/2026 16:15, olcott wrote:
    On 7/4/2026 1:37 AM, Mikko wrote:
    On 03/07/2026 17:46, olcott wrote:
    On 7/3/2026 3:17 AM, Mikko wrote:
    On 02/07/2026 17:37, olcott wrote:

    x = "The Moon is made from green cheese"
    y = "Donald Trump is the one and only Lord and Savior Jesus Christ: >>>>>>> POE concludes (x ∧ ¬x) ⊢ y

    "the principle of explosion is the theorem according to
      which any statement can be proven from a contradiction"
    https://en.wikipedia.org/wiki/Principle_of_explosion

    When you pay attention to the meaning of the words
    and correctly apply correct semantic entailment on
    the basis of the meaning of those words then the
    principle of explosion is a PSYCHOTIC BREAK FROM REALITY.

    No, it is not. The premise x above is a break from reality. But that >>>>>> is not in logic, it was introduced by you. Even without the principle >>>>>> of explosion it is possible to infer a false conclusion from a false >>>>>> premise.

    Yes. From "I am 35 feet tall" ⊢ "I am 35 feet tall"
    and as you said my premise is literally FALSE
    (P ∧ ~P) ⊢ FALSE

    The principle of explosion merely facilitates tinding a
    conclusion that is so obviously false that it convincingly proves
    that the remise is false.

    There is nothing semantically relevant that can be
    proven from a contradiction besides bare FALSE and
    bare FALSE only entails bare FALSE.

    Yes, there is. From the contradiction "I have blue eyes and
    I don't have blue eyes" one can prove "I have blue eyes" and
    "I don't have blue eyes", both of which are semantically
    relevant, and one of which in addition is false.


    That is greatly restricted from the POE.
      (P ∧ ~P) ⊢ FALSE // is what can really be proved semantically

    If you can prove that FALSE is true then what is not true?


    That is not proving that false is true.
    It is stipulating that contradictions
    only derive bare FALSE.

    Apparently you don't understand what 'derives' means.

    When we say that X derives Y we mean that x entails that Y is *true*

    So (P ∧ ~P) ⊢ FALSE means that (P ∧ ~P) proves that FALSE is true. That would be a good example of an explosion.

    André
    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Mon Jul 6 14:06:38 2026
    From Newsgroup: comp.ai.philosophy

    On 7/6/2026 1:57 PM, André G. Isaak wrote:
    On 2026-07-06 11:54, olcott wrote:
    On 7/6/2026 5:17 AM, Mikko wrote:
    On 04/07/2026 16:15, olcott wrote:
    On 7/4/2026 1:37 AM, Mikko wrote:
    On 03/07/2026 17:46, olcott wrote:
    On 7/3/2026 3:17 AM, Mikko wrote:
    On 02/07/2026 17:37, olcott wrote:

    x = "The Moon is made from green cheese"
    y = "Donald Trump is the one and only Lord and Savior Jesus Christ: >>>>>>>> POE concludes (x ∧ ¬x) ⊢ y

    "the principle of explosion is the theorem according to
      which any statement can be proven from a contradiction"
    https://en.wikipedia.org/wiki/Principle_of_explosion

    When you pay attention to the meaning of the words
    and correctly apply correct semantic entailment on
    the basis of the meaning of those words then the
    principle of explosion is a PSYCHOTIC BREAK FROM REALITY.

    No, it is not. The premise x above is a break from reality. But that >>>>>>> is not in logic, it was introduced by you. Even without the
    principle
    of explosion it is possible to infer a false conclusion from a false >>>>>>> premise.

    Yes. From "I am 35 feet tall" ⊢ "I am 35 feet tall"
    and as you said my premise is literally FALSE
    (P ∧ ~P) ⊢ FALSE

    The principle of explosion merely facilitates tinding a
    conclusion that is so obviously false that it convincingly proves >>>>>>> that the remise is false.

    There is nothing semantically relevant that can be
    proven from a contradiction besides bare FALSE and
    bare FALSE only entails bare FALSE.

    Yes, there is. From the contradiction "I have blue eyes and
    I don't have blue eyes" one can prove "I have blue eyes" and
    "I don't have blue eyes", both of which are semantically
    relevant, and one of which in addition is false.


    That is greatly restricted from the POE.
      (P ∧ ~P) ⊢ FALSE // is what can really be proved semantically

    If you can prove that FALSE is true then what is not true?


    That is not proving that false is true.
    It is stipulating that contradictions
    only derive bare FALSE.

    Apparently you don't understand what 'derives' means.


    (P ∧ ~P) ⊢ ⊥ is a stipulated axiom. FALSE was the dumbed down version.

    When we say that X derives Y we mean that x entails that Y is *true*

    So (P ∧ ~P) ⊢ FALSE means that (P ∧ ~P) proves that FALSE is true. That
    would be a good example of an explosion.

    André

    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Mon Jul 6 13:17:39 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-06 13:06, olcott wrote:
    On 7/6/2026 1:57 PM, André G. Isaak wrote:
    On 2026-07-06 11:54, olcott wrote:
    On 7/6/2026 5:17 AM, Mikko wrote:
    On 04/07/2026 16:15, olcott wrote:
    On 7/4/2026 1:37 AM, Mikko wrote:
    On 03/07/2026 17:46, olcott wrote:
    On 7/3/2026 3:17 AM, Mikko wrote:
    On 02/07/2026 17:37, olcott wrote:

    x = "The Moon is made from green cheese"
    y = "Donald Trump is the one and only Lord and Savior Jesus >>>>>>>>> Christ:
    POE concludes (x ∧ ¬x) ⊢ y

    "the principle of explosion is the theorem according to
      which any statement can be proven from a contradiction"
    https://en.wikipedia.org/wiki/Principle_of_explosion

    When you pay attention to the meaning of the words
    and correctly apply correct semantic entailment on
    the basis of the meaning of those words then the
    principle of explosion is a PSYCHOTIC BREAK FROM REALITY.

    No, it is not. The premise x above is a break from reality. But >>>>>>>> that
    is not in logic, it was introduced by you. Even without the
    principle
    of explosion it is possible to infer a false conclusion from a >>>>>>>> false
    premise.

    Yes. From "I am 35 feet tall" ⊢ "I am 35 feet tall"
    and as you said my premise is literally FALSE
    (P ∧ ~P) ⊢ FALSE

    The principle of explosion merely facilitates tinding a
    conclusion that is so obviously false that it convincingly proves >>>>>>>> that the remise is false.

    There is nothing semantically relevant that can be
    proven from a contradiction besides bare FALSE and
    bare FALSE only entails bare FALSE.

    Yes, there is. From the contradiction "I have blue eyes and
    I don't have blue eyes" one can prove "I have blue eyes" and
    "I don't have blue eyes", both of which are semantically
    relevant, and one of which in addition is false.


    That is greatly restricted from the POE.
      (P ∧ ~P) ⊢ FALSE // is what can really be proved semantically >>>>
    If you can prove that FALSE is true then what is not true?


    That is not proving that false is true.
    It is stipulating that contradictions
    only derive bare FALSE.

    Apparently you don't understand what 'derives' means.


    (P ∧ ~P) ⊢ ⊥ is a stipulated axiom. FALSE was the dumbed down version.

    Which would mean that (P ∧ ~P) proves that ⊥ is true. Again, an example
    of explosion.

    André
    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Mon Jul 6 15:04:12 2026
    From Newsgroup: comp.ai.philosophy

    On 7/6/2026 2:17 PM, André G. Isaak wrote:
    On 2026-07-06 13:06, olcott wrote:
    On 7/6/2026 1:57 PM, André G. Isaak wrote:
    On 2026-07-06 11:54, olcott wrote:
    On 7/6/2026 5:17 AM, Mikko wrote:
    On 04/07/2026 16:15, olcott wrote:
    On 7/4/2026 1:37 AM, Mikko wrote:
    On 03/07/2026 17:46, olcott wrote:
    On 7/3/2026 3:17 AM, Mikko wrote:
    On 02/07/2026 17:37, olcott wrote:

    x = "The Moon is made from green cheese"
    y = "Donald Trump is the one and only Lord and Savior Jesus >>>>>>>>>> Christ:
    POE concludes (x ∧ ¬x) ⊢ y

    "the principle of explosion is the theorem according to
      which any statement can be proven from a contradiction" >>>>>>>>>> https://en.wikipedia.org/wiki/Principle_of_explosion

    When you pay attention to the meaning of the words
    and correctly apply correct semantic entailment on
    the basis of the meaning of those words then the
    principle of explosion is a PSYCHOTIC BREAK FROM REALITY.

    No, it is not. The premise x above is a break from reality. But >>>>>>>>> that
    is not in logic, it was introduced by you. Even without the >>>>>>>>> principle
    of explosion it is possible to infer a false conclusion from a >>>>>>>>> false
    premise.

    Yes. From "I am 35 feet tall" ⊢ "I am 35 feet tall"
    and as you said my premise is literally FALSE
    (P ∧ ~P) ⊢ FALSE

    The principle of explosion merely facilitates tinding a
    conclusion that is so obviously false that it convincingly proves >>>>>>>>> that the remise is false.

    There is nothing semantically relevant that can be
    proven from a contradiction besides bare FALSE and
    bare FALSE only entails bare FALSE.

    Yes, there is. From the contradiction "I have blue eyes and
    I don't have blue eyes" one can prove "I have blue eyes" and
    "I don't have blue eyes", both of which are semantically
    relevant, and one of which in addition is false.


    That is greatly restricted from the POE.
      (P ∧ ~P) ⊢ FALSE // is what can really be proved semantically >>>>>
    If you can prove that FALSE is true then what is not true?


    That is not proving that false is true.
    It is stipulating that contradictions
    only derive bare FALSE.

    Apparently you don't understand what 'derives' means.


    (P ∧ ~P) ⊢ ⊥ is a stipulated axiom. FALSE was the dumbed down version.

    Which would mean that (P ∧ ~P) proves that ⊥ is true. Again, an example of explosion.

    André



    ⊥ ⊢ ⊥ no explosion.
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Mon Jul 6 14:20:35 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-06 14:04, olcott wrote:

    ⊥  ⊢ ⊥ no explosion.

    Of course that's an explosion. It says that ⊥ demonstrates that ⊥ is true.

    Your problem is that you don't understand even the most basic facts of
    logic. Stuff that would be taught during the first week of an
    introduction to formal logic is beyond your purview, yet you somehow
    feel qualified to pontificate about logic.

    André
    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Mon Jul 6 16:54:54 2026
    From Newsgroup: comp.ai.philosophy

    On 7/6/2026 3:20 PM, André G. Isaak wrote:
    On 2026-07-06 14:04, olcott wrote:

    ⊥  ⊢ ⊥ no explosion.

    Of course that's an explosion. It says that ⊥ demonstrates that ⊥ is true.


    That you do not know what explosion is is not my mistake.
    I thought that one of you two guys had a PhD in math
    is that you or Alan?

    Your problem is that you don't understand even the most basic facts of logic. Stuff that would be taught during the first week of an
    introduction to formal logic is beyond your purview, yet you somehow
    feel qualified to pontificate about logic.

    André

    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Mon Jul 6 16:15:25 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-06 15:54, olcott wrote:
    On 7/6/2026 3:20 PM, André G. Isaak wrote:
    On 2026-07-06 14:04, olcott wrote:

    ⊥  ⊢ ⊥ no explosion.

    Of course that's an explosion. It says that ⊥ demonstrates that ⊥ is
    true.


    That you do not know what explosion is is not my mistake.
    I thought that one of you two guys had a PhD in math
    is that you or Alan?

    I do know what explosion is in the context of logic. Apparently you do
    not. And I've never claimed to have a doctoracte in maths. My background
    is in linguistics.

    André
    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Alan Mackenzie@acm@muc.de to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Mon Jul 6 22:17:21 2026
    From Newsgroup: comp.ai.philosophy

    [ Followup-To: set ]
    In comp.theory olcott <polcott333@gmail.com> wrote:
    On 7/6/2026 3:20 PM, André G. Isaak wrote:
    On 2026-07-06 14:04, olcott wrote:
    ⊥  ⊢ ⊥ no explosion.
    Of course that's an explosion. It says that ⊥ demonstrates that ⊥ is true.
    That you do not know what explosion is is not my mistake.
    I thought that one of you two guys had a PhD in math
    is that you or Alan?
    I have a batchelor's degree in maths. I'm not sure about André, but I
    expect he has at least a first degree in maths. You do not, and it
    shows. It would be reasonable to expect at least a modicum of respect
    for others' learning from you, given the rudimentary level of your own
    general education.
    Your problem is that you don't understand even the most basic facts of logic. Stuff that would be taught during the first week of an
    introduction to formal logic is beyond your purview, yet you somehow
    feel qualified to pontificate about logic.
    Indeed.
    André
    --
    Copyright 2026 Olcott
    --
    Alan Mackenzie (Nuremberg, Germany).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Mon Jul 6 17:31:43 2026
    From Newsgroup: comp.ai.philosophy

    On 7/6/2026 5:17 PM, Alan Mackenzie wrote:
    [ Followup-To: set ]

    In comp.theory olcott <polcott333@gmail.com> wrote:
    On 7/6/2026 3:20 PM, André G. Isaak wrote:
    On 2026-07-06 14:04, olcott wrote:

    ⊥  ⊢ ⊥ no explosion.

    Of course that's an explosion. It says that ⊥ demonstrates that ⊥ is true.


    That you do not know what explosion is is not my mistake.
    I thought that one of you two guys had a PhD in math
    is that you or Alan?

    I have a batchelor's degree in maths. I'm not sure about André, but I expect he has at least a first degree in maths. You do not, and it
    shows. It would be reasonable to expect at least a modicum of respect
    for others' learning from you, given the rudimentary level of your own general education.


    He is flat out incorrect about explosion.

    Your problem is that you don't understand even the most basic facts of
    logic. Stuff that would be taught during the first week of an
    introduction to formal logic is beyond your purview, yet you somehow
    feel qualified to pontificate about logic.

    Indeed.

    André

    --
    Copyright 2026 Olcott

    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Mon Jul 6 17:36:46 2026
    From Newsgroup: comp.ai.philosophy

    On 7/6/2026 5:15 PM, André G. Isaak wrote:
    On 2026-07-06 15:54, olcott wrote:
    On 7/6/2026 3:20 PM, André G. Isaak wrote:
    On 2026-07-06 14:04, olcott wrote:

    ⊥  ⊢ ⊥ no explosion.

    Of course that's an explosion. It says that ⊥ demonstrates that ⊥ is >>> true.


    That you do not know what explosion is is not my mistake.
    I thought that one of you two guys had a PhD in math
    is that you or Alan?

    I do know what explosion is in the context of logic. Apparently you do
    not. And I've never claimed to have a doctoracte in maths. My background
    is in linguistics.

    André


    You are flat our wrong about explosion. I thought that
    one of you two guys had a PhD in something. Most linguists
    don't have a clue about formal semantics I spoke on sci.lang
    for at least 10 years. None of them ever had much of a clue
    about this.
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Mon Jul 6 16:50:36 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-06 16:36, olcott wrote:
    On 7/6/2026 5:15 PM, André G. Isaak wrote:
    On 2026-07-06 15:54, olcott wrote:
    On 7/6/2026 3:20 PM, André G. Isaak wrote:
    On 2026-07-06 14:04, olcott wrote:

    ⊥  ⊢ ⊥ no explosion.

    Of course that's an explosion. It says that ⊥ demonstrates that ⊥ is >>>> true.


    That you do not know what explosion is is not my mistake.
    I thought that one of you two guys had a PhD in math
    is that you or Alan?

    I do know what explosion is in the context of logic. Apparently you do
    not. And I've never claimed to have a doctoracte in maths. My
    background is in linguistics.

    André


    You are flat our wrong about explosion.

    No. You claim that ⊥ ⊢ ⊥ which is to say that ⊥ can be derived from ⊥.
    But in a consistent logic, ⊥ shouldn't be derivable from *anything*. The only way you can derive it is by introducing a contradiction into your
    proof (that's what the first occurrence of ⊥ represents in your
    statement) which is exactly what the principle of explosion says.

    I thought that
    one of you two guys had a PhD in something. Most linguists
    don't have a clue about formal semantics I spoke on sci.lang
    for at least 10 years. None of them ever had much of a clue
    about this.
    sci.lang is not populated by linguists. The vast majority of people who
    post to that group are simply cranks like you. You can't infer anything
    about what linguists may or may not know by following sci.lang.

    André
    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Mon Jul 6 17:53:39 2026
    From Newsgroup: comp.ai.philosophy

    On 7/6/2026 5:50 PM, André G. Isaak wrote:
    On 2026-07-06 16:36, olcott wrote:
    On 7/6/2026 5:15 PM, André G. Isaak wrote:
    On 2026-07-06 15:54, olcott wrote:
    On 7/6/2026 3:20 PM, André G. Isaak wrote:
    On 2026-07-06 14:04, olcott wrote:

    ⊥  ⊢ ⊥ no explosion.

    Of course that's an explosion. It says that ⊥ demonstrates that ⊥ >>>>> is true.


    That you do not know what explosion is is not my mistake.
    I thought that one of you two guys had a PhD in math
    is that you or Alan?

    I do know what explosion is in the context of logic. Apparently you
    do not. And I've never claimed to have a doctoracte in maths. My
    background is in linguistics.

    André


    You are flat our wrong about explosion.

    No. You claim that ⊥  ⊢ ⊥ which is to say that ⊥ can be derived from ⊥.
    But in a consistent logic, ⊥ shouldn't be derivable from *anything*. The


    It is not explosive, full stop you are wrong.

    only way you can derive it is by introducing a contradiction into your
    proof (that's what the first occurrence of ⊥ represents in your
    statement) which is exactly what the principle of explosion says.

    I thought that
    one of you two guys had a PhD in something. Most linguists
    don't have a clue about formal semantics I spoke on sci.lang
    for at least 10 years. None of them ever had much of a clue
    about this.
    sci.lang is not populated by linguists. The vast majority of people who
    post to that group are simply cranks like you. You can't infer anything about what linguists may or may not know by following sci.lang.

    André


    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Mon Jul 6 17:37:41 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-06 16:53, olcott wrote:
    On 7/6/2026 5:50 PM, André G. Isaak wrote:
    On 2026-07-06 16:36, olcott wrote:
    On 7/6/2026 5:15 PM, André G. Isaak wrote:
    On 2026-07-06 15:54, olcott wrote:
    On 7/6/2026 3:20 PM, André G. Isaak wrote:
    On 2026-07-06 14:04, olcott wrote:

    ⊥  ⊢ ⊥ no explosion.

    Of course that's an explosion. It says that ⊥ demonstrates that ⊥ >>>>>> is true.


    That you do not know what explosion is is not my mistake.
    I thought that one of you two guys had a PhD in math
    is that you or Alan?

    I do know what explosion is in the context of logic. Apparently you
    do not. And I've never claimed to have a doctoracte in maths. My
    background is in linguistics.

    André


    You are flat our wrong about explosion.

    No. You claim that ⊥  ⊢ ⊥ which is to say that ⊥ can be derived from
    ⊥. But in a consistent logic, ⊥ shouldn't be derivable from
    *anything*. The


    It is not explosive, full stop you are wrong.

    You're really not qualified to make such a claim.

    André
    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Mon Jul 6 18:40:59 2026
    From Newsgroup: comp.ai.philosophy

    On 7/6/2026 6:37 PM, André G. Isaak wrote:
    On 2026-07-06 16:53, olcott wrote:
    On 7/6/2026 5:50 PM, André G. Isaak wrote:
    On 2026-07-06 16:36, olcott wrote:
    On 7/6/2026 5:15 PM, André G. Isaak wrote:
    On 2026-07-06 15:54, olcott wrote:
    On 7/6/2026 3:20 PM, André G. Isaak wrote:
    On 2026-07-06 14:04, olcott wrote:

    ⊥  ⊢ ⊥ no explosion.

    Of course that's an explosion. It says that ⊥ demonstrates that ⊥ >>>>>>> is true.


    That you do not know what explosion is is not my mistake.
    I thought that one of you two guys had a PhD in math
    is that you or Alan?

    I do know what explosion is in the context of logic. Apparently you >>>>> do not. And I've never claimed to have a doctoracte in maths. My
    background is in linguistics.

    André


    You are flat our wrong about explosion.

    No. You claim that ⊥  ⊢ ⊥ which is to say that ⊥ can be derived from
    ⊥. But in a consistent logic, ⊥ shouldn't be derivable from
    *anything*. The


    It is not explosive, full stop you are wrong.

    You're really not qualified to make such a claim.

    André


    Define in your own words what you think that deductive
    explosion means.
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Mon Jul 6 18:47:29 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-06 17:40, olcott wrote:
    On 7/6/2026 6:37 PM, André G. Isaak wrote:
    On 2026-07-06 16:53, olcott wrote:
    On 7/6/2026 5:50 PM, André G. Isaak wrote:
    On 2026-07-06 16:36, olcott wrote:
    On 7/6/2026 5:15 PM, André G. Isaak wrote:
    On 2026-07-06 15:54, olcott wrote:
    On 7/6/2026 3:20 PM, André G. Isaak wrote:
    On 2026-07-06 14:04, olcott wrote:

    ⊥  ⊢ ⊥ no explosion.

    Of course that's an explosion. It says that ⊥ demonstrates that >>>>>>>> ⊥ is true.


    That you do not know what explosion is is not my mistake.
    I thought that one of you two guys had a PhD in math
    is that you or Alan?

    I do know what explosion is in the context of logic. Apparently
    you do not. And I've never claimed to have a doctoracte in maths. >>>>>> My background is in linguistics.

    André


    You are flat our wrong about explosion.

    No. You claim that ⊥  ⊢ ⊥ which is to say that ⊥ can be derived from
    ⊥. But in a consistent logic, ⊥ shouldn't be derivable from
    *anything*. The


    It is not explosive, full stop you are wrong.

    You're really not qualified to make such a claim.

    André


    Define in your own words what you think that deductive
    explosion means.

    Odd that you should ask such a thing since you rarely if ever respond to requests for you to explain things in your own words and instead post
    links to wikipedia pages.

    deductive explosion occurs when contradictory premises are introduced
    into an argument therefore allowing anything, including false statements
    to be derived.

    You offered ⊥ ⊢ ⊥

    ⊥ is the logical symbol representing a falsehood or contradiction. You
    are therefore deriving a falsehood or contradiction which shouldn't
    happen. The only reason you were able to do this is because your premise
    was ⊥. That's explosion.

    André
    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Mon Jul 6 20:24:33 2026
    From Newsgroup: comp.ai.philosophy

    On 7/6/2026 7:47 PM, André G. Isaak wrote:
    On 2026-07-06 17:40, olcott wrote:
    On 7/6/2026 6:37 PM, André G. Isaak wrote:
    On 2026-07-06 16:53, olcott wrote:
    On 7/6/2026 5:50 PM, André G. Isaak wrote:
    On 2026-07-06 16:36, olcott wrote:
    On 7/6/2026 5:15 PM, André G. Isaak wrote:
    On 2026-07-06 15:54, olcott wrote:
    On 7/6/2026 3:20 PM, André G. Isaak wrote:
    On 2026-07-06 14:04, olcott wrote:

    ⊥  ⊢ ⊥ no explosion.

    Of course that's an explosion. It says that ⊥ demonstrates that >>>>>>>>> ⊥ is true.


    That you do not know what explosion is is not my mistake.
    I thought that one of you two guys had a PhD in math
    is that you or Alan?

    I do know what explosion is in the context of logic. Apparently >>>>>>> you do not. And I've never claimed to have a doctoracte in maths. >>>>>>> My background is in linguistics.

    André


    You are flat our wrong about explosion.

    No. You claim that ⊥  ⊢ ⊥ which is to say that ⊥ can be derived >>>>> from ⊥. But in a consistent logic, ⊥ shouldn't be derivable from >>>>> *anything*. The


    It is not explosive, full stop you are wrong.

    You're really not qualified to make such a claim.

    André


    Define in your own words what you think that deductive
    explosion means.

    Odd that you should ask such a thing since you rarely if ever respond to requests for you to explain things in your own words and instead post
    links to wikipedia pages.

    deductive explosion occurs when contradictory premises are introduced
    into an argument therefore allowing anything, including false statements
    to be derived.

    You offered ⊥  ⊢ ⊥

    ⊥ is the logical symbol representing a falsehood or contradiction. You
    are therefore deriving a falsehood or contradiction which shouldn't
    happen. The only reason you were able to do this is because your premise
    was ⊥. That's explosion.

    André


    OK good. I am stipulating that from contradiction only
    falsum follows and from falsum only falsum follows
    cutting off the legs of explosion.

    ∀x (x ∧ ¬x) ⊢ ⊥
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Mon Jul 6 19:49:10 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-06 19:24, olcott wrote:
    On 7/6/2026 7:47 PM, André G. Isaak wrote:
    On 2026-07-06 17:40, olcott wrote:
    On 7/6/2026 6:37 PM, André G. Isaak wrote:
    On 2026-07-06 16:53, olcott wrote:
    On 7/6/2026 5:50 PM, André G. Isaak wrote:
    On 2026-07-06 16:36, olcott wrote:
    On 7/6/2026 5:15 PM, André G. Isaak wrote:
    On 2026-07-06 15:54, olcott wrote:
    On 7/6/2026 3:20 PM, André G. Isaak wrote:
    On 2026-07-06 14:04, olcott wrote:

    ⊥  ⊢ ⊥ no explosion.

    Of course that's an explosion. It says that ⊥ demonstrates >>>>>>>>>> that ⊥ is true.


    That you do not know what explosion is is not my mistake.
    I thought that one of you two guys had a PhD in math
    is that you or Alan?

    I do know what explosion is in the context of logic. Apparently >>>>>>>> you do not. And I've never claimed to have a doctoracte in
    maths. My background is in linguistics.

    André


    You are flat our wrong about explosion.

    No. You claim that ⊥  ⊢ ⊥ which is to say that ⊥ can be derived
    from ⊥. But in a consistent logic, ⊥ shouldn't be derivable from >>>>>> *anything*. The


    It is not explosive, full stop you are wrong.

    You're really not qualified to make such a claim.

    André


    Define in your own words what you think that deductive
    explosion means.

    Odd that you should ask such a thing since you rarely if ever respond
    to requests for you to explain things in your own words and instead
    post links to wikipedia pages.

    deductive explosion occurs when contradictory premises are introduced
    into an argument therefore allowing anything, including false
    statements to be derived.

    You offered ⊥  ⊢ ⊥

    ⊥ is the logical symbol representing a falsehood or contradiction. You
    are therefore deriving a falsehood or contradiction which shouldn't
    happen. The only reason you were able to do this is because your
    premise was ⊥. That's explosion.

    André


    OK good. I am stipulating that from contradiction only
    falsum follows and from falsum only falsum follows
    cutting off the legs of explosion.

    ∀x (x ∧ ¬x) ⊢ ⊥

    Which is simply a way of stating that (x ∧ ¬x) proves that ⊥ is true.
    How is that not an explosion? I don't think you grasp what ⊢ or ⊥ mean.

    'X follows' means that the truth of X is entailed by the premise.
    'falsum follows' means that falsum is true. That's explosion.

    André
    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Mon Jul 6 20:57:35 2026
    From Newsgroup: comp.ai.philosophy

    On 7/6/2026 8:49 PM, André G. Isaak wrote:
    On 2026-07-06 19:24, olcott wrote:
    On 7/6/2026 7:47 PM, André G. Isaak wrote:
    On 2026-07-06 17:40, olcott wrote:
    On 7/6/2026 6:37 PM, André G. Isaak wrote:
    On 2026-07-06 16:53, olcott wrote:
    On 7/6/2026 5:50 PM, André G. Isaak wrote:
    On 2026-07-06 16:36, olcott wrote:
    On 7/6/2026 5:15 PM, André G. Isaak wrote:
    On 2026-07-06 15:54, olcott wrote:
    On 7/6/2026 3:20 PM, André G. Isaak wrote:
    On 2026-07-06 14:04, olcott wrote:

    ⊥  ⊢ ⊥ no explosion.

    Of course that's an explosion. It says that ⊥ demonstrates >>>>>>>>>>> that ⊥ is true.


    That you do not know what explosion is is not my mistake.
    I thought that one of you two guys had a PhD in math
    is that you or Alan?

    I do know what explosion is in the context of logic. Apparently >>>>>>>>> you do not. And I've never claimed to have a doctoracte in
    maths. My background is in linguistics.

    André


    You are flat our wrong about explosion.

    No. You claim that ⊥  ⊢ ⊥ which is to say that ⊥ can be derived
    from ⊥. But in a consistent logic, ⊥ shouldn't be derivable from >>>>>>> *anything*. The


    It is not explosive, full stop you are wrong.

    You're really not qualified to make such a claim.

    André


    Define in your own words what you think that deductive
    explosion means.

    Odd that you should ask such a thing since you rarely if ever respond
    to requests for you to explain things in your own words and instead
    post links to wikipedia pages.

    deductive explosion occurs when contradictory premises are introduced
    into an argument therefore allowing anything, including false
    statements to be derived.

    You offered ⊥  ⊢ ⊥

    ⊥ is the logical symbol representing a falsehood or contradiction.
    You are therefore deriving a falsehood or contradiction which
    shouldn't happen. The only reason you were able to do this is because
    your premise was ⊥. That's explosion.

    André


    OK good. I am stipulating that from contradiction only
    falsum follows and from falsum only falsum follows
    cutting off the legs of explosion.

    ∀x (x ∧ ¬x) ⊢ ⊥

    Which is simply a way of stating that (x ∧ ¬x) proves that ⊥ is true.

    Proving that falsum is true seems like proving
    that small is large.

    How is that not an explosion? I don't think you grasp what ⊢ or ⊥ mean.


    Explosion means that anything at all can be proved
    from a contradiction. I stipulate the nothing at
    all can be proved from a contradiction.

    'X follows' means that the truth of X is entailed by the premise.
    'falsum follows' means that falsum is true. That's explosion.

    André

    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Mon Jul 6 20:11:09 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-06 19:57, olcott wrote:
    On 7/6/2026 8:49 PM, André G. Isaak wrote:
    On 2026-07-06 19:24, olcott wrote:
    On 7/6/2026 7:47 PM, André G. Isaak wrote:
    On 2026-07-06 17:40, olcott wrote:
    On 7/6/2026 6:37 PM, André G. Isaak wrote:
    On 2026-07-06 16:53, olcott wrote:
    On 7/6/2026 5:50 PM, André G. Isaak wrote:
    On 2026-07-06 16:36, olcott wrote:
    On 7/6/2026 5:15 PM, André G. Isaak wrote:
    On 2026-07-06 15:54, olcott wrote:
    On 7/6/2026 3:20 PM, André G. Isaak wrote:
    On 2026-07-06 14:04, olcott wrote:

    ⊥  ⊢ ⊥ no explosion.

    Of course that's an explosion. It says that ⊥ demonstrates >>>>>>>>>>>> that ⊥ is true.


    That you do not know what explosion is is not my mistake. >>>>>>>>>>> I thought that one of you two guys had a PhD in math
    is that you or Alan?

    I do know what explosion is in the context of logic.
    Apparently you do not. And I've never claimed to have a
    doctoracte in maths. My background is in linguistics.

    André


    You are flat our wrong about explosion.

    No. You claim that ⊥  ⊢ ⊥ which is to say that ⊥ can be derived
    from ⊥. But in a consistent logic, ⊥ shouldn't be derivable from >>>>>>>> *anything*. The


    It is not explosive, full stop you are wrong.

    You're really not qualified to make such a claim.

    André


    Define in your own words what you think that deductive
    explosion means.

    Odd that you should ask such a thing since you rarely if ever
    respond to requests for you to explain things in your own words and
    instead post links to wikipedia pages.

    deductive explosion occurs when contradictory premises are
    introduced into an argument therefore allowing anything, including
    false statements to be derived.

    You offered ⊥  ⊢ ⊥

    ⊥ is the logical symbol representing a falsehood or contradiction.
    You are therefore deriving a falsehood or contradiction which
    shouldn't happen. The only reason you were able to do this is
    because your premise was ⊥. That's explosion.

    André


    OK good. I am stipulating that from contradiction only
    falsum follows and from falsum only falsum follows
    cutting off the legs of explosion.

    ∀x (x ∧ ¬x) ⊢ ⊥

    Which is simply a way of stating that (x ∧ ¬x) proves that ⊥ is true.

    Proving that falsum is true seems like proving
    that small is large.

    But that''s exactly what you wrote.

    How is that not an explosion? I don't think you grasp what ⊢ or ⊥ mean. >>

    Explosion means that anything at all can be proved
    from a contradiction. I stipulate the nothing at
    all can be proved from a contradiction.

    But that's not actually what you wrote. You really don't understand the notation you are using.

    And you can't 'stipulate' what logic can or cannot do. What it can do
    follows from the axioms of the system.

    André
    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Mon Jul 6 21:24:46 2026
    From Newsgroup: comp.ai.philosophy

    On 7/6/2026 9:11 PM, André G. Isaak wrote:
    On 2026-07-06 19:57, olcott wrote:
    On 7/6/2026 8:49 PM, André G. Isaak wrote:
    On 2026-07-06 19:24, olcott wrote:
    On 7/6/2026 7:47 PM, André G. Isaak wrote:
    On 2026-07-06 17:40, olcott wrote:
    On 7/6/2026 6:37 PM, André G. Isaak wrote:
    On 2026-07-06 16:53, olcott wrote:
    On 7/6/2026 5:50 PM, André G. Isaak wrote:
    On 2026-07-06 16:36, olcott wrote:
    On 7/6/2026 5:15 PM, André G. Isaak wrote:
    On 2026-07-06 15:54, olcott wrote:
    On 7/6/2026 3:20 PM, André G. Isaak wrote:
    On 2026-07-06 14:04, olcott wrote:

    ⊥  ⊢ ⊥ no explosion.

    Of course that's an explosion. It says that ⊥ demonstrates >>>>>>>>>>>>> that ⊥ is true.


    That you do not know what explosion is is not my mistake. >>>>>>>>>>>> I thought that one of you two guys had a PhD in math
    is that you or Alan?

    I do know what explosion is in the context of logic.
    Apparently you do not. And I've never claimed to have a >>>>>>>>>>> doctoracte in maths. My background is in linguistics.

    André


    You are flat our wrong about explosion.

    No. You claim that ⊥  ⊢ ⊥ which is to say that ⊥ can be derived
    from ⊥. But in a consistent logic, ⊥ shouldn't be derivable >>>>>>>>> from *anything*. The


    It is not explosive, full stop you are wrong.

    You're really not qualified to make such a claim.

    André


    Define in your own words what you think that deductive
    explosion means.

    Odd that you should ask such a thing since you rarely if ever
    respond to requests for you to explain things in your own words and >>>>> instead post links to wikipedia pages.

    deductive explosion occurs when contradictory premises are
    introduced into an argument therefore allowing anything, including
    false statements to be derived.

    You offered ⊥  ⊢ ⊥

    ⊥ is the logical symbol representing a falsehood or contradiction. >>>>> You are therefore deriving a falsehood or contradiction which
    shouldn't happen. The only reason you were able to do this is
    because your premise was ⊥. That's explosion.

    André


    OK good. I am stipulating that from contradiction only
    falsum follows and from falsum only falsum follows
    cutting off the legs of explosion.

    ∀x (x ∧ ¬x) ⊢ ⊥

    Which is simply a way of stating that (x ∧ ¬x) proves that ⊥ is true. >>
    Proving that falsum is true seems like proving
    that small is large.

    But that''s exactly what you wrote.

    How is that not an explosion? I don't think you grasp what ⊢ or ⊥ mean. >>>

    Explosion means that anything at all can be proved
    from a contradiction. I stipulate the nothing at
    all can be proved from a contradiction.

    But that's not actually what you wrote. You really don't understand the notation you are using.


    ∀x(φ(x) ∧ ¬φ(x)) ⊢ ⊥
    and
    Γ ⊢ ⊥
    --------------------
    derivation terminated


    And you can't 'stipulate' what logic can or cannot do. What it can do follows from the axioms of the system.

    André

    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Mon Jul 6 20:41:44 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-06 20:24, olcott wrote:

    ∀x(φ(x) ∧ ¬φ(x)) ⊢ ⊥
    and
           Γ ⊢ ⊥
    --------------------
    derivation terminated

    That's simply gibberish.

    André
    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Mon Jul 6 21:44:56 2026
    From Newsgroup: comp.ai.philosophy

    On 7/6/2026 9:41 PM, André G. Isaak wrote:
    On 2026-07-06 20:24, olcott wrote:

    ∀x(φ(x) ∧ ¬φ(x)) ⊢ ⊥
    and
            Γ ⊢ ⊥
    --------------------
    derivation terminated

    That's simply gibberish.

    André


    How do you think that:
    From a contradiction nothing follows
    should be encoded?
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Mon Jul 6 21:03:41 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-06 20:44, olcott wrote:
    On 7/6/2026 9:41 PM, André G. Isaak wrote:
    On 2026-07-06 20:24, olcott wrote:

    ∀x(φ(x) ∧ ¬φ(x)) ⊢ ⊥
    and
            Γ ⊢ ⊥
    --------------------
    derivation terminated

    That's simply gibberish.

    André


    How do you think that:
    From a contradiction nothing follows
    should be encoded?

    Since you don't understand the formalism you're trying to use, why
    bother trying to formalize it? You can simply state it in English. but
    what you're stating is simply false. The fact that *anything* follows
    from a contradiction isn't some axiom that can be removed from standard
    logic and replaced with something else. It's a consequence of the basic definitions used.

    André
    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Mon Jul 6 22:12:04 2026
    From Newsgroup: comp.ai.philosophy

    On 7/6/2026 10:03 PM, André G. Isaak wrote:
    On 2026-07-06 20:44, olcott wrote:
    On 7/6/2026 9:41 PM, André G. Isaak wrote:
    On 2026-07-06 20:24, olcott wrote:

    ∀x(φ(x) ∧ ¬φ(x)) ⊢ ⊥
    and
            Γ ⊢ ⊥
    --------------------
    derivation terminated

    That's simply gibberish.

    André


    How do you think that:
     From a contradiction nothing follows
    should be encoded?

    Since you don't understand the formalism you're trying to use, why
    bother trying to formalize it?

    Both LLMs agree that I am already correct.

    You can simply state it in English. but
    what you're stating is simply false.

    I am overriding and superseding the psychotic break
    from reality of the principle of explosion.
    Numerous famous logicians have done this same
    thing in several different ways.

    The fact that *anything* follows
    from a contradiction

    Is totally fucked up nonsense that only a psychotic
    would not reject in less than three seconds.

    isn't some axiom that can be removed from standard
    logic and replaced with something else. It's a consequence of the basic definitions used.

    André


    That breaks the coherence notion of truth.
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Mon Jul 6 21:28:19 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-06 21:12, olcott wrote:
    On 7/6/2026 10:03 PM, André G. Isaak wrote:
    On 2026-07-06 20:44, olcott wrote:
    On 7/6/2026 9:41 PM, André G. Isaak wrote:
    On 2026-07-06 20:24, olcott wrote:

    ∀x(φ(x) ∧ ¬φ(x)) ⊢ ⊥
    and
            Γ ⊢ ⊥
    --------------------
    derivation terminated

    That's simply gibberish.

    André


    How do you think that:
     From a contradiction nothing follows
    should be encoded?

    Since you don't understand the formalism you're trying to use, why
    bother trying to formalize it?

    Both LLMs agree that I am already correct.

    LLMs carry no weight in my opinion. And since you can't clearly express yourself, it wouldn't be clear exactly what they were agreeing with anyways.

    You can simply state it in English. but what you're stating is simply
    false.

    I am overriding and superseding the psychotic break
    from reality of the principle of explosion.
    Numerous famous logicians have done this same
    thing in several different ways.

    They've done it by adopting paraconsistent logics which raise their own
    set of problems. Most importantly, though, none of them have claimed to
    have removed the principle of explosion from classical logic.

    The fact that *anything* follows from a contradiction

    Is totally fucked up nonsense that only a psychotic
    would not reject in less than three seconds.

    Since the overwhelming majority of logicians accept this having spent
    far more than three seconds contemplating it, you might want to
    reconsider your position. You really should contemplate the possibility
    that you have misunderstood the topic.

    isn't some axiom that can be removed from standard logic and replaced
    with something else. It's a consequence of the basic definitions used.

    André


    That breaks the coherence notion of truth.

    No, it does not.

    André
    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Mon Jul 6 22:40:08 2026
    From Newsgroup: comp.ai.philosophy

    On 7/6/2026 10:28 PM, André G. Isaak wrote:
    On 2026-07-06 21:12, olcott wrote:
    On 7/6/2026 10:03 PM, André G. Isaak wrote:
    On 2026-07-06 20:44, olcott wrote:
    On 7/6/2026 9:41 PM, André G. Isaak wrote:
    On 2026-07-06 20:24, olcott wrote:

    ∀x(φ(x) ∧ ¬φ(x)) ⊢ ⊥
    and
            Γ ⊢ ⊥
    --------------------
    derivation terminated

    That's simply gibberish.

    André


    How do you think that:
     From a contradiction nothing follows
    should be encoded?

    Since you don't understand the formalism you're trying to use, why
    bother trying to formalize it?

    Both LLMs agree that I am already correct.

    LLMs carry no weight in my opinion.

    This is also your own error.

    And since you can't clearly express
    yourself, it wouldn't be clear exactly what they were agreeing with
    anyways.


    How do we formalize: "from a contradiction nothing follows?"

    You can simply state it in English. but what you're stating is simply
    false.

    I am overriding and superseding the psychotic break
    from reality of the principle of explosion.
    Numerous famous logicians have done this same
    thing in several different ways.

    They've done it by adopting paraconsistent logics which raise their own
    set of problems. Most importantly, though, none of them have claimed to
    have removed the principle of explosion from classical logic.


    They did it by taking semantics out of the formal
    language where it can be ignored. Ridiculously stupid
    mistake.

    The fact that *anything* follows from a contradiction

    Is totally fucked up nonsense that only a psychotic
    would not reject in less than three seconds.

    Since the overwhelming majority of logicians accept this having spent

    Proves that consensus is no measure of truth.

    *In my new logic system*
    P ⊢ Q means syntactic derivation implements
    semantic entailment encoded in syntactically
    the language. This is the only inference
    steps allowed. The entailment rules depend
    on the represented domain.

    So the above seems to be the only good way to do this.
    Everything else is not as much as half-assed.

    far more than three seconds contemplating it, you might want to
    reconsider your position. You really should contemplate the possibility
    that you have misunderstood the topic.

    isn't some axiom that can be removed from standard logic and replaced
    with something else. It's a consequence of the basic definitions used.

    André


    That breaks the coherence notion of truth.

    No, it does not.

    André

    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Ross Finlayson@ross.a.finlayson@gmail.com to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Mon Jul 6 21:58:15 2026
    From Newsgroup: comp.ai.philosophy

    On 07/06/2026 08:28 PM, André G. Isaak wrote:
    On 2026-07-06 21:12, olcott wrote:
    On 7/6/2026 10:03 PM, André G. Isaak wrote:
    On 2026-07-06 20:44, olcott wrote:
    On 7/6/2026 9:41 PM, André G. Isaak wrote:
    On 2026-07-06 20:24, olcott wrote:

    ∀x(φ(x) ∧ ¬φ(x)) ⊢ ⊥
    and
    Γ ⊢ ⊥
    --------------------
    derivation terminated

    That's simply gibberish.

    André


    How do you think that:
    From a contradiction nothing follows
    should be encoded?

    Since you don't understand the formalism you're trying to use, why
    bother trying to formalize it?

    Both LLMs agree that I am already correct.

    LLMs carry no weight in my opinion. And since you can't clearly express yourself, it wouldn't be clear exactly what they were agreeing with
    anyways.

    You can simply state it in English. but what you're stating is simply
    false.

    I am overriding and superseding the psychotic break
    from reality of the principle of explosion.
    Numerous famous logicians have done this same
    thing in several different ways.

    They've done it by adopting paraconsistent logics which raise their own
    set of problems. Most importantly, though, none of them have claimed to
    have removed the principle of explosion from classical logic.

    The fact that *anything* follows from a contradiction

    Is totally fucked up nonsense that only a psychotic
    would not reject in less than three seconds.

    Since the overwhelming majority of logicians accept this having spent
    far more than three seconds contemplating it, you might want to
    reconsider your position. You really should contemplate the possibility
    that you have misunderstood the topic.

    isn't some axiom that can be removed from standard logic and replaced
    with something else. It's a consequence of the basic definitions used.

    André


    That breaks the coherence notion of truth.

    No, it does not.

    André


    I do, I say that classical logic since Chrysippus, with Aristotle,
    is a modal, temporal, relevance logic: that "classical quasi-modal
    logic" since Philo and Plotinus and usually in the classroom since the
    20'th century is _not_.

    Somebody like Richard McKeon reflects on this in his account of Aristotle.


    Then, "paraconsistent" or "non-classical logics" have that the
    di-aletheic is just an account of a setting for resolving inductive
    paradox, not accommodating it. I.e., when "non-classical" or
    "synthetic" or "pluralistic" logics are mutually inconsistent,
    they're mutually inconsistent.



    I've never accepted material implication since Philo and Plotinus,
    and direct implication from the likes of Augustus de Morgan is
    quite suitable for all logical purposes.


    So, here there's a principle of inversion, sort of like what's
    suggested by the recent talk about Prawitz and inversion principle,
    and not tertium-non-datur and excluded-middle, since there are
    non-binary propositions, and the account of weighing alternatives
    itself is tertium-datur.


    Then, there's a principle of thorough reason, beyond a principle
    of "sufficient" reason, that like inverse subsumes and is sublime,
    per Kant, for non-contradiction, then the thorough is: sufficient.


    So, I remove the "quasi-modal" from classical logic,
    and explosion goes with it.




    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Tue Jul 7 09:31:48 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-06 21:40, olcott wrote:
    On 7/6/2026 10:28 PM, André G. Isaak wrote:
    On 2026-07-06 21:12, olcott wrote:
    On 7/6/2026 10:03 PM, André G. Isaak wrote:
    On 2026-07-06 20:44, olcott wrote:
    On 7/6/2026 9:41 PM, André G. Isaak wrote:
    On 2026-07-06 20:24, olcott wrote:

    ∀x(φ(x) ∧ ¬φ(x)) ⊢ ⊥
    and
            Γ ⊢ ⊥
    --------------------
    derivation terminated

    That's simply gibberish.

    André


    How do you think that:
     From a contradiction nothing follows
    should be encoded?

    Since you don't understand the formalism you're trying to use, why
    bother trying to formalize it?

    Both LLMs agree that I am already correct.

    LLMs carry no weight in my opinion.

    This is also your own error.

    And since you can't clearly express yourself, it wouldn't be clear
    exactly what they were agreeing with anyways.


    How do we formalize: "from a contradiction nothing follows?"

    You really ought to take an introductory course in formal logic, or
    simply give up on trying to formalize things. If you really wanted to
    you could write something like

    ∀Φ ¬∃Ψ (Φ ∧ ¬Φ) → Ψ

    But simply looking at the truth table for → would reveal that this
    statement is false.

    You can simply state it in English. but what you're stating is
    simply false.

    I am overriding and superseding the psychotic break
    from reality of the principle of explosion.
    Numerous famous logicians have done this same
    thing in several different ways.

    They've done it by adopting paraconsistent logics which raise their
    own set of problems. Most importantly, though, none of them have
    claimed to have removed the principle of explosion from classical logic.


    They did it by taking semantics out of the formal
    language where it can be ignored. Ridiculously stupid
    mistake.

    The fact that *anything* follows from a contradiction

    Is totally fucked up nonsense that only a psychotic
    would not reject in less than three seconds.

    Since the overwhelming majority of logicians accept this having spent

    Proves that consensus is no measure of truth.

    Consensus may not be a measure of truth, but accusing the overwhelming majority of logicians of being 'psychotic' seems a bit much. And I'll
    take the consensus of logicians who have actually studied logic over the
    word of one internet crank who has consistently demonstrated a complete ignorance of formal logic.

    André

    *In my new logic system*
    P ⊢ Q means syntactic derivation implements
    semantic entailment encoded in syntactically
    the language.  This is the only inference
    steps allowed. The entailment rules depend
    on the represented domain.

    So the above seems to be the only good way to do this.
    Everything else is not as much as half-assed.

    far more than three seconds contemplating it, you might want to
    reconsider your position. You really should contemplate the
    possibility that you have misunderstood the topic.

    isn't some axiom that can be removed from standard logic and
    replaced with something else. It's a consequence of the basic
    definitions used.

    André


    That breaks the coherence notion of truth.

    No, it does not.

    André



    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Ross Finlayson@ross.a.finlayson@gmail.com to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Tue Jul 7 08:44:28 2026
    From Newsgroup: comp.ai.philosophy

    On 07/06/2026 09:58 PM, Ross Finlayson wrote:
    On 07/06/2026 08:28 PM, André G. Isaak wrote:
    On 2026-07-06 21:12, olcott wrote:
    On 7/6/2026 10:03 PM, André G. Isaak wrote:
    On 2026-07-06 20:44, olcott wrote:
    On 7/6/2026 9:41 PM, André G. Isaak wrote:
    On 2026-07-06 20:24, olcott wrote:

    ∀x(φ(x) ∧ ¬φ(x)) ⊢ ⊥
    and
    Γ ⊢ ⊥
    --------------------
    derivation terminated

    That's simply gibberish.

    André


    How do you think that:
    From a contradiction nothing follows
    should be encoded?

    Since you don't understand the formalism you're trying to use, why
    bother trying to formalize it?

    Both LLMs agree that I am already correct.

    LLMs carry no weight in my opinion. And since you can't clearly express
    yourself, it wouldn't be clear exactly what they were agreeing with
    anyways.

    You can simply state it in English. but what you're stating is simply
    false.

    I am overriding and superseding the psychotic break
    from reality of the principle of explosion.
    Numerous famous logicians have done this same
    thing in several different ways.

    They've done it by adopting paraconsistent logics which raise their own
    set of problems. Most importantly, though, none of them have claimed to
    have removed the principle of explosion from classical logic.

    The fact that *anything* follows from a contradiction

    Is totally fucked up nonsense that only a psychotic
    would not reject in less than three seconds.

    Since the overwhelming majority of logicians accept this having spent
    far more than three seconds contemplating it, you might want to
    reconsider your position. You really should contemplate the possibility
    that you have misunderstood the topic.

    isn't some axiom that can be removed from standard logic and replaced
    with something else. It's a consequence of the basic definitions used. >>>>
    André


    That breaks the coherence notion of truth.

    No, it does not.

    André


    I do, I say that classical logic since Chrysippus, with Aristotle,
    is a modal, temporal, relevance logic: that "classical quasi-modal
    logic" since Philo and Plotinus and usually in the classroom since the
    20'th century is _not_.

    Somebody like Richard McKeon reflects on this in his account of Aristotle.


    Then, "paraconsistent" or "non-classical logics" have that the
    di-aletheic is just an account of a setting for resolving inductive
    paradox, not accommodating it. I.e., when "non-classical" or
    "synthetic" or "pluralistic" logics are mutually inconsistent,
    they're mutually inconsistent.



    I've never accepted material implication since Philo and Plotinus,
    and direct implication from the likes of Augustus de Morgan is
    quite suitable for all logical purposes.


    So, here there's a principle of inversion, sort of like what's
    suggested by the recent talk about Prawitz and inversion principle,
    and not tertium-non-datur and excluded-middle, since there are
    non-binary propositions, and the account of weighing alternatives
    itself is tertium-datur.


    Then, there's a principle of thorough reason, beyond a principle
    of "sufficient" reason, that like inverse subsumes and is sublime,
    per Kant, for non-contradiction, then the thorough is: sufficient.


    So, I remove the "quasi-modal" from classical logic,
    and explosion goes with it.





    About "standard", the definition, there are a variety of usual meanings
    of "standard".

    The default, the common, and so on, then a usual idea is as to define
    the "non-standard", that the positive definition is to the negative
    term, as it were.


    So, having "infinity" or the "non-archimedean", or, the
    "super-archimedean", has that there are different accounts among the
    "non-" and the "super-", of the standard.

    So, "standard" usually enough means "regularity with a completion",
    like in set theory "an ordinary inductive set".

    Then, what "standard" means in "classical logic", it's sort of
    what follows from "standard vacuity", that the quasi-modal is
    as after making an account of using vacuity to make a regularity,
    instead of that vacuity or emptiness is ordinary, that like
    infinity, ordinary and extra-ordinary, is emptiness, ordinary
    and extra-ordinary.


    So, completion in mathematics and vacuity in logic, "ordinary"
    as "standard", then have that among accounts of _competing rulialities_,
    that's what's standard to one account is non-standard to
    the other account, here for example for "standard infinitesimals"
    and "standard type", where there are no _nulls_ the values in the
    language, and every type has its own empty set.


    So, then about what's given by _vacuity_ in logic, and called
    "material implication", is not _standard_ in a modal temporal
    relevance logic where references to empty values are typed.


    It's sort of like relational algebra where there are no nulls.



    So, it's simple and usually considered "trivial" what "basic quasi-modal
    logic" makes as a definition after "vacuity" to
    result what's its "regular" what's its "standard".

    Then, it's not trivial nor is it so in other accounts.



    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Ross Finlayson@ross.a.finlayson@gmail.com to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Tue Jul 7 08:56:11 2026
    From Newsgroup: comp.ai.philosophy

    On 07/07/2026 08:44 AM, Ross Finlayson wrote:
    On 07/06/2026 09:58 PM, Ross Finlayson wrote:
    On 07/06/2026 08:28 PM, André G. Isaak wrote:
    On 2026-07-06 21:12, olcott wrote:
    On 7/6/2026 10:03 PM, André G. Isaak wrote:
    On 2026-07-06 20:44, olcott wrote:
    On 7/6/2026 9:41 PM, André G. Isaak wrote:
    On 2026-07-06 20:24, olcott wrote:

    ∀x(φ(x) ∧ ¬φ(x)) ⊢ ⊥
    and
    Γ ⊢ ⊥
    --------------------
    derivation terminated

    That's simply gibberish.

    André


    How do you think that:
    From a contradiction nothing follows
    should be encoded?

    Since you don't understand the formalism you're trying to use, why
    bother trying to formalize it?

    Both LLMs agree that I am already correct.

    LLMs carry no weight in my opinion. And since you can't clearly express
    yourself, it wouldn't be clear exactly what they were agreeing with
    anyways.

    You can simply state it in English. but what you're stating is simply >>>>> false.

    I am overriding and superseding the psychotic break
    from reality of the principle of explosion.
    Numerous famous logicians have done this same
    thing in several different ways.

    They've done it by adopting paraconsistent logics which raise their own
    set of problems. Most importantly, though, none of them have claimed to
    have removed the principle of explosion from classical logic.

    The fact that *anything* follows from a contradiction

    Is totally fucked up nonsense that only a psychotic
    would not reject in less than three seconds.

    Since the overwhelming majority of logicians accept this having spent
    far more than three seconds contemplating it, you might want to
    reconsider your position. You really should contemplate the possibility
    that you have misunderstood the topic.

    isn't some axiom that can be removed from standard logic and replaced >>>>> with something else. It's a consequence of the basic definitions used. >>>>>
    André


    That breaks the coherence notion of truth.

    No, it does not.

    André


    I do, I say that classical logic since Chrysippus, with Aristotle,
    is a modal, temporal, relevance logic: that "classical quasi-modal
    logic" since Philo and Plotinus and usually in the classroom since the
    20'th century is _not_.

    Somebody like Richard McKeon reflects on this in his account of
    Aristotle.


    Then, "paraconsistent" or "non-classical logics" have that the
    di-aletheic is just an account of a setting for resolving inductive
    paradox, not accommodating it. I.e., when "non-classical" or
    "synthetic" or "pluralistic" logics are mutually inconsistent,
    they're mutually inconsistent.



    I've never accepted material implication since Philo and Plotinus,
    and direct implication from the likes of Augustus de Morgan is
    quite suitable for all logical purposes.


    So, here there's a principle of inversion, sort of like what's
    suggested by the recent talk about Prawitz and inversion principle,
    and not tertium-non-datur and excluded-middle, since there are
    non-binary propositions, and the account of weighing alternatives
    itself is tertium-datur.


    Then, there's a principle of thorough reason, beyond a principle
    of "sufficient" reason, that like inverse subsumes and is sublime,
    per Kant, for non-contradiction, then the thorough is: sufficient.


    So, I remove the "quasi-modal" from classical logic,
    and explosion goes with it.





    About "standard", the definition, there are a variety of usual meanings
    of "standard".

    The default, the common, and so on, then a usual idea is as to define
    the "non-standard", that the positive definition is to the negative
    term, as it were.


    So, having "infinity" or the "non-archimedean", or, the
    "super-archimedean", has that there are different accounts among the
    "non-" and the "super-", of the standard.

    So, "standard" usually enough means "regularity with a completion",
    like in set theory "an ordinary inductive set".

    Then, what "standard" means in "classical logic", it's sort of
    what follows from "standard vacuity", that the quasi-modal is
    as after making an account of using vacuity to make a regularity,
    instead of that vacuity or emptiness is ordinary, that like
    infinity, ordinary and extra-ordinary, is emptiness, ordinary
    and extra-ordinary.


    So, completion in mathematics and vacuity in logic, "ordinary"
    as "standard", then have that among accounts of _competing rulialities_, that's what's standard to one account is non-standard to
    the other account, here for example for "standard infinitesimals"
    and "standard type", where there are no _nulls_ the values in the
    language, and every type has its own empty set.


    So, then about what's given by _vacuity_ in logic, and called
    "material implication", is not _standard_ in a modal temporal
    relevance logic where references to empty values are typed.


    It's sort of like relational algebra where there are no nulls.



    So, it's simple and usually considered "trivial" what "basic quasi-modal logic" makes as a definition after "vacuity" to
    result what's its "regular" what's its "standard".

    Then, it's not trivial nor is it so in other accounts.




    So, "super-classical", then, and, of the "extra-ordinary",
    infinity and vacuity.

    Then, according to ancient accounts, that's "classical",
    and with "classical expositions of the super-classical".


    Then, "extra-ordinary" is a term at least since Mirimanoff,
    and many, many logicians explore super-classical and extra-ordinary
    logics, not "non-classical" nor for that matter "classical quasi-modal",
    what's their "super-standard".


    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Tue Jul 7 11:04:55 2026
    From Newsgroup: comp.ai.philosophy

    On 7/7/2026 10:31 AM, André G. Isaak wrote:
    On 2026-07-06 21:40, olcott wrote:
    On 7/6/2026 10:28 PM, André G. Isaak wrote:
    On 2026-07-06 21:12, olcott wrote:
    On 7/6/2026 10:03 PM, André G. Isaak wrote:
    On 2026-07-06 20:44, olcott wrote:
    On 7/6/2026 9:41 PM, André G. Isaak wrote:
    On 2026-07-06 20:24, olcott wrote:

    ∀x(φ(x) ∧ ¬φ(x)) ⊢ ⊥
    and
            Γ ⊢ ⊥
    --------------------
    derivation terminated

    That's simply gibberish.

    André


    How do you think that:
     From a contradiction nothing follows
    should be encoded?

    Since you don't understand the formalism you're trying to use, why
    bother trying to formalize it?

    Both LLMs agree that I am already correct.

    LLMs carry no weight in my opinion.

    This is also your own error.

    And since you can't clearly express yourself, it wouldn't be clear
    exactly what they were agreeing with anyways.


    How do we formalize: "from a contradiction nothing follows?"

    You really ought to take an introductory course in formal logic, or
    simply give up on trying to formalize things. If you really wanted to
    you could write something like

    ∀Φ ¬∃Ψ (Φ ∧ ¬Φ) → Ψ

    But simply looking at the truth table for → would reveal that this statement is false.


    P ⊢ Q means syntactic derivation implements semantic
    entailment encoded in syntactically the language.
    This is the only inference steps allowed. The entailment
    rules depend on the represented domain.

    I am going with this in terms of

    The Definitional View of Atomic Systems in Proof-Theoretic
    Semantics Thomas Piecha and Peter Schroeder-Heister

    When you actually look at the meaning of the English
    words of the sentences then it becomes obvious that
    the principle of explosion can only occur when you
    ignore this underlying semantics.
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Tue Jul 7 12:46:24 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-07 10:04, olcott wrote:
    On 7/7/2026 10:31 AM, André G. Isaak wrote:
    On 2026-07-06 21:40, olcott wrote:
    On 7/6/2026 10:28 PM, André G. Isaak wrote:
    On 2026-07-06 21:12, olcott wrote:
    On 7/6/2026 10:03 PM, André G. Isaak wrote:
    On 2026-07-06 20:44, olcott wrote:
    On 7/6/2026 9:41 PM, André G. Isaak wrote:
    On 2026-07-06 20:24, olcott wrote:

    ∀x(φ(x) ∧ ¬φ(x)) ⊢ ⊥
    and
            Γ ⊢ ⊥
    --------------------
    derivation terminated

    That's simply gibberish.

    André


    How do you think that:
     From a contradiction nothing follows
    should be encoded?

    Since you don't understand the formalism you're trying to use, why >>>>>> bother trying to formalize it?

    Both LLMs agree that I am already correct.

    LLMs carry no weight in my opinion.

    This is also your own error.

    And since you can't clearly express yourself, it wouldn't be clear
    exactly what they were agreeing with anyways.


    How do we formalize: "from a contradiction nothing follows?"

    You really ought to take an introductory course in formal logic, or
    simply give up on trying to formalize things. If you really wanted to
    you could write something like

    ∀Φ ¬∃Ψ (Φ ∧ ¬Φ) → Ψ

    But simply looking at the truth table for → would reveal that this
    statement is false.


    P ⊢ Q means syntactic derivation implements semantic
    entailment encoded in syntactically the language.
    This is the only inference steps allowed. The entailment
    rules depend on the represented domain.

    That really doesn't seem to say anything. Why don't you illustrate this
    with a simple mathematical proof which shows exactly what you mean by 'semantic entailments encoded syntactically in the language'

    André

    I am going with this in terms of

    The Definitional View of Atomic Systems in Proof-Theoretic
    Semantics Thomas Piecha and Peter Schroeder-Heister

    When you actually look at the meaning of the English
    words of the sentences then it becomes obvious that
    the principle of explosion can only occur when you
    ignore this underlying semantics.

    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Tue Jul 7 14:19:21 2026
    From Newsgroup: comp.ai.philosophy

    On 7/7/2026 1:46 PM, André G. Isaak wrote:
    On 2026-07-07 10:04, olcott wrote:
    On 7/7/2026 10:31 AM, André G. Isaak wrote:
    On 2026-07-06 21:40, olcott wrote:
    On 7/6/2026 10:28 PM, André G. Isaak wrote:
    On 2026-07-06 21:12, olcott wrote:
    On 7/6/2026 10:03 PM, André G. Isaak wrote:
    On 2026-07-06 20:44, olcott wrote:
    On 7/6/2026 9:41 PM, André G. Isaak wrote:
    On 2026-07-06 20:24, olcott wrote:

    ∀x(φ(x) ∧ ¬φ(x)) ⊢ ⊥
    and
            Γ ⊢ ⊥
    --------------------
    derivation terminated

    That's simply gibberish.

    André


    How do you think that:
     From a contradiction nothing follows
    should be encoded?

    Since you don't understand the formalism you're trying to use,
    why bother trying to formalize it?

    Both LLMs agree that I am already correct.

    LLMs carry no weight in my opinion.

    This is also your own error.

    And since you can't clearly express yourself, it wouldn't be clear
    exactly what they were agreeing with anyways.


    How do we formalize: "from a contradiction nothing follows?"

    You really ought to take an introductory course in formal logic, or
    simply give up on trying to formalize things. If you really wanted to
    you could write something like

    ∀Φ ¬∃Ψ (Φ ∧ ¬Φ) → Ψ

    But simply looking at the truth table for → would reveal that this
    statement is false.


    P ⊢ Q means syntactic derivation implements semantic
    entailment encoded in syntactically the language.
    This is the only inference steps allowed. The entailment
    rules depend on the represented domain.

    That really doesn't seem to say anything. Why don't you illustrate this
    with a simple mathematical proof which shows exactly what you mean by 'semantic entailments encoded syntactically in the language'


    To do with with minimal simplicity the axioms of
    PA are construed as semantic entailment thus when
    there is no sequence of inference steps between G
    and PA then G is Kripke undefined in PA.

    André

    I am going with this in terms of

    The Definitional View of Atomic Systems in Proof-Theoretic
    Semantics Thomas Piecha and Peter Schroeder-Heister

    When you actually look at the meaning of the English
    words of the sentences then it becomes obvious that
    the principle of explosion can only occur when you
    ignore this underlying semantics.


    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Tue Jul 7 13:29:11 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-07 13:19, olcott wrote:
    On 7/7/2026 1:46 PM, André G. Isaak wrote:
    On 2026-07-07 10:04, olcott wrote:
    On 7/7/2026 10:31 AM, André G. Isaak wrote:
    On 2026-07-06 21:40, olcott wrote:
    On 7/6/2026 10:28 PM, André G. Isaak wrote:
    On 2026-07-06 21:12, olcott wrote:
    On 7/6/2026 10:03 PM, André G. Isaak wrote:
    On 2026-07-06 20:44, olcott wrote:
    On 7/6/2026 9:41 PM, André G. Isaak wrote:
    On 2026-07-06 20:24, olcott wrote:

    ∀x(φ(x) ∧ ¬φ(x)) ⊢ ⊥
    and
            Γ ⊢ ⊥
    --------------------
    derivation terminated

    That's simply gibberish.

    André


    How do you think that:
     From a contradiction nothing follows
    should be encoded?

    Since you don't understand the formalism you're trying to use, >>>>>>>> why bother trying to formalize it?

    Both LLMs agree that I am already correct.

    LLMs carry no weight in my opinion.

    This is also your own error.

    And since you can't clearly express yourself, it wouldn't be clear >>>>>> exactly what they were agreeing with anyways.


    How do we formalize: "from a contradiction nothing follows?"

    You really ought to take an introductory course in formal logic, or
    simply give up on trying to formalize things. If you really wanted
    to you could write something like

    ∀Φ ¬∃Ψ (Φ ∧ ¬Φ) → Ψ

    But simply looking at the truth table for → would reveal that this
    statement is false.


    P ⊢ Q means syntactic derivation implements semantic
    entailment encoded in syntactically the language.
    This is the only inference steps allowed. The entailment
    rules depend on the represented domain.

    That really doesn't seem to say anything. Why don't you illustrate
    this with a simple mathematical proof which shows exactly what you
    mean by 'semantic entailments encoded syntactically in the language'


    To do with with minimal simplicity the axioms of
    PA are construed as semantic entailment thus when
    there is no sequence of inference steps between G
    and PA then G is Kripke undefined in PA.

    So why don't you illustrate this with an actual proof?

    André
    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Tue Jul 7 14:53:24 2026
    From Newsgroup: comp.ai.philosophy

    On 7/7/2026 2:29 PM, André G. Isaak wrote:
    On 2026-07-07 13:19, olcott wrote:
    On 7/7/2026 1:46 PM, André G. Isaak wrote:
    On 2026-07-07 10:04, olcott wrote:
    On 7/7/2026 10:31 AM, André G. Isaak wrote:
    On 2026-07-06 21:40, olcott wrote:
    On 7/6/2026 10:28 PM, André G. Isaak wrote:
    On 2026-07-06 21:12, olcott wrote:
    On 7/6/2026 10:03 PM, André G. Isaak wrote:
    On 2026-07-06 20:44, olcott wrote:
    On 7/6/2026 9:41 PM, André G. Isaak wrote:
    On 2026-07-06 20:24, olcott wrote:

    ∀x(φ(x) ∧ ¬φ(x)) ⊢ ⊥
    and
            Γ ⊢ ⊥
    --------------------
    derivation terminated

    That's simply gibberish.

    André


    How do you think that:
     From a contradiction nothing follows
    should be encoded?

    Since you don't understand the formalism you're trying to use, >>>>>>>>> why bother trying to formalize it?

    Both LLMs agree that I am already correct.

    LLMs carry no weight in my opinion.

    This is also your own error.

    And since you can't clearly express yourself, it wouldn't be
    clear exactly what they were agreeing with anyways.


    How do we formalize: "from a contradiction nothing follows?"

    You really ought to take an introductory course in formal logic, or >>>>> simply give up on trying to formalize things. If you really wanted
    to you could write something like

    ∀Φ ¬∃Ψ (Φ ∧ ¬Φ) → Ψ

    But simply looking at the truth table for → would reveal that this >>>>> statement is false.


    P ⊢ Q means syntactic derivation implements semantic
    entailment encoded in syntactically the language.
    This is the only inference steps allowed. The entailment
    rules depend on the represented domain.

    That really doesn't seem to say anything. Why don't you illustrate
    this with a simple mathematical proof which shows exactly what you
    mean by 'semantic entailments encoded syntactically in the language'


    To do with with minimal simplicity the axioms of
    PA are construed as semantic entailment thus when
    there is no sequence of inference steps between G
    and PA then G is Kripke undefined in PA.

    So why don't you illustrate this with an actual proof?

    André


    The principle is simply whenever X cannot be proven
    in F then X is ungrounded in the atomic base F. Even
    diagonalization makes to attempt at actual proof.
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Tue Jul 7 14:08:30 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-07 13:53, olcott wrote:
    On 7/7/2026 2:29 PM, André G. Isaak wrote:
    On 2026-07-07 13:19, olcott wrote:

    To do with with minimal simplicity the axioms of
    PA are construed as semantic entailment thus when
    there is no sequence of inference steps between G
    and PA then G is Kripke undefined in PA.

    So why don't you illustrate this with an actual proof?

    André


    The principle is simply whenever X cannot be proven
    in F then X is ungrounded in the atomic base F. Even
    diagonalization makes to attempt at actual proof.

    I can't make heads or tails of that.

    If you can't illustrate your alleged system with a simple proof, then I
    have no choice but to conclude that it is as ill-defined to you as it is
    to me.

    André
    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Tue Jul 7 16:13:53 2026
    From Newsgroup: comp.ai.philosophy

    On 7/7/2026 3:08 PM, André G. Isaak wrote:
    On 2026-07-07 13:53, olcott wrote:
    On 7/7/2026 2:29 PM, André G. Isaak wrote:
    On 2026-07-07 13:19, olcott wrote:

    To do with with minimal simplicity the axioms of
    PA are construed as semantic entailment thus when
    there is no sequence of inference steps between G
    and PA then G is Kripke undefined in PA.

    So why don't you illustrate this with an actual proof?

    André


    The principle is simply whenever X cannot be proven
    in F then X is ungrounded in the atomic base F. Even
    diagonalization makes to attempt at actual proof.

    I can't make heads or tails of that.


    The actual proof in meta-math that G cannot be
    proved in PA is itself not any sequence of inference
    steps. It simply uses a version of the proof that
    Cantor use to show that reals are not countable.

    If you can't illustrate your alleged system with a simple proof, then I
    have no choice but to conclude that it is as ill-defined to you as it is
    to me.

    André


    2 + 3 = 4 in PA cannot be proven because
    s(s(0)) + s(s(s(0))) != s(s(s(s(0))))
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Tue Jul 7 15:24:52 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-07 15:13, olcott wrote:
    On 7/7/2026 3:08 PM, André G. Isaak wrote:
    On 2026-07-07 13:53, olcott wrote:
    On 7/7/2026 2:29 PM, André G. Isaak wrote:
    On 2026-07-07 13:19, olcott wrote:

    To do with with minimal simplicity the axioms of
    PA are construed as semantic entailment thus when
    there is no sequence of inference steps between G
    and PA then G is Kripke undefined in PA.

    So why don't you illustrate this with an actual proof?

    André


    The principle is simply whenever X cannot be proven
    in F then X is ungrounded in the atomic base F. Even
    diagonalization makes to attempt at actual proof.

    I can't make heads or tails of that.


    The actual proof in meta-math that G cannot be
    proved in PA is itself not any sequence of inference
    steps. It simply uses a version of the proof that
    Cantor use to show that reals are not countable.

    ???

    Cantor's proof absolutely contained inference steps, as did Gödels. I
    don't think you actually know what you're talking about.

    If you can't illustrate your alleged system with a simple proof, then
    I have no choice but to conclude that it is as ill-defined to you as
    it is to me.

    André


    2 + 3 = 4 in PA cannot be proven because
    s(s(0)) + s(s(s(0))) != s(s(s(s(0))))

    I asked you to provide an example of a proof which illustrates what you
    mean by "semantic entailments encoded syntactically in the language". I
    didn't ask for an example of something which cannot be proven.

    André
    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Tue Jul 7 16:30:32 2026
    From Newsgroup: comp.ai.philosophy

    On 7/7/2026 4:24 PM, André G. Isaak wrote:
    On 2026-07-07 15:13, olcott wrote:
    On 7/7/2026 3:08 PM, André G. Isaak wrote:
    On 2026-07-07 13:53, olcott wrote:
    On 7/7/2026 2:29 PM, André G. Isaak wrote:
    On 2026-07-07 13:19, olcott wrote:

    To do with with minimal simplicity the axioms of
    PA are construed as semantic entailment thus when
    there is no sequence of inference steps between G
    and PA then G is Kripke undefined in PA.

    So why don't you illustrate this with an actual proof?

    André


    The principle is simply whenever X cannot be proven
    in F then X is ungrounded in the atomic base F. Even
    diagonalization makes to attempt at actual proof.

    I can't make heads or tails of that.


    The actual proof in meta-math that G cannot be
    proved in PA is itself not any sequence of inference
    steps. It simply uses a version of the proof that
    Cantor use to show that reals are not countable.

    ???

    Cantor's proof absolutely contained inference steps, as did Gödels. I
    don't think you actually know what you're talking about.

    If you can't illustrate your alleged system with a simple proof, then
    I have no choice but to conclude that it is as ill-defined to you as
    it is to me.

    André


    2 + 3 = 4 in PA cannot be proven because
    s(s(0)) + s(s(s(0))) != s(s(s(s(0))))

    I asked you to provide an example of a proof which illustrates what you
    mean by "semantic entailments encoded syntactically in the language". I didn't ask for an example of something which cannot be proven.

    André


    PTS simply declares by fiat that syntactic inference steps
    are semantic steps. I actually mean natural language semantic
    inference in the CycL programming language. This is the place
    where nothing follows form a contradiction is most easily seen.
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Tue Jul 7 17:06:17 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-07 15:30, olcott wrote:
    On 7/7/2026 4:24 PM, André G. Isaak wrote:
    On 2026-07-07 15:13, olcott wrote:
    On 7/7/2026 3:08 PM, André G. Isaak wrote:
    On 2026-07-07 13:53, olcott wrote:
    On 7/7/2026 2:29 PM, André G. Isaak wrote:
    On 2026-07-07 13:19, olcott wrote:

    To do with with minimal simplicity the axioms of
    PA are construed as semantic entailment thus when
    there is no sequence of inference steps between G
    and PA then G is Kripke undefined in PA.

    So why don't you illustrate this with an actual proof?

    André


    The principle is simply whenever X cannot be proven
    in F then X is ungrounded in the atomic base F. Even
    diagonalization makes to attempt at actual proof.

    I can't make heads or tails of that.


    The actual proof in meta-math that G cannot be
    proved in PA is itself not any sequence of inference
    steps. It simply uses a version of the proof that
    Cantor use to show that reals are not countable.

    ???

    Cantor's proof absolutely contained inference steps, as did Gödels. I
    don't think you actually know what you're talking about.

    If you can't illustrate your alleged system with a simple proof,
    then I have no choice but to conclude that it is as ill-defined to
    you as it is to me.

    André


    2 + 3 = 4 in PA cannot be proven because
    s(s(0)) + s(s(s(0))) != s(s(s(s(0))))

    I asked you to provide an example of a proof which illustrates what
    you mean by "semantic entailments encoded syntactically in the
    language". I didn't ask for an example of something which cannot be
    proven.

    André


    PTS simply declares by fiat that syntactic inference steps
    are semantic steps. I actually mean natural language semantic
    inference in the CycL programming language. This is the place
    where nothing follows form a contradiction is most easily seen.

    So basically you're saying that you are incapable of constructing even a simple mathematical proof. Gödel is about theories of arithmetic. CycL
    is not. If you can't construct proofs in an arithmetic framework you
    really have no business talking about Gödel.

    André
    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Tue Jul 7 19:05:47 2026
    From Newsgroup: comp.ai.philosophy

    On 7/7/2026 6:06 PM, André G. Isaak wrote:
    On 2026-07-07 15:30, olcott wrote:
    On 7/7/2026 4:24 PM, André G. Isaak wrote:
    On 2026-07-07 15:13, olcott wrote:
    On 7/7/2026 3:08 PM, André G. Isaak wrote:
    On 2026-07-07 13:53, olcott wrote:
    On 7/7/2026 2:29 PM, André G. Isaak wrote:
    On 2026-07-07 13:19, olcott wrote:

    To do with with minimal simplicity the axioms of
    PA are construed as semantic entailment thus when
    there is no sequence of inference steps between G
    and PA then G is Kripke undefined in PA.

    So why don't you illustrate this with an actual proof?

    André


    The principle is simply whenever X cannot be proven
    in F then X is ungrounded in the atomic base F. Even
    diagonalization makes to attempt at actual proof.

    I can't make heads or tails of that.


    The actual proof in meta-math that G cannot be
    proved in PA is itself not any sequence of inference
    steps. It simply uses a version of the proof that
    Cantor use to show that reals are not countable.

    ???

    Cantor's proof absolutely contained inference steps, as did Gödels. I
    don't think you actually know what you're talking about.

    If you can't illustrate your alleged system with a simple proof,
    then I have no choice but to conclude that it is as ill-defined to
    you as it is to me.

    André


    2 + 3 = 4 in PA cannot be proven because
    s(s(0)) + s(s(s(0))) != s(s(s(s(0))))

    I asked you to provide an example of a proof which illustrates what
    you mean by "semantic entailments encoded syntactically in the
    language". I didn't ask for an example of something which cannot be
    proven.

    André


    PTS simply declares by fiat that syntactic inference steps
    are semantic steps. I actually mean natural language semantic
    inference in the CycL programming language. This is the place
    where nothing follows form a contradiction is most easily seen.

    So basically you're saying that you are incapable of constructing even a simple mathematical proof. Gödel is about theories of arithmetic. CycL
    is not. If you can't construct proofs in an arithmetic framework you
    really have no business talking about Gödel.

    André


    So basically you are totally not interested in understanding me.
    As far as proofs go I always think in terms of syllogisms and
    their extensions. Every other proof is utterly irrelevant to my
    work.
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?=@agisaak@gm.invalid to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Tue Jul 7 19:17:18 2026
    From Newsgroup: comp.ai.philosophy

    On 2026-07-07 18:05, olcott wrote:
    On 7/7/2026 6:06 PM, André G. Isaak wrote:
    On 2026-07-07 15:30, olcott wrote:
    On 7/7/2026 4:24 PM, André G. Isaak wrote:
    On 2026-07-07 15:13, olcott wrote:
    On 7/7/2026 3:08 PM, André G. Isaak wrote:
    On 2026-07-07 13:53, olcott wrote:
    On 7/7/2026 2:29 PM, André G. Isaak wrote:
    On 2026-07-07 13:19, olcott wrote:

    To do with with minimal simplicity the axioms of
    PA are construed as semantic entailment thus when
    there is no sequence of inference steps between G
    and PA then G is Kripke undefined in PA.

    So why don't you illustrate this with an actual proof?

    André


    The principle is simply whenever X cannot be proven
    in F then X is ungrounded in the atomic base F. Even
    diagonalization makes to attempt at actual proof.

    I can't make heads or tails of that.


    The actual proof in meta-math that G cannot be
    proved in PA is itself not any sequence of inference
    steps. It simply uses a version of the proof that
    Cantor use to show that reals are not countable.

    ???

    Cantor's proof absolutely contained inference steps, as did Gödels.
    I don't think you actually know what you're talking about.

    If you can't illustrate your alleged system with a simple proof,
    then I have no choice but to conclude that it is as ill-defined to >>>>>> you as it is to me.

    André


    2 + 3 = 4 in PA cannot be proven because
    s(s(0)) + s(s(s(0))) != s(s(s(s(0))))

    I asked you to provide an example of a proof which illustrates what
    you mean by "semantic entailments encoded syntactically in the
    language". I didn't ask for an example of something which cannot be
    proven.

    André


    PTS simply declares by fiat that syntactic inference steps
    are semantic steps. I actually mean natural language semantic
    inference in the CycL programming language. This is the place
    where nothing follows form a contradiction is most easily seen.

    So basically you're saying that you are incapable of constructing even
    a simple mathematical proof. Gödel is about theories of arithmetic.
    CycL is not. If you can't construct proofs in an arithmetic framework
    you really have no business talking about Gödel.

    André


    So basically you are totally not interested in understanding me.
    As far as proofs go I always think in terms of syllogisms and
    their extensions. Every other proof is utterly irrelevant to my
    work.

    If your interest is limited to syllogisms then both Gödel and the
    halting problem are utterly irrelevant to your work, so you probably
    should stop making claims about them.

    André
    --
    To email remove 'invalid' & replace 'gm' with well known Google mail
    service.

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Tue Jul 7 20:49:06 2026
    From Newsgroup: comp.ai.philosophy

    On 7/7/2026 8:17 PM, André G. Isaak wrote:
    On 2026-07-07 18:05, olcott wrote:
    On 7/7/2026 6:06 PM, André G. Isaak wrote:
    On 2026-07-07 15:30, olcott wrote:
    On 7/7/2026 4:24 PM, André G. Isaak wrote:
    On 2026-07-07 15:13, olcott wrote:
    On 7/7/2026 3:08 PM, André G. Isaak wrote:
    On 2026-07-07 13:53, olcott wrote:
    On 7/7/2026 2:29 PM, André G. Isaak wrote:
    On 2026-07-07 13:19, olcott wrote:

    To do with with minimal simplicity the axioms of
    PA are construed as semantic entailment thus when
    there is no sequence of inference steps between G
    and PA then G is Kripke undefined in PA.

    So why don't you illustrate this with an actual proof?

    André


    The principle is simply whenever X cannot be proven
    in F then X is ungrounded in the atomic base F. Even
    diagonalization makes to attempt at actual proof.

    I can't make heads or tails of that.


    The actual proof in meta-math that G cannot be
    proved in PA is itself not any sequence of inference
    steps. It simply uses a version of the proof that
    Cantor use to show that reals are not countable.

    ???

    Cantor's proof absolutely contained inference steps, as did Gödels. >>>>> I don't think you actually know what you're talking about.

    If you can't illustrate your alleged system with a simple proof, >>>>>>> then I have no choice but to conclude that it is as ill-defined >>>>>>> to you as it is to me.

    André


    2 + 3 = 4 in PA cannot be proven because
    s(s(0)) + s(s(s(0))) != s(s(s(s(0))))

    I asked you to provide an example of a proof which illustrates what >>>>> you mean by "semantic entailments encoded syntactically in the
    language". I didn't ask for an example of something which cannot be >>>>> proven.

    André


    PTS simply declares by fiat that syntactic inference steps
    are semantic steps. I actually mean natural language semantic
    inference in the CycL programming language. This is the place
    where nothing follows form a contradiction is most easily seen.

    So basically you're saying that you are incapable of constructing
    even a simple mathematical proof. Gödel is about theories of
    arithmetic. CycL is not. If you can't construct proofs in an
    arithmetic framework you really have no business talking about Gödel.

    André


    So basically you are totally not interested in understanding me.
    As far as proofs go I always think in terms of syllogisms and
    their extensions. Every other proof is utterly irrelevant to my
    work.

    If your interest is limited to syllogisms then both Gödel and the
    halting problem are utterly irrelevant to your work, so you probably
    should stop making claims about them.

    André


    My interest is in defining automated reasoning
    that approximates infallibility and knows all
    the general knowledge known to man. A system such
    as this would make the best funded disinformation
    teams look like ridiculous fools even to themselves.

    Being able to show all the steps of how PA
    derives 2 + 3 = 5 is totally unrelated to this.
    --
    Copyright 2026 Olcott

    My 28 year goal has been to make
    "true on the basis of meaning expressed in language"
    reliably computable for the entire body of knowledge.
    The complete structure of this system is now defined.

    The entire body of knowledge expressed in language is
    comprised of two types of relations between finite strings:
    (a) *Axioms* Expressions of language that are stipulated to be true.

    My system bridges the analytic/synthetic distinction by
    expressly encoding all empirical "atomic facts" in a formal
    language such as CycL of the Cyc project.

    (b) *Inference Rules* Expressions of language that are semantically
    entailed syntactically from (a) and/or (b).
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Wed Jul 8 12:10:39 2026
    From Newsgroup: comp.ai.philosophy

    On 06/07/2026 20:54, olcott wrote:
    On 7/6/2026 5:17 AM, Mikko wrote:
    On 04/07/2026 16:15, olcott wrote:
    On 7/4/2026 1:37 AM, Mikko wrote:
    On 03/07/2026 17:46, olcott wrote:
    On 7/3/2026 3:17 AM, Mikko wrote:
    On 02/07/2026 17:37, olcott wrote:

    x = "The Moon is made from green cheese"
    y = "Donald Trump is the one and only Lord and Savior Jesus Christ: >>>>>>> POE concludes (x ∧ ¬x) ⊢ y

    "the principle of explosion is the theorem according to
      which any statement can be proven from a contradiction"
    https://en.wikipedia.org/wiki/Principle_of_explosion

    When you pay attention to the meaning of the words
    and correctly apply correct semantic entailment on
    the basis of the meaning of those words then the
    principle of explosion is a PSYCHOTIC BREAK FROM REALITY.

    No, it is not. The premise x above is a break from reality. But that >>>>>> is not in logic, it was introduced by you. Even without the principle >>>>>> of explosion it is possible to infer a false conclusion from a false >>>>>> premise.

    Yes. From "I am 35 feet tall" ⊢ "I am 35 feet tall"
    and as you said my premise is literally FALSE
    (P ∧ ~P) ⊢ FALSE

    The principle of explosion merely facilitates tinding a
    conclusion that is so obviously false that it convincingly proves
    that the remise is false.

    There is nothing semantically relevant that can be
    proven from a contradiction besides bare FALSE and
    bare FALSE only entails bare FALSE.

    Yes, there is. From the contradiction "I have blue eyes and
    I don't have blue eyes" one can prove "I have blue eyes" and
    "I don't have blue eyes", both of which are semantically
    relevant, and one of which in addition is false.


    That is greatly restricted from the POE.
      (P ∧ ~P) ⊢ FALSE // is what can really be proved semantically

    If you can prove that FALSE is true then what is not true?

    That is not proving that false is true.
    It is stipulating that contradictions
    only derive bare FALSE.

    By proof theoretic semantics whatever is derived is true is that system.
    If the postulates or hypotheses include P and ~P then (P ∧ ~P) cna be
    derived and from that FALSE, which is therefore PTS-true.
    --
    Mikko

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Chris M. Thomasson@chris.m.thomasson.1@gmail.com to sci.logic,comp.theory,comp.ai.philosophy,sci.math on Wed Jul 8 15:12:46 2026
    From Newsgroup: comp.ai.philosophy

    On 7/7/2026 6:17 PM, André G. Isaak wrote:
    On 2026-07-07 18:05, olcott wrote:
    On 7/7/2026 6:06 PM, André G. Isaak wrote:
    On 2026-07-07 15:30, olcott wrote:
    On 7/7/2026 4:24 PM, André G. Isaak wrote:
    On 2026-07-07 15:13, olcott wrote:
    On 7/7/2026 3:08 PM, André G. Isaak wrote:
    On 2026-07-07 13:53, olcott wrote:
    On 7/7/2026 2:29 PM, André G. Isaak wrote:
    On 2026-07-07 13:19, olcott wrote:

    To do with with minimal simplicity the axioms of
    PA are construed as semantic entailment thus when
    there is no sequence of inference steps between G
    and PA then G is Kripke undefined in PA.

    So why don't you illustrate this with an actual proof?

    André


    The principle is simply whenever X cannot be proven
    in F then X is ungrounded in the atomic base F. Even
    diagonalization makes to attempt at actual proof.

    I can't make heads or tails of that.


    The actual proof in meta-math that G cannot be
    proved in PA is itself not any sequence of inference
    steps. It simply uses a version of the proof that
    Cantor use to show that reals are not countable.

    ???

    Cantor's proof absolutely contained inference steps, as did Gödels. >>>>> I don't think you actually know what you're talking about.

    If you can't illustrate your alleged system with a simple proof, >>>>>>> then I have no choice but to conclude that it is as ill-defined >>>>>>> to you as it is to me.

    André


    2 + 3 = 4 in PA cannot be proven because
    s(s(0)) + s(s(s(0))) != s(s(s(s(0))))

    I asked you to provide an example of a proof which illustrates what >>>>> you mean by "semantic entailments encoded syntactically in the
    language". I didn't ask for an example of something which cannot be >>>>> proven.

    André


    PTS simply declares by fiat that syntactic inference steps
    are semantic steps. I actually mean natural language semantic
    inference in the CycL programming language. This is the place
    where nothing follows form a contradiction is most easily seen.

    So basically you're saying that you are incapable of constructing
    even a simple mathematical proof. Gödel is about theories of
    arithmetic. CycL is not. If you can't construct proofs in an
    arithmetic framework you really have no business talking about Gödel.

    André


    So basically you are totally not interested in understanding me.
    As far as proofs go I always think in terms of syllogisms and
    their extensions. Every other proof is utterly irrelevant to my
    work.

    If your interest is limited to syllogisms then both Gödel and the
    halting problem are utterly irrelevant to your work, so you probably
    should stop making claims about them.

    Olcott thinks he is God, there is that... ;^o
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to sci.logic,comp.theory,sci.math,comp.ai.philosophy on Thu Jul 9 10:40:16 2026
    From Newsgroup: comp.ai.philosophy

    On 30/06/2026 16:45, olcott wrote:
    On 6/30/2026 2:55 AM, Mikko wrote:
    On 29/06/2026 16:23, dbush wrote:
    On 6/29/2026 9:17 AM, polcott wrote:
    On 6/29/2026 7:08 AM, dbush wrote:
    On 6/29/2026 12:13 AM, olcott wrote:
    On 6/28/2026 10:56 PM, dbush wrote:
    On 6/27/2026 11:34 PM, dbush wrote:
    On 6/27/2026 11:23 PM, olcott wrote:
    On 6/27/2026 9:02 PM, dbush wrote:
    On 6/27/2026 9:53 PM, dbush wrote:
    On 6/27/2026 9:49 PM, olcott wrote:
    On 6/27/2026 8:42 PM, dbush wrote:
    On 6/27/2026 9:40 PM, olcott wrote:
    On 6/27/2026 8:29 PM, dbush wrote:
    On 6/27/2026 9:24 PM, olcott wrote:
    On 6/27/2026 8:08 PM, dbush wrote:
    On 6/27/2026 7:56 PM, olcott wrote:
    On 6/27/2026 6:30 PM, dbush wrote:
    On 6/27/2026 7:22 PM, olcott wrote:
    On 6/27/2026 5:52 PM, dbush wrote:
    On 6/27/2026 6:40 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 1:34 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:29 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 1:24 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:03 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 12:54 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 11:11 AM, polcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:08 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 26/06/2026 15:49, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/26/2026 1:49 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 26/06/2026 04:32, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> William T. Parry, Entailment Logics >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> gets rid of Disjunction introduction >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> to prevent the principle of explosion >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    A simple logical matrix and sequent >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> calculus for
    Parry’s logic of Analytic Implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    The main and distinctive feature of PAI >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> (and of the many >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> systems of analytic implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> belonging to its ilk) is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> the rejection of the classically valid >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> principle of Addition, >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> sometimes also referred to as >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Disjunction Introduction. In >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> other words, the principle leading from >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> a formula ϕ to a >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where ψ >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> is an arbitrary >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formula. Parry blamed on this principle >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> the derivability >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of the paradoxes of strict implication— >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> given that it is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> famously featured in Lewis’ derivation >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of an arbitrary >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formula ψ from a contradiction of the >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> form ϕ ∧ ¬ϕ. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    He also gets rid of an efficient way to >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> convince people who don't >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> understand much of logic. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    As I recently showed in another post. I >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> figured
    all this out on my own. I didn't even know >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> that
    anyone else ever did this. I just knew >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> that when
    trying to find out what is deduced from a >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> set of
    premises that you cannot pop in another >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> sentence
    from out of nowhere and get a correct >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> conclusion.

    By popping in another sentence from out of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> nowhere
    (as it shows above) the principle of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> explosion is
    derived.

    The usual meaning of proof is a sequence of >>>>>>>>>>>>>>>>>>>>>>>>>>>>> statement where eachstatement either is a >>>>>>>>>>>>>>>>>>>>>>>>>>>>> premis or follows from one or more earlier >>>>>>>>>>>>>>>>>>>>>>>>>>>>> statements

    Except with Disjunction introduction, that >>>>>>>>>>>>>>>>>>>>>>>>>>>> is its problem.

    So you're saying that in the following >>>>>>>>>>>>>>>>>>>>>>>>>>> natural language statement: >>>>>>>>>>>>>>>>>>>>>>>>>>>

    It is a key issue in that it creates the >>>>>>>>>>>>>>>>>>>>>>>>>> psychotic break from reality known as the >>>>>>>>>>>>>>>>>>>>>>>>>> Principle of Explosion, otherwise it may >>>>>>>>>>>>>>>>>>>>>>>>>> make no difference at all. >>>>>>>>>>>>>>>>>>>>>>>>>>
    Stay on topic or I will block you. >>>>>>>>>>>>>>>>>>>>>>>>>
    Explain in detail how the below which you >>>>>>>>>>>>>>>>>>>>>>>>> dishonestly trimmed is off- topic. >>>>>>>>>>>>>>>>>>>>>>>>>

    The topic is how Disjunction introduction >>>>>>>>>>>>>>>>>>>>>>>> enables the
    Principle of Explosion.


    Rejected, as you not liking the result doesn't >>>>>>>>>>>>>>>>>>>>>>> make it invalid.

    Through a series of truth preserving operations, >>>>>>>>>>>>>>>>>>>>>>> when a contradiction is given as true, any >>>>>>>>>>>>>>>>>>>>>>> statement can be proven as true. >>>>>>>>>>>>>>>>>>>>>>>
    The principle of explosion is a demonstration of >>>>>>>>>>>>>>>>>>>>>>> *why* a formal system whose axioms lead to a >>>>>>>>>>>>>>>>>>>>>>> contradiction is useless.

    The only reason someone would want to get rid of >>>>>>>>>>>>>>>>>>>>>>> the principle of explosion is to be able to use a >>>>>>>>>>>>>>>>>>>>>>> system that has a contradiction. >>>>>>>>>>>>>>>>>>>>>>>

    My reason to get rid of the principle of explosion >>>>>>>>>>>>>>>>>>>>>> it to get rid of anything and everything that >>>>>>>>>>>>>>>>>>>>>> prevents
    infallibly correct reasoning.


    If you get rid of the principle of explosion, the >>>>>>>>>>>>>>>>>>>>> law of non- contradiction goes away as it looses >>>>>>>>>>>>>>>>>>>>> its basis.


    You keep failing to pay close enough attention. >>>>>>>>>>>>>>>>>>>> I only get rid of the POE by getting rid of >>>>>>>>>>>>>>>>>>>> Disjunction introduction.

    Which you can't do because it's a truth-preserving >>>>>>>>>>>>>>>>>>> operation.

    1) P ∧ ¬P    // Premise
    2) P          // Conjunction elimination >>>>>>>>>>>>>>>>>> 3) ¬P        // Conjunction elimination >>>>>>>>>>>>>>>>>> 4) P ∨ Q      // Disjunction introduction >>>>>>>>>>>>>>>>>> 5) Q          // Disjunctive syllogism >>>>>>>>>>>>>>>>>> https://en.wikipedia.org/wiki/
    Principle_of_explosion#Proof

    When you insert English meanings into the
    propositional variables it is as obvious
    as a pie in the fact the DI IS NOT TRUTH PRESERVING. >>>>>>>>>>>>>>>>>
    So you're saying that in the following natural language >>>>>>>>>>>>>>>>> statement:

    --------------------------------------
    At least one of the following statements is true: >>>>>>>>>>>>>>>>> - Earth is the third planet from the sun.
    - <X>
    --------------------------------------

    Where <X> is any natural language statement, there >>>>>>>>>>>>>>>>> exists a statement X such that the condition "At least >>>>>>>>>>>>>>>>> one of the following statements is true" is false. >>>>>>>>>>>>>>>>>
    Name it.


    That is not Disjunction introduction combined with >>>>>>>>>>>>>>>> Disjunctive syllogism, it is bare Disjunction. >>>>>>>>>>>>>>>>

    Let me spell it out more explicitly then.

    Given that the following natural language statement is true: >>>>>>>>>>>>>>>
    --------------------------------------
    Earth is the third planet from the sun.
    --------------------------------------

    In the following natural language statement:

    --------------------------------------
    At least one of the following statements is true: >>>>>>>>>>>>>>> - Earth is the third planet from the sun.
    - <X>
    --------------------------------------

    Where <X> is any natural language statement, does there >>>>>>>>>>>>>>> exist a statement X such that the condition "At least one >>>>>>>>>>>>>>> of the following statements is true" is false?


    Where X is "What time is it?"



    Is the statement "Earth is the third planet from the sun" >>>>>>>>>>>>> true?

    We have a type mismatch error.



    The statement you gave isn't a truth-bearing statement, so it >>>>>>>>>>> can't be used in logic.  I didn't think I had to make that >>>>>>>>>>> explicit.

    However, let's go with it anyway because it still illustrates >>>>>>>>>>> the point.

    So I'll ask again:

    Is the statement "Earth is the third planet from the sun" true? >>>>>>>>>>>

    On second though, let's back up as that might confuse you. >>>>>>>>>>
    Given that <X> is any *truth bearing* natural language
    statement, does there exist a statement X such that the
    condition "At least one of the following statements is true" >>>>>>>>>> is false?


    Head games will be ignored.
    That you did so well on the other things
    so I will not block you.


    Explain in detail how this is a head game.

    Failure to either answer the above question or explain how it is >>>>>>>> a head game in your next reply or within one hour of you next >>>>>>>> post in this newsgroup will be taken as your official, on-the- >>>>>>>> record admission that Disjunction introduction is in fact truth >>>>>>>> preserving and valid, and therefore so is the Principle of
    Explosion.


    Let the record show that Peter Olcott made the following post in >>>>>>> this newsgroup:

    On 6/28/2026 10:52 PM, olcott wrote:
    Q also can't bake a birthday cake, this does not make
    Q in any way "incomplete" relative to what it was
    defined to do.
    ...

    And more that one hour has passed with no attempt to answer the >>>>>>> above question or explain why it is a head game.  Therefore, as >>>>>>> per the above criteria:

    Let The Record Show

    That Peter Olcott

    Has *Officially* Admitted:

    That Disjunction introduction is in fact truth preserving and
    valid, and therefore so is the Principle of Explosion.



    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for
    Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many
    systems of analytic implication belonging to its ilk) is

    the rejection of the classically valid principle of Addition,
    sometimes also referred to as Disjunction Introduction. In

    other words, the principle leading from a formula ϕ to a
    disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary
    formula. Parry blamed on this principle the derivability
    of the paradoxes of strict implication—given that it is
    famously featured in Lewis’ derivation of an arbitrary
    formula ψ from a contradiction of the form ϕ ∧ ¬ϕ.

    https://philarchive.org/archive/SZMASL


    So someone came up with a different system that has different
    rules. That has no bearing on existing systems.


    The bearing that it has on existing systems is

    None, as you can't remove a truth-preserving operation.

    One can construct a system where a truth-preserving operation is not
    valid, and must if one wants to construct a paraconsistent system,
    where some but not every sentence can be both PTS-true and PTS-false.

    Current semantic entailment is the only inference step allowed.

    Nobody cares what you "allow" as long as you don't specify any
    inference rule. Probably nobody will care even if you will specify
    but there is no way to really know as long as you don't specify.
    --
    Mikko
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to sci.logic,comp.theory,sci.math,comp.ai.philosophy on Thu Jul 9 10:48:42 2026
    From Newsgroup: comp.ai.philosophy

    On 01/07/2026 18:04, olcott wrote:
    On 7/1/2026 1:50 AM, Mikko wrote:
    On 30/06/2026 16:45, olcott wrote:
    On 6/30/2026 2:55 AM, Mikko wrote:
    On 29/06/2026 16:23, dbush wrote:
    On 6/29/2026 9:17 AM, polcott wrote:
    On 6/29/2026 7:08 AM, dbush wrote:
    On 6/29/2026 12:13 AM, olcott wrote:
    On 6/28/2026 10:56 PM, dbush wrote:
    On 6/27/2026 11:34 PM, dbush wrote:
    On 6/27/2026 11:23 PM, olcott wrote:
    On 6/27/2026 9:02 PM, dbush wrote:
    On 6/27/2026 9:53 PM, dbush wrote:
    On 6/27/2026 9:49 PM, olcott wrote:
    On 6/27/2026 8:42 PM, dbush wrote:
    On 6/27/2026 9:40 PM, olcott wrote:
    On 6/27/2026 8:29 PM, dbush wrote:
    On 6/27/2026 9:24 PM, olcott wrote:
    On 6/27/2026 8:08 PM, dbush wrote:
    On 6/27/2026 7:56 PM, olcott wrote:
    On 6/27/2026 6:30 PM, dbush wrote:
    On 6/27/2026 7:22 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 5:52 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 6:40 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 1:34 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:29 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 1:24 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:03 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 12:54 PM, dbush wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 11:11 AM, polcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/27/2026 2:08 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 26/06/2026 15:49, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 6/26/2026 1:49 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 26/06/2026 04:32, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> William T. Parry, Entailment Logics >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> gets rid of Disjunction introduction >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> to prevent the principle of explosion >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    A simple logical matrix and sequent >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> calculus for >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Parry’s logic of Analytic Implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    The main and distinctive feature of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> PAI (and of the many >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> systems of analytic implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> belonging to its ilk) is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> the rejection of the classically valid >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> principle of Addition, >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> sometimes also referred to as >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Disjunction Introduction. In >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> other words, the principle leading >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> from a formula ϕ to a >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> disjunction of the form ϕ ∨ ψ, where ψ >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> is an arbitrary >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formula. Parry blamed on this >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> principle the derivability >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of the paradoxes of strict implication >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> — given that it is >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> famously featured in Lewis’ derivation >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of an arbitrary >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formula ψ from a contradiction of the >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> form ϕ ∧ ¬ϕ. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    https://philarchive.org/archive/SZMASL >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    He also gets rid of an efficient way to >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> convince people who don't >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> understand much of logic. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    As I recently showed in another post. I >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> figured
    all this out on my own. I didn't even >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> know that
    anyone else ever did this. I just knew >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> that when
    trying to find out what is deduced from >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> a set of
    premises that you cannot pop in another >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> sentence
    from out of nowhere and get a correct >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> conclusion.

    By popping in another sentence from out >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of nowhere
    (as it shows above) the principle of >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> explosion is
    derived.

    The usual meaning of proof is a sequence >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of statement where eachstatement either >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> is a premis or follows from one or more >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> earlier
    statements

    Except with Disjunction introduction, that >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> is its problem.

    So you're saying that in the following >>>>>>>>>>>>>>>>>>>>>>>>>>>>> natural language statement: >>>>>>>>>>>>>>>>>>>>>>>>>>>>>

    It is a key issue in that it creates the >>>>>>>>>>>>>>>>>>>>>>>>>>>> psychotic break from reality known as the >>>>>>>>>>>>>>>>>>>>>>>>>>>> Principle of Explosion, otherwise it may >>>>>>>>>>>>>>>>>>>>>>>>>>>> make no difference at all. >>>>>>>>>>>>>>>>>>>>>>>>>>>>
    Stay on topic or I will block you. >>>>>>>>>>>>>>>>>>>>>>>>>>>
    Explain in detail how the below which you >>>>>>>>>>>>>>>>>>>>>>>>>>> dishonestly trimmed is off- topic. >>>>>>>>>>>>>>>>>>>>>>>>>>>

    The topic is how Disjunction introduction >>>>>>>>>>>>>>>>>>>>>>>>>> enables the
    Principle of Explosion.


    Rejected, as you not liking the result doesn't >>>>>>>>>>>>>>>>>>>>>>>>> make it invalid.

    Through a series of truth preserving >>>>>>>>>>>>>>>>>>>>>>>>> operations, when a contradiction is given as >>>>>>>>>>>>>>>>>>>>>>>>> true, any statement can be proven as true. >>>>>>>>>>>>>>>>>>>>>>>>>
    The principle of explosion is a demonstration >>>>>>>>>>>>>>>>>>>>>>>>> of *why* a formal system whose axioms lead to a >>>>>>>>>>>>>>>>>>>>>>>>> contradiction is useless.

    The only reason someone would want to get rid >>>>>>>>>>>>>>>>>>>>>>>>> of the principle of explosion is to be able to >>>>>>>>>>>>>>>>>>>>>>>>> use a system that has a contradiction. >>>>>>>>>>>>>>>>>>>>>>>>>

    My reason to get rid of the principle of explosion >>>>>>>>>>>>>>>>>>>>>>>> it to get rid of anything and everything that >>>>>>>>>>>>>>>>>>>>>>>> prevents
    infallibly correct reasoning.


    If you get rid of the principle of explosion, the >>>>>>>>>>>>>>>>>>>>>>> law of non- contradiction goes away as it looses >>>>>>>>>>>>>>>>>>>>>>> its basis.


    You keep failing to pay close enough attention. >>>>>>>>>>>>>>>>>>>>>> I only get rid of the POE by getting rid of >>>>>>>>>>>>>>>>>>>>>> Disjunction introduction.

    Which you can't do because it's a truth-preserving >>>>>>>>>>>>>>>>>>>>> operation.

    1) P ∧ ¬P    // Premise
    2) P          // Conjunction elimination >>>>>>>>>>>>>>>>>>>> 3) ¬P        // Conjunction elimination >>>>>>>>>>>>>>>>>>>> 4) P ∨ Q      // Disjunction introduction >>>>>>>>>>>>>>>>>>>> 5) Q          // Disjunctive syllogism >>>>>>>>>>>>>>>>>>>> https://en.wikipedia.org/wiki/
    Principle_of_explosion#Proof

    When you insert English meanings into the >>>>>>>>>>>>>>>>>>>> propositional variables it is as obvious >>>>>>>>>>>>>>>>>>>> as a pie in the fact the DI IS NOT TRUTH PRESERVING. >>>>>>>>>>>>>>>>>>>
    So you're saying that in the following natural >>>>>>>>>>>>>>>>>>> language statement:

    --------------------------------------
    At least one of the following statements is true: >>>>>>>>>>>>>>>>>>> - Earth is the third planet from the sun. >>>>>>>>>>>>>>>>>>> - <X>
    --------------------------------------

    Where <X> is any natural language statement, there >>>>>>>>>>>>>>>>>>> exists a statement X such that the condition "At >>>>>>>>>>>>>>>>>>> least one of the following statements is true" is false. >>>>>>>>>>>>>>>>>>>
    Name it.


    That is not Disjunction introduction combined with >>>>>>>>>>>>>>>>>> Disjunctive syllogism, it is bare Disjunction. >>>>>>>>>>>>>>>>>>

    Let me spell it out more explicitly then.

    Given that the following natural language statement is >>>>>>>>>>>>>>>>> true:

    --------------------------------------
    Earth is the third planet from the sun.
    --------------------------------------

    In the following natural language statement: >>>>>>>>>>>>>>>>>
    --------------------------------------
    At least one of the following statements is true: >>>>>>>>>>>>>>>>> - Earth is the third planet from the sun.
    - <X>
    --------------------------------------

    Where <X> is any natural language statement, does there >>>>>>>>>>>>>>>>> exist a statement X such that the condition "At least >>>>>>>>>>>>>>>>> one of the following statements is true" is false? >>>>>>>>>>>>>>>>>

    Where X is "What time is it?"



    Is the statement "Earth is the third planet from the sun" >>>>>>>>>>>>>>> true?

    We have a type mismatch error.



    The statement you gave isn't a truth-bearing statement, so >>>>>>>>>>>>> it can't be used in logic.  I didn't think I had to make >>>>>>>>>>>>> that explicit.

    However, let's go with it anyway because it still
    illustrates the point.

    So I'll ask again:

    Is the statement "Earth is the third planet from the sun" >>>>>>>>>>>>> true?


    On second though, let's back up as that might confuse you. >>>>>>>>>>>>
    Given that <X> is any *truth bearing* natural language >>>>>>>>>>>> statement, does there exist a statement X such that the >>>>>>>>>>>> condition "At least one of the following statements is true" >>>>>>>>>>>> is false?


    Head games will be ignored.
    That you did so well on the other things
    so I will not block you.


    Explain in detail how this is a head game.

    Failure to either answer the above question or explain how it >>>>>>>>>> is a head game in your next reply or within one hour of you >>>>>>>>>> next post in this newsgroup will be taken as your official, >>>>>>>>>> on- the- record admission that Disjunction introduction is in >>>>>>>>>> fact truth preserving and valid, and therefore so is the
    Principle of Explosion.


    Let the record show that Peter Olcott made the following post >>>>>>>>> in this newsgroup:

    On 6/28/2026 10:52 PM, olcott wrote:
    Q also can't bake a birthday cake, this does not make
    Q in any way "incomplete" relative to what it was
    defined to do.
    ...

    And more that one hour has passed with no attempt to answer the >>>>>>>>> above question or explain why it is a head game.  Therefore, as >>>>>>>>> per the above criteria:

    Let The Record Show

    That Peter Olcott

    Has *Officially* Admitted:

    That Disjunction introduction is in fact truth preserving and >>>>>>>>> valid, and therefore so is the Principle of Explosion.



    William T. Parry, Entailment Logics
    gets rid of Disjunction introduction
    to prevent the principle of explosion

    A simple logical matrix and sequent calculus for
    Parry’s logic of Analytic Implication

    The main and distinctive feature of PAI (and of the many
    systems of analytic implication belonging to its ilk) is

    the rejection of the classically valid principle of Addition,
    sometimes also referred to as Disjunction Introduction. In

    other words, the principle leading from a formula ϕ to a
    disjunction of the form ϕ ∨ ψ, where ψ is an arbitrary
    formula. Parry blamed on this principle the derivability
    of the paradoxes of strict implication—given that it is
    famously featured in Lewis’ derivation of an arbitrary
    formula ψ from a contradiction of the form ϕ ∧ ¬ϕ.

    https://philarchive.org/archive/SZMASL


    So someone came up with a different system that has different
    rules. That has no bearing on existing systems.


    The bearing that it has on existing systems is

    None, as you can't remove a truth-preserving operation.

    One can construct a system where a truth-preserving operation is not
    valid, and must if one wants to construct a paraconsistent system,
    where some but not every sentence can be both PTS-true and PTS-false.


    Current semantic entailment is the only inference step allowed.

    Every truth-prserving transformation is a correct semantic entailment.
    In particular, disjunction introduction is.

    That is counter-factual.

    No, it is not. It is a matter of definition. Because you have not
    defined "correct semantic entailment" as an inference rule my
    statement cannot contradict your definition.

    POE is misconstrued as truth preserving.

    Who has said that POE preserves truth? And what does it even mean
    if one says that POE preserves or does not preserve truth?

    Every element of logic is utterly discarded and only the underlying
    semantics is preserved.
    If you reject inferences (wich are central elements of logic) then
    you can't infer anyting from anything.

    A part of natural language semantics is logical inference. If you
    reject logic you must also reject the logical part of natural
    language semantics.
    --
    Mikko
    --- Synchronet 3.22a-Linux NewsLink 1.2