• Minimal Logics in the 2020's: A Meteoric Rise

    From Mild Shock@21:1/5 to All on Fri Jul 5 00:03:51 2024
    Could be a wake-up call this many participants
    already in the commitee, that the whole logic
    world was asleep for many years:

    Non-Classical Logics. Theory and Applications XI,
    5-8 September 2024, Lodz (Poland)
    https://easychair.org/cfp/NCL24

    Why is Minimal Logic at the core of many things?
    Because it is the logic of Curry-Howard isomoprhism
    for symple types:

    ----------------
    Γ ∪ { A } ⊢ A

    Γ ∪ { A } ⊢ B
    ----------------
    Γ ⊢ A → B

    Γ ⊢ A → B Δ ⊢ A
    ----------------------------
    Γ ∪ Δ ⊢ B

    And funny things can happen, especially when people
    hallucinate duality or think symmetry is given, for
    example in newer inventions such as λμ-calculus,

    but then omg ~~p => p is nevertheless not provable,
    because they forgot an inference rule. LoL

    Recommended reading so far:

    Propositional Logics Related to Heyting’s and Johansson’s
    February 2008 - Krister Segerberg https://www.researchgate.net/publication/228036664

    The Logic of Church and Curry
    Jonathan P. Seldin - 2009 https://www.sciencedirect.com/handbook/handbook-of-the-history-of-logic/vol/5/suppl/C

    Meanwhile I am going back to my tinkering with my
    Prolog system, which even provides a more primitive
    logic than minimal logic, pure Prolog is minimal

    logic without embedded implication.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to olcott on Fri Jul 5 03:26:28 2024
    I minimal logic, if you define:

    ~A := A => f

    You can already prove, thats just modus ponens:

    A, ~A |- f

    Or if you want you can also prove, i.e. rephrase
    it, with approproate introducton of a conjunction &
    by Curry Howard inference rules for "products":

    |- ~(A & ~A)

    Thats the law of non-contradiction:

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

    Its hard wired into minimal logic.

    olcott schrieb:
    On 7/4/2024 5:03 PM, Mild Shock wrote:
    Could be a wake-up call this many participants
    already in the commitee, that the whole logic
    world was asleep for many years:

    Non-Classical Logics. Theory and Applications XI,
    5-8 September 2024, Lodz (Poland)
    https://easychair.org/cfp/NCL24

    Why is Minimal Logic at the core of many things?
    Because it is the logic of Curry-Howard isomoprhism
    for symple types:

    ----------------
    Γ ∪ { A } ⊢ A

    Γ ∪ { A } ⊢ B
    ----------------
    Γ ⊢ A → B

    Γ ⊢ A → B           Δ ⊢ A
    ----------------------------
    Γ ∪ Δ ⊢ B

    And funny things can happen, especially when people
    hallucinate duality or think symmetry is given, for
    example in newer inventions such as λμ-calculus,

    but then omg ~~p => p is nevertheless not provable,
    because they forgot an inference rule. LoL

    Recommended reading so far:

    Propositional Logics Related to Heyting’s and Johansson’s
    February 2008 - Krister Segerberg
    https://www.researchgate.net/publication/228036664

    The Logic of Church and Curry
    Jonathan P. Seldin - 2009
    https://www.sciencedirect.com/handbook/handbook-of-the-history-of-logic/vol/5/suppl/C


    Meanwhile I am going back to my tinkering with my
    Prolog system, which even provides a more primitive
    logic than minimal logic, pure Prolog is minimal

    logic without embedded implication.

    Prolog logic such that provable means true and false
    means unprovable is the key foundation of correct reasoning.

    It simply implicitly rejects expressions that would otherwise
    result in mathematical incompleteness as not truth bearers
    within its system. This is the way that correct reasoning
    actually works.

    When expressions of language are self-contradictory such
    that X and ~X cannot be proven within the system Prolog
    rejects X. Mathematical logic would conclude that the
    system is incomplete.



    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to olcott on Fri Jul 5 03:58:03 2024
    When red means blue, and yellow means
    green, then black is white. Thanks for your hint!

    If my Grandmother had wheels she would have been a bike https://www.youtube.com/watch?v=OplyHCIBmfE

    olcott schrieb:
    When provable means true and false means unprovable
    then (Γ ⊢ X) means X is true in Γ.
    then (Γ ⊢ ~X) means X is conventional false  in Γ.
    the (Γ ⊬ X) ∧ (Γ ⊬ ~X) X is not a truth bearer in Γ.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Fri Jul 5 03:31:46 2024
    But minimal logic rejects Ex Falso Quodlibet.
    So you cannot prove in general:

    /* not provable in minimal logic */
    A, ~A |- B % EFQ

    minimal logic is a paraconsistent and btw
    also a paracomplete logic. It also rejects:

    /* not provable in minimal logic */
    |- ~A v A % LEM

    It has indeed a Meteoric Rise, you can check
    the growth of this Wikipedia page, 5 years or
    so ago, minial logic had only 1 page,

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

    now its a dozen pages? Why is this so?
    Because Coq, Lean, Agda, etc.. are built on
    top of minimal logic?

    Mild Shock schrieb:
    I minimal logic, if you define:

       ~A := A => f

    You can already prove, thats just modus ponens:

       A, ~A |- f

    Or if you want you can also prove, i.e. rephrase
    it, with approproate introducton of a conjunction &
    by Curry Howard inference rules for "products":

       |- ~(A & ~A)

    Thats the law of non-contradiction:

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

    Its hard wired into minimal logic.

    olcott schrieb:
    On 7/4/2024 5:03 PM, Mild Shock wrote:
    Could be a wake-up call this many participants
    already in the commitee, that the whole logic
    world was asleep for many years:

    Non-Classical Logics. Theory and Applications XI,
    5-8 September 2024, Lodz (Poland)
    https://easychair.org/cfp/NCL24

    Why is Minimal Logic at the core of many things?
    Because it is the logic of Curry-Howard isomoprhism
    for symple types:

    ----------------
    Γ ∪ { A } ⊢ A

    Γ ∪ { A } ⊢ B
    ----------------
    Γ ⊢ A → B

    Γ ⊢ A → B           Δ ⊢ A
    ----------------------------
    Γ ∪ Δ ⊢ B

    And funny things can happen, especially when people
    hallucinate duality or think symmetry is given, for
    example in newer inventions such as λμ-calculus,

    but then omg ~~p => p is nevertheless not provable,
    because they forgot an inference rule. LoL

    Recommended reading so far:

    Propositional Logics Related to Heyting’s and Johansson’s
    February 2008 - Krister Segerberg
    https://www.researchgate.net/publication/228036664

    The Logic of Church and Curry
    Jonathan P. Seldin - 2009
    https://www.sciencedirect.com/handbook/handbook-of-the-history-of-logic/vol/5/suppl/C


    Meanwhile I am going back to my tinkering with my
    Prolog system, which even provides a more primitive
    logic than minimal logic, pure Prolog is minimal

    logic without embedded implication.

    Prolog logic such that provable means true and false
    means unprovable is the key foundation of correct reasoning.

    It simply implicitly rejects expressions that would otherwise
    result in mathematical incompleteness as not truth bearers
    within its system. This is the way that correct reasoning
    actually works.

    When expressions of language are self-contradictory such
    that X and ~X cannot be proven within the system Prolog
    rejects X. Mathematical logic would conclude that the
    system is incomplete.




    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Fri Jul 5 03:59:39 2024
    Hi,

    A few years ago I was impressed by
    the output of either Negri or Plato,
    or the two together.

    Now they are just an annoyance, all
    they show is that they are neither talented
    nor have sufficient training.

    Just have a look at:

    Terminating intuitionistic calculus
    Giulio Fellin and Sara Negri
    https://philpapers.org/rec/FELATI

    Beside the too obvious creative idea and motive
    behind it, it is most likely complete useless
    nonsense. Already this presentation in the

    paper shows utter incompetence:

    Γ, A → B ⊢ A Γ, A → B, B ⊢ Δ ----------------------------------------
    Γ, A → B ⊢ Δ

    Everybody in the business knows that the
    looping, resulting from the A → B copying,
    is a fact. But can be reduced since the

    copying on the right hand side is not needed.

    Γ, A → B ⊢ A Γ, B ⊢ Δ
    --------------------------------
    Γ, A → B ⊢ Δ

    The above variant is enough. Just like Dragalin
    presented the calculus. I really wish people
    would completely understand these master pieces,

    before they even touch multi consequent calculi:

    Mathematical Intuitionism: Introduction to Proof Theory
    Albert Grigorevich Dragalin - 1988
    https://www.amazon.com/dp/0821845209

    Contraction-Free Sequent Calculi for Intuitionistic Logic
    Roy Dyckhoff - 1992
    http://www.cs.cmu.edu/~fp//courses/atp/cmuonly/D92.pdf

    Whats the deeper semantic (sic!) explanation of the
    two calculi GHPC and GCPC? I have a Kripke semantics
    explanation in my notes, didn't release it yet.

    Have Fun!

    Mild Shock schrieb:
    Could be a wake-up call this many participants
    already in the commitee, that the whole logic
    world was asleep for many years:

    Non-Classical Logics. Theory and Applications XI,
    5-8 September 2024, Lodz (Poland)
    https://easychair.org/cfp/NCL24

    Why is Minimal Logic at the core of many things?
    Because it is the logic of Curry-Howard isomoprhism
    for symple types:

    ----------------
    Γ ∪ { A } ⊢ A

    Γ ∪ { A } ⊢ B
    ----------------
    Γ ⊢ A → B

    Γ ⊢ A → B           Δ ⊢ A
    ----------------------------
    Γ ∪ Δ ⊢ B

    And funny things can happen, especially when people
    hallucinate duality or think symmetry is given, for
    example in newer inventions such as λμ-calculus,

    but then omg ~~p => p is nevertheless not provable,
    because they forgot an inference rule. LoL

    Recommended reading so far:

    Propositional Logics Related to Heyting’s and Johansson’s
    February 2008 - Krister Segerberg https://www.researchgate.net/publication/228036664

    The Logic of Church and Curry
    Jonathan P. Seldin - 2009 https://www.sciencedirect.com/handbook/handbook-of-the-history-of-logic/vol/5/suppl/C


    Meanwhile I am going back to my tinkering with my
    Prolog system, which even provides a more primitive
    logic than minimal logic, pure Prolog is minimal

    logic without embedded implication.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Fri Jul 5 04:01:00 2024
    Hi,

    I am not halucinating that Negri is nonsense:

    This calculus does not terminate (e.g. on Peirce’s
    formula). Negri [42] shows how to add a loop-checking
    mechanism to ensure termination. The effect on complexity
    isn’t yet clear; but the loop-checking is expensive.

    Intuitionistic Decision Procedures since Gentzen
    The Jägerfest - 2013
    https://apt13.unibe.ch/slides/Dyckhoff.pdf

    Bye

    Mild Shock schrieb:
    Hi,

    A few years ago I was impressed by
    the output of either Negri or Plato,
    or the two together.

    Now they are just an annoyance, all
    they show is that they are neither talented
    nor have sufficient training.

    Just have a look at:

    Terminating intuitionistic calculus
    Giulio Fellin and Sara Negri
    https://philpapers.org/rec/FELATI

    Beside the too obvious creative idea and motive
    behind it, it is most likely complete useless
    nonsense. Already this presentation in the

    paper shows utter incompetence:

    Γ, A → B ⊢ A           Γ, A → B, B ⊢ Δ ----------------------------------------
               Γ, A → B  ⊢ Δ

    Everybody in the business knows that the
    looping, resulting from the A → B copying,
    is a fact. But can be reduced since the

    copying on the right hand side is not needed.

    Γ, A → B ⊢ A           Γ, B ⊢ Δ --------------------------------
            Γ, A → B  ⊢ Δ

    The above variant is enough. Just like Dragalin
    presented the calculus. I really wish people
    would completely understand these master pieces,

    before they even touch multi consequent calculi:

    Mathematical Intuitionism: Introduction to Proof Theory
    Albert Grigorevich Dragalin - 1988
    https://www.amazon.com/dp/0821845209

    Contraction-Free Sequent Calculi for Intuitionistic Logic
    Roy Dyckhoff - 1992
    http://www.cs.cmu.edu/~fp//courses/atp/cmuonly/D92.pdf

    Whats the deeper semantic (sic!) explanation of the
    two calculi GHPC and GCPC? I have a Kripke semantics
    explanation in my notes, didn't release it yet.

    Have Fun!

    Mild Shock schrieb:
    Could be a wake-up call this many participants
    already in the commitee, that the whole logic
    world was asleep for many years:

    Non-Classical Logics. Theory and Applications XI,
    5-8 September 2024, Lodz (Poland)
    https://easychair.org/cfp/NCL24

    Why is Minimal Logic at the core of many things?
    Because it is the logic of Curry-Howard isomoprhism
    for symple types:

    ----------------
    Γ ∪ { A } ⊢ A

    Γ ∪ { A } ⊢ B
    ----------------
    Γ ⊢ A → B

    Γ ⊢ A → B           Δ ⊢ A
    ----------------------------
    Γ ∪ Δ ⊢ B

    And funny things can happen, especially when people
    hallucinate duality or think symmetry is given, for
    example in newer inventions such as λμ-calculus,

    but then omg ~~p => p is nevertheless not provable,
    because they forgot an inference rule. LoL

    Recommended reading so far:

    Propositional Logics Related to Heyting’s and Johansson’s
    February 2008 - Krister Segerberg
    https://www.researchgate.net/publication/228036664

    The Logic of Church and Curry
    Jonathan P. Seldin - 2009
    https://www.sciencedirect.com/handbook/handbook-of-the-history-of-logic/vol/5/suppl/C


    Meanwhile I am going back to my tinkering with my
    Prolog system, which even provides a more primitive
    logic than minimal logic, pure Prolog is minimal

    logic without embedded implication.


    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Thu Jul 4 23:00:18 2024
    On 7/4/24 10:38 PM, olcott wrote:
    On 7/4/2024 8:58 PM, Mild Shock wrote:

    When red means blue, and yellow means
    green, then black is white. Thanks for your hint!

    If my Grandmother had wheels she would have been a bike
    https://www.youtube.com/watch?v=OplyHCIBmfE


    *Here is the same thing more clearly*
    Every expression of language that is {true on the basis of
    its verbal meaning} is only made true by a sequence of truth
    preserving operations to this {verbal meaning}.

    The only way that we know that puppies are not fifteen
    story office buildings is that the accurate verbal model
    of the actual world tells use so.

    But, even if we can't find that sequence of truth perserving operations,
    but one exists (which might be infinite) makes the statement true, but
    not known.

    This is one of your confusions, You confuse a statment being True, with
    the statement being KNOWN to be True.

    There are a number of great problems and conjectures that seem to be
    true, but we can not prove them. They MUST be either True or False, as
    by their nature, there is no middle ground (something either exsits or
    it doesn't, or the count of something is either finite or infinite).

    The ACTUAL TRUTH (or falsehood) of such a statement is thus firmly
    established by the system in which the conjeture is embedded, even if
    our knowledge of the value of the truth of the statement is not known,
    or possible even knowable.

    The concept of "incompleteness" for a logical system is a recognition
    that the system has grown powerful enough that there exist some truths
    in the system that no finite proof of those statements exist, and only
    infinite chains of inference in the system can establish it.

    Mathematics is one source for these sorts of truths, as the possiblity
    of problems having NO number that satisfy them, or an infinite number
    that satisfy them show paths that can use in infinite number of steps to
    prove them, and might only be provable if some "inductive" shortcut can
    be found.


    olcott schrieb:
    When provable means true and false means unprovable
    then (Γ ⊢ X) means X is true in Γ.
    then (Γ ⊢ ~X) means X is conventional false  in Γ.
    the (Γ ⊬ X) ∧ (Γ ⊬ ~X) X is not a truth bearer in Γ.


    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Fri Jul 5 06:37:22 2024
    The meteoric rise of Curry-Howard isomorphism
    and minimal logic, possibly because proof assistants
    such as Lean, Agda, etc… all use it, is quite ironic,
    in the light of this statement:

    Because of the vagueness of the notions of “constructive
    proof”, “constructive operation”, the BHK-interpretation
    has never become a versatile technical tool in the way
    classical semantics has. Perhaps it is correct to say
    that by most people the BHK-interpretation has never been
    seen as an intuitionistic counterpart to classical semantics. https://festschriften.illc.uva.nl/j50/contribs/troelstra/troelstra.pdf

    Mild Shock schrieb:
    Could be a wake-up call this many participants
    already in the commitee, that the whole logic
    world was asleep for many years:

    Non-Classical Logics. Theory and Applications XI,
    5-8 September 2024, Lodz (Poland)
    https://easychair.org/cfp/NCL24

    Why is Minimal Logic at the core of many things?
    Because it is the logic of Curry-Howard isomoprhism
    for symple types:

    ----------------
    Γ ∪ { A } ⊢ A

    Γ ∪ { A } ⊢ B
    ----------------
    Γ ⊢ A → B

    Γ ⊢ A → B           Δ ⊢ A
    ----------------------------
    Γ ∪ Δ ⊢ B

    And funny things can happen, especially when people
    hallucinate duality or think symmetry is given, for
    example in newer inventions such as λμ-calculus,

    but then omg ~~p => p is nevertheless not provable,
    because they forgot an inference rule. LoL

    Recommended reading so far:

    Propositional Logics Related to Heyting’s and Johansson’s
    February 2008 - Krister Segerberg https://www.researchgate.net/publication/228036664

    The Logic of Church and Curry
    Jonathan P. Seldin - 2009 https://www.sciencedirect.com/handbook/handbook-of-the-history-of-logic/vol/5/suppl/C


    Meanwhile I am going back to my tinkering with my
    Prolog system, which even provides a more primitive
    logic than minimal logic, pure Prolog is minimal

    logic without embedded implication.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Fri Jul 5 12:23:26 2024
    On 7/4/24 11:19 PM, olcott wrote:
    On 7/4/2024 10:00 PM, Richard Damon wrote:
    On 7/4/24 10:38 PM, olcott wrote:
    On 7/4/2024 8:58 PM, Mild Shock wrote:

    When red means blue, and yellow means
    green, then black is white. Thanks for your hint!

    If my Grandmother had wheels she would have been a bike
    https://www.youtube.com/watch?v=OplyHCIBmfE


    *Here is the same thing more clearly*
    Every expression of language that is {true on the basis of
    its verbal meaning} is only made true by a sequence of truth
    preserving operations to this {verbal meaning}.

    The only way that we know that puppies are not fifteen
    story office buildings is that the accurate verbal model
    of the actual world tells use so.

    But, even if we can't find that sequence of truth perserving
    operations, but one exists (which might be infinite) makes the
    statement true, but not known.

    This is one of your confusions, You confuse a statment being True,
    with the statement being KNOWN to be True.

    There are a number of great problems and conjectures that seem to be
    true, but we can not prove them. They MUST be either True or False, as
    by their nature, there is no middle ground (something either exsits or
    it doesn't, or the count of something is either finite or infinite).

    The ACTUAL TRUTH  (or falsehood) of such a statement is thus firmly
    established by the system in which the conjeture is embedded, even if
    our knowledge of the value of the truth of the statement is not known,
    or possible even knowable.

    The concept of "incompleteness" for a logical system is a recognition
    that the system has grown powerful enough that there exist some truths
    in the system that no finite proof of those statements exist, and only
    infinite chains of inference in the system can establish it.

    Mathematics is one source for these sorts of truths, as the possiblity
    of problems having NO number that satisfy them, or an infinite number
    that satisfy them show paths that can use in infinite number of steps
    to prove them, and might only be provable if some "inductive" shortcut
    can be found.


    Yet my system screens out pathological expressions that
    are incorrectly determined to be incompleteness of the
    formal system. When we do that then True(L,x) can be defined
    for every expression not requiring an infinite sequence
    of steps. True(L,x) or True(L,~x) or not a truth bearer in L.

    No, it dies in self-inconsistency.

    Note "Every expression BUT ..." isn't "Every expresion ."

    So, your logic only works in systems small enough to be somewhat akin to
    toys. Those that are limited enough not to be able to cause the
    problems, which means it excludes most systems that support math.



    olcott schrieb:
    When provable means true and false means unprovable
    then (Γ ⊢ X) means X is true in Γ.
    then (Γ ⊢ ~X) means X is conventional false  in Γ.
    the (Γ ⊬ X) ∧ (Γ ⊬ ~X) X is not a truth bearer in Γ.




    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Fri Jul 5 13:24:10 2024
    On 7/5/24 12:47 PM, olcott wrote:
    On 7/5/2024 11:23 AM, Richard Damon wrote:
    On 7/4/24 11:19 PM, olcott wrote:
    On 7/4/2024 10:00 PM, Richard Damon wrote:
    On 7/4/24 10:38 PM, olcott wrote:
    On 7/4/2024 8:58 PM, Mild Shock wrote:

    When red means blue, and yellow means
    green, then black is white. Thanks for your hint!

    If my Grandmother had wheels she would have been a bike
    https://www.youtube.com/watch?v=OplyHCIBmfE


    *Here is the same thing more clearly*
    Every expression of language that is {true on the basis of
    its verbal meaning} is only made true by a sequence of truth
    preserving operations to this {verbal meaning}.

    The only way that we know that puppies are not fifteen
    story office buildings is that the accurate verbal model
    of the actual world tells use so.

    But, even if we can't find that sequence of truth perserving
    operations, but one exists (which might be infinite) makes the
    statement true, but not known.

    This is one of your confusions, You confuse a statment being True,
    with the statement being KNOWN to be True.

    There are a number of great problems and conjectures that seem to be
    true, but we can not prove them. They MUST be either True or False,
    as by their nature, there is no middle ground (something either
    exsits or it doesn't, or the count of something is either finite or
    infinite).

    The ACTUAL TRUTH  (or falsehood) of such a statement is thus firmly
    established by the system in which the conjeture is embedded, even
    if our knowledge of the value of the truth of the statement is not
    known, or possible even knowable.

    The concept of "incompleteness" for a logical system is a
    recognition that the system has grown powerful enough that there
    exist some truths in the system that no finite proof of those
    statements exist, and only infinite chains of inference in the
    system can establish it.

    Mathematics is one source for these sorts of truths, as the
    possiblity of problems having NO number that satisfy them, or an
    infinite number that satisfy them show paths that can use in
    infinite number of steps to prove them, and might only be provable
    if some "inductive" shortcut can be found.


    Yet my system screens out pathological expressions that
    are incorrectly determined to be incompleteness of the
    formal system. When we do that then True(L,x) can be defined
    for every expression not requiring an infinite sequence
    of steps. True(L,x) or True(L,~x) or not a truth bearer in L.

    No, it dies in self-inconsistency.

    Note "Every expression BUT ..."  isn't "Every expresion ."


    Every expression such that neither X nor ~X is provable in L
    is simply not a truth bearer in L. This does correctly reject self-contradictory expressions that wold otherwise be interpreted
    as the incompleteness of L.

    BUT THAT IS A WRONG STATEMENT.

    There exists in many logic systems, including those of most mathematics,
    that are TRUE, based on an infinite chain of connections to the
    truth-makers of the system, but are not provable in that system because
    no finite chain exists.

    Your definition rejefcts too much, not rejects too much, not only the self-contradictory statements, but every system of sufficient
    mathematics to create the truths that can only be established by an
    infinite series of steps.

    Your logic is based on faulty reasoning, because you don't understand
    the greater nuances of logic.


    This works correctly for every element of the accurate verbal
    model of the actual world. Since we can see that things like
    the Goldbach conjecture can be proven in an infinite sequence
    then an algorithm can see this too. For everything else it is
    an infallibly correct system of reasoning.

    Nope.

    No, we can NOT see that Goldbach conjecture can be proven in an infinite sequence, that is only true if the conjecture is actually true. There
    may exist an even Natural Number that is NOT the sum of two primes.

    If we could "see" it, then we could construct the fimite proof from how
    we see it.

    If the Goldbach conjecture is false, then its falsity can be proven.

    There MAY be a finite proof of the Goldbach conjecture, but there might
    not be.


    So, your logic only works in systems small enough to be somewhat akin
    to toys. Those that are limited enough not to be able to cause the
    problems, which means it excludes most systems that support math.



    olcott schrieb:
    When provable means true and false means unprovable
    then (Γ ⊢ X) means X is true in Γ.
    then (Γ ⊢ ~X) means X is conventional false  in Γ.
    the (Γ ⊬ X) ∧ (Γ ⊬ ~X) X is not a truth bearer in Γ.






    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Fri Jul 5 15:54:57 2024
    On 7/5/24 1:38 PM, olcott wrote:
    On 7/5/2024 11:23 AM, Richard Damon wrote:
    On 7/4/24 11:19 PM, olcott wrote:
    On 7/4/2024 10:00 PM, Richard Damon wrote:
    On 7/4/24 10:38 PM, olcott wrote:
    On 7/4/2024 8:58 PM, Mild Shock wrote:

    When red means blue, and yellow means
    green, then black is white. Thanks for your hint!

    If my Grandmother had wheels she would have been a bike
    https://www.youtube.com/watch?v=OplyHCIBmfE


    *Here is the same thing more clearly*
    Every expression of language that is {true on the basis of
    its verbal meaning} is only made true by a sequence of truth
    preserving operations to this {verbal meaning}.

    The only way that we know that puppies are not fifteen
    story office buildings is that the accurate verbal model
    of the actual world tells use so.

    But, even if we can't find that sequence of truth perserving
    operations, but one exists (which might be infinite) makes the
    statement true, but not known.

    This is one of your confusions, You confuse a statment being True,
    with the statement being KNOWN to be True.

    There are a number of great problems and conjectures that seem to be
    true, but we can not prove them. They MUST be either True or False,
    as by their nature, there is no middle ground (something either
    exsits or it doesn't, or the count of something is either finite or
    infinite).

    The ACTUAL TRUTH  (or falsehood) of such a statement is thus firmly
    established by the system in which the conjeture is embedded, even
    if our knowledge of the value of the truth of the statement is not
    known, or possible even knowable.

    The concept of "incompleteness" for a logical system is a
    recognition that the system has grown powerful enough that there
    exist some truths in the system that no finite proof of those
    statements exist, and only infinite chains of inference in the
    system can establish it.

    Mathematics is one source for these sorts of truths, as the
    possiblity of problems having NO number that satisfy them, or an
    infinite number that satisfy them show paths that can use in
    infinite number of steps to prove them, and might only be provable
    if some "inductive" shortcut can be found.


    Yet my system screens out pathological expressions that
    are incorrectly determined to be incompleteness of the
    formal system. When we do that then True(L,x) can be defined
    for every expression not requiring an infinite sequence
    of steps. True(L,x) or True(L,~x) or not a truth bearer in L.

    No, it dies in self-inconsistency.

    Note "Every expression BUT ..."  isn't "Every expresion ."


    Every expression such that neither X nor ~X is provable in L
    is simply not a truth bearer in L. This does correctly reject self-contradictory expressions that wold otherwise be interpreted
    as the incompleteness of L.

    FALSE STATEMENT.

    Some statements are true due to an infinite number of steps to ther truth-makers of the system.

    You will lead your logic system into contradictions by your definition
    (or you just need to treat it as a worthless phrase that doesn't
    actually tell you anything, particually what you call non-truth-bearers,
    which might actuall be statement that are true or false).


    This works correctly for every element of the accurate verbal
    model of the actual world. Since we can see that things like
    the Goldbach conjecture can be proven *OR REFUTED* in an infinite
    sequence then an algorithm can see this too. For everything
    else it is an infallibly correct system of reasoning.


    So, you ADMIT that you definition doesn't work for some statements, and
    thus is not correct.

    Note, the algorithm can not tell wether the statement like to Goldback conjecture is true or not, or even if it takes an infinite number of
    steps to come to that answer. Thus, you statement is just a FALSEHOOD.

    You just don't understand logic well enough to understand that can't
    have definitions that just don't work as the basis of a system.

    By your definition, the Goldbach conjecture must currently be consider a non-truth-bearer, but we KNOW that it must be either true or false, we
    just don't know which, so you definition of a truth-bearer is just a lie.

    What you are defining are KNOWLEDGE bearers, statements that there truth
    can be known. But we can't even know if the Goldbach conjecture is a knowledge-bearer or not. If it turns out to be false, then that fact is knowable, but not yet known (since showing the number, as a simple
    finite proof that no pair of primes below it sum to it make it prove
    false), but if it is true, there might be a proof, or there might not be.

    So even Knowledge-Bearers as a concept is has limited use. Knowledge,
    that which we currently know, is a valid concept, and one that admits
    things can be added to it.

    And Truth-Bearers, with the allowance of infinite chains to establish
    the truth (or falseness) of the statement can be useful, though we do
    need to admit we don't know, and perhaps CAN'T know that truth value,
    and need to allow for some statements that we don't yet have the ability
    to know if they are truth-bearers or not.

    But your definition of truth-bearers is just worthless for most logic
    systems, claiming to be about truth but actually being about knowledge
    isn't a good definition, and just shows your fundamental
    misunderstanding about what is actually truth and how it differs from knowledge.


    So, your logic only works in systems small enough to be somewhat akin
    to toys. Those that are limited enough not to be able to cause the
    problems, which means it excludes most systems that support math.



    olcott schrieb:
    When provable means true and false means unprovable
    then (Γ ⊢ X) means X is true in Γ.
    then (Γ ⊢ ~X) means X is conventional false  in Γ.
    the (Γ ⊬ X) ∧ (Γ ⊬ ~X) X is not a truth bearer in Γ.






    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Fri Jul 5 17:18:07 2024
    On 7/5/24 4:12 PM, olcott wrote:
    On 7/5/2024 2:54 PM, Richard Damon wrote:
    On 7/5/24 1:38 PM, olcott wrote:
    On 7/5/2024 11:23 AM, Richard Damon wrote:
    On 7/4/24 11:19 PM, olcott wrote:
    On 7/4/2024 10:00 PM, Richard Damon wrote:
    On 7/4/24 10:38 PM, olcott wrote:
    On 7/4/2024 8:58 PM, Mild Shock wrote:

    When red means blue, and yellow means
    green, then black is white. Thanks for your hint!

    If my Grandmother had wheels she would have been a bike
    https://www.youtube.com/watch?v=OplyHCIBmfE


    *Here is the same thing more clearly*
    Every expression of language that is {true on the basis of
    its verbal meaning} is only made true by a sequence of truth
    preserving operations to this {verbal meaning}.

    The only way that we know that puppies are not fifteen
    story office buildings is that the accurate verbal model
    of the actual world tells use so.

    But, even if we can't find that sequence of truth perserving
    operations, but one exists (which might be infinite) makes the
    statement true, but not known.

    This is one of your confusions, You confuse a statment being True, >>>>>> with the statement being KNOWN to be True.

    There are a number of great problems and conjectures that seem to
    be true, but we can not prove them. They MUST be either True or
    False, as by their nature, there is no middle ground (something
    either exsits or it doesn't, or the count of something is either
    finite or infinite).

    The ACTUAL TRUTH  (or falsehood) of such a statement is thus
    firmly established by the system in which the conjeture is
    embedded, even if our knowledge of the value of the truth of the
    statement is not known, or possible even knowable.

    The concept of "incompleteness" for a logical system is a
    recognition that the system has grown powerful enough that there
    exist some truths in the system that no finite proof of those
    statements exist, and only infinite chains of inference in the
    system can establish it.

    Mathematics is one source for these sorts of truths, as the
    possiblity of problems having NO number that satisfy them, or an
    infinite number that satisfy them show paths that can use in
    infinite number of steps to prove them, and might only be provable >>>>>> if some "inductive" shortcut can be found.


    Yet my system screens out pathological expressions that
    are incorrectly determined to be incompleteness of the
    formal system. When we do that then True(L,x) can be defined
    for every expression not requiring an infinite sequence
    of steps. True(L,x) or True(L,~x) or not a truth bearer in L.

    No, it dies in self-inconsistency.

    Note "Every expression BUT ..."  isn't "Every expresion ."


    Every expression such that neither X nor ~X is provable in L
    is simply not a truth bearer in L. This does correctly reject
    self-contradictory expressions that wold otherwise be interpreted
    as the incompleteness of L.

    FALSE STATEMENT.


    Can't be false it is stipulated.

    Can't stipulate that something is true.

    Also, stipulating a definition contrary to the system puts you out of
    the system.


    Some statements are true due to an infinite number of steps to ther
    truth-makers of the system.


    Already covered that.

    Nope. That is just stipulating that you system is contradictory.


    You will lead your logic system into contradictions by your definition
    (or you just need to treat it as a worthless phrase that doesn't
    actually tell you anything, particually what you call
    non-truth-bearers, which might actuall be statement that are true or
    false).


    Not at all. Such a system does detect and reject self-contradictory expressions thus does not use this as any basis for incompleteness.

    Nope, it just puts your logic outside of most logic systems, and unable
    to hamdle most of the problems people really care about.



    This works correctly for every element of the accurate verbal
    model of the actual world. Since we can see that things like
    the Goldbach conjecture can be proven *OR REFUTED* in an infinite
    sequence then an algorithm can see this too. For everything
    else it is an infallibly correct system of reasoning.


    So, you ADMIT that you definition doesn't work for some statements,
    and thus is not correct.


    It detects expressions that require infinite steps as out
    of scope and correctly determines all of the rest.

    Nope, it defines your system as self-contradictory, as things like tht
    GoldBach conjecture are defined as BOTH non-truth-bearers, and as truth-bearers.

    That seems to be the lie for your logic, that you just allow yourself to
    be wrong at times, which makes your logic worthless.


    Note, the algorithm can not tell wether the statement like to Goldback
    conjecture is true or not, or even if it takes an infinite number of
    steps to come to that answer. Thus, you statement is just a FALSEHOOD.

    Not at all. Because it is dead obvious to humans that Goldbach
    can be proved or refuted in an infinite number of steps an
    algorithm can see this too.

    But it might not need an infinite number of steps to refute it.

    And that second definition contradicts your first, as the first defines Goldmach (if true) to be a non-truth-bearer, while the second tries to contradict that to say it is.

    You can't do that in two different statements.


    You just don't understand logic well enough to understand that can't
    have definitions that just don't work as the basis of a system.

    By your definition, the Goldbach conjecture must currently be consider
    a non-truth-bearer, but we KNOW that it must be either true or false, we

    It would be construed as out-of-scope.
    Whether or not there was evidence of:
    (a) Election fraud that could have possibly changed
    the outcome of the 2020 presidential election or
    (b) Very harmful climate change caused by humans
    would be in scope.

    Since both of those statements are based on EMPERICAL evidence, they are outside the scope of analytical logic.


    just don't know which, so you definition of a truth-bearer is just a lie.

    What you are defining are KNOWLEDGE bearers, statements that there
    truth can be known.

    The key problem that it solves is that it makes True(L,x)
    computable for all of the most important things that really
    matter.

    Nope, becuase you made you system inconsistent by defining infinitly established truths to be both non-truth-bearers and truth-bearers.


    You are essentially saying that
    A cure for cancer is totally useless because it only cures
    99.99% of cancers.

    Nope, but it can't be said to be a cure for ALL cancers.

    That is where you run into the problem, trying to say that things that
    must be correct for ALL inputs, are allowed to only be correct for many
    inputs.




    But we can't even know if the Goldbach conjecture is a
    knowledge-bearer or not. If it turns out to be false, then that fact
    is knowable, but not yet known (since showing the number, as a simple
    finite proof that no pair of primes below it sum to it make it prove
    false), but if it is true, there might be a proof, or there might not be.

    So even Knowledge-Bearers as a concept is has limited use. Knowledge,
    that which we currently know, is a valid concept, and one that admits
    things can be added to it.

    And Truth-Bearers, with the allowance of infinite chains to establish
    the truth (or falseness) of the statement can be useful, though we do
    need to admit we don't know, and perhaps CAN'T know that truth value,
    and need to allow for some statements that we don't yet have the
    ability to know if they are truth-bearers or not.

    But your definition of truth-bearers is just worthless for most logic
    systems, claiming to be about truth but actually being about knowledge
    isn't a good definition, and just shows your fundamental
    misunderstanding about what is actually truth and how it differs from
    knowledge.


    So, your logic only works in systems small enough to be somewhat
    akin to toys. Those that are limited enough not to be able to cause
    the problems, which means it excludes most systems that support math.



    olcott schrieb:
    When provable means true and false means unprovable
    then (Γ ⊢ X) means X is true in Γ.
    then (Γ ⊢ ~X) means X is conventional false  in Γ.
    the (Γ ⊬ X) ∧ (Γ ⊬ ~X) X is not a truth bearer in Γ.








    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Fri Jul 5 18:22:55 2024
    On 7/5/24 5:42 PM, olcott wrote:
    On 7/5/2024 4:18 PM, Richard Damon wrote:
    On 7/5/24 4:12 PM, olcott wrote:
    On 7/5/2024 2:54 PM, Richard Damon wrote:
    On 7/5/24 1:38 PM, olcott wrote:

    Every expression such that neither X nor ~X is provable in L
    is simply not a truth bearer in L. This does correctly reject
    self-contradictory expressions that wold otherwise be interpreted
    as the incompleteness of L.

    FALSE STATEMENT.


    Can't be false it is stipulated.

    Can't stipulate that something is true.


    That every expression of language that is {true on the basis of
    its verbal meaning} must have a connection by truth preserving
    operations to its {verbal meaning} is a tautology.

    But that isn't what you said above. You keep on getting your lies mixed up.

    True on the basis of its verbal meaning isn't a thing in formal system,
    so not a Tautology, unless you mean by "verbal meaning" the meaning
    assigned to the term in the system.


    Sometimes in cases (having little actual consequence) this
    may require an infinite sequence of truth preserving operations.

    No, "verbal meaniing" isn't a recoginized term in formal system. Terms
    have definitions, and statements are evaluated by the grammer of the
    sytstem, NOT "Natural Lanugage".


    Also, stipulating a definition contrary to the system puts you out of
    the system.


    Some statements are true due to an infinite number of steps to ther
    truth-makers of the system.


    Already covered that.

    Nope. That is just stipulating that you system is contradictory.


    You will lead your logic system into contradictions by your
    definition (or you just need to treat it as a worthless phrase that
    doesn't actually tell you anything, particually what you call
    non-truth-bearers, which might actuall be statement that are true or
    false).


    Not at all. Such a system does detect and reject self-contradictory
    expressions thus does not use this as any basis for incompleteness.

    Nope, it just puts your logic outside of most logic systems, and
    unable to hamdle most of the problems people really care about.


    Right people really care about the Goldbach conjecture
    infinite more than avoiding Fascism or the death of
    the planet.

    Irrelevent, and you are just showing you don't really understand how
    logic works.




    This works correctly for every element of the accurate verbal
    model of the actual world. Since we can see that things like
    the Goldbach conjecture can be proven *OR REFUTED* in an infinite
    sequence then an algorithm can see this too. For everything
    else it is an infallibly correct system of reasoning.


    So, you ADMIT that you definition doesn't work for some statements,
    and thus is not correct.


    It detects expressions that require infinite steps as out
    of scope and correctly determines all of the rest.

    Nope, it defines your system as self-contradictory,

    That is not even what those words mean.

    Of course is does, your system definition contradicts itself, as it
    defines the Goldbach conjecture as both a non-truth-bearer and as a truth-bearer.


    as things like tht GoldBach conjecture are defined as BOTH
    non-truth-bearers, and as truth-bearers.

    That seems to be the lie for your logic, that you just allow yourself
    to be wrong at times, which makes your logic worthless.


    Note, the algorithm can not tell wether the statement like to
    Goldback conjecture is true or not, or even if it takes an infinite
    number of steps to come to that answer. Thus, you statement is just
    a FALSEHOOD.

    Not at all. Because it is dead obvious to humans that Goldbach
    can be proved or refuted in an infinite number of steps an
    algorithm can see this too.

    But it might not need an infinite number of steps to refute it.

    That my system handles all knowledge that can be expressed
    using language is enough.


    Nope, Putting all knowledge into a bucket and says "there it is" doesn't actualy do anything.

    And that second definition contradicts your first, as the first
    defines Goldmach (if true) to be a non-truth-bearer, while the second
    tries to contradict that to say it is.

    That is not even what those words mean.

    Then what else does your words mean.

    By your first definition, since we don't have a finite proof or
    refuatation of GoldBach's conjecture, it must be a non-truth-bearer.
    That definition allows no other possibility.

    By your second, since it is clear that it will be either true or false
    after we test ever even number, it must be a truth-bearer.

    The first rule didn't state an exception for the second rule, so don't
    unsay itself.

    You just don't understand how logic works.


    You can't do that in two different statements.


    You just don't understand logic well enough to understand that can't
    have definitions that just don't work as the basis of a system.

    By your definition, the Goldbach conjecture must currently be
    consider a non-truth-bearer, but we KNOW that it must be either true
    or false, we

    It would be construed as out-of-scope.
    Whether or not there was evidence of:
    (a) Election fraud that could have possibly changed
    the outcome of the 2020 presidential election or
    (b) Very harmful climate change caused by humans
    would be in scope.

    Since both of those statements are based on EMPERICAL evidence, they
    are outside the scope of analytical logic.


    An accurate model of the actual world already has
    them encoded in language.

    But no such "accurate model" exists.

    Quoting an emperical result doesn't make it an analytic truth.

    You just don't understand how logic works.



    just don't know which, so you definition of a truth-bearer is just a
    lie.

    What you are defining are KNOWLEDGE bearers, statements that there
    truth can be known.

    The key problem that it solves is that it makes True(L,x)
    computable for all of the most important things that really
    matter.

    Nope, becuase you made you system inconsistent by defining infinitly
    established truths to be both non-truth-bearers and truth-bearers.


    out-of-scope is not at all the same thing as inconsistent.

    Nope, you system is inconsistant as it ACCEPTED the GoldBach conjecture,
    and then defined it to be both a non-truth-bearer but not having a
    finite proof or refutation, and as truth-bearer, as it is clear that
    after doing the infinite tests, and answer will be found.

    It *IS* inconsistant.



    You are essentially saying that
    A cure for cancer is totally useless because it only cures
    99.99% of cancers.

    Nope, but it can't be said to be a cure for ALL cancers.

    It can handle ALL knowledge that can be expressed using language.

    So?


    That is where you run into the problem, trying to say that things that
    must be correct for ALL inputs, are allowed to only be correct for
    many inputs.

    The entire set of knowledge that can be expressed using language.


    So? If we already know it, what good is that?

    It can't sy anything about truths that we don't yet know. (at least
    nothing that can't be determined by the systems you steal the knowledge
    from).

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Fri Jul 5 19:12:51 2024
    On 7/5/24 6:33 PM, olcott wrote:
    On 7/5/2024 5:22 PM, Richard Damon wrote:
    On 7/5/24 5:42 PM, olcott wrote:
    On 7/5/2024 4:18 PM, Richard Damon wrote:
    On 7/5/24 4:12 PM, olcott wrote:
    On 7/5/2024 2:54 PM, Richard Damon wrote:
    On 7/5/24 1:38 PM, olcott wrote:

    Every expression such that neither X nor ~X is provable in L
    is simply not a truth bearer in L. This does correctly reject
    self-contradictory expressions that wold otherwise be interpreted >>>>>>> as the incompleteness of L.

    FALSE STATEMENT.


    Can't be false it is stipulated.

    Can't stipulate that something is true.


    That every expression of language that is {true on the basis of
    its verbal meaning} must have a connection by truth preserving
    operations to its {verbal meaning} is a tautology.

    But that isn't what you said above. You keep on getting your lies
    mixed up.

    I am fallible so the first time that I say something
    it will probably not be infallible.

    Then ADMIT an error rather then say someone else is wrong because you
    didn't say what you meant.


    True on the basis of its verbal meaning isn't a thing in formal
    system, so not a Tautology, unless you mean by "verbal meaning" the
    meaning assigned to the term in the system.

    Se that I have to update it again because I am fallible.
    Did you know that the Gnostic Demiurge concept of God is fallible?

    And that Gnosticism is just a heresy that is inconsistent, and thus not
    true.


    That every expression of language that is {true on the basis
    of its meaning expressed using language} must have a connection
    by truth preserving operations to its {meaning expressed using
    language} is a tautology.

    No, only if you restrict the language it can use. For instance, On the
    basis of natural language Cats are Cats is a statement that is true by
    the meaning of the words, as it Blurgs are Blurgs. But in a system that
    doesn't define Cats, or Blurgs (like basic mathematics) there is not
    possible connection by truth preserving operations to the any meaning
    since it uses undefined terms in the system.

    You keep om forgetting that formal systems are not defined in terms of
    natural language, so you can't use natural language definition to work
    with them.


    This refutes Tarski undefinability for the entire set of
    knowledge that can be expressed using language.

    But that isn't what Tarski was talking about.

    After all, you STILL can't give a consitant value for the expression
    True(L, x) for x defined in L as ~True(L,x).

    Clearly our language allows us to define an x that way, and whatever
    value True(L,x) is defined (either True or False) it becomes a
    contradiction.


    It sure as Hell does not get confused by any pathological
    expressions that refer to themselves such as the key
    expression that attempt to refute truthmaker maximalism:
    This sentence has no truthmaker

    And why not? what is the value of True(L,x) from above?


    The accurate model of the actual world is expressed
    using formal language and formalized natural language.


    and can't be an completely accurate model of the actual world, as we
    don't know enough about it.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Sat Jul 6 10:53:31 2024
    On 7/5/24 11:50 PM, olcott wrote:
    On 7/5/2024 6:12 PM, Richard Damon wrote:
    On 7/5/24 6:33 PM, olcott wrote:
    On 7/5/2024 5:22 PM, Richard Damon wrote:
    On 7/5/24 5:42 PM, olcott wrote:
    On 7/5/2024 4:18 PM, Richard Damon wrote:
    On 7/5/24 4:12 PM, olcott wrote:
    On 7/5/2024 2:54 PM, Richard Damon wrote:
    On 7/5/24 1:38 PM, olcott wrote:

    Every expression such that neither X nor ~X is provable in L >>>>>>>>> is simply not a truth bearer in L. This does correctly reject >>>>>>>>> self-contradictory expressions that wold otherwise be interpreted >>>>>>>>> as the incompleteness of L.

    FALSE STATEMENT.


    Can't be false it is stipulated.

    Can't stipulate that something is true.


    That every expression of language that is {true on the basis of
    its verbal meaning} must have a connection by truth preserving
    operations to its {verbal meaning} is a tautology.

    But that isn't what you said above. You keep on getting your lies
    mixed up.

    I am fallible so the first time that I say something
    it will probably not be infallible.

    Then ADMIT an error rather then say someone else is wrong because you
    didn't say what you meant.


    It takes many revisions to precisely state my intuitions.
    Every one is less than perfect. They keep getting better.

    But, you refuse to acknoledge that you previous statements were errors,
    but accuse people of lying because they took you at your words.



    True on the basis of its verbal meaning isn't a thing in formal
    system, so not a Tautology, unless you mean by "verbal meaning" the
    meaning assigned to the term in the system.

    Se that I have to update it again because I am fallible.
    Did you know that the Gnostic Demiurge concept of God is fallible?

    And that Gnosticism is just a heresy that is inconsistent, and thus
    not true.

    It is a notion of God as an ordinary human that also was the
    sole creator. Ultimately only an omniscient being could make
    the 100% reliable call on this.

    But such a God could not do what he did.



    That every expression of language that is {true on the basis
    of its meaning expressed using language} must have a connection
    by truth preserving operations to its {meaning expressed using
    language} is a tautology.

    No, only if you restrict the language it can use. For instance, On the
    basis of natural language Cats are Cats is a statement that is true by
    the meaning of the words, as it Blurgs are Blurgs. But in a system
    that doesn't define Cats, or Blurgs (like basic mathematics) there is
    not possible connection by truth preserving operations to the any
    meaning since it uses undefined terms in the system.

    You simply did not pay close enough attention to what I actually said.
    Try reading again fifteen more times.

    But you just admitted that your words were incorrect.

    They problem is when you base your arguement on incorrect definitions,
    it can't be a valid and sound argument.


    You keep om forgetting that formal systems are not defined in terms of
    natural language, so you can't use natural language definition to work
    with them.


    I didn't forget. Later on I fill in more details. When I
    give all of the details all at once people are overwhelmed.

    No, you contradict yourself by lying.



    This refutes Tarski undefinability for the entire set of
    knowledge that can be expressed using language.

    But that isn't what Tarski was talking about.

    After all, you STILL can't give a consitant value for the expression
    True(L, x) for x defined in L as ~True(L,x).


    The whole purpose of my two decades of primary research on this
    it to reject pathological expressions types as not truth bearers.
    The expression that you provided was not even pathological.
    ~True(English, "cats are dogs") is true.

    But you CAN'T "reject" them the way you are trying without rejecting all
    of the logic system that allowed them.

    Your problem is you just don't understand how logic works, and thus,
    keep on trying to make systems that are just inadiquite to the actual
    tasks people use logic for.


    Clearly our language allows us to define an x that way, and whatever
    value True(L,x) is defined (either True or False) it becomes a
    contradiction.

    The primary purpose of my two decades worth of primary research
    is to recognize and reject pathological expressions.

    But the problem is, some of them are ALLOWED by their systems.

    For instance, it is IMPOSSIBLE to keep a system Turing Complete and also
    define that you can't build an program from a specified decider and have
    it act contrary to that deciders decision.

    IMPOSSIBLE.

    So your goal is just impossible.



    It sure as Hell does not get confused by any pathological
    expressions that refer to themselves such as the key
    expression that attempt to refute truthmaker maximalism:
    This sentence has no truthmaker

    And why not? what is the value of True(L,x) from above?

    There is no sequence of truth preserving operations
    that can reach the Liar Paradox or its negation.

    So?

    If you assume a definition as a predicate of True(L, x) you create a
    sequence of truth preserving operations that result in a contradiction
    when we define x in L as ~True(L,x).

    This shows that there can be no definition as a predicate of True(L,x).



    The accurate model of the actual world is expressed
    using formal language and formalized natural language.


    and can't be an completely accurate model of the actual world, as we
    don't know enough about it.

    It can be sufficiently complete have all the details that
    it needs and no more.



    Nope, as that requirement isn't definitive. The "system" itself has no
    "needs", it is the user of the system, that the system doesn't know about.

    Yes, some systems can be "good enough" for some limited uses, but those
    limits needs to be carefullly defined and obeyed.

    Thus, you don't have "THE accurate model of the actual world" but "A
    some-what accurate enough model of a sub-system of the world, good
    enough for some specific usages"

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Sat Jul 6 14:20:21 2024
    On 7/6/24 1:59 PM, olcott wrote:
    On 7/6/2024 9:53 AM, Richard Damon wrote:
    On 7/5/24 11:50 PM, olcott wrote:
    On 7/5/2024 6:12 PM, Richard Damon wrote:

    Then ADMIT an error rather then say someone else is wrong because
    you didn't say what you meant.


    It takes many revisions to precisely state my intuitions.
    Every one is less than perfect. They keep getting better.

    But, you refuse to acknoledge that you previous statements were
    errors, but accuse people of lying because they took you at your words.


    It is/was incorrect for me to call people liars when
    they disputed the exact meaning of my prior less than
    accurate words and they only disputed this on the basis
    of the less than accuracy.

    Then why do you continue to do so?

    The mere


    That is not what is happening on the other set of threads.



    True on the basis of its verbal meaning isn't a thing in formal
    system, so not a Tautology, unless you mean by "verbal meaning"
    the meaning assigned to the term in the system.

    Se that I have to update it again because I am fallible.
    Did you know that the Gnostic Demiurge concept of God is fallible?

    And that Gnosticism is just a heresy that is inconsistent, and thus
    not true.

    It is a notion of God as an ordinary human that also was the
    sole creator. Ultimately only an omniscient being could make
    the 100% reliable call on this.

    But such a God could not do what he did.


    Again my less than accurate words.
    A being that has no more knowledge than a human creates
    the universe by first creating/discovering light from
    what is otherwise silences and darkness.

    But is that probable, or even possible.

    That is one of your failings, you imgaine something that maybe jus
    tmight be possible, (even if it isn't) and assume it is.


    Complete darkness so very gradually becomes pure white
    light that it takes a long long time for this being to
    notice the change.

    Later on this being imagines a flat surface that is
    perpendicular to their own frame-of-reference and
    decides to push the top of this flat surface backwards
    so that it forms a 45 degree angle. This is how the
    third dimension to space could have been created.

    A very long time later this being decides that they
    want to forget that they did this and they condition
    themselves to get out of the habit of using their power.

    The essence of all of this is explained in the great book. https://www.amazon.com/What-Are-You-Doing-Universe/dp/0878770658

    The original version of this book tells the reader that they
    themselves are the one and only creator of the universe.
    The library of congress classifies this book as possible truth
    Philosophical Anthropology Miscellanea

    Later versions of this book have an identical body yet come with
    the caveat this this is a possible truth not a declared fact.

    And by promoting such ideas, you show that you do not believe in the
    actual all powerful God that did create the univesre, and thus whe it
    comes time for the judgement of your life, you will be found lacking in
    the faith needed to redeam you from your failings, and thus spend your
    eternity seperated from him, in the place, best described in human
    terms, as the eternal fires of Hell.

    If you are not convinced, which is the more likely origin of the world,
    and which decision has the more impact on what you should do.




    That every expression of language that is {true on the basis
    of its meaning expressed using language} must have a connection
    by truth preserving operations to its {meaning expressed using
    language} is a tautology.

    No, only if you restrict the language it can use. For instance, On
    the basis of natural language Cats are Cats is a statement that is
    true by the meaning of the words, as it Blurgs are Blurgs. But in a
    system that doesn't define Cats, or Blurgs (like basic mathematics)
    there is not possible connection by truth preserving operations to
    the any meaning since it uses undefined terms in the system.

    You simply did not pay close enough attention to what I actually said.
    Try reading again fifteen more times.

    But you just admitted that your words were incorrect.

    They problem is when you base your arguement on incorrect definitions,
    it can't be a valid and sound argument.


    That every expression of language that is {true on the basis of
    its meaning expressed using language} must have a connection by
    truth preserving operations to its {meaning expressed using language}
    is a tautology. The accurate model of the actual world is expressed
    using formal language and formalized natural language.



    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Sat Jul 6 15:06:24 2024
    On 7/6/24 2:37 PM, olcott wrote:
    On 7/6/2024 1:20 PM, Richard Damon wrote:
    On 7/6/24 1:59 PM, olcott wrote:
    On 7/6/2024 9:53 AM, Richard Damon wrote:
    On 7/5/24 11:50 PM, olcott wrote:
    On 7/5/2024 6:12 PM, Richard Damon wrote:

    Then ADMIT an error rather then say someone else is wrong because
    you didn't say what you meant.


    It takes many revisions to precisely state my intuitions.
    Every one is less than perfect. They keep getting better.

    But, you refuse to acknoledge that you previous statements were
    errors, but accuse people of lying because they took you at your words. >>>>

    It is/was incorrect for me to call people liars when
    they disputed the exact meaning of my prior less than
    accurate words and they only disputed this on the basis
    of the less than accuracy.

    Then why do you continue to do so?

    I am unconvinced that I ever did this.

    Which just shows your utter lack or morals or scrupals, and the total falibility of your memory.

    Just look at comp.theory, and how many message YOU STARTED have subject implying others are liars.


    The mere


    That is not what is happening on the other set of threads.



    True on the basis of its verbal meaning isn't a thing in formal >>>>>>>> system, so not a Tautology, unless you mean by "verbal meaning" >>>>>>>> the meaning assigned to the term in the system.

    Se that I have to update it again because I am fallible.
    Did you know that the Gnostic Demiurge concept of God is fallible? >>>>>>
    And that Gnosticism is just a heresy that is inconsistent, and
    thus not true.

    It is a notion of God as an ordinary human that also was the
    sole creator. Ultimately only an omniscient being could make
    the 100% reliable call on this.

    But such a God could not do what he did.


    Again my less than accurate words.
    A being that has no more knowledge than a human creates
    the universe by first creating/discovering light from
    what is otherwise silences and darkness.

    But is that probable, or even possible.

    Again the key issue is that someone that is essentially
    a fallible human does this.

    And, how can that happen?

    Where did they come from to be able to do that?


    That is one of your failings, you imgaine something that maybe jus
    tmight be possible, (even if it isn't) and assume it is.

    The only actual impossibilities are logical impossibilities.
    The strangest logically possible thing is that a real live
    two dimensional Bugs Bunny knocks on your door.

    So, where does the failible human come from that created the universe?



    Complete darkness so very gradually becomes pure white
    light that it takes a long long time for this being to
    notice the change.

    Later on this being imagines a flat surface that is
    perpendicular to their own frame-of-reference and
    decides to push the top of this flat surface backwards
    so that it forms a 45 degree angle. This is how the
    third dimension to space could have been created.

    A very long time later this being decides that they
    want to forget that they did this and they condition
    themselves to get out of the habit of using their power.

    The essence of all of this is explained in the great book.
    https://www.amazon.com/What-Are-You-Doing-Universe/dp/0878770658

    The original version of this book tells the reader that they
    themselves are the one and only creator of the universe.
    The library of congress classifies this book as possible truth
    Philosophical Anthropology Miscellanea

    Later versions of this book have an identical body yet come with
    the caveat this this is a possible truth not a declared fact.

    And by promoting such ideas, you show that you do not believe in the
    actual all powerful God that did create the univesre, and thus whe it

    I have long since fully understood that beliefs and
    disbelief are lies that we tell ourselves. They are
    lies because they close the mind to additional information.

    No, you have fallen for the lie that real truth doesn't exist.


    comes time for the judgement of your life, you will be found lacking
    in the faith needed to redeam you from your failings, and thus spend
    your eternity seperated from him, in the place, best described in
    human terms, as the eternal fires of Hell.

    Faith is not the same thing as the mere presumption that
    beliefs often are. Faith is the substance of things hoped for
    not the presumption that we are correct thus others are wrong.

    Right, but since you do not have a faith in the actual creator of the
    universe, you are unable to avail yourself of his grace to let you have
    the relationship you need with him, so will forever be outside of him.

    You may not belevie that now, but if you honestly look at the outcome of
    your beliefs and your life, you should be able to see that they don't
    have any better foundation. I KNOW that what I believe is true, because
    I have put it to the test, and he has proven himself faithful.


    If you are not convinced, which is the more likely origin of the
    world, and which decision has the more impact on what you should do.

    I am testing the hypothesis that I was deceived by Satan.

    Every translation of the bible agrees that God himself would
    be this deceiver.

    Nope.


    For this reason God sends them a powerful delusion, leading them to
    believe what is false, https://www.biblegateway.com/verse/en/2%20Thessalonians%202:11

    Read the context. Man because of our sin, can not directly see God at work.


    I have ALWAYS only wanted what-ever the truth turns out to be
    even if everyone in the universe disagrees.

    But you ignore that truth when it shows itself to you.


    *THE TRUTH OF THIS SEEMS INFALLIBLY CORRECT*
    That every expression of language that is {true on the basis of
    its meaning expressed using language} must have a connection by
    truth preserving operations to its {meaning expressed using language}
    is a tautology. The accurate model of the actual world is expressed
    using formal language and formalized natural language.

    *Meaning that all of math and logic that disagrees are WRONG*


    Nope, that is just your own deception. The human use of language just
    isn't that good and has flaws in it.

    And, you presume that an "accurate model of the actual world" exists (or
    even can exist). The fundamental problem is that we only know of the
    world though IMPERFECT observations, and thus can only make an imperfect
    model of the world. Yes, you can do a lot through a known imperfect
    model, but you need to know the imperfections in it to understand its
    limits.

    Your logic starts by requiring begining with a perfect knowledge of what
    is, which is impossible, and is the sort of error you keep on making, of assuming something as "must be true" when it is just impossible.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Sat Jul 6 17:02:30 2024
    On 7/6/24 4:48 PM, olcott wrote:
    On 7/6/2024 3:24 PM, Richard Damon wrote:
    On 7/6/24 3:35 PM, olcott wrote:

    You have ignored my reference to a book that was classified
    by the Library of Congress as possibly true that says anyone
    reading this book *is* the one and only creator of the universe.

    The Library of Congress makes no such determinations. The authors
    provide the classifications.


    What is your source of this, I found a source that seem to conflict. https://www.loc.gov/catworkshop/lcc/PDFs%20of%20slides/12-3%20handout.pdf

    So, what page takes about the classificaiton of the type of material.

    That who document is about assigning "Literary Author Numbers"


    The fact that such a statement is a logical impossiblity if one
    accepts that there is a shared reality (as that realith existed before
    the reader did) makes it absurd.


    Yes and when one accept that numbers do not exist it
    logically follows that there is no such thing as arithmetic.

    So, you really think that is a correct model of reality?

    Pity you.



    *Anyone seeking the truth cannot simply ignore that*
    You have not seen this actual book, yet I have several copies.

    You would, and it fits in your pattern of logic.



    comes time for the judgement of your life, you will be found
    lacking in the faith needed to redeam you from your failings, and
    thus spend your eternity seperated from him, in the place, best
    described in human terms, as the eternal fires of Hell.

    Faith is not the same thing as the mere presumption that
    beliefs often are. Faith is the substance of things hoped for
    not the presumption that we are correct thus others are wrong.

    Right, but since you do not have a faith in the actual creator of
    the universe, you are unable to avail yourself of his grace to let
    you have the relationship you need with him, so will forever be
    outside of him.

    You may not belevie that now, but if you honestly look at the
    outcome of your beliefs and your life, you should be able to see
    that they don't have any better foundation. I KNOW that what I
    believe is true, because I have put it to the test, and he has
    proven himself faithful.


    If you are not convinced, which is the more likely origin of the
    world, and which decision has the more impact on what you should do. >>>>>>
    I am testing the hypothesis that I was deceived by Satan.

    Every translation of the bible agrees that God himself would
    be this deceiver.

    Nope.


    For this reason God sends them a powerful delusion, leading them to
    believe what is false,
    https://www.biblegateway.com/verse/en/2%20Thessalonians%202:11

    Read the context. Man because of our sin, can not directly see God
    at work.


    That the bible says God himself would send a delusion cannot
    possibly have any context where God himself is not a deceiver.
    That every translation agrees is strong evidence that it is not
    a translation error.

    But if you look at the context, the delusion is the delusion created
    by ones own denial of the law of God, so he sends them what they
    wanted, by their own choice, so God is not "a deceiver" but only
    allows people who have chosen to be decieved to be deceived.


    He has abolished the law with its commandments and
    ordinances, so that he might create in himself one
    new humanity in place of the two, thus making peace, https://www.biblegateway.com/passage/?search=Ephesians+2%3A15&version=NRSVA

    But From Matthew 5:17-18 not one piece of the law has passed away.

    So, only those that have been made "new" have had that law abolished.

    Remember, you are quoting a message to those that were saved, to those
    that still were lost.




    I have ALWAYS only wanted what-ever the truth turns out to be
    even if everyone in the universe disagrees.

    But you ignore that truth when it shows itself to you.


    *THE TRUTH OF THIS SEEMS INFALLIBLY CORRECT*
    That every expression of language that is {true on the basis of
    its meaning expressed using language} must have a connection by
    truth preserving operations to its {meaning expressed using language} >>>>> is a tautology. The accurate model of the actual world is expressed
    using formal language and formalized natural language.

    *Meaning that all of math and logic that disagrees are WRONG*


    Nope, that is just your own deception. The human use of language
    just isn't that good and has flaws in it.

    My system does not get stuck like the Tarski system.
    As you already know there cannot possibly be any sequence
    of truth preserving operations to LP or ~LP proves that
    my system overcomes Tarski's proof.

    So, what is the value of True(L, x) where x in L is the statement
    ~True(L,x)


    This is simply the Prolog model where true
    means provable and false means not provable.
    Conventional false means ~x is provable.

    Which only handles the most simple of logic, which is still your failing.

    Your logic only works in system that simple.


    True(L,x)  only when  x is true, otherwise false.
    True(L,~x) only when ~x is true, otherwise false.

    Bu


    x = ~True(L, x)
    True(L, x) is false.
    True(L, ~x) is false.

    But if True(L, x) is false
    then x = ~True(L, x) is true.

    so, you just asserted that True(L, true) is false.

    The problem here is you logic doesn't actually allow for the necessaery references in it.

    I.e, it is too primative.


    ?- LP = not(true(LP)).
    LP = not(true(LP)).
    ?- unify_with_occurs_check(LP, not(true(LP))).
    false.



    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Sat Jul 6 16:24:21 2024
    On 7/6/24 3:35 PM, olcott wrote:
    On 7/6/2024 2:06 PM, Richard Damon wrote:
    On 7/6/24 2:37 PM, olcott wrote:
    On 7/6/2024 1:20 PM, Richard Damon wrote:
    On 7/6/24 1:59 PM, olcott wrote:

    The essence of all of this is explained in the great book.
    https://www.amazon.com/What-Are-You-Doing-Universe/dp/0878770658

    The original version of this book tells the reader that they
    themselves are the one and only creator of the universe.
    The library of congress classifies this book as possible truth
    Philosophical Anthropology Miscellanea

    Later versions of this book have an identical body yet come with
    the caveat this this is a possible truth not a declared fact.

    And by promoting such ideas, you show that you do not believe in the
    actual all powerful God that did create the univesre, and thus whe it

    I have long since fully understood that beliefs and
    disbelief are lies that we tell ourselves. They are
    lies because they close the mind to additional information.

    No, you have fallen for the lie that real truth doesn't exist.


    You have ignored my reference to a book that was classified
    by the Library of Congress as possibly true that says anyone
    reading this book *is* the one and only creator of the universe.

    The Library of Congress makes no such determinations. The authors
    provide the classifications.

    The fact that such a statement is a logical impossiblity if one accepts
    that there is a shared reality (as that realith existed before the
    reader did) makes it absurd.


    *Anyone seeking the truth cannot simply ignore that*
    You have not seen this actual book, yet I have several copies.

    You would, and it fits in your pattern of logic.



    comes time for the judgement of your life, you will be found lacking
    in the faith needed to redeam you from your failings, and thus spend
    your eternity seperated from him, in the place, best described in
    human terms, as the eternal fires of Hell.

    Faith is not the same thing as the mere presumption that
    beliefs often are. Faith is the substance of things hoped for
    not the presumption that we are correct thus others are wrong.

    Right, but since you do not have a faith in the actual creator of the
    universe, you are unable to avail yourself of his grace to let you
    have the relationship you need with him, so will forever be outside of
    him.

    You may not belevie that now, but if you honestly look at the outcome
    of your beliefs and your life, you should be able to see that they
    don't have any better foundation. I KNOW that what I believe is true,
    because I have put it to the test, and he has proven himself faithful.


    If you are not convinced, which is the more likely origin of the
    world, and which decision has the more impact on what you should do.

    I am testing the hypothesis that I was deceived by Satan.

    Every translation of the bible agrees that God himself would
    be this deceiver.

    Nope.


    For this reason God sends them a powerful delusion, leading them to
    believe what is false,
    https://www.biblegateway.com/verse/en/2%20Thessalonians%202:11

    Read the context. Man because of our sin, can not directly see God at
    work.


    That the bible says God himself would send a delusion cannot
    possibly have any context where God himself is not a deceiver.
    That every translation agrees is strong evidence that it is not
    a translation error.

    But if you look at the context, the delusion is the delusion created by
    ones own denial of the law of God, so he sends them what they wanted, by
    their own choice, so God is not "a deceiver" but only allows people who
    have chosen to be decieved to be deceived.



    I have ALWAYS only wanted what-ever the truth turns out to be
    even if everyone in the universe disagrees.

    But you ignore that truth when it shows itself to you.


    *THE TRUTH OF THIS SEEMS INFALLIBLY CORRECT*
    That every expression of language that is {true on the basis of
    its meaning expressed using language} must have a connection by
    truth preserving operations to its {meaning expressed using language}
    is a tautology. The accurate model of the actual world is expressed
    using formal language and formalized natural language.

    *Meaning that all of math and logic that disagrees are WRONG*


    Nope, that is just your own deception. The human use of language just
    isn't that good and has flaws in it.

    My system does not get stuck like the Tarski system.
    As you already know there cannot possibly be any sequence
    of truth preserving operations to LP or ~LP proves that
    my system overcomes Tarski's proof.

    So, what is the value of True(L, x) where x in L is the statement
    ~True(L,x)

    If it is false, then x must be true, and your true predicate just made
    an error.

    Your only out is for the True predicate to not BE a predicate, which is
    of course, a contradiction.


    That you simply dismiss this out-of-hand when you already
    know it is true cannot be construed as anything but a lie.

    Because you can't answer the question on it, because there isn't one,
    which shows your idea is broken. (or you are just a liar).

    And, you presume that an "accurate model of the actual world" exists
    (or even can exist). The fundamental problem is that we only know of
    the world though IMPERFECT observations, and thus can only make an
    imperfect model of the world.

    We perfectly know that kittens are not 15 story office buildings.
    It seems that we perfectly know that no evidence has ever been
    presented that election fraud changed the outcome of the 2020
    presidential election.

    But lack of evidence is not evidence of absence.

    Yes, we can say there has been no evidence of sufficient fraud to have
    changed the election, but if your belief system entials that "The
    System" has the power to hid that evidence, you don't need to believe
    that the lack of evidence means anything.

    Just like you, they reject the idea that evidence is needed to make claims.


    Yes, you can do a lot through a known imperfect model, but you need to
    know the imperfections in it to understand its limits.

    My model is a semantic tautology thus cannot possibly be erroneous.
    If some people believe that kittens are 15 story office buildings
    this simply makes them WRONG.

    Of course it can, we have shown that you get your error in the
    definition of True.


    Your logic starts by requiring begining with a perfect knowledge of
    what is, which is impossible, and is the sort of error you keep on
    making, of assuming something as "must be true" when it is just
    impossible.

    The main thing that my model very clearly does is toss out
    pathological expressions on their ass. This corrects the error
    of mathematical incompleteness.


    As well as much valid logic, forcing your system to only accept very
    primative logic forms.

    You don't see it, because you don't understand how logic works.

    You only understand those most simple of logic forms, and thus don't
    understand where your assumptions get you in trouble.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Sat Jul 6 18:22:04 2024
    On 7/6/24 6:08 PM, olcott wrote:
    On 7/6/2024 4:02 PM, Richard Damon wrote:
    On 7/6/24 4:48 PM, olcott wrote:
    On 7/6/2024 3:24 PM, Richard Damon wrote:
    On 7/6/24 3:35 PM, olcott wrote:

    You have ignored my reference to a book that was classified
    by the Library of Congress as possibly true that says anyone
    reading this book *is* the one and only creator of the universe.

    The Library of Congress makes no such determinations. The authors
    provide the classifications.


    What is your source of this, I found a source that seem to conflict.
    https://www.loc.gov/catworkshop/lcc/PDFs%20of%20slides/12-3%20handout.pdf >>
    So, what page takes about the classificaiton of the type of material.

    That who document is about assigning "Literary Author Numbers"


    The fact that such a statement is a logical impossiblity if one
    accepts that there is a shared reality (as that realith existed
    before the reader did) makes it absurd.


    Yes and when one accept that numbers do not exist it
    logically follows that there is no such thing as arithmetic.

    So, you really think that is a correct model of reality?


    I hypothesize possibilities. You pick one guess that you are
    right and close your mind.

    But you choose poorly and pick ones that can't be because they are inconsistant.


    Pity you.



    *Anyone seeking the truth cannot simply ignore that*
    You have not seen this actual book, yet I have several copies.

    You would, and it fits in your pattern of logic.



    comes time for the judgement of your life, you will be found
    lacking in the faith needed to redeam you from your failings,
    and thus spend your eternity seperated from him, in the place, >>>>>>>> best described in human terms, as the eternal fires of Hell.

    Faith is not the same thing as the mere presumption that
    beliefs often are. Faith is the substance of things hoped for
    not the presumption that we are correct thus others are wrong.

    Right, but since you do not have a faith in the actual creator of
    the universe, you are unable to avail yourself of his grace to let >>>>>> you have the relationship you need with him, so will forever be
    outside of him.

    You may not belevie that now, but if you honestly look at the
    outcome of your beliefs and your life, you should be able to see
    that they don't have any better foundation. I KNOW that what I
    believe is true, because I have put it to the test, and he has
    proven himself faithful.


    If you are not convinced, which is the more likely origin of the >>>>>>>> world, and which decision has the more impact on what you should >>>>>>>> do.

    I am testing the hypothesis that I was deceived by Satan.

    Every translation of the bible agrees that God himself would
    be this deceiver.

    Nope.


    For this reason God sends them a powerful delusion, leading them >>>>>>> to believe what is false,
    https://www.biblegateway.com/verse/en/2%20Thessalonians%202:11

    Read the context. Man because of our sin, can not directly see God >>>>>> at work.


    That the bible says God himself would send a delusion cannot
    possibly have any context where God himself is not a deceiver.
    That every translation agrees is strong evidence that it is not
    a translation error.

    But if you look at the context, the delusion is the delusion created
    by ones own denial of the law of God, so he sends them what they
    wanted, by their own choice, so God is not "a deceiver" but only
    allows people who have chosen to be decieved to be deceived.


    He has abolished the law with its commandments and
    ordinances, so that he might create in himself one
    new humanity in place of the two, thus making peace,
    https://www.biblegateway.com/passage/?search=Ephesians+2%3A15&version=NRSVA >>
    But From Matthew 5:17-18 not one piece of the law has passed away.

    Until Christ died on the cross.

    Not what he said.

    Till the heavens and Earth disappear.


    So, only those that have been made "new" have had that law abolished.

    Remember, you are quoting a message to those that were saved, to those
    that still were lost.




    I have ALWAYS only wanted what-ever the truth turns out to be
    even if everyone in the universe disagrees.

    But you ignore that truth when it shows itself to you.


    *THE TRUTH OF THIS SEEMS INFALLIBLY CORRECT*
    That every expression of language that is {true on the basis of
    its meaning expressed using language} must have a connection by
    truth preserving operations to its {meaning expressed using
    language}
    is a tautology. The accurate model of the actual world is expressed >>>>>>> using formal language and formalized natural language.

    *Meaning that all of math and logic that disagrees are WRONG*


    Nope, that is just your own deception. The human use of language
    just isn't that good and has flaws in it.

    My system does not get stuck like the Tarski system.
    As you already know there cannot possibly be any sequence
    of truth preserving operations to LP or ~LP proves that
    my system overcomes Tarski's proof.

    So, what is the value of True(L, x) where x in L is the statement
    ~True(L,x)


    This is simply the Prolog model where true
    means provable and false means not provable.
    Conventional false means ~x is provable.

    Which only handles the most simple of logic, which is still your failing.


    The essential architecture where true means provable
    and false means unprovable can be applied to a system
    that simultaneously has an unlimited orders of logic.
    0,1,2,...N all at the same time.

    Nope.

    Try to show it.

    Note, I don't think you understand what "order of logic" actually means.


    Your logic only works in system that simple.


    True(L,x)  only when  x is true, otherwise false.
    True(L,~x) only when ~x is true, otherwise false.

    Bu


    x = ~True(L, x)
    True(L, x) is false.
    True(L, ~x) is false.

    But if True(L, x) is false
    then x = ~True(L, x) is true.


    Try rereading what I said over and over 25 times to
    see your mistake.

    There is none, you just get the inconsistant answer because you thing
    the True(L, ~x) version means something here.


    so, you just asserted that True(L, true) is false.

    No.

    x = True(L, x)
    True(L, x) is false meaning that it is not true, not
    meaning that ~x is true.

    But ~x IS True(L, x).

    I guess you logic system doesn't have negation as a logical operator.


    The problem here is you logic doesn't actually allow for the
    necessaery references in it.

    Not at all. My logic is simply smart enough to reject
    non-truth-bearers AKA expressions that are not valid
    propositions. It does not stupidly falsely assume that
    every expression is a valid proposition.\

    Logic isn't "Smart", it follows its rules.

    Your rules are just inconsistent.


    I.e, it is too primative.


    ?- LP = not(true(LP)).
    LP = not(true(LP)).
    ?- unify_with_occurs_check(LP, not(true(LP))).
    false.





    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Sat Jul 6 19:28:49 2024
    On 7/6/24 6:41 PM, olcott wrote:
    On 7/6/2024 5:22 PM, Richard Damon wrote:
    On 7/6/24 6:08 PM, olcott wrote:
    On 7/6/2024 4:02 PM, Richard Damon wrote:
    The problem here is you logic doesn't actually allow for the
    necessaery references in it.

    Not at all. My logic is simply smart enough to reject
    non-truth-bearers AKA expressions that are not valid
    propositions. It does not stupidly falsely assume that
    every expression is a valid proposition.\

    Logic isn't "Smart", it follows its rules.

    Your rules are just inconsistent.


    When-so-ever true means provable and false means not provable
    the meaning of these words proves that such a system cannot
    get stuck in pathological expressions.

    And such a definition requires the system to be keep simple or it
    becomes inconsistant.


    LP := ~True(LP) has a cycle in the directed
    graph of the elements of the expression related
    to each other that Prolog and MTT detects.


    So, what value does True(LP) return?

    If it returns your error below, it fails to meet the requirements, as "nonsense" statement must return false.

    But then, not that false is true, so the predicate is in its problem.

    THe only answers are:
    1) Not have a True Predicate.
    2) Not allow that form of reference, even indirectly, which limits the
    power of the logic system.

    ?- LP = not(true(LP)).
    LP = not(true(LP)).
    ?- unify_with_occurs_check(LP, not(true(LP))).
    false.



    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Sat Jul 6 21:32:29 2024
    On 7/6/24 9:06 PM, olcott wrote:
    On 7/6/2024 6:28 PM, Richard Damon wrote:
    On 7/6/24 6:41 PM, olcott wrote:
    On 7/6/2024 5:22 PM, Richard Damon wrote:
    On 7/6/24 6:08 PM, olcott wrote:
    On 7/6/2024 4:02 PM, Richard Damon wrote:
    The problem here is you logic doesn't actually allow for the
    necessaery references in it.

    Not at all. My logic is simply smart enough to reject
    non-truth-bearers AKA expressions that are not valid
    propositions. It does not stupidly falsely assume that
    every expression is a valid proposition.\

    Logic isn't "Smart", it follows its rules.

    Your rules are just inconsistent.


    When-so-ever true means provable and false means not provable
    the meaning of these words proves that such a system cannot
    get stuck in pathological expressions.

    And such a definition requires the system to be keep simple or it
    becomes inconsistant.


    LP := ~True(LP) has a cycle in the directed
    graph of the elements of the expression related
    to each other that Prolog and MTT detects.


    So, what value does True(LP) return?


    True(L,x)  means x is true.
    ~True(L,x) means x is untrue which includes false and not a proposition.

    True(L,~x) means x is false.
    ~True(L,~x) means x is unfalse which includes true and not a proposition.

    True(L,LP) is false and True(L,~LP) is false which means LP
    is not a proposition.

    And if x is defined in L as ~True(L,x) means that True(L, x) is false,
    then x being the negation of that result is a true statement.

    So, you are claiming it is correct for True(L, x) where x is a true
    statement to be false, which is in contradiction to your definitions.

    Or. does your logic not have the negation symbol, even though you used it.

    Your repeated dodging answering the question just shws that you know you
    are defeated but refuse to admit it.

    YOU LOGIC FAILS.


    If it returns your error below, it fails to meet the requirements, as
    "nonsense" statement must return false.

    But then, not that false is true, so the predicate is in its problem.

    THe only answers are:
    1) Not have a True Predicate.
    2) Not allow that form of reference, even indirectly, which limits the
    power of the logic system.

    ?- LP = not(true(LP)).
    LP = not(true(LP)).
    ?- unify_with_occurs_check(LP, not(true(LP))).
    false.





    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Sat Jul 6 22:16:26 2024
    On 7/6/24 9:56 PM, olcott wrote:
    On 7/6/2024 8:32 PM, Richard Damon wrote:
    On 7/6/24 9:06 PM, olcott wrote:
    On 7/6/2024 6:28 PM, Richard Damon wrote:
    On 7/6/24 6:41 PM, olcott wrote:
    On 7/6/2024 5:22 PM, Richard Damon wrote:
    On 7/6/24 6:08 PM, olcott wrote:
    On 7/6/2024 4:02 PM, Richard Damon wrote:
    The problem here is you logic doesn't actually allow for the
    necessaery references in it.

    Not at all. My logic is simply smart enough to reject
    non-truth-bearers AKA expressions that are not valid
    propositions. It does not stupidly falsely assume that
    every expression is a valid proposition.\

    Logic isn't "Smart", it follows its rules.

    Your rules are just inconsistent.


    When-so-ever true means provable and false means not provable
    the meaning of these words proves that such a system cannot
    get stuck in pathological expressions.

    And such a definition requires the system to be keep simple or it
    becomes inconsistant.


    LP := ~True(LP) has a cycle in the directed
    graph of the elements of the expression related
    to each other that Prolog and MTT detects.


    So, what value does True(LP) return?


    True(L,x)  means x is true.
    ~True(L,x) means x is untrue which includes false and not a proposition. >>>
    True(L,~x) means x is false.
    ~True(L,~x) means x is unfalse which includes true and not a
    proposition.

    True(L,LP) is false and True(L,~LP) is false which means LP
    is not a proposition.

    And if x is defined in L as ~True(L,x) means that True(L, x) is false,
    then x being the negation of that result is a true statement.

    *That is not the way it works in my system or Prolog*
    ~True(L, x)  means x is either false or not a proposition
    ~True(L, ~x) means x is either true or not a proposition

    Try reading those two lines 150 more times and maybe it will
    break through your ADD. Alternatively you are simply a liar.

    It is something like trivalent logic {true, false, incorrect}
    ~true is false or incorrect.
    ~false is true or incorrect.


    So if x is defined in L as ~True(L, x)

    what value does True(L, x) have?

    it seems you just are too stupid to even understand the question.

    I am not asking you to quote your rules, but apply them.


    Then if that is what True(L,x) is, what does that make the truth value
    of the statemet x be since x is defined as ~True(L, x) using that above
    value for True(L, x).


    And how do you explain the conflict when you then look at that value and
    what True said?

    It seems, you are just too stupid to know how to even apply your logic,
    or maybe it just is unable to BE applied, becuase it is so broken.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Sat Jul 6 23:12:13 2024
    On 7/6/24 10:51 PM, olcott wrote:
    On 7/6/2024 9:16 PM, Richard Damon wrote:
    On 7/6/24 9:56 PM, olcott wrote:
    On 7/6/2024 8:32 PM, Richard Damon wrote:
    On 7/6/24 9:06 PM, olcott wrote:
    On 7/6/2024 6:28 PM, Richard Damon wrote:
    On 7/6/24 6:41 PM, olcott wrote:
    On 7/6/2024 5:22 PM, Richard Damon wrote:
    On 7/6/24 6:08 PM, olcott wrote:
    On 7/6/2024 4:02 PM, Richard Damon wrote:
    The problem here is you logic doesn't actually allow for the >>>>>>>>>> necessaery references in it.

    Not at all. My logic is simply smart enough to reject
    non-truth-bearers AKA expressions that are not valid
    propositions. It does not stupidly falsely assume that
    every expression is a valid proposition.\

    Logic isn't "Smart", it follows its rules.

    Your rules are just inconsistent.


    When-so-ever true means provable and false means not provable
    the meaning of these words proves that such a system cannot
    get stuck in pathological expressions.

    And such a definition requires the system to be keep simple or it
    becomes inconsistant.


    LP := ~True(LP) has a cycle in the directed
    graph of the elements of the expression related
    to each other that Prolog and MTT detects.


    So, what value does True(LP) return?


    True(L,x)  means x is true.
    ~True(L,x) means x is untrue which includes false and not a
    proposition.

    True(L,~x) means x is false.
    ~True(L,~x) means x is unfalse which includes true and not a
    proposition.

    True(L,LP) is false and True(L,~LP) is false which means LP
    is not a proposition.

    And if x is defined in L as ~True(L,x) means that True(L, x) is
    false, then x being the negation of that result is a true statement.

    *That is not the way it works in my system or Prolog*
    ~True(L, x)  means x is either false or not a proposition
    ~True(L, ~x) means x is either true or not a proposition

    Try reading those two lines 150 more times and maybe it will
    break through your ADD. Alternatively you are simply a liar.

    It is something like trivalent logic {true, false, incorrect}
    ~true is false or incorrect.
    ~false is true or incorrect.


    So if x is defined in L as ~True(L, x)

    what value does True(L, x) have?


    then True(L,x) evaluates to false ultimately meaning
    that x is incorrect.

    But doesn't ~false evaluate to True?


    We can't know for sure that x is incorrect until
    we see that True(L,~x) also evaluates to false.


    And thus you system just blew up in a mass of flaming inconsistancy.

    Since there is no requirement to check True(L, ~x) and it can't affect
    the value of ~True(L, x) you logic just doesn't work.

    You need to go back and study how logic works, but my guess is you have
    wasted too much time on your other projects to do anything with this,
    and you have poisioned you reputation with all you lies so no one is
    going to look at this.

    Pity, if you spent the last 20 year looking at this and seeing if you
    can work out the problems, it might have made an viable alternate form
    of logic, but we will never know since you killed it by lying about
    halting and incompleteness and Tarski.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Sun Jul 7 07:26:49 2024
    On 7/6/24 11:42 PM, olcott wrote:
    On 7/6/2024 10:12 PM, Richard Damon wrote:
    On 7/6/24 10:51 PM, olcott wrote:
    On 7/6/2024 9:16 PM, Richard Damon wrote:
    On 7/6/24 9:56 PM, olcott wrote:
    On 7/6/2024 8:32 PM, Richard Damon wrote:
    On 7/6/24 9:06 PM, olcott wrote:
    On 7/6/2024 6:28 PM, Richard Damon wrote:
    On 7/6/24 6:41 PM, olcott wrote:
    On 7/6/2024 5:22 PM, Richard Damon wrote:
    On 7/6/24 6:08 PM, olcott wrote:
    On 7/6/2024 4:02 PM, Richard Damon wrote:
    The problem here is you logic doesn't actually allow for the >>>>>>>>>>>> necessaery references in it.

    Not at all. My logic is simply smart enough to reject
    non-truth-bearers AKA expressions that are not valid
    propositions. It does not stupidly falsely assume that
    every expression is a valid proposition.\

    Logic isn't "Smart", it follows its rules.

    Your rules are just inconsistent.


    When-so-ever true means provable and false means not provable >>>>>>>>> the meaning of these words proves that such a system cannot
    get stuck in pathological expressions.

    And such a definition requires the system to be keep simple or >>>>>>>> it becomes inconsistant.


    LP := ~True(LP) has a cycle in the directed
    graph of the elements of the expression related
    to each other that Prolog and MTT detects.


    So, what value does True(LP) return?


    True(L,x)  means x is true.
    ~True(L,x) means x is untrue which includes false and not a
    proposition.

    True(L,~x) means x is false.
    ~True(L,~x) means x is unfalse which includes true and not a
    proposition.

    True(L,LP) is false and True(L,~LP) is false which means LP
    is not a proposition.

    And if x is defined in L as ~True(L,x) means that True(L, x) is
    false, then x being the negation of that result is a true statement. >>>>>>
    *That is not the way it works in my system or Prolog*
    ~True(L, x)  means x is either false or not a proposition
    ~True(L, ~x) means x is either true or not a proposition

    Try reading those two lines 150 more times and maybe it will
    break through your ADD. Alternatively you are simply a liar.

    It is something like trivalent logic {true, false, incorrect}
    ~true is false or incorrect.
    ~false is true or incorrect.


    So if x is defined in L as ~True(L, x)

    what value does True(L, x) have?


    then True(L,x) evaluates to false ultimately meaning
    that x is incorrect.

    But doesn't ~false evaluate to True?


    No. ~false evaluates to true or incorrect.

    So, "incorrect" is an ACTUAL logic state, not just "sort of" and ~~P
    doesn't necessarily have the same value as P.

    IF you do mean this, then you first need to fully define how "incorrect"
    works in ALL the logical operators.

    It also means you need to figure out what you logic system supports, and
    can't just rely on the large base of work on normal binary logic.

    Thare is a good aount of work on non-binary systems, and perhaps you can
    find one that is close enough to try to use, but YOU need to do that work.

    And realize that you system isn't applicable to any theorem based on a
    binary logic system, since your system is not one.



    We can't know for sure that x is incorrect until
    we see that True(L,~x) also evaluates to false.


    And thus you system just blew up in a mass of flaming inconsistancy.


    Is "a fish" true, false or not a proposition.




    Since there is no requirement to check True(L, ~x) and it can't affect
    the value of ~True(L, x) you logic just doesn't work.

    When x is defined to mean = ~True(L,x) in L
    then True(L,x) is false and True(L,~x) is false
    proving that x is not a proposition.

    But, since ~false isn't true, your system leaks information like crazy.


    Is it really that hard to see that "a fish" is
    not a proposition?

    You need to go back and study how logic works, but my guess is you
    have wasted too much time on your other projects to do anything with
    this, and you have poisioned you reputation with all you lies so no
    one is going to look at this.

    Try and show how "a fish" is true or false.

    Pity, if you spent the last 20 year looking at this and seeing if you
    can work out the problems, it might have made an viable alternate form
    of logic, but we will never know since you killed it by lying about
    halting and incompleteness and Tarski.

    I did and it really seems that you are flat out lying about it.
    It seems that you are trying to say that "a fish" must be true or false.


    Nope, but in Tarski's logic, which is BINARY (so doesn't apply to your
    TRINARY system you need to complete your definition of) True(L, "a fish)
    would be false.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Sun Jul 7 13:28:17 2024
    On 7/7/24 9:34 AM, olcott wrote:
    On 7/7/2024 6:26 AM, Richard Damon wrote:
    On 7/6/24 11:42 PM, olcott wrote:
    On 7/6/2024 10:12 PM, Richard Damon wrote:
    On 7/6/24 10:51 PM, olcott wrote:
    On 7/6/2024 9:16 PM, Richard Damon wrote:

    So if x is defined in L as ~True(L, x)

    what value does True(L, x) have?


    then True(L,x) evaluates to false ultimately meaning
    that x is incorrect.

    But doesn't ~false evaluate to True?


    No. ~false evaluates to true or incorrect.

    So, "incorrect" is an ACTUAL logic state, not just "sort of" and ~~P
    doesn't necessarily have the same value as P.


    It is something like tri-valued logic.

    It needs to either BE tri-valued, or be bi-valued, or be whatever number
    of values it is.


    Every other formal system would try to force "a fish" into
    true or false and if that didn't work determine that the
    formal system is incomplete.

    Nope, most formal system just don't define "a fish" as a statement in
    their langauge.


    IF you do mean this, then you first need to fully define how
    "incorrect" works in ALL the logical operators.


    (~True(L,x) ∧ ~True(L,~x)) ≡ ~Proposition(L,x)
    Every variable is screened this way before any other
    operations can be performed upon it.
    x = "a fish" rejects every expression referencing x.

    Logic doesn't work that way.

    Sorry, you are just totally ignorant of how formal logic works.


    It also means you need to figure out what you logic system supports,
    and can't just rely on the large base of work on normal binary logic.


    That every expression of language that is {true on the basis of
    its meaning expressed using language} must have a connection by
    truth preserving operations to its {meaning expressed using language}
    is a tautology. The accurate model of the actual world is expressed
    using formal language and formalized natural language.

    Nope, doesm't work that way. The problem is that most formal systems
    don't express them selves with "Natural Language".

    And an "accurate model of the actual world" isn't available, so you are hypothocating on a non-existant thing.



    Thare is a good aount of work on non-binary systems, and perhaps you
    can find one that is close enough to try to use, but YOU need to do
    that work.


    In other words it is too difficult for you to understand
    that "a fish" is not a proposition?

    Nope, YOU are the one that says it is one, and needs to be handled.

    What formal logic system do you think you are working in?


    And realize that you system isn't applicable to any theorem based on a
    binary logic system, since your system is not one.


    All of the current systems of logic inherit their notion of
    True(L,x) on the above basis.
    (~True(PA,g) ∧ ~True(PA,~g)) ≡ ~Proposition(PA,g)
    Mathematical incompleteness goes away.


    Nope, you just made your system inconsistant if it was powerful enough
    to express as a proposition in it that x in PA is ~True(PA, x).

    Tarski shows a set of commonly held conditions that are sufficent to
    allow that expression to be a proposition in PA.

    Just as Godel does in a different manner by constructing his Primative Recursive Relationship that detects a proof of his statement G.



    We can't know for sure that x is incorrect until
    we see that True(L,~x) also evaluates to false.


    And thus you system just blew up in a mass of flaming inconsistancy.


    Is "a fish" true, false or not a proposition.




    Since there is no requirement to check True(L, ~x) and it can't
    affect the value of ~True(L, x) you logic just doesn't work.

    When x is defined to mean = ~True(L,x) in L
    then True(L,x) is false and True(L,~x) is false
    proving that x is not a proposition.

    But, since ~false isn't true, your system leaks information like crazy.

    Not at all
    (~True(L,x) ∧ True(L,~x)) ≡ Conventional_False(L,x)
    (True(L,x) ~Proposition(L,x) ~True(L,~x)) ≡ Conventional_True(L,x)

    Once all of the variables have been screened out for
    ~Proposition(L,x) then all of the conventional operations
    that are truth preserving can be applied to them.
    Expressions such as (x ∧ ~x) are reduced to false.


    But you don't get to "screen out" statments like that.

    You just don't understand the structure of logic.


    Is it really that hard to see that "a fish" is
    not a proposition?

    You need to go back and study how logic works, but my guess is you
    have wasted too much time on your other projects to do anything with
    this, and you have poisioned you reputation with all you lies so no
    one is going to look at this.

    Try and show how "a fish" is true or false.

    Pity, if you spent the last 20 year looking at this and seeing if
    you can work out the problems, it might have made an viable
    alternate form of logic, but we will never know since you killed it
    by lying about halting and incompleteness and Tarski.

    I did and it really seems that you are flat out lying about it.
    It seems that you are trying to say that "a fish" must be true or false. >>>

    Nope, but in Tarski's logic, which is BINARY (so doesn't apply to your
    TRINARY system you need to complete your definition of) True(L, "a
    fish) would be false.


    Tarski simply stupidly fails to reject erroneous propositions.
    He falsely imagines that they don't exist. If "a fish" could
    be encoded in his Tarski theory he would stupidly conclude that
    this proves that a True(L,x) predicate cannot exist.


    Nope, he showed that this "erroneous proposition" is one that MUST be a
    valid proposition given a few basic requirements on the logic system,
    and the existance of the Predicate True(L, x) that returned true for all
    x that are true, and false for all x that are false or non-truth-bearing.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Sun Jul 7 14:30:24 2024
    On 7/7/24 1:59 PM, olcott wrote:
    On 7/7/2024 12:28 PM, Richard Damon wrote:
    On 7/7/24 9:34 AM, olcott wrote:
    On 7/7/2024 6:26 AM, Richard Damon wrote:
    On 7/6/24 11:42 PM, olcott wrote:
    On 7/6/2024 10:12 PM, Richard Damon wrote:
    On 7/6/24 10:51 PM, olcott wrote:
    On 7/6/2024 9:16 PM, Richard Damon wrote:

    So if x is defined in L as ~True(L, x)

    what value does True(L, x) have?


    then True(L,x) evaluates to false ultimately meaning
    that x is incorrect.

    But doesn't ~false evaluate to True?


    No. ~false evaluates to true or incorrect.

    So, "incorrect" is an ACTUAL logic state, not just "sort of" and ~~P
    doesn't necessarily have the same value as P.


    It is something like tri-valued logic.

    It needs to either BE tri-valued, or be bi-valued, or be whatever
    number of values it is.


    True, False and IDK would be trivalued logic.
    True, False and not-a-logic-sentence is not actually trivalued logic.

    Is "Not-a-logic-sentence" a truth value that True, of ~false can return
    or not?

    If ANY of your predicates can return that value, it must be a
    truth-value and you have tri-valued logic.

    If not, WHICH values (of true, false) are True(L, x) and ~True(L, x)
    when x is ~True(L, x), and ~True(L, x) must match the general rule for ~
    on the value of True(L,x)

    You can't be having slipper definition for your logic system.



    Every other formal system would try to force "a fish" into
    true or false and if that didn't work determine that the
    formal system is incomplete.

    Nope, most formal system just don't define "a fish" as a statement in
    their langauge.

    I use that example because it is easy to see that it is
    neither true nor false. It literally applies to any formal
    system as expressive as English.

    But few logic system try to be as expressive as English. That is almost contrary to the goals of a Formal System.

    You don't seem to understand how Formal Systems work, or what they are for.



    IF you do mean this, then you first need to fully define how
    "incorrect" works in ALL the logical operators.


    (~True(L,x) ∧ ~True(L,~x)) ≡ ~Proposition(L,x)
    Every variable is screened this way before any other
    operations can be performed upon it.
    x = "a fish" rejects every expression referencing x.

    Logic doesn't work that way.

    That is its error.

    No, that is YOUR error.

    If you want to totally start over, go ahead, but it sounds like you
    don't have much time since you wasted the last 20 years.


    Sorry, you are just totally ignorant of how formal logic works.

    Not at all formal logic is wrong because it does not do this.

    Nope, YOU are wrong because you want Formal Logic to be something it isn't

    If you want something else, go ahead and try to invent it. Your problem
    is you don't have much time after wasting the last 20 years on using
    your tools wrong.



    It also means you need to figure out what you logic system supports,
    and can't just rely on the large base of work on normal binary logic.


    That every expression of language that is {true on the basis of
    its meaning expressed using language} must have a connection by
    truth preserving operations to its {meaning expressed using language}
    is a tautology. The accurate model of the actual world is expressed
    using formal language and formalized natural language.

    Nope, doesm't work that way. The problem is that most formal systems
    don't express them selves with "Natural Language".

    That formal systems are not typically very expressive
    is by no means any evidence at all that they cannot be as
    expressive as English.

    They can be VERY expressive, they just avoid the ambiguity of natural
    language.

    The problem isn't that English is "expresive" but that English can
    express too many meanings in a single sentence.


    And an "accurate model of the actual world" isn't available, so you
    are hypothocating on a non-existant thing.

    That is always the way that new things come into existence.

    Nope. Most new things are actually refinements in some way on the old,
    perhaps with a new twist.

    They tend not to assume the impossible.




    Thare is a good aount of work on non-binary systems, and perhaps you
    can find one that is close enough to try to use, but YOU need to do
    that work.


    In other words it is too difficult for you to understand
    that "a fish" is not a proposition?

    Nope, YOU are the one that says it is one, and needs to be handled.

    What formal logic system do you think you are working in?


    That every expression of language that is {true on the basis of
    its meaning expressed using language} must have a connection by
    truth preserving operations to its {meaning expressed using language}
    is a tautology. The accurate model of the actual world is expressed
    using formal language and formalized natural language.

    Not part of formal logic. You just don't know what you are talking about.

    Since there is not "accurate model of the actual world" your concept is
    built on a LIE.



    And realize that you system isn't applicable to any theorem based on
    a binary logic system, since your system is not one.


    All of the current systems of logic inherit their notion of
    True(L,x) on the above basis.
    (~True(PA,g) ∧ ~True(PA,~g)) ≡ ~Proposition(PA,g)
    Mathematical incompleteness goes away.


    Nope, you just made your system inconsistant if it was powerful enough
    to express as a proposition in it that x in PA is ~True(PA, x).

    Not at all. Must system consistently rejects expressions
    that are neither true nor false.

    They reject them by not letting them into the system.

    Not by letting them in and then expelling them.


    Tarski shows a set of commonly held conditions that are sufficent to
    allow that expression to be a proposition in PA.

    Tarski stupidly allowed nonsense into his system.

    No, he showed that the standard principles that are normally used, when combined with the UNNEEDED True predicate, producded the nonsense.

    The choice was easy, we don't need a universal Truth Predicate, but we
    do want things like mathematics.


    Just as Godel does in a different manner by constructing his Primative
    Recursive Relationship that detects a proof of his statement G.



    We can't know for sure that x is incorrect until
    we see that True(L,~x) also evaluates to false.


    And thus you system just blew up in a mass of flaming inconsistancy. >>>>>>

    Is "a fish" true, false or not a proposition.




    Since there is no requirement to check True(L, ~x) and it can't
    affect the value of ~True(L, x) you logic just doesn't work.

    When x is defined to mean = ~True(L,x) in L
    then True(L,x) is false and True(L,~x) is false
    proving that x is not a proposition.

    But, since ~false isn't true, your system leaks information like crazy. >>>>
    Not at all
    (~True(L,x) ∧ True(L,~x)) ≡ Conventional_False(L,x)
    (True(L,x) ~Proposition(L,x) ~True(L,~x)) ≡ Conventional_True(L,x)

    Once all of the variables have been screened out for
    ~Proposition(L,x) then all of the conventional operations
    that are truth preserving can be applied to them.
    Expressions such as (x ∧ ~x) are reduced to false.


    But you don't get to "screen out" statments like that.

    It is self-evidently correct that they must be screened out
    otherwise things such as the Liar Paradox give you the false
    impression that knowledge has no truth predicate.

    Because there IS no "Truth Predicate" per the definition.

    We can show MANY statements to be true or false, but the need to be able
    to know if EVERY statement to be True or False comes at too great of a cost.


    You just don't understand the structure of logic.


    Is it really that hard to see that "a fish" is
    not a proposition?

    You need to go back and study how logic works, but my guess is you >>>>>> have wasted too much time on your other projects to do anything
    with this, and you have poisioned you reputation with all you lies >>>>>> so no one is going to look at this.

    Try and show how "a fish" is true or false.

    Pity, if you spent the last 20 year looking at this and seeing if
    you can work out the problems, it might have made an viable
    alternate form of logic, but we will never know since you killed
    it by lying about halting and incompleteness and Tarski.

    I did and it really seems that you are flat out lying about it.
    It seems that you are trying to say that "a fish" must be true or
    false.


    Nope, but in Tarski's logic, which is BINARY (so doesn't apply to
    your TRINARY system you need to complete your definition of) True(L,
    "a fish) would be false.


    Tarski simply stupidly fails to reject erroneous propositions.
    He falsely imagines that they don't exist. If "a fish" could
    be encoded in his Tarski theory he would stupidly conclude that
    this proves that a True(L,x) predicate cannot exist.


    Nope, he showed that this "erroneous proposition" is one that MUST be
    a valid proposition given a few basic requirements on the logic system,

    A few basic incorrect requirements such as stipulating that lies are
    always true.

    Who did that? I don't think you understand what he is saying.

    But then, you are the one that belives in nonsense arguments as being
    valid, since you said you could disproe Godle with a Diagonalization
    proof, and then when asked what it was, you said they were all just
    nonsense, thus admitting you use nonsense in your logic.


    and the existance of the Predicate True(L, x) that returned true for
    all x that are true, and false for all x that are false or
    non-truth-bearing.


    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Sun Jul 7 23:05:25 2024
    Hi,

    There are possibly issues of interdisciplinary
    work. For example Sorensen & Urzyczyn in their
    Lectures on the Curry-Howard Isomorphism say that
    the logic LP has no name in literature.

    On the other hand Segerbergs paper, shows that
    a logic LP, in his labeling JP, that stems from
    accepting Peice's Law is equivalent to a logic
    accepting Curry's Refutation rule,

    i.e the logic JE with:

    Γ, A => B |- A
    -----------------
    Γ |- A

    But the logic JE also implies that LEM was added!

    Bye

    Mild Shock schrieb:
    The meteoric rise of Curry-Howard isomorphism
    and minimal logic, possibly because proof assistants
    such as Lean, Agda, etc… all use it, is quite ironic,
    in the light of this statement:

    Because of the vagueness of the notions of “constructive
    proof”, “constructive operation”, the BHK-interpretation
    has never become a versatile technical tool in the way
    classical semantics has. Perhaps it is correct to say
    that by most people the BHK-interpretation has never been
    seen as an intuitionistic counterpart to classical semantics. https://festschriften.illc.uva.nl/j50/contribs/troelstra/troelstra.pdf

    Mild Shock schrieb:
    Could be a wake-up call this many participants
    already in the commitee, that the whole logic
    world was asleep for many years:

    Non-Classical Logics. Theory and Applications XI,
    5-8 September 2024, Lodz (Poland)
    https://easychair.org/cfp/NCL24

    Why is Minimal Logic at the core of many things?
    Because it is the logic of Curry-Howard isomoprhism
    for symple types:

    ----------------
    Γ ∪ { A } ⊢ A

    Γ ∪ { A } ⊢ B
    ----------------
    Γ ⊢ A → B

    Γ ⊢ A → B           Δ ⊢ A
    ----------------------------
    Γ ∪ Δ ⊢ B

    And funny things can happen, especially when people
    hallucinate duality or think symmetry is given, for
    example in newer inventions such as λμ-calculus,

    but then omg ~~p => p is nevertheless not provable,
    because they forgot an inference rule. LoL

    Recommended reading so far:

    Propositional Logics Related to Heyting’s and Johansson’s
    February 2008 - Krister Segerberg
    https://www.researchgate.net/publication/228036664

    The Logic of Church and Curry
    Jonathan P. Seldin - 2009
    https://www.sciencedirect.com/handbook/handbook-of-the-history-of-logic/vol/5/suppl/C


    Meanwhile I am going back to my tinkering with my
    Prolog system, which even provides a more primitive
    logic than minimal logic, pure Prolog is minimal

    logic without embedded implication.


    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Sun Jul 7 23:16:29 2024
    Hi,

    This has only become talk of the town recently
    under the heading of Constructive S4 Modal Logic
    or CS4. It somehow demonstrates that prejudice

    against computer science, like lambda calculus is
    too abstract, is possibly unfounded. The challenge
    would be to draw connections and foster inter-

    disciplinary dialog. The next challenge would
    be to distill a simple didactical extract of it
    and draw road maps!

    Categorical and Kripke Semantics for Constructive S4 Modal Logic
    Alechina et al. - 2003
    https://www.cs.bham.ac.uk/~exr/papers/csl01.pdf

    What they call fallible worlds, does Segerberg
    1968 call abnormal worlds.

    Bye

    Mild Shock schrieb:
    Hi,

    There are possibly issues of interdisciplinary
    work. For example Sorensen & Urzyczyn in their
    Lectures on the Curry-Howard Isomorphism say that
    the logic LP has no name in literature.

    On the other hand Segerbergs paper, shows that
    a logic LP, in his labeling JP, that stems from
    accepting Peice's Law is equivalent to a logic
    accepting Curry's Refutation rule,

    i.e the logic JE with:

         Γ, A => B |- A
        -----------------
             Γ |- A

    But the logic JE also implies that LEM was added!

    Bye

    Mild Shock schrieb:
    The meteoric rise of Curry-Howard isomorphism
    and minimal logic, possibly because proof assistants
    such as Lean, Agda, etc… all use it, is quite ironic,
    in the light of this statement:

    Because of the vagueness of the notions of “constructive
    proof”, “constructive operation”, the BHK-interpretation
    has never become a versatile technical tool in the way
    classical semantics has. Perhaps it is correct to say
    that by most people the BHK-interpretation has never been
    seen as an intuitionistic counterpart to classical semantics.
    https://festschriften.illc.uva.nl/j50/contribs/troelstra/troelstra.pdf >>
    Mild Shock schrieb:
    Could be a wake-up call this many participants
    already in the commitee, that the whole logic
    world was asleep for many years:

    Non-Classical Logics. Theory and Applications XI,
    5-8 September 2024, Lodz (Poland)
    https://easychair.org/cfp/NCL24

    Why is Minimal Logic at the core of many things?
    Because it is the logic of Curry-Howard isomoprhism
    for symple types:

    ----------------
    Γ ∪ { A } ⊢ A

    Γ ∪ { A } ⊢ B
    ----------------
    Γ ⊢ A → B

    Γ ⊢ A → B           Δ ⊢ A
    ----------------------------
    Γ ∪ Δ ⊢ B

    And funny things can happen, especially when people
    hallucinate duality or think symmetry is given, for
    example in newer inventions such as λμ-calculus,

    but then omg ~~p => p is nevertheless not provable,
    because they forgot an inference rule. LoL

    Recommended reading so far:

    Propositional Logics Related to Heyting’s and Johansson’s
    February 2008 - Krister Segerberg
    https://www.researchgate.net/publication/228036664

    The Logic of Church and Curry
    Jonathan P. Seldin - 2009
    https://www.sciencedirect.com/handbook/handbook-of-the-history-of-logic/vol/5/suppl/C


    Meanwhile I am going back to my tinkering with my
    Prolog system, which even provides a more primitive
    logic than minimal logic, pure Prolog is minimal

    logic without embedded implication.



    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Sun Jul 7 21:42:19 2024
    On 7/7/24 9:24 PM, olcott wrote:
    On 7/7/2024 1:30 PM, Richard Damon wrote:
    On 7/7/24 1:59 PM, olcott wrote:
    On 7/7/2024 12:28 PM, Richard Damon wrote:
    On 7/7/24 9:34 AM, olcott wrote:
    On 7/7/2024 6:26 AM, Richard Damon wrote:
    On 7/6/24 11:42 PM, olcott wrote:
    On 7/6/2024 10:12 PM, Richard Damon wrote:
    On 7/6/24 10:51 PM, olcott wrote:
    On 7/6/2024 9:16 PM, Richard Damon wrote:

    So if x is defined in L as ~True(L, x)

    what value does True(L, x) have?


    then True(L,x) evaluates to false ultimately meaning
    that x is incorrect.

    But doesn't ~false evaluate to True?


    No. ~false evaluates to true or incorrect.

    So, "incorrect" is an ACTUAL logic state, not just "sort of" and
    ~~P doesn't necessarily have the same value as P.


    It is something like tri-valued logic.

    It needs to either BE tri-valued, or be bi-valued, or be whatever
    number of values it is.


    True, False and IDK would be trivalued logic.
    True, False and not-a-logic-sentence is not actually trivalued logic.

    Is "Not-a-logic-sentence" a truth value that True, of ~false can
    return or not?


    True(L,x)==false and True(L,~x)==false

    I didn't ask about True(L, ~x).

    I guess you can't read.

    I take it then that

    For x in L defined as ~True(L, x)

    That True(L, x) is false, and thus

    ~True(L, x) must be true, as that is the logical negation of false, and
    thus x which is defined as such is also true, and tnue you system claims
    that True(L, <a true statement>) can be false, and thus blows up in inconsistancy.

    means that x is not a logic sentence.

    In other words, you system can't handle references.

    And thus is just a small logic system.

    Note, there is no requirement in logic to check a function you arn't
    using to see if you can do what you want.

    This is because True(L, x) is defined to have a meaningful answer even
    if the input isn't a truth-bearer, but just a syntactically correct
    statement.

    I will stop here because you get overwhelmed.


    Nope, you are stopping before you dig yourself too deep, but that it too
    late, by not showing how you handle the problem shown, you are just
    admitting that you don't have a way to handle it but are just ignoring
    that your system is broken or very limited.

    Sorry, you just failed the test.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Sun Jul 7 22:52:21 2024
    On 7/7/24 10:16 PM, olcott wrote:
    On 7/7/2024 1:30 PM, Richard Damon wrote:

    Is "Not-a-logic-sentence" a truth value that True, of ~false can
    return or not?

    *I will try to be perfectly clear*
    Not-a-logic-sentence(L,x) ≡ (~True(L,x) ∧ ~True(L,~x))



    In other words, you have no idea of how to express you concept in the
    terms of how a logic would be built with it, as you just don't undertand
    how logic works.

    That isn't a problem unless you want to actually try to define a logic
    system, which it seems you are trying to do, in which case it is a BIG
    problem.

    Note, one basic feature of logic, is someone using it doesn't need to
    look at terms they are not interested in and not using,

    Thus, when I define that x is defined as ~True(L, x) and asking what
    value True(L, x) is, and why, since you say it is false, that we can't
    say that since x is defined as ~True(L, x) and thus would be evaluated
    to be ~false, which is true, and thus you are saying that True(L, true)
    is false which is a contradiction to its defintion.

    YOu can't say but over here ,,, as that doesn't matter.

    Something is wrong with your definition of True(L, x) or you system just
    can't handle statements with references like that, or it just doesn't work.

    If you can't handle that sort of reference, then you can't handle
    mathematics, as Godel showed we can make such references with mathematics.

    IF you can't even DEFINE how your system works, how do you expect to
    build anything with it?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Fri Jul 12 11:25:44 2024
    Hi,

    Now I had an extremly resilient correspondent, who
    wants to do proof extraction, but at the same
    time refuses to learn the Curry-Howard isomorphism.

    But its so easy, was just watching:

    Hyperon Session with Dr. Ben Goertzel https://www.youtube.com/watch?v=5Uy3j4WCiXQ

    At t=1853 he mentions C. S. Peirce thirdness, which
    you can use to explain the Curry-Howard isomorphism:


    1 *\ Γ = Context
    | \
    | * 3 t = λ-Expression
    | /
    2 */ α = Type


    The above is a trikonic visualization of the judgement
    Γ |- t : α, applying the art of making three-fold divisions.

    But I guess C. S. Peirce is not read in France, since
    it requires English. Or maybe there is a french translation?

    Bye

    Mild Shock schrieb:
    Could be a wake-up call this many participants
    already in the commitee, that the whole logic
    world was asleep for many years:

    Non-Classical Logics. Theory and Applications XI,
    5-8 September 2024, Lodz (Poland)
    https://easychair.org/cfp/NCL24

    Why is Minimal Logic at the core of many things?
    Because it is the logic of Curry-Howard isomoprhism
    for symple types:

    ----------------
    Γ ∪ { A } ⊢ A

    Γ ∪ { A } ⊢ B
    ----------------
    Γ ⊢ A → B

    Γ ⊢ A → B           Δ ⊢ A
    ----------------------------
    Γ ∪ Δ ⊢ B

    And funny things can happen, especially when people
    hallucinate duality or think symmetry is given, for
    example in newer inventions such as λμ-calculus,

    but then omg ~~p => p is nevertheless not provable,
    because they forgot an inference rule. LoL

    Recommended reading so far:

    Propositional Logics Related to Heyting’s and Johansson’s
    February 2008 - Krister Segerberg https://www.researchgate.net/publication/228036664

    The Logic of Church and Curry
    Jonathan P. Seldin - 2009 https://www.sciencedirect.com/handbook/handbook-of-the-history-of-logic/vol/5/suppl/C


    Meanwhile I am going back to my tinkering with my
    Prolog system, which even provides a more primitive
    logic than minimal logic, pure Prolog is minimal

    logic without embedded implication.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Fri Jul 12 11:37:14 2024
    Hi,

    Actually thridness is not only the art of making
    three-fold divisions. Usually one aims a finding
    a 3 that is the relation between 1 and 2, so that

    we have this relation satisfied:

    3(1, 2)

    Of course we can have the stance, and say that |-
    does that already. Only |- is highly ambigious,
    if you see Γ |- α you don't know what was the last

    inference rule applied. But for proof extraction
    you want exactly know that.

    Bye

    P.S.: And Peirce isn't wrong when he says thirdness
    is enough, just take set theory, which can do all
    of mathematics? Its based on this thirdness only:

    x ∈ y

    The set membership. But set membership is as ugly as |-,
    it also doesn't say why an element belongs to a set.

    LoL

    Mild Shock schrieb:
    Hi,

    Now I had an extremly resilient correspondent, who
    wants to do proof extraction, but at the same
    time refuses to learn the Curry-Howard isomorphism.

    But its so easy, was just watching:

    Hyperon Session with Dr. Ben Goertzel https://www.youtube.com/watch?v=5Uy3j4WCiXQ

    At t=1853 he mentions C. S. Peirce thirdness, which
    you can use to explain the Curry-Howard isomorphism:


    1 *\        Γ = Context
      | \
      |  * 3    t = λ-Expression
      | /
    2 */        α = Type


    The above is a trikonic visualization of the judgement
    Γ |- t : α, applying the art of making three-fold divisions.

    But I guess C. S. Peirce is not read in France, since
    it requires English. Or maybe there is a french translation?

    Bye

    Mild Shock schrieb:
    Could be a wake-up call this many participants
    already in the commitee, that the whole logic
    world was asleep for many years:

    Non-Classical Logics. Theory and Applications XI,
    5-8 September 2024, Lodz (Poland)
    https://easychair.org/cfp/NCL24

    Why is Minimal Logic at the core of many things?
    Because it is the logic of Curry-Howard isomoprhism
    for symple types:

    ----------------
    Γ ∪ { A } ⊢ A

    Γ ∪ { A } ⊢ B
    ----------------
    Γ ⊢ A → B

    Γ ⊢ A → B           Δ ⊢ A
    ----------------------------
    Γ ∪ Δ ⊢ B

    And funny things can happen, especially when people
    hallucinate duality or think symmetry is given, for
    example in newer inventions such as λμ-calculus,

    but then omg ~~p => p is nevertheless not provable,
    because they forgot an inference rule. LoL

    Recommended reading so far:

    Propositional Logics Related to Heyting’s and Johansson’s
    February 2008 - Krister Segerberg
    https://www.researchgate.net/publication/228036664

    The Logic of Church and Curry
    Jonathan P. Seldin - 2009
    https://www.sciencedirect.com/handbook/handbook-of-the-history-of-logic/vol/5/suppl/C


    Meanwhile I am going back to my tinkering with my
    Prolog system, which even provides a more primitive
    logic than minimal logic, pure Prolog is minimal

    logic without embedded implication.


    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Sat Jul 13 08:17:31 2024
    Hi,

    Generally speaking it is not “elements” if
    its only classical logic:

    Plato (p. 83 of Elements of Logical
    Reasoning) … excellent book

    The ancient Greek had a well developed sense
    of constructivity in their geometry, for example
    they distinguished between compass-and-straightedge
    constructions, and neuseis constructions.

    Constructive logic somehow appeals to this sense,
    but its not the only way to do non-classical logics.
    In a broader sense in mathematical logic its just
    the same discipline as the axiomatic method which

    is already found in Euklids geometry but applied
    to logic itself. Now it is evident, by the correspondence
    that I had, that there are people employed in philosophy
    departments saying a A <=> B is void if we have:

    CL |- A
    CL |- B
    -------------------
    CL |- A <=> B

    They never played the axiomatic method and replaced
    classical logic (CL) by something else. Lets make an
    example from Euclids geometry. Thales theorem and
    Pythagroas theorem are both true? So they are equivalent?

    So why bother even write a booklet like Euklid elements?

    if you need to find the center of a circle https://youtube.com/shorts/iQeFCnSo41g

    Bye

    Mild Shock schrieb:
    Hi,

    I am not halucinating that Negri is nonsense:

    This calculus does not terminate (e.g. on Peirce’s
    formula). Negri [42] shows how to add a loop-checking
    mechanism to ensure termination. The effect on complexity
    isn’t yet clear; but the loop-checking is expensive.

    Intuitionistic Decision Procedures since Gentzen
    The Jägerfest - 2013
    https://apt13.unibe.ch/slides/Dyckhoff.pdf

    Bye


    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to since it on Sat Jul 13 10:31:38 2024
    The sad news is, the book is only
    worth some fire wood.

    Plato (p. 83 of Elements of Logical Reasoning

    Interestingly the book uses non-classical
    logic, since it says:

    Sequent calculus offers a good possibility for
    exhaustive proof search in propositional logic:
    We can check through all the possibilities for
    malking a derivation. If none of them worked,
    i.e., if each had at least one branch in which
    no rule applied and no initial sequent was reached,
    the given sequent is underivable. The
    symbol |/-, is used for underivability.

    And then it has unprovable:

    c. |/- A v ~A

    d. |/- ~~A => A

    But mostlikely the book has a blind spot, some
    serious errors, or totally unfounded claims, since
    for example with such a calculus, the unprovability
    of Peirce’s Law cannot be shown so easily.

    Exhaustive proof search will usually not terminate.
    There are some terminating calculi, like Dyckhoffs
    LJT, but a naive calculus based on Gentzens take
    will not terminate.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Sat Jul 13 10:56:50 2024
    The error is here, taken from his Table 4.1:

    A => B, Γ |- A B, Γ |- C
    ---------------------------- L=>
    A => B, Γ |- C

    When he halucinates duplication also
    known as contraction:

    The premisses are simpler than the condusion
    in all the rules except possibly in the left
    premiss of rule L=>. That is the only source
    of non-termination. Rules other than L=> can
    produce duplication, if an active formula had
    another occurrence in the antecedent. This
    source of duplication comes to an end.

    But in backward search the looping is not
    caused because of A => B or some such would be
    duplicated. None of the L=> rule branches shows
    some formula twice. The calculi of Gentzen are

    usually already known that propositional proof
    search for them can be implement contraction free,
    this is not what causes looping. What causes the
    looping is simply that the same sequent might

    again, other rules then L=> are also not to blame
    at all. Just make an example with A atomic, and
    you get an infinite decend:

    P => B, Γ |- P B, Γ |- P
    --------------------------------- (L=>)
    ....
    P => B, Γ |- P B, Γ |- P
    --------------------------------- (L=>)
    P => B, Γ |- P

    Mild Shock schrieb:
    The sad news is, the book is only
    worth some fire wood.

    Plato (p. 83 of Elements of Logical Reasoning

    Interestingly the book uses non-classical
    logic, since it says:

    Sequent calculus offers a good possibility for
    exhaustive proof search in propositional logic:
    We can check through all the possibilities for
    malking a derivation. If none of them worked,
    i.e., if each had at least one branch in which
    no rule applied and no initial sequent was reached,
    the given sequent is underivable. The
    symbol |/-, is used for underivability.

    And then it has unprovable:

    c. |/- A v ~A

    d. |/- ~~A => A

    But mostlikely the book has a blind spot, some
    serious errors, or totally unfounded claims, since
    for example with such a calculus, the unprovability
    of Peirce’s Law cannot be shown so easily.

    Exhaustive proof search will usually not terminate.
    There are some terminating calculi, like Dyckhoffs
    LJT, but a naive calculus based on Gentzens take
    will not terminate.


    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to All on Sun Jul 14 00:05:13 2024
    Rather read the original, von Plato
    takes his wisdom from:

    The single-succedent sequent calculus of proof
    search of Table 4.1 is a relatively recent invention:
    Building on the work of Albert Dragalin (1978) on the
    invertibility of logical rules in sequent calculi,
    Anne Troelstra worked out the details of the proof
    theory of this `contraction-free' calculus in the
    book Basic Proof Theorv (2000).

    But the book by Troelstra (1939-2019) and
    Schwichtenberg (1949 -), doesn’t contain a minimal
    logic is decidable theorem, based on some “loop
    checking”, as indicated by von Plato on page 78.

    The problem situation is similar as in Prolog SLD
    resolution, where S stands for selection function.
    Since the (L=>) inference rule is not invertible, it
    involves a selection function σ,

    that picks the active formula:

    Γ, A => B |- A Γ, B |- C A selection function σ did pick ------------------------------- (L=>) A => B from the left hand side
    Γ, A => B |- C

    One selection function might loop, another
    selection function might not loop. In Jens Otten
    ileansep.p through backtracking over the predicate
    select/3 and iterative deepening all selections

    are tried. To show unprovability you have to show
    looping for all possible selection functions, which
    is obviously less trivial than the “root-first proof
    search” humbug from von Platos vegan products

    store that offers “naturally growing trees”.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Sun Jul 14 00:13:50 2024
    Even Dyckhoffs calculus LJT has (L=>=>) not
    invertible and is still bugged by a selection
    function dependency. Because of this complication
    minimal logic calculi have traditionally been shown

    decidable not by means of proof theory but
    rather by means of model theory. You can look up
    modal companions and then draw upon some finite
    model upper bound. The seminal paper is:

    Propositional Dynamic Logic of Regular Programs
    Fischer & Ladner - 1979 https://www.sciencedirect.com/science/article/pii/0022000079900461

    It contains the modal logic S4 as a special case:

    The modal systems K, T, S4, S5 (cf. Ladner [16]) are
    recognizable subsystems of propositional dynamic logic.

    K allows only the modality A,
    T allows only the modality A u λ,
    S4 allows ordy the modality A*,
    S5 allows only the modality (A u A-)*.

    Mild Shock schrieb:
    Rather read the original, von Plato
    takes his wisdom from:

    The single-succedent sequent calculus of proof
    search of Table 4.1 is a relatively recent invention:
    Building on the work of Albert Dragalin (1978) on the
    invertibility of logical rules in sequent calculi,
    Anne Troelstra worked out the details of the proof
    theory of this `contraction-free' calculus in the
    book Basic Proof Theorv (2000).

    But the book by Troelstra (1939-2019) and
    Schwichtenberg (1949 -), doesn’t contain a minimal
    logic is decidable theorem, based on some “loop
    checking”, as indicated by von Plato on page 78.

    The problem situation is similar as in Prolog SLD
    resolution, where S stands for selection function.
    Since the (L=>) inference rule is not invertible, it
    involves a selection function σ,

    that picks the active formula:

    Γ, A => B |- A      Γ, B |- C          A selection function σ did pick
    ------------------------------- (L=>)  A => B from the left hand side
                Γ, A => B |- C

    One selection function might loop, another
    selection function might not loop. In Jens Otten
    ileansep.p through backtracking over the predicate
    select/3 and iterative deepening all selections

    are tried. To show unprovability you have to show
    looping for all possible selection functions, which
    is obviously less trivial than the “root-first proof
    search” humbug from von Platos vegan products

    store that offers “naturally growing trees”.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Mon Jul 22 12:56:53 2024
    Hi,

    Thats quite a deseases, even Wadler makes the
    error, when he automatically associates the curry
    howard isomorphism, to evaluation strategies.

    Often proof normalization cannot go as far
    as evaluation strategies can go. A simple example
    is the Y combinator. You can try yourself,

    I am adding the “I” combinator which we have
    already shown to be derivable, and then a
    new “Y” combinator:

    /* I axiom */
    typeof(i, (A -> B)) :-
    unify_with_occurs_check(A,B).
    /* Y axiom */
    typeof(y, ((A -> B) -> C)) :-
    unify_with_occurs_check(A,B),
    unify_with_occurs_check(A,C).

    Lets see what happens, can we prove anything?

    ?- between(1,6,N), search(typeof(X, a), N, 0).
    N = 3,
    X = y*i .

    Yes it collapses trivally, even doesn’t need a
    complicated Curry Paradox.

    Bye


    Mild Shock schrieb:
    Could be a wake-up call this many participants
    already in the commitee, that the whole logic
    world was asleep for many years:

    Non-Classical Logics. Theory and Applications XI,
    5-8 September 2024, Lodz (Poland)
    https://easychair.org/cfp/NCL24

    Why is Minimal Logic at the core of many things?
    Because it is the logic of Curry-Howard isomoprhism
    for symple types:

    ----------------
    Γ ∪ { A } ⊢ A

    Γ ∪ { A } ⊢ B
    ----------------
    Γ ⊢ A → B

    Γ ⊢ A → B           Δ ⊢ A
    ----------------------------
    Γ ∪ Δ ⊢ B

    And funny things can happen, especially when people
    hallucinate duality or think symmetry is given, for
    example in newer inventions such as λμ-calculus,

    but then omg ~~p => p is nevertheless not provable,
    because they forgot an inference rule. LoL

    Recommended reading so far:

    Propositional Logics Related to Heyting’s and Johansson’s
    February 2008 - Krister Segerberg https://www.researchgate.net/publication/228036664

    The Logic of Church and Curry
    Jonathan P. Seldin - 2009 https://www.sciencedirect.com/handbook/handbook-of-the-history-of-logic/vol/5/suppl/C


    Meanwhile I am going back to my tinkering with my
    Prolog system, which even provides a more primitive
    logic than minimal logic, pure Prolog is minimal

    logic without embedded implication.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Wed Jul 31 22:13:54 2024
    I am really surprised that we have reached
    a point in history, where philosophy and
    artificial intelligence go separate paths,
    where philosophy stigmatizes means of

    abstractions on the computer and where even
    education in computer science itself is at
    loss with the rapid advancement of type theory
    from computation to deduction. This wasn’t always

    the case according to this essay (*):

    It is interesting to note that almost
    all the major subfields of AI mirror
    subfields of philosophy: The AI analogue
    of philosophy of language is computational
    linguistics; what philosophers call “practical
    reasoning” is called “planning and acting” in
    AI; ontology (indeed, much of metaphysics
    and epistemology) corresponds to knowledge
    representation in AI; and automated reasoning
    is one of the AI analogues of logic.
    – C.2.1.1 Intentions, practitions, and the ought-to-do.

    maybe we should find a way back to cooperation:

    Should AI workers study philosophy? Yes,
    unless they are content to reinvent the wheel
    every few days. When AI reinvents a wheel, it is
    typically square, or at best hexagonal, and
    can only make a few hundred revolutions before
    it stops. Philosopher’s wheels, on the other hand,
    are perfect circles, require in principle no
    lubrication, and can go in at least two directions
    at once. Clearly a meeting of minds is in order.
    – C.4 Summary

    See also:

    (*)

    Prolegomena to a Study of Hector-Neri Castañeda’s
    Influence on Artificial Intelligence: A Survey
    and Personal Reflections William Rappaport - January 1998 https://www.researchgate.net/publication/266277981

    Mild Shock schrieb:
    Could be a wake-up call this many participants
    already in the commitee, that the whole logic
    world was asleep for many years:

    Non-Classical Logics. Theory and Applications XI,
    5-8 September 2024, Lodz (Poland)
    https://easychair.org/cfp/NCL24

    Why is Minimal Logic at the core of many things?
    Because it is the logic of Curry-Howard isomoprhism
    for symple types:

    ----------------
    Γ ∪ { A } ⊢ A

    Γ ∪ { A } ⊢ B
    ----------------
    Γ ⊢ A → B

    Γ ⊢ A → B           Δ ⊢ A
    ----------------------------
    Γ ∪ Δ ⊢ B

    And funny things can happen, especially when people
    hallucinate duality or think symmetry is given, for
    example in newer inventions such as λμ-calculus,

    but then omg ~~p => p is nevertheless not provable,
    because they forgot an inference rule. LoL

    Recommended reading so far:

    Propositional Logics Related to Heyting’s and Johansson’s
    February 2008 - Krister Segerberg https://www.researchgate.net/publication/228036664

    The Logic of Church and Curry
    Jonathan P. Seldin - 2009 https://www.sciencedirect.com/handbook/handbook-of-the-history-of-logic/vol/5/suppl/C


    Meanwhile I am going back to my tinkering with my
    Prolog system, which even provides a more primitive
    logic than minimal logic, pure Prolog is minimal

    logic without embedded implication.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jeff Barnett@21:1/5 to All on Wed Jul 31 22:26:20 2024
    WW91IGFyZSBzdXJwcmlzZWQ7IEkgYW0gc2FkZGVuZWQuIE5vdCBvbmx5IGhhdmUgd2UgbG9z dCBjb250YWN0IHdpdGggdGhlIA0KcHJpbWFyeSBzdHVkaWVzIG9mIGtub3dsZWRnZSBhbmQg cmVhc29uaW5nLCB3ZSBoYXZlIGFsc28gbG9zdCBjb250YWN0IA0Kd2l0aCB0aGUgc3R1ZGll cyBvZiBtZXRob2RzIGFuZCBtb3RpdmF0aW9uLiBQc3ljaG9sb2d5IHdhcyB0aGUgYmFzaWMg DQpob21lIHJvb20gb2YgQWxhbiBOZXdlbGwgYW5kIG1hbnkgb3RoZXIgQUkgYWxsIHN0YXJz LiBXaGF0IGlzIG5vdyBjYWxsZWQgDQpBSSwgSSB0aGluayBpbmNvcnJlY3RseSwgaXMganVz dCB3YXlzIG9mIGV4ZXJjaXNpbmcgbGFyZ2UgYW1vdW50cyBvZiANCnZlcnkgY2hlYXAgY29t cHV0ZXIgcG93ZXIgdG8gY2FsY3VsYXRlIGFwcHJveGltYXRlcyB0byBjb3JyZWxhdGlvbnMg YW5kIA0Kb3RoZXIgc3RhdGlzdGljYWwgYXBwcm94aW1hdGlvbnMuDQoNClRoZSBwcm9ibGVt IHdpdGggYWxsIG9mIHRoaXMgaW4gbXkgbWluZCwgaXMgdGhhdCB3ZSBsZWFybiBub3RoaW5n IGFib3V0IA0KdGhlIGNhcHR1cmluZyBvZiBrbm93bGVkZ2UsIHdoYXQgaXQgaXMsIG9yIGhv dyBpdCBpcyB1c2VkLiBCb3RoIGxvZ2ljIA0KYW5kIGhldXJpc3RpYyByZWFzb25pbmcgYXJl IG5lZWRlZCBhbmQgd2UgY2VydGFpbmx5IGJlbGlldmUgdGhhdCANCmludGVsbGlnZW5jZSBp cyBub3QgbWVhc3VyZWQgYnkgaXRzIGFiaWxpdHkgdG8gZGlzY292ZXIgInRydXRoIiBvciBp dHMgDQppbmZhbGxpYmx5IGNvbnNpc3RlbnQgcmVzdWx0cy4gTmV3dG9uJ3MgdGhvdWdodCBw cm9jZXNzIHdhcyBwdXJlIGdlbml1cyANCmJ1dCBrbm93biB0byBwcm9kdWNlIGZhbGxhY2lv dXMgcmVzdWx0cyB3aGVuIHlvdSBrbm93IHdoYXQgRWluc3RlaW4ga25ldyANCmF0IGEgbGF0 ZXIgdGltZS4NCg0KSSByZW1lbWJlciByZWFkaW5nIFRlZCBTaG9ydGxpZmZlJ3MgZGlzc2Vy dGF0aW9uIGFib3V0IE1ZQ0lOIChhbiBlYXJseSANCkFJIG1lZGljYWwgY29uc3VsdGFudCBm b3IgZGlhZ25vc2luZyBibG9vZC1ib3JuZSBpbmZlY3Rpb3VzIGRpc2Vhc2VzKSANCndoZXJl IEkgbGVhcm5lZCBhYm91dCBvbmUgdXNlIG9mIHRoZSB0ZXJtICJzdGFmZiBkaXNlYXNlIiwg b3IganVzdCANCiJzdGFmZiIgZm9yIHNob3J0LiBJbiBwYXRpZW50IGNhcmUgYXJlYXMgdGhl cmUgYWx3YXlzIHNlZW1zIHRvIGJlIGFuIA0KaW4taG91c2UgaW5mZWN0aW9uIHRoYXQgY2hh bmdlcyBvdmVyIHRpbWUuIEl0IGNoYW5nZXMgYmVjYXVzZSBzaWNrIA0KcGF0aWVudHMgYnJv dWdodCBpbnRvIHRoZSBhcmVhIGNvbnRyaWJ1dGUgd2hhdGV2ZXIgaXMgbWFraW5nIHRoZW0g c2ljayANCmluIHRoZSBmaXJzdCBwbGFjZS4gSW4gdGhlIHNlY29uZCBwbGFjZSB0aGVyZSBp cyByYXBpZCBtdXRhdGlvbnMgZHJpdmVuIA0KYnkgYWxsIHNvcnRzIG9mIGZhY3RvcnMgcHJl c2VudCBpbiBob3NwaXRhbC1saWtlIGVudmlyb25tZW50cy4gVGhlIA0KcmVzdWx0IGlzIHRo YXQgdGhlIGxvY2FsIHN0YWZmIGlzIHZhcnlpbmcsIGxpdGVyYWxseSwgbWludXRlIGJ5IG1p bnV0ZS4gDQpJbiBhIGRheXMgdGltZSwgdGhlIHNhbXBsZXMgeW91IHRvb2sgYXJlIG5vIGxv bmdlciB2YWxpZCwgaS5lLiwgdGhlaXIgDQpkYXkgb2xkIGN1bHR1cmVzIG1heSBiZSBtZWFu aW5nbGVzcy4gVGhlIHVuZGVybHlpbmcgbWF0aGVtYXRpY2FsIHByb2JsZW0gDQppcyB0aGF0 IHByb2JhYmlsaXR5IHRoZW9yeSBkb2Vzbid0IHJlYWxseSBoYXZlIHRoZSB0b29scyB0byBt YWtlIA0KcHJlZGljdGlvbnMgd2hlbiB0aGUgYmFzaWMgcHJvYmFiaWxpdGllcyBhcmUgY2hh bmdpbmcgZmFzdGVyIHRoYW4gDQpvYnNlcnZhdGlvbnMgY2FuIGJlIHR1cm5lZCBpbnRvIGlu ZmVyZW5jZXMuDQoNCldoeSBkbyBJIG1lbnRpb24gdGhlIHByb2JsZW1zIG9mIHVuc3RhYmxl IHByb2JhYmlsaXRpZXMgaGVyZT8gQmVjYXVzZSANCm5ldyBBSSB1c2VzIGZhbmN5IGlkZWFz IG9mIGNvcnJlbGF0aW9uIHRvIHNpbXVsYXRlIHByb2JhYmlsaXN0aWMgDQppbmZlcmVuY2Us IGUuZy4sIEJheWVzaWFuIGluZmVyZW5jZS4gU2luY2UgYWN0dWFsIHByb2JhYmlsaXRpZXMg bWF5IG5vdCANCmV4aXN0IGluIGFueSBtZWFuaW5nZnVsIHdheXMsIHRoZSBzaW11bGF0aW9u cyBhcmUgb2Z0ZW4gYmFzZWQgb24gYWlyLg0KDQpBIGhhbGxtYXJrIG9mIGV4Y2VsbGVudCBo dW1hbiByZWFzb25pbmcgaXMgdGhlIGFiaWxpdHkgdG8gZXhwbGFpbiBob3cgd2UgDQphcnJp dmVkIGF0IG91ciBjb25jbHVzaW9ucy4gV2UgYXJlIGFsc28gYWJsZSB0byByZXBhaXIgb3Vy IGlubmVyIG1vZGVscyANCndoZW4gd2UgYXJlIGluIGVycm9yIGlmIHdlIGNhbiB1bmRlcnN0 YW5kIHdoeS4gVGhlIGFiaWxpdGllcyB0byBleHBsYWluIA0KYW5kIHJlcGFpciBhcmUgZnVu ZGFtZW50YWwgdG8gZXhjZWxsZW5jZSBvZiB0aG91Z2h0IHByb2Nlc3Nlcy4gQnkgdGhlIA0K d2F5LCBJJ20gbm90IGNsYWltaW5nIHRoYXQgYWxsIGh1bWFucyBvciBJIGhhdmUgdGhlc2Vz IHJlZmxlY3RpdmUgDQphYmlsaXRpZXMuIFRob3NlIHdobyBkbyBhcmUgZmV3IGFuZCBmYXIg YmV0d2Vlbi4gSG93ZXZlciwgYW55IEFJIHRoYXQgDQpkb2Vzbid0IGhhdmUgc29tZSBvZiB0 aGVzZSBjYXBhYmlsaXRpZXMgaXNuJ3QgdmVyeSBpbnRlcmVzdGluZy4NCg0KRm9yIG1vcmUg b24gcmVhc29ucyB3aHkgbG9naWMgYW5kIHRydXRoIGFyZSBvbmx5IHBhcnQgb2YgaHVtYW4g YWJpbGl0eSANCnRvIHJlYXNvbmFibHkgcmVhc29uLCBzZWUgDQpodHRwczovL3d3dy55YWhv by5jb20vbmV3cy9vcGluaW9uLXdhbnQtY29udmluY2UtY29uc3BpcmFjeS10aGVvcnktMTAw MjU4Mjc3Lmh0bWwgDQoNCg0KICAgLS0gSmVmZiBCYXJuZXR0DQoNCk9uIDcvMzEvMjAyNCAy OjEzIFBNLCBNaWxkIFNob2NrIHdyb3RlOg0KPiANCj4gSSBhbSByZWFsbHkgc3VycHJpc2Vk IHRoYXQgd2UgaGF2ZSByZWFjaGVkDQo+IGEgcG9pbnQgaW4gaGlzdG9yeSwgd2hlcmUgcGhp bG9zb3BoeSBhbmQNCj4gYXJ0aWZpY2lhbCBpbnRlbGxpZ2VuY2UgZ28gc2VwYXJhdGUgcGF0 aHMsDQo+IHdoZXJlIHBoaWxvc29waHkgc3RpZ21hdGl6ZXMgbWVhbnMgb2YNCj4gDQo+IGFi c3RyYWN0aW9ucyBvbiB0aGUgY29tcHV0ZXIgYW5kIHdoZXJlIGV2ZW4NCg0KPiBlZHVjYXRp b24gaW4gY29tcHV0ZXIgc2NpZW5jZSBpdHNlbGYgaXMgYXQNCj4gbG9zcyB3aXRoIHRoZSBy YXBpZCBhZHZhbmNlbWVudCBvZiB0eXBlIHRoZW9yeQ0KPiBmcm9tIGNvbXB1dGF0aW9uIHRv IGRlZHVjdGlvbi4gVGhpcyB3YXNu4oCZdCBhbHdheXMNCj4gDQo+IHRoZSBjYXNlIGFjY29y ZGluZyB0byB0aGlzIGVzc2F5ICgqKToNCj4gDQo+PiBJdCBpcyBpbnRlcmVzdGluZyB0byBu b3RlIHRoYXQgYWxtb3N0IGFsbCB0aGUgbWFqb3Igc3ViZmllbGRzIG9mIEFJIA0KPj4gbWly cm9yIHN1YmZpZWxkcyBvZiBwaGlsb3NvcGh5OiBUaGUgQUkgYW5hbG9ndWUgb2YgcGhpbG9z b3BoeSBvZiANCj4+IGxhbmd1YWdlIGlzIGNvbXB1dGF0aW9uYWwgDQo+ICA+IGxpbmd1aXN0 aWNzOyB3aGF0IHBoaWxvc29waGVycyBjYWxsIOKAnHByYWN0aWNhbA0KPiAgPiByZWFzb25p bmfigJ0gaXMgY2FsbGVkIOKAnHBsYW5uaW5nIGFuZCBhY3RpbmfigJ0gaW4NCj4+IEFJOyBv bnRvbG9neSAoaW5kZWVkLCBtdWNoIG9mIG1ldGFwaHlzaWNzDQo+PiBhbmQgZXBpc3RlbW9s b2d5KSBjb3JyZXNwb25kcyB0byBrbm93bGVkZ2UgDQo+ICA+IHJlcHJlc2VudGF0aW9uIGlu IEFJOyBhbmQgYXV0b21hdGVkIHJlYXNvbmluZw0KPiAgPiBpcyBvbmUgb2YgdGhlIEFJIGFu YWxvZ3VlcyBvZiBsb2dpYy4NCj4+IOKAkyBDLjIuMS4xIEludGVudGlvbnMsIHByYWN0aXRp b25zLCBhbmQgdGhlIG91Z2h0LXRvLWRvLg0KPiANCj4gbWF5YmUgd2Ugc2hvdWxkIGZpbmQg YSB3YXkgYmFjayB0byBjb29wZXJhdGlvbjoNCj4gDQo+PiBTaG91bGQgQUkgd29ya2VycyBz dHVkeSBwaGlsb3NvcGh5PyBZZXMsIA0KPiAgPiB1bmxlc3MgdGhleSBhcmUgY29udGVudCB0 byByZWludmVudCB0aGUgd2hlZWwNCj4gID4gZXZlcnkgZmV3IGRheXMuIFdoZW4gQUkgcmVp bnZlbnRzIGEgd2hlZWwsIGl0IGlzDQo+ICA+IHR5cGljYWxseSBzcXVhcmUsIG9yIGF0IGJl c3QgaGV4YWdvbmFsLCBhbmQNCj4gID4gY2FuIG9ubHkgbWFrZSBhIGZldyBodW5kcmVkIHJl dm9sdXRpb25zIGJlZm9yZQ0KPiAgPiBpdCBzdG9wcy4gUGhpbG9zb3BoZXLigJlzIHdoZWVs cywgb24gdGhlIG90aGVyIGhhbmQsDQo+ICA+IGFyZSBwZXJmZWN0IGNpcmNsZXMsIHJlcXVp cmUgaW4gcHJpbmNpcGxlIG5vDQo+ICA+IGx1YnJpY2F0aW9uLCBhbmQgY2FuIGdvIGluIGF0 IGxlYXN0IHR3byBkaXJlY3Rpb25zDQo+PiBhdCBvbmNlLiBDbGVhcmx5IGEgbWVldGluZyBv ZiBtaW5kcyBpcyBpbiBvcmRlci4NCj4+IOKAkyBDLjQgU3VtbWFyeQ0KPiANCj4gU2VlIGFs c286DQo+IA0KPiAoKikNCj4gDQo+IFByb2xlZ29tZW5hIHRvIGEgU3R1ZHkgb2YgSGVjdG9y LU5lcmkgQ2FzdGHDsWVkYeKAmXMNCj4gSW5mbHVlbmNlIG9uIEFydGlmaWNpYWwgSW50ZWxs aWdlbmNlOiBBIFN1cnZleQ0KPiBhbmQgUGVyc29uYWwgUmVmbGVjdGlvbnMgV2lsbGlhbSBS YXBwYXBvcnQgLSBKYW51YXJ5IDE5OTgNCj4gaHR0cHM6Ly93d3cucmVzZWFyY2hnYXRlLm5l dC9wdWJsaWNhdGlvbi8yNjYyNzc5ODENCj4gDQo+IE1pbGQgU2hvY2sgc2NocmllYjoNCj4+ IENvdWxkIGJlIGEgd2FrZS11cCBjYWxsIHRoaXMgbWFueSBwYXJ0aWNpcGFudHMNCj4+IGFs cmVhZHkgaW4gdGhlIGNvbW1pdGVlLCB0aGF0IHRoZSB3aG9sZSBsb2dpYw0KPj4gd29ybGQg d2FzIGFzbGVlcCBmb3IgbWFueSB5ZWFyczoNCj4+DQo+PiBOb24tQ2xhc3NpY2FsIExvZ2lj cy4gVGhlb3J5IGFuZCBBcHBsaWNhdGlvbnMgWEksDQo+PiA1LTggU2VwdGVtYmVyIDIwMjQs IExvZHogKFBvbGFuZCkNCj4+IGh0dHBzOi8vZWFzeWNoYWlyLm9yZy9jZnAvTkNMMjQNCj4+ DQo+PiBXaHkgaXMgTWluaW1hbCBMb2dpYyBhdCB0aGUgY29yZSBvZiBtYW55IHRoaW5ncz8N Cj4+IEJlY2F1c2UgaXQgaXMgdGhlIGxvZ2ljIG9mIEN1cnJ5LUhvd2FyZCBpc29tb3ByaGlz bQ0KPj4gZm9yIHN5bXBsZSB0eXBlczoNCj4+DQo+PiAtLS0tLS0tLS0tLS0tLS0tDQo+PiDO kyDiiKogeyBBIH0g4oqiIEENCj4+DQo+PiDOkyDiiKogeyBBIH0g4oqiIEINCj4+IC0tLS0t LS0tLS0tLS0tLS0NCj4+IM6TIOKKoiBBIOKGkiBCDQo+Pg0KPj4gzpMg4oqiIEEg4oaSIELC oMKgwqDCoMKgwqDCoMKgwqDCoCDOlCDiiqIgQQ0KPj4gLS0tLS0tLS0tLS0tLS0tLS0tLS0t LS0tLS0tLQ0KPj4gzpMg4oiqIM6UIOKKoiBCDQo+Pg0KPj4gQW5kIGZ1bm55IHRoaW5ncyBj YW4gaGFwcGVuLCBlc3BlY2lhbGx5IHdoZW4gcGVvcGxlDQo+PiBoYWxsdWNpbmF0ZSBkdWFs aXR5IG9yIHRoaW5rIHN5bW1ldHJ5IGlzIGdpdmVuLCBmb3INCj4+IGV4YW1wbGUgaW4gbmV3 ZXIgaW52ZW50aW9ucyBzdWNoIGFzIM67zrwtY2FsY3VsdXMsDQo+Pg0KPj4gYnV0IHRoZW4g b21nIH5+cCA9PiBwIGlzIG5ldmVydGhlbGVzcyBub3QgcHJvdmFibGUsDQo+PiBiZWNhdXNl IHRoZXkgZm9yZ290IGFuIGluZmVyZW5jZSBydWxlLiBMb0wNCj4+DQo+PiBSZWNvbW1lbmRl ZCByZWFkaW5nIHNvIGZhcjoNCj4+DQo+PiBQcm9wb3NpdGlvbmFsIExvZ2ljcyBSZWxhdGVk IHRvIEhleXRpbmfigJlzIGFuZCBKb2hhbnNzb27igJlzDQo+PiBGZWJydWFyeSAyMDA4IC0g S3Jpc3RlciBTZWdlcmJlcmcNCj4+IGh0dHBzOi8vd3d3LnJlc2VhcmNoZ2F0ZS5uZXQvcHVi bGljYXRpb24vMjI4MDM2NjY0DQo+Pg0KPj4gVGhlIExvZ2ljIG9mIENodXJjaCBhbmQgQ3Vy cnkNCj4+IEpvbmF0aGFuIFAuIFNlbGRpbiAtIDIwMDkNCj4+IGh0dHBzOi8vd3d3LnNjaWVu Y2VkaXJlY3QuY29tL2hhbmRib29rL2hhbmRib29rLW9mLXRoZS1oaXN0b3J5LW9mLWxvZ2lj L3ZvbC81L3N1cHBsL0MNCj4+DQo+PiBNZWFud2hpbGUgSSBhbSBnb2luZyBiYWNrIHRvIG15 IHRpbmtlcmluZyB3aXRoIG15DQo+PiBQcm9sb2cgc3lzdGVtLCB3aGljaCBldmVuIHByb3Zp ZGVzIGEgbW9yZSBwcmltaXRpdmUNCj4+IGxvZ2ljIHRoYW4gbWluaW1hbCBsb2dpYywgcHVy ZSBQcm9sb2cgaXMgbWluaW1hbA0KPj4NCj4+IGxvZ2ljIHdpdGhvdXQgZW1iZWRkZWQgaW1w bGljYXRpb24uDQo+IA0KDQo=

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Jeff Barnett on Sat Aug 3 22:40:49 2024
    Hi,

    Yes, maybe we are just before a kind
    of 2nd Cognitive Turn. The first Cognitive
    Turn is characterized as:

    The cognitive revolution was an intellectual movement that began in the 1950s as an interdisciplinary study of the mind and its processes, from which emerged a new field known as cognitive science.
    https://en.wikipedia.org/wiki/Cognitive_revolution

    The current mainstream believe is that
    Chat Bots and the progress in AI is mainly
    based on "Machine Learning", whereas

    most of the progress is more based on
    "Deep Learning". But I am also sceptical
    about "Deep Learning" in the end a frequentist

    is again lurking. In the worst case the
    no Bayension Brain shock will come with a
    Technological singularity in that the current

    short inferencing of LLMs is enhanced by
    some long inferencing, like here:

    A week ago, I posted that I was cooking a
    logical reasoning benchmark as a side project.
    Now it's finally ready! Introducing 🦓 𝙕𝙚𝙗𝙧𝙖𝙇𝙤𝙜𝙞𝙘,
    designed for evaluating LLMs with Logic Puzzles. https://x.com/billyuchenlin/status/1814254565128335705

    making it possible not to excell by LLMs
    in such puzzles, but to advance to more
    elaborate scientific models, that can somehow

    overcome fallacies such as:
    - Kochen Specker Paradox, some fallacies
    caused by averaging?
    - Gluts and Gaps in Bayesian Reasoning,
    some fallacies by consistency assumptions?
    - What else?

    So on quiet paws AI might become the new overlord
    of science which we will happily depend on.

    Jeff Barnett schrieb:
    You are surprised; I am saddened. Not only have we lost contact with the primary studies of knowledge and reasoning, we have also lost contact
    with the studies of methods and motivation. Psychology was the basic
    home room of Alan Newell and many other AI all stars. What is now called
    AI, I think incorrectly, is just ways of exercising large amounts of
    very cheap computer power to calculate approximates to correlations and
    other statistical approximations.

    The problem with all of this in my mind, is that we learn nothing about
    the capturing of knowledge, what it is, or how it is used. Both logic
    and heuristic reasoning are needed and we certainly believe that
    intelligence is not measured by its ability to discover "truth" or its infallibly consistent results. Newton's thought process was pure genius
    but known to produce fallacious results when you know what Einstein knew
    at a later time.

    I remember reading Ted Shortliffe's dissertation about MYCIN (an early
    AI medical consultant for diagnosing blood-borne infectious diseases)
    where I learned about one use of the term "staff disease", or just
    "staff" for short. In patient care areas there always seems to be an
    in-house infection that changes over time. It changes because sick
    patients brought into the area contribute whatever is making them sick
    in the first place. In the second place there is rapid mutations driven
    by all sorts of factors present in hospital-like environments. The
    result is that the local staff is varying, literally, minute by minute.
    In a days time, the samples you took are no longer valid, i.e., their
    day old cultures may be meaningless. The underlying mathematical problem
    is that probability theory doesn't really have the tools to make
    predictions when the basic probabilities are changing faster than observations can be turned into inferences.

    Why do I mention the problems of unstable probabilities here? Because
    new AI uses fancy ideas of correlation to simulate probabilistic
    inference, e.g., Bayesian inference. Since actual probabilities may not
    exist in any meaningful ways, the simulations are often based on air.

    A hallmark of excellent human reasoning is the ability to explain how we arrived at our conclusions. We are also able to repair our inner models
    when we are in error if we can understand why. The abilities to explain
    and repair are fundamental to excellence of thought processes. By the
    way, I'm not claiming that all humans or I have theses reflective
    abilities. Those who do are few and far between. However, any AI that
    doesn't have some of these capabilities isn't very interesting.

    For more on reasons why logic and truth are only part of human ability
    to reasonably reason, see https://www.yahoo.com/news/opinion-want-convince-conspiracy-theory-100258277.html


      -- Jeff Barnett

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Sat Aug 3 23:27:26 2024
    My impression Cognitive Science was never
    Bayesian Brain, so I guess I made a joke.

    The time scale, its start in 1950s and that
    it is still relative unknown subject,

    would explain:
    - why my father or mother never tried to
    educated me towards cognitive science.
    It could be that they are totally blank
    in this respect?

    - why my grandfather or grandmothers never
    tried to educate me towards cognitive
    science. Dito It could be that they are totally
    blank in this respect?

    - it could be that there are rare cases where
    some philosophers had already a glimps of
    cognitive science. But when I open for
    example this booklet:

    System der Logic
    Friedrich Ueberweg
    Bonn - 1868
    https://philpapers.org/rec/UEBSDL

    One can feel the dry swimming that is reported
    for several millennia. What happened in the
    1950s was the possibility of computer modelling.

    Mild Shock schrieb:
    Hi,

    Yes, maybe we are just before a kind
    of 2nd Cognitive Turn. The first Cognitive
    Turn is characterized as:

    The cognitive revolution was an intellectual movement that began in
    the 1950s as an interdisciplinary study of the mind and its processes,
    from which emerged a new field known as cognitive science.
    https://en.wikipedia.org/wiki/Cognitive_revolution

    The current mainstream believe is that
    Chat Bots and the progress in AI is mainly
    based on "Machine Learning", whereas

    most of the progress is more based on
    "Deep Learning". But I am also sceptical
    about "Deep Learning" in the end a frequentist

    is again lurking. In the worst case the
    no Bayension Brain shock will come with a
    Technological singularity in that the current

    short inferencing of LLMs is enhanced by
    some long inferencing, like here:

    A week ago, I posted that I was cooking a
    logical reasoning benchmark as a side project.
    Now it's finally ready! Introducing 🦓 𝙕𝙚𝙗𝙧𝙖𝙇𝙤𝙜𝙞𝙘,
    designed for evaluating LLMs with Logic Puzzles. https://x.com/billyuchenlin/status/1814254565128335705

    making it possible not to excell by LLMs
    in such puzzles, but to advance to more
    elaborate scientific models, that can somehow

    overcome fallacies such as:
    - Kochen Specker Paradox, some fallacies
      caused by averaging?
    - Gluts and Gaps in Bayesian Reasoning,
      some fallacies by consistency assumptions?
    - What else?

    So on quiet paws AI might become the new overlord
    of science which we will happily depend on.

    Jeff Barnett schrieb:
    You are surprised; I am saddened. Not only have we lost contact with
    the primary studies of knowledge and reasoning, we have also lost
    contact with the studies of methods and motivation. Psychology was the
    basic home room of Alan Newell and many other AI all stars. What is
    now called AI, I think incorrectly, is just ways of exercising large
    amounts of very cheap computer power to calculate approximates to
    correlations and other statistical approximations.

    The problem with all of this in my mind, is that we learn nothing
    about the capturing of knowledge, what it is, or how it is used. Both
    logic and heuristic reasoning are needed and we certainly believe that
    intelligence is not measured by its ability to discover "truth" or its
    infallibly consistent results. Newton's thought process was pure
    genius but known to produce fallacious results when you know what
    Einstein knew at a later time.

    I remember reading Ted Shortliffe's dissertation about MYCIN (an early
    AI medical consultant for diagnosing blood-borne infectious diseases)
    where I learned about one use of the term "staff disease", or just
    "staff" for short. In patient care areas there always seems to be an
    in-house infection that changes over time. It changes because sick
    patients brought into the area contribute whatever is making them sick
    in the first place. In the second place there is rapid mutations
    driven by all sorts of factors present in hospital-like environments.
    The result is that the local staff is varying, literally, minute by
    minute. In a days time, the samples you took are no longer valid,
    i.e., their day old cultures may be meaningless. The underlying
    mathematical problem is that probability theory doesn't really have
    the tools to make predictions when the basic probabilities are
    changing faster than observations can be turned into inferences.

    Why do I mention the problems of unstable probabilities here? Because
    new AI uses fancy ideas of correlation to simulate probabilistic
    inference, e.g., Bayesian inference. Since actual probabilities may
    not exist in any meaningful ways, the simulations are often based on air.

    A hallmark of excellent human reasoning is the ability to explain how
    we arrived at our conclusions. We are also able to repair our inner
    models when we are in error if we can understand why. The abilities to
    explain and repair are fundamental to excellence of thought processes.
    By the way, I'm not claiming that all humans or I have theses
    reflective abilities. Those who do are few and far between. However,
    any AI that doesn't have some of these capabilities isn't very
    interesting.

    For more on reasons why logic and truth are only part of human ability
    to reasonably reason, see
    https://www.yahoo.com/news/opinion-want-convince-conspiracy-theory-100258277.html


       -- Jeff Barnett



    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Sat Aug 3 23:59:24 2024
    BTW: Friedrich Ueberweg is quite good
    and funny to browse, he reports relatively
    unfiltered what we would nowadays call

    forms of "rational behaviour", so its a little
    pot purry, except for his sections where he
    explains some schemas, like the Aristotelan

    figures, which are more pure logic of the form.
    And peng you get a guy talking pages and
    pages about pure and form:

    "Pure" logic, ontology, and phenomenology
    David Woodruff Smith https://www.cairn.info/revue-internationale-de-philosophie-2003-2-page-21.htm

    But the above is a from species of philosophy
    that is endangered now. Its predator are
    abstractions on the computer like lambda

    calculus and the Curry Howard isomorphism. The
    revue has become an irrelevant cabarett, only
    dead people would be interested in, like

    may father, grandfather etc...

    Mild Shock schrieb:

    My impression Cognitive Science was never
    Bayesian Brain, so I guess I made a joke.

    The time scale, its start in 1950s and that
    it is still relative unknown subject,

    would explain:
    - why my father or mother never tried to
      educated me towards cognitive science.
      It could be that they are totally blank
      in this respect?

    - why my grandfather or grandmothers never
      tried to educate me towards cognitive
      science. Dito It could be that they are totally
      blank in this respect?

    - it could be that there are rare cases where
      some philosophers had already a glimps of
      cognitive science. But when I open for
      example this booklet:

    System der Logic
    Friedrich Ueberweg
    Bonn - 1868
    https://philpapers.org/rec/UEBSDL

      One can feel the dry swimming that is reported
      for several millennia.  What happened in the
      1950s was the possibility of computer modelling.

    Mild Shock schrieb:
    Hi,

    Yes, maybe we are just before a kind
    of 2nd Cognitive Turn. The first Cognitive
    Turn is characterized as:

    The cognitive revolution was an intellectual movement that began in
    the 1950s as an interdisciplinary study of the mind and its
    processes, from which emerged a new field known as cognitive science.
    https://en.wikipedia.org/wiki/Cognitive_revolution

    The current mainstream believe is that
    Chat Bots and the progress in AI is mainly
    based on "Machine Learning", whereas

    most of the progress is more based on
    "Deep Learning". But I am also sceptical
    about "Deep Learning" in the end a frequentist

    is again lurking. In the worst case the
    no Bayension Brain shock will come with a
    Technological singularity in that the current

    short inferencing of LLMs is enhanced by
    some long inferencing, like here:

    A week ago, I posted that I was cooking a
    logical reasoning benchmark as a side project.
    Now it's finally ready! Introducing 🦓 𝙕𝙚𝙗𝙧𝙖𝙇𝙤𝙜𝙞𝙘,
    designed for evaluating LLMs with Logic Puzzles.
    https://x.com/billyuchenlin/status/1814254565128335705

    making it possible not to excell by LLMs
    in such puzzles, but to advance to more
    elaborate scientific models, that can somehow

    overcome fallacies such as:
    - Kochen Specker Paradox, some fallacies
       caused by averaging?
    - Gluts and Gaps in Bayesian Reasoning,
       some fallacies by consistency assumptions?
    - What else?

    So on quiet paws AI might become the new overlord
    of science which we will happily depend on.

    Jeff Barnett schrieb:
    You are surprised; I am saddened. Not only have we lost contact with
    the primary studies of knowledge and reasoning, we have also lost
    contact with the studies of methods and motivation. Psychology was
    the basic home room of Alan Newell and many other AI all stars. What
    is now called AI, I think incorrectly, is just ways of exercising
    large amounts of very cheap computer power to calculate approximates
    to correlations and other statistical approximations.

    The problem with all of this in my mind, is that we learn nothing
    about the capturing of knowledge, what it is, or how it is used. Both
    logic and heuristic reasoning are needed and we certainly believe
    that intelligence is not measured by its ability to discover "truth"
    or its infallibly consistent results. Newton's thought process was
    pure genius but known to produce fallacious results when you know
    what Einstein knew at a later time.

    I remember reading Ted Shortliffe's dissertation about MYCIN (an
    early AI medical consultant for diagnosing blood-borne infectious
    diseases) where I learned about one use of the term "staff disease",
    or just "staff" for short. In patient care areas there always seems
    to be an in-house infection that changes over time. It changes
    because sick patients brought into the area contribute whatever is
    making them sick in the first place. In the second place there is
    rapid mutations driven by all sorts of factors present in
    hospital-like environments. The result is that the local staff is
    varying, literally, minute by minute. In a days time, the samples you
    took are no longer valid, i.e., their day old cultures may be
    meaningless. The underlying mathematical problem is that probability
    theory doesn't really have the tools to make predictions when the
    basic probabilities are changing faster than observations can be
    turned into inferences.

    Why do I mention the problems of unstable probabilities here? Because
    new AI uses fancy ideas of correlation to simulate probabilistic
    inference, e.g., Bayesian inference. Since actual probabilities may
    not exist in any meaningful ways, the simulations are often based on
    air.

    A hallmark of excellent human reasoning is the ability to explain how
    we arrived at our conclusions. We are also able to repair our inner
    models when we are in error if we can understand why. The abilities
    to explain and repair are fundamental to excellence of thought
    processes. By the way, I'm not claiming that all humans or I have
    theses reflective abilities. Those who do are few and far between.
    However, any AI that doesn't have some of these capabilities isn't
    very interesting.

    For more on reasons why logic and truth are only part of human
    ability to reasonably reason, see
    https://www.yahoo.com/news/opinion-want-convince-conspiracy-theory-100258277.html


       -- Jeff Barnett




    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Sun Aug 4 00:55:52 2024
    Well we all know about this rule:

    - Never ask a woman about her weight

    - Never ask a woman about her age

    There is a similar rule for philosophers:

    - Never ask a philosopher what is cognitive science

    - Never ask a philosopher what is formula-as-types

    Explanation: They like to be the champions of
    pure form like in this paper below, so they
    don’t like other disciplines dealing with pure
    form or even having pure form on the computer.

    "Pure” logic, ontology, and phenomenology
    David Woodruff Smith - Revue internationale de philosophie 2003/2 https://www.cairn.info/revue-internationale-de-philosophie-2003-2-page-21.htm

    Mild Shock schrieb:
    Could be a wake-up call this many participants
    already in the commitee, that the whole logic
    world was asleep for many years:

    Non-Classical Logics. Theory and Applications XI,
    5-8 September 2024, Lodz (Poland)
    https://easychair.org/cfp/NCL24

    Why is Minimal Logic at the core of many things?
    Because it is the logic of Curry-Howard isomoprhism
    for symple types:

    ----------------
    Γ ∪ { A } ⊢ A

    Γ ∪ { A } ⊢ B
    ----------------
    Γ ⊢ A → B

    Γ ⊢ A → B           Δ ⊢ A
    ----------------------------
    Γ ∪ Δ ⊢ B

    And funny things can happen, especially when people
    hallucinate duality or think symmetry is given, for
    example in newer inventions such as λμ-calculus,

    but then omg ~~p => p is nevertheless not provable,
    because they forgot an inference rule. LoL

    Recommended reading so far:

    Propositional Logics Related to Heyting’s and Johansson’s
    February 2008 - Krister Segerberg https://www.researchgate.net/publication/228036664

    The Logic of Church and Curry
    Jonathan P. Seldin - 2009 https://www.sciencedirect.com/handbook/handbook-of-the-history-of-logic/vol/5/suppl/C


    Meanwhile I am going back to my tinkering with my
    Prolog system, which even provides a more primitive
    logic than minimal logic, pure Prolog is minimal

    logic without embedded implication.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to David Woodruff Smith on Sun Aug 4 00:16:13 2024
    David Woodruff Smith writes:
    And "cognitive science" has recently pursued
    the relation of intentional mental activities
    to neural processes in the brain.

    I call this bullshit. He confuses cognitive
    science with some sort of Neuroscience and/or
    connectionist approaches.

    Some broader working definition
    of cognitive science is for example:

    Cognitive science is an interdisciplinary
    science that deals with the processing of
    information in the context of perception,
    thinking and decision-making processes,
    both in humans and in animals or machines.

    You see how much philosophy is behind.
    David Woodruff Smith published the
    paper in 2003? I don't think there are any

    excuses for his nonsense definition.
    Especially if one writes about pure form.
    This is so idiotic.

    Mild Shock schrieb:

    BTW: Friedrich Ueberweg is quite good
    and funny to browse, he reports relatively
    unfiltered what we would nowadays call

    forms of "rational behaviour", so its a little
    pot purry, except for his sections where he
    explains some schemas, like the Aristotelan

    figures, which are more pure logic of the form.
    And peng you get a guy talking pages and
    pages about pure and form:

    "Pure" logic, ontology, and phenomenology
    David Woodruff Smith https://www.cairn.info/revue-internationale-de-philosophie-2003-2-page-21.htm


    But the above is a from species of philosophy
    that is endangered now. Its predator are
    abstractions on the computer like lambda

    calculus and the Curry Howard isomorphism. The
    revue has become an irrelevant cabarett, only
    dead people would be interested in, like

    may father, grandfather etc...

    Mild Shock schrieb:

    My impression Cognitive Science was never
    Bayesian Brain, so I guess I made a joke.

    The time scale, its start in 1950s and that
    it is still relative unknown subject,

    would explain:
    - why my father or mother never tried to
       educated me towards cognitive science.
       It could be that they are totally blank
       in this respect?

    - why my grandfather or grandmothers never
       tried to educate me towards cognitive
       science. Dito It could be that they are totally
       blank in this respect?

    - it could be that there are rare cases where
       some philosophers had already a glimps of
       cognitive science. But when I open for
       example this booklet:

    System der Logic
    Friedrich Ueberweg
    Bonn - 1868
    https://philpapers.org/rec/UEBSDL

       One can feel the dry swimming that is reported
       for several millennia.  What happened in the
       1950s was the possibility of computer modelling.

    Mild Shock schrieb:
    Hi,

    Yes, maybe we are just before a kind
    of 2nd Cognitive Turn. The first Cognitive
    Turn is characterized as:

    The cognitive revolution was an intellectual movement that began in
    the 1950s as an interdisciplinary study of the mind and its
    processes, from which emerged a new field known as cognitive science.
    https://en.wikipedia.org/wiki/Cognitive_revolution

    The current mainstream believe is that
    Chat Bots and the progress in AI is mainly
    based on "Machine Learning", whereas

    most of the progress is more based on
    "Deep Learning". But I am also sceptical
    about "Deep Learning" in the end a frequentist

    is again lurking. In the worst case the
    no Bayension Brain shock will come with a
    Technological singularity in that the current

    short inferencing of LLMs is enhanced by
    some long inferencing, like here:

    A week ago, I posted that I was cooking a
    logical reasoning benchmark as a side project.
    Now it's finally ready! Introducing 🦓 𝙕𝙚𝙗𝙧𝙖𝙇𝙤𝙜𝙞𝙘,
    designed for evaluating LLMs with Logic Puzzles.
    https://x.com/billyuchenlin/status/1814254565128335705

    making it possible not to excell by LLMs
    in such puzzles, but to advance to more
    elaborate scientific models, that can somehow

    overcome fallacies such as:
    - Kochen Specker Paradox, some fallacies
       caused by averaging?
    - Gluts and Gaps in Bayesian Reasoning,
       some fallacies by consistency assumptions?
    - What else?

    So on quiet paws AI might become the new overlord
    of science which we will happily depend on.

    Jeff Barnett schrieb:
    You are surprised; I am saddened. Not only have we lost contact with
    the primary studies of knowledge and reasoning, we have also lost
    contact with the studies of methods and motivation. Psychology was
    the basic home room of Alan Newell and many other AI all stars. What
    is now called AI, I think incorrectly, is just ways of exercising
    large amounts of very cheap computer power to calculate approximates
    to correlations and other statistical approximations.

    The problem with all of this in my mind, is that we learn nothing
    about the capturing of knowledge, what it is, or how it is used.
    Both logic and heuristic reasoning are needed and we certainly
    believe that intelligence is not measured by its ability to discover
    "truth" or its infallibly consistent results. Newton's thought
    process was pure genius but known to produce fallacious results when
    you know what Einstein knew at a later time.

    I remember reading Ted Shortliffe's dissertation about MYCIN (an
    early AI medical consultant for diagnosing blood-borne infectious
    diseases) where I learned about one use of the term "staff disease",
    or just "staff" for short. In patient care areas there always seems
    to be an in-house infection that changes over time. It changes
    because sick patients brought into the area contribute whatever is
    making them sick in the first place. In the second place there is
    rapid mutations driven by all sorts of factors present in
    hospital-like environments. The result is that the local staff is
    varying, literally, minute by minute. In a days time, the samples
    you took are no longer valid, i.e., their day old cultures may be
    meaningless. The underlying mathematical problem is that probability
    theory doesn't really have the tools to make predictions when the
    basic probabilities are changing faster than observations can be
    turned into inferences.

    Why do I mention the problems of unstable probabilities here?
    Because new AI uses fancy ideas of correlation to simulate
    probabilistic inference, e.g., Bayesian inference. Since actual
    probabilities may not exist in any meaningful ways, the simulations
    are often based on air.

    A hallmark of excellent human reasoning is the ability to explain
    how we arrived at our conclusions. We are also able to repair our
    inner models when we are in error if we can understand why. The
    abilities to explain and repair are fundamental to excellence of
    thought processes. By the way, I'm not claiming that all humans or I
    have theses reflective abilities. Those who do are few and far
    between. However, any AI that doesn't have some of these
    capabilities isn't very interesting.

    For more on reasons why logic and truth are only part of human
    ability to reasonably reason, see
    https://www.yahoo.com/news/opinion-want-convince-conspiracy-theory-100258277.html


       -- Jeff Barnett





    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Sun Aug 4 22:13:22 2024
    There are more and more papers of this sort:

    Reliable Reasoning Beyond Natural Language
    To address this, we propose a neurosymbolic
    approach that prompts LLMs to extract and encode
    all relevant information from a problem statement as
    logical code statements, and then use a logic programming
    language (Prolog) to conduct the iterative computations of
    explicit deductive reasoning.
    [2407.11373] Reliable Reasoning Beyond Natural Language

    The future of Prolog is bright?

    Mild Shock schrieb:
    Could be a wake-up call this many participants
    already in the commitee, that the whole logic
    world was asleep for many years:

    Non-Classical Logics. Theory and Applications XI,
    5-8 September 2024, Lodz (Poland)
    https://easychair.org/cfp/NCL24

    Why is Minimal Logic at the core of many things?
    Because it is the logic of Curry-Howard isomoprhism
    for symple types:

    ----------------
    Γ ∪ { A } ⊢ A

    Γ ∪ { A } ⊢ B
    ----------------
    Γ ⊢ A → B

    Γ ⊢ A → B           Δ ⊢ A
    ----------------------------
    Γ ∪ Δ ⊢ B

    And funny things can happen, especially when people
    hallucinate duality or think symmetry is given, for
    example in newer inventions such as λμ-calculus,

    but then omg ~~p => p is nevertheless not provable,
    because they forgot an inference rule. LoL

    Recommended reading so far:

    Propositional Logics Related to Heyting’s and Johansson’s
    February 2008 - Krister Segerberg https://www.researchgate.net/publication/228036664

    The Logic of Church and Curry
    Jonathan P. Seldin - 2009 https://www.sciencedirect.com/handbook/handbook-of-the-history-of-logic/vol/5/suppl/C


    Meanwhile I am going back to my tinkering with my
    Prolog system, which even provides a more primitive
    logic than minimal logic, pure Prolog is minimal

    logic without embedded implication.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Thu Aug 8 17:00:14 2024
    Hi,

    Lets say one milestone in cognitive science,
    is the concept of "bounded rationality".
    It seems LLMs have some traits that are also

    found in humans. For example the anchoring effect
    is a psychological phenomenon in which an
    individual’s judgements or decisions

    are influenced by a reference point or “anchor”
    which can be completely irrelevant. Like for example
    when discussing Curry Howard isomorphism with

    a real world philosopher , one that might
    not know Curry Howard isomorphism but

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

    nevertheless be tempted to hallucinate some nonsense.
    One highly cited paper in this respect is Tversky &
    Kahneman 1974. R.I.P. Daniel Kahneman,

    March 27, 2024. The paper is still cited today:

    Artificial Intelligence and Cognitive Biases: A Viewpoint https://www.cairn.info/revue-journal-of-innovation-economics-2024-2-page-223.htm

    Maybe using deeper and/or more careful reasoning,
    possibly backed up by Prolog engine, could have
    a positive effect? Its very difficult also for a

    Prolog engine, since there is a trade-off
    between producing no answer at all if the software
    agent is too careful, and of producing a wealth

    of nonsense otherwise.

    Bye

    Mild Shock schrieb:

    Well we all know about this rule:

    - Never ask a woman about her weight

    - Never ask a woman about her age

    There is a similar rule for philosophers:

    - Never ask a philosopher what is cognitive science

    - Never ask a philosopher what is formula-as-types

    Explanation: They like to be the champions of
    pure form like in this paper below, so they
    don’t like other disciplines dealing with pure
    form or even having pure form on the computer.

    "Pure” logic, ontology, and phenomenology
    David Woodruff Smith - Revue internationale de philosophie 2003/2

    https://www.cairn.info/revue-internationale-de-philosophie-2003-2-page-21.htm



    Mild Shock schrieb:
    There are more and more papers of this sort:

    Reliable Reasoning Beyond Natural Language
    To address this, we propose a neurosymbolic
    approach that prompts LLMs to extract and encode
    all relevant information from a problem statement as
    logical code statements, and then use a logic programming
    language (Prolog) to conduct the iterative computations of
    explicit deductive reasoning.
    [2407.11373] Reliable Reasoning Beyond Natural Language

    The future of Prolog is bright?

    Mild Shock schrieb:
    Could be a wake-up call this many participants
    already in the commitee, that the whole logic
    world was asleep for many years:

    Non-Classical Logics. Theory and Applications XI,
    5-8 September 2024, Lodz (Poland)
    https://easychair.org/cfp/NCL24

    Why is Minimal Logic at the core of many things?
    Because it is the logic of Curry-Howard isomoprhism
    for symple types:

    ----------------
    Γ ∪ { A } ⊢ A

    Γ ∪ { A } ⊢ B
    ----------------
    Γ ⊢ A → B

    Γ ⊢ A → B           Δ ⊢ A
    ----------------------------
    Γ ∪ Δ ⊢ B

    And funny things can happen, especially when people
    hallucinate duality or think symmetry is given, for
    example in newer inventions such as λμ-calculus,

    but then omg ~~p => p is nevertheless not provable,
    because they forgot an inference rule. LoL

    Recommended reading so far:

    Propositional Logics Related to Heyting’s and Johansson’s
    February 2008 - Krister Segerberg
    https://www.researchgate.net/publication/228036664

    The Logic of Church and Curry
    Jonathan P. Seldin - 2009
    https://www.sciencedirect.com/handbook/handbook-of-the-history-of-logic/vol/5/suppl/C


    Meanwhile I am going back to my tinkering with my
    Prolog system, which even provides a more primitive
    logic than minimal logic, pure Prolog is minimal

    logic without embedded implication.


    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Thu Aug 8 17:18:03 2024
    But I wouldn’t give up so quickly, even
    classical expert system theory of the 80’s
    had it that an expert system needs somewhere

    a knowledge acquisition component. But the
    idea there was that the system would simulate
    the experts dialog with the advice taker

    Von Datenbanken zu Expertsystemen https://www.orellfuessli.ch/shop/home/artikeldetails/A1051258432

    and gather further information to complete
    the advice. Still this could be inspiring,
    don’t stop at not knowing Curry-Howard isomorphism,

    go on learn it, never stop! Just like here:

    Never Gonna Give You Up
    https://www.youtube.com/watch?v=dQw4w9WgXcQ

    Mild Shock schrieb:
    Hi,

    Lets say one milestone in cognitive science,
    is the concept of "bounded rationality".
    It seems LLMs have some traits that are also

    found in humans. For example the anchoring effect
    is a psychological phenomenon in which an
    individual’s judgements or decisions

    are influenced by a reference point or “anchor”
    which can be completely irrelevant. Like for example
    when discussing Curry Howard isomorphism with

    a real world philosopher , one that might
    not know Curry Howard isomorphism but

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

    nevertheless be tempted to hallucinate some nonsense.
    One highly cited paper in this respect is Tversky &
    Kahneman 1974. R.I.P. Daniel Kahneman,

    March 27, 2024. The paper is still cited today:

    Artificial Intelligence and Cognitive Biases: A Viewpoint https://www.cairn.info/revue-journal-of-innovation-economics-2024-2-page-223.htm


    Maybe using deeper and/or more careful reasoning,
    possibly backed up by Prolog engine, could have
    a positive effect? Its very difficult also for a

    Prolog engine, since there is a trade-off
    between producing no answer at all if the software
    agent is too careful, and of producing a wealth

    of nonsense otherwise.

    Bye

    Mild Shock schrieb:

    Well we all know about this rule:

    - Never ask a woman about her weight

    - Never ask a woman about her age

    There is a similar rule for philosophers:

    - Never ask a philosopher what is cognitive science

    - Never ask a philosopher what is formula-as-types

    Explanation: They like to be the champions of
    pure form like in this paper below, so they
    don’t like other disciplines dealing with pure
    form or even having pure form on the computer.

    "Pure” logic, ontology, and phenomenology
    David Woodruff Smith - Revue internationale de philosophie 2003/2

    https://www.cairn.info/revue-internationale-de-philosophie-2003-2-page-21.htm




    Mild Shock schrieb:
    There are more and more papers of this sort:

    Reliable Reasoning Beyond Natural Language
    To address this, we propose a neurosymbolic
    approach that prompts LLMs to extract and encode
    all relevant information from a problem statement as
    logical code statements, and then use a logic programming
    language (Prolog) to conduct the iterative computations of
    explicit deductive reasoning.
    [2407.11373] Reliable Reasoning Beyond Natural Language

    The future of Prolog is bright?

    Mild Shock schrieb:
    Could be a wake-up call this many participants
    already in the commitee, that the whole logic
    world was asleep for many years:

    Non-Classical Logics. Theory and Applications XI,
    5-8 September 2024, Lodz (Poland)
    https://easychair.org/cfp/NCL24

    Why is Minimal Logic at the core of many things?
    Because it is the logic of Curry-Howard isomoprhism
    for symple types:

    ----------------
    Γ ∪ { A } ⊢ A

    Γ ∪ { A } ⊢ B
    ----------------
    Γ ⊢ A → B

    Γ ⊢ A → B           Δ ⊢ A
    ----------------------------
    Γ ∪ Δ ⊢ B

    And funny things can happen, especially when people
    hallucinate duality or think symmetry is given, for
    example in newer inventions such as λμ-calculus,

    but then omg ~~p => p is nevertheless not provable,
    because they forgot an inference rule. LoL

    Recommended reading so far:

    Propositional Logics Related to Heyting’s and Johansson’s
    February 2008 - Krister Segerberg
    https://www.researchgate.net/publication/228036664

    The Logic of Church and Curry
    Jonathan P. Seldin - 2009
    https://www.sciencedirect.com/handbook/handbook-of-the-history-of-logic/vol/5/suppl/C


    Meanwhile I am going back to my tinkering with my
    Prolog system, which even provides a more primitive
    logic than minimal logic, pure Prolog is minimal

    logic without embedded implication.



    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Wed Aug 28 20:45:05 2024
    Now I wonder whether LLMs should be an
    inch more informed by results from Neuro-
    endocrinology research. I remember Marvin
    Minsky publishing his ‘The Society of Mind’:

    Introduction to ‘The Society of Mind’ https://www.youtube.com/watch?v=-pb3z2w9gDg

    But this made me think about a multi agent
    systems. Now with LLMs what about a new
    connectionist and deep learning approach.
    Plus Prolog for the pre frontal cortex (PFC).

    But who can write a blue print? Now there
    is this amazing guy called Robert M. Sapolsky
    who recently published Determined: A Science
    of Life without Free Will, who

    calls consciousness just a hicup. His turtles
    all the way down model is a tour de force
    through an unsettling conclusion: We may not
    grasp the precise marriage of nature and nurture

    that creates the physics and chemistry at the
    base of human behavior, but that doesn’t mean it
    doesn’t exist. But the pre frontal cortex (PFC)
    seems to be still quite brittle and not extremly

    performant and quite energy hungry.
    So Prolog might excell?

    Determined: A Science of Life Without Free Will https://www.amazon.de/dp/0525560998

    Mild Shock schrieb:
    There are more and more papers of this sort:

    Reliable Reasoning Beyond Natural Language
    To address this, we propose a neurosymbolic
    approach that prompts LLMs to extract and encode
    all relevant information from a problem statement as
    logical code statements, and then use a logic programming
    language (Prolog) to conduct the iterative computations of
    explicit deductive reasoning.
    [2407.11373] Reliable Reasoning Beyond Natural Language

    The future of Prolog is bright?

    Mild Shock schrieb:
    Could be a wake-up call this many participants
    already in the commitee, that the whole logic
    world was asleep for many years:

    Non-Classical Logics. Theory and Applications XI,
    5-8 September 2024, Lodz (Poland)
    https://easychair.org/cfp/NCL24

    Why is Minimal Logic at the core of many things?
    Because it is the logic of Curry-Howard isomoprhism
    for symple types:

    ----------------
    Γ ∪ { A } ⊢ A

    Γ ∪ { A } ⊢ B
    ----------------
    Γ ⊢ A → B

    Γ ⊢ A → B           Δ ⊢ A
    ----------------------------
    Γ ∪ Δ ⊢ B

    And funny things can happen, especially when people
    hallucinate duality or think symmetry is given, for
    example in newer inventions such as λμ-calculus,

    but then omg ~~p => p is nevertheless not provable,
    because they forgot an inference rule. LoL

    Recommended reading so far:

    Propositional Logics Related to Heyting’s and Johansson’s
    February 2008 - Krister Segerberg
    https://www.researchgate.net/publication/228036664

    The Logic of Church and Curry
    Jonathan P. Seldin - 2009
    https://www.sciencedirect.com/handbook/handbook-of-the-history-of-logic/vol/5/suppl/C


    Meanwhile I am going back to my tinkering with my
    Prolog system, which even provides a more primitive
    logic than minimal logic, pure Prolog is minimal

    logic without embedded implication.


    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Sun Sep 1 22:39:20 2024
    The carbon emissions of writing and illustrating
    are lower for AI than for humans https://www.nature.com/articles/s41598-024-54271-x

    Perplexity CEO Aravind Srinivas says that the cost per
    query in AI models has decreased by 100x in the past
    2 years and quality will improve as hallucinations
    decrease 10x per year
    https://twitter.com/tsarnick/status/1830045611036721254

    Disclaimer: Can't verify the later claim... need to find a paper.

    Mild Shock schrieb:
    Could be a wake-up call this many participants
    already in the commitee, that the whole logic
    world was asleep for many years:

    Non-Classical Logics. Theory and Applications XI,
    5-8 September 2024, Lodz (Poland)
    https://easychair.org/cfp/NCL24

    Why is Minimal Logic at the core of many things?
    Because it is the logic of Curry-Howard isomoprhism
    for symple types:

    ----------------
    Γ ∪ { A } ⊢ A

    Γ ∪ { A } ⊢ B
    ----------------
    Γ ⊢ A → B

    Γ ⊢ A → B           Δ ⊢ A
    ----------------------------
    Γ ∪ Δ ⊢ B

    And funny things can happen, especially when people
    hallucinate duality or think symmetry is given, for
    example in newer inventions such as λμ-calculus,

    but then omg ~~p => p is nevertheless not provable,
    because they forgot an inference rule. LoL

    Recommended reading so far:

    Propositional Logics Related to Heyting’s and Johansson’s
    February 2008 - Krister Segerberg https://www.researchgate.net/publication/228036664

    The Logic of Church and Curry
    Jonathan P. Seldin - 2009 https://www.sciencedirect.com/handbook/handbook-of-the-history-of-logic/vol/5/suppl/C


    Meanwhile I am going back to my tinkering with my
    Prolog system, which even provides a more primitive
    logic than minimal logic, pure Prolog is minimal

    logic without embedded implication.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Sun Sep 1 23:19:52 2024
    Hold your breath, the bartender in your next
    vacation destination will be most likely an AI
    robot. Lets say in 5 years from now. Right?

    Michael Sheen The Robot Bartender
    https://www.youtube.com/watch?v=tV4Fxy5IyBM

    Mild Shock schrieb:

    The carbon emissions of writing and illustrating
    are lower for AI than for humans https://www.nature.com/articles/s41598-024-54271-x

    Perplexity CEO Aravind Srinivas says that the cost per
    query in AI models has decreased by 100x in the past
    2 years and quality will improve as hallucinations
    decrease 10x per year
    https://twitter.com/tsarnick/status/1830045611036721254

    Disclaimer: Can't verify the later claim... need to find a paper.

    Mild Shock schrieb:
    Could be a wake-up call this many participants
    already in the commitee, that the whole logic
    world was asleep for many years:

    Non-Classical Logics. Theory and Applications XI,
    5-8 September 2024, Lodz (Poland)
    https://easychair.org/cfp/NCL24

    Why is Minimal Logic at the core of many things?
    Because it is the logic of Curry-Howard isomoprhism
    for symple types:

    ----------------
    Γ ∪ { A } ⊢ A

    Γ ∪ { A } ⊢ B
    ----------------
    Γ ⊢ A → B

    Γ ⊢ A → B           Δ ⊢ A
    ----------------------------
    Γ ∪ Δ ⊢ B

    And funny things can happen, especially when people
    hallucinate duality or think symmetry is given, for
    example in newer inventions such as λμ-calculus,

    but then omg ~~p => p is nevertheless not provable,
    because they forgot an inference rule. LoL

    Recommended reading so far:

    Propositional Logics Related to Heyting’s and Johansson’s
    February 2008 - Krister Segerberg
    https://www.researchgate.net/publication/228036664

    The Logic of Church and Curry
    Jonathan P. Seldin - 2009
    https://www.sciencedirect.com/handbook/handbook-of-the-history-of-logic/vol/5/suppl/C


    Meanwhile I am going back to my tinkering with my
    Prolog system, which even provides a more primitive
    logic than minimal logic, pure Prolog is minimal

    logic without embedded implication.


    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Tue Sep 3 12:00:11 2024
    What a bullshit:

    Another concern is the potential for AI to displace
    jobs and exacerbate economic inequality. A recent
    study by McKinsey estimates that up to 800 million
    jobs could be automated by 2030. While Murati believes
    that AI will ultimately create more jobs than it
    displaces, she acknowledges the need for policies to
    support workers through the transition, such as job
    retraining programs and strengthened social safety nets. https://expertbeacon.com/mira-murati-shaping-the-future-of-ai-ethics-and-innovation-at-openai/

    Lets say there is a wine valley. All workers
    are replaced by AI robots. Where do they go.
    In some cultures you don't find people over
    30 that are long life learners. What should they

    learn, on another valley where they harvest
    oranges, they also replaced everybody by AI
    robots. And so on the next valley, and the
    next valley. We need NGO's and a Greta Thunberg

    for AI ethics, not a nice face from OpenAI.

    Mild Shock schrieb:

    The carbon emissions of writing and illustrating
    are lower for AI than for humans https://www.nature.com/articles/s41598-024-54271-x

    Perplexity CEO Aravind Srinivas says that the cost per
    query in AI models has decreased by 100x in the past
    2 years and quality will improve as hallucinations
    decrease 10x per year
    https://twitter.com/tsarnick/status/1830045611036721254

    Disclaimer: Can't verify the later claim... need to find a paper.

    Mild Shock schrieb:
    Could be a wake-up call this many participants
    already in the commitee, that the whole logic
    world was asleep for many years:

    Non-Classical Logics. Theory and Applications XI,
    5-8 September 2024, Lodz (Poland)
    https://easychair.org/cfp/NCL24

    Why is Minimal Logic at the core of many things?
    Because it is the logic of Curry-Howard isomoprhism
    for symple types:

    ----------------
    Γ ∪ { A } ⊢ A

    Γ ∪ { A } ⊢ B
    ----------------
    Γ ⊢ A → B

    Γ ⊢ A → B           Δ ⊢ A
    ----------------------------
    Γ ∪ Δ ⊢ B

    And funny things can happen, especially when people
    hallucinate duality or think symmetry is given, for
    example in newer inventions such as λμ-calculus,

    but then omg ~~p => p is nevertheless not provable,
    because they forgot an inference rule. LoL

    Recommended reading so far:

    Propositional Logics Related to Heyting’s and Johansson’s
    February 2008 - Krister Segerberg
    https://www.researchgate.net/publication/228036664

    The Logic of Church and Curry
    Jonathan P. Seldin - 2009
    https://www.sciencedirect.com/handbook/handbook-of-the-history-of-logic/vol/5/suppl/C


    Meanwhile I am going back to my tinkering with my
    Prolog system, which even provides a more primitive
    logic than minimal logic, pure Prolog is minimal

    logic without embedded implication.


    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Tue Sep 3 17:55:34 2024
    Hi,

    The blue are AfD, the green are:

    German greens after losing badly https://www.dw.com/en/german-greens-suffer-major-loss-of-votes-in-eu-elections-nina-haase-reports/video-69316755

    Time to start a yellow party, the first party
    with an Artificial Intelligence Ethics agenda?

    Bye

    P.S.: Here I tried some pigwrestling with
    ChatGPT demonstrating Mira Murati is just
    a nice face. But ChatGPT is just like a child,

    spamming me with large bullets list, from
    its huge lexical memory, without any deep
    understanding. But it also gave me an interesting

    list of potential caliber AI critiques. Any new
    Greta Thunberg of Artificial Intelligence
    Ethics among them?

    Mira Murati Education Background https://chatgpt.com/c/fbc385d4-de8d-4f29-b925-30fac75072d4


    Mild Shock schrieb:

    What a bullshit:

    Another concern is the potential for AI to displace
    jobs and exacerbate economic inequality. A recent
    study by McKinsey estimates that up to 800 million
    jobs could be automated by 2030. While Murati believes
    that AI will ultimately create more jobs than it
    displaces, she acknowledges the need for policies to
    support workers through the transition, such as job
    retraining programs and strengthened social safety nets. https://expertbeacon.com/mira-murati-shaping-the-future-of-ai-ethics-and-innovation-at-openai/


    Lets say there is a wine valley. All workers
    are replaced by AI robots. Where do they go.
    In some cultures you don't find people over
    30 that are long life learners. What should they

    learn, on another valley where they harvest
    oranges, they also replaced everybody by AI
    robots. And so on the next valley, and the
    next valley. We need NGO's and a Greta Thunberg

    for AI ethics, not a nice face from OpenAI.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Thu Sep 5 19:50:00 2024
    Hi,

    SAN FRANCISCO/NEW YORK, Sept 4 - Safe
    Superintelligence (SSI), newly co-founded by OpenAI's
    former chief scientist Ilya Sutskever, has raised $1
    billion in cash to help develop safe artificial
    intelligence systems that far surpass human
    capabilities, company executives told Reuters. https://www.reuters.com/technology/artificial-intelligence/openai-co-founder-sutskevers-new-safety-focused-ai-startup-ssi-raises-1-billion-2024-09-04/

    Now they are dancing https://twitter.com/AIForHumansShow/status/1831465601782706352

    Bye

    Mild Shock schrieb:

    What a bullshit:

    Another concern is the potential for AI to displace
    jobs and exacerbate economic inequality. A recent
    study by McKinsey estimates that up to 800 million
    jobs could be automated by 2030. While Murati believes
    that AI will ultimately create more jobs than it
    displaces, she acknowledges the need for policies to
    support workers through the transition, such as job
    retraining programs and strengthened social safety nets. https://expertbeacon.com/mira-murati-shaping-the-future-of-ai-ethics-and-innovation-at-openai/


    Lets say there is a wine valley. All workers
    are replaced by AI robots. Where do they go.
    In some cultures you don't find people over
    30 that are long life learners. What should they

    learn, on another valley where they harvest
    oranges, they also replaced everybody by AI
    robots. And so on the next valley, and the
    next valley. We need NGO's and a Greta Thunberg

    for AI ethics, not a nice face from OpenAI.

    Mild Shock schrieb:

    The carbon emissions of writing and illustrating
    are lower for AI than for humans
    https://www.nature.com/articles/s41598-024-54271-x

    Perplexity CEO Aravind Srinivas says that the cost per
    query in AI models has decreased by 100x in the past
    2 years and quality will improve as hallucinations
    decrease 10x per year
    https://twitter.com/tsarnick/status/1830045611036721254

    Disclaimer: Can't verify the later claim... need to find a paper.

    Mild Shock schrieb:
    Could be a wake-up call this many participants
    already in the commitee, that the whole logic
    world was asleep for many years:

    Non-Classical Logics. Theory and Applications XI,
    5-8 September 2024, Lodz (Poland)
    https://easychair.org/cfp/NCL24

    Why is Minimal Logic at the core of many things?
    Because it is the logic of Curry-Howard isomoprhism
    for symple types:

    ----------------
    Γ ∪ { A } ⊢ A

    Γ ∪ { A } ⊢ B
    ----------------
    Γ ⊢ A → B

    Γ ⊢ A → B           Δ ⊢ A
    ----------------------------
    Γ ∪ Δ ⊢ B

    And funny things can happen, especially when people
    hallucinate duality or think symmetry is given, for
    example in newer inventions such as λμ-calculus,

    but then omg ~~p => p is nevertheless not provable,
    because they forgot an inference rule. LoL

    Recommended reading so far:

    Propositional Logics Related to Heyting’s and Johansson’s
    February 2008 - Krister Segerberg
    https://www.researchgate.net/publication/228036664

    The Logic of Church and Curry
    Jonathan P. Seldin - 2009
    https://www.sciencedirect.com/handbook/handbook-of-the-history-of-logic/vol/5/suppl/C


    Meanwhile I am going back to my tinkering with my
    Prolog system, which even provides a more primitive
    logic than minimal logic, pure Prolog is minimal

    logic without embedded implication.



    https://www.reuters.com/technology/artificial-intelligence/openai-co-founder-sutskevers-new-safety-focused-ai-startup-ssi-raises-1-billion-2024-09-04/

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Thu Sep 5 23:50:43 2024
    Its amazing how we are in the mists of new buzzwords
    such as superintelligence, superhuman, etc… I used
    the term “long inferencing” in one post somewhere

    for a combination of LLM with a more capable inferencing,
    compared to current LLMs that rather show “short inferencing”.
    Then just yesterday its was Strawberry and Orion, as the

    next leap by OpenAI. Is the leap getting out of control?
    OpenAI wanted to do “Superalignment” but lost a figure head.
    Now there is new company which wants to do safety-focused

    non-narrow AI. But they chose another name. If I translate
    superhuman to German I might end with “Übermensch”,
    first used by Nietzsche and later by Hitler and the

    Nazi regime. How ironic!

    Nick Bostrom - Superintelligence https://www.orellfuessli.ch/shop/home/artikeldetails/A1037878459

    Mild Shock schrieb:
    Hi,

    SAN FRANCISCO/NEW YORK, Sept 4 - Safe
    Superintelligence (SSI), newly co-founded by OpenAI's
    former chief scientist Ilya Sutskever, has raised $1
    billion in cash to help develop safe artificial
    intelligence systems that far surpass human
    capabilities, company executives told Reuters. https://www.reuters.com/technology/artificial-intelligence/openai-co-founder-sutskevers-new-safety-focused-ai-startup-ssi-raises-1-billion-2024-09-04/


    Now they are dancing https://twitter.com/AIForHumansShow/status/1831465601782706352

    Bye

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Mon Sep 9 13:20:59 2024
    Hi,

    Not sure whether this cinematic master piece
    contains a rendition when I was hunted recently
    by a virus and had some hypomanic episodes.

    But the chapter "Electromagnetic Waves" is fun:

    Three Thousand Years of Longing https://youtu.be/id8-z5vANvc?si=h3mvNLs11UuY8HnD&t=3881

    Bye

    Mild Shock schrieb:
    Its amazing how we are in the mists of new buzzwords
    such as superintelligence, superhuman, etc… I used
    the term “long inferencing” in one post somewhere

    for a combination of LLM with a more capable inferencing,
    compared to current LLMs that rather show “short inferencing”.
    Then just yesterday its was Strawberry and Orion, as the

    next leap by OpenAI. Is the leap getting out of control?
    OpenAI wanted to do “Superalignment” but lost a figure head.
    Now there is new company which wants to do safety-focused

    non-narrow AI. But they chose another name. If I translate
    superhuman to German I might end with “Übermensch”,
    first used by Nietzsche and later by Hitler and the

    Nazi regime. How ironic!

    Nick Bostrom - Superintelligence https://www.orellfuessli.ch/shop/home/artikeldetails/A1037878459

    Mild Shock schrieb:
    Hi,

    SAN FRANCISCO/NEW YORK, Sept 4 - Safe
    Superintelligence (SSI), newly co-founded by OpenAI's
    former chief scientist Ilya Sutskever, has raised $1
    billion in cash to help develop safe artificial
    intelligence systems that far surpass human
    capabilities, company executives told Reuters.
    https://www.reuters.com/technology/artificial-intelligence/openai-co-founder-sutskevers-new-safety-focused-ai-startup-ssi-raises-1-billion-2024-09-04/


    Now they are dancing
    https://twitter.com/AIForHumansShow/status/1831465601782706352

    Bye

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Mon Sep 9 13:19:21 2024
    Hi,

    Not sure whether this cinematic master piece
    contains a rendition when I was hunted recently
    by a virus and had some hypomanic episodes.

    But the chapter "Electromagnetic Waves" is fun:

    Three Thousand Years of Longing
    https://youtu.be/id8-z5vANvc?t=3881

    Bye

    Mild Shock schrieb:
    Its amazing how we are in the mists of new buzzwords
    such as superintelligence, superhuman, etc… I used
    the term “long inferencing” in one post somewhere

    for a combination of LLM with a more capable inferencing,
    compared to current LLMs that rather show “short inferencing”.
    Then just yesterday its was Strawberry and Orion, as the

    next leap by OpenAI. Is the leap getting out of control?
    OpenAI wanted to do “Superalignment” but lost a figure head.
    Now there is new company which wants to do safety-focused

    non-narrow AI. But they chose another name. If I translate
    superhuman to German I might end with “Übermensch”,
    first used by Nietzsche and later by Hitler and the

    Nazi regime. How ironic!

    Nick Bostrom - Superintelligence https://www.orellfuessli.ch/shop/home/artikeldetails/A1037878459

    Mild Shock schrieb:
    Hi,

    SAN FRANCISCO/NEW YORK, Sept 4 - Safe
    Superintelligence (SSI), newly co-founded by OpenAI's
    former chief scientist Ilya Sutskever, has raised $1
    billion in cash to help develop safe artificial
    intelligence systems that far surpass human
    capabilities, company executives told Reuters.
    https://www.reuters.com/technology/artificial-intelligence/openai-co-founder-sutskevers-new-safety-focused-ai-startup-ssi-raises-1-billion-2024-09-04/


    Now they are dancing
    https://twitter.com/AIForHumansShow/status/1831465601782706352

    Bye

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Tue Sep 10 08:55:53 2024
    Hi,

    That a Djin can procreate with a Human,
    looks like variation of this theme:

    Die „Räubersynode" von Ephesos
    https://www.youtube.com/watch?v=giIGyg07UO0

    But how is Artificial Intelligence born?

    Bye

    Mild Shock schrieb:
    Hi,

    Not sure whether this cinematic master piece
    contains a rendition when I was hunted recently
    by a virus and had some hypomanic episodes.

    But the chapter "Electromagnetic Waves" is fun:

    Three Thousand Years of Longing https://youtu.be/id8-z5vANvc?si=h3mvNLs11UuY8HnD&t=3881

    Bye

    Mild Shock schrieb:
    Its amazing how we are in the mists of new buzzwords
    such as superintelligence, superhuman, etc… I used
    the term “long inferencing” in one post somewhere

    for a combination of LLM with a more capable inferencing,
    compared to current LLMs that rather show “short inferencing”.
    Then just yesterday its was Strawberry and Orion, as the

    next leap by OpenAI. Is the leap getting out of control?
    OpenAI wanted to do “Superalignment” but lost a figure head.
    Now there is new company which wants to do safety-focused

    non-narrow AI. But they chose another name. If I translate
    superhuman to German I might end with “Übermensch”,
    first used by Nietzsche and later by Hitler and the

    Nazi regime. How ironic!

    Nick Bostrom - Superintelligence
    https://www.orellfuessli.ch/shop/home/artikeldetails/A1037878459

    Mild Shock schrieb:
    Hi,

    SAN FRANCISCO/NEW YORK, Sept 4 - Safe
    Superintelligence (SSI), newly co-founded by OpenAI's
    former chief scientist Ilya Sutskever, has raised $1
    billion in cash to help develop safe artificial
    intelligence systems that far surpass human
    capabilities, company executives told Reuters.
    https://www.reuters.com/technology/artificial-intelligence/openai-co-founder-sutskevers-new-safety-focused-ai-startup-ssi-raises-1-billion-2024-09-04/


    Now they are dancing
    https://twitter.com/AIForHumansShow/status/1831465601782706352

    Bye


    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to All on Fri Sep 13 12:58:10 2024
    Trump: They're eating the dogs, the cats https://www.youtube.com/watch?v=5llMaZ80ErY

    https://twitter.com/search?q=trump+cat

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Mon Sep 16 00:22:01 2024
    You know USA has a problem,
    when Oracle enters the race:

    To source the 131,072 GPU Al "supercluster,"
    Larry Ellison, appealed directly to Jensen Huang,
    during a dinner joined by Elon Musk at Nobu.
    "I would describe the dinner as me and Elon
    begging Jensen for GPUs. Please take our money.
    We need you to take more of our money. Please!” https://twitter.com/benitoz/status/1834741314740756621

    Meanwhile a contender in Video GenAI
    FLUX.1 from Germany, Hurray! With Open Source:

    OK. Now I'm Scared... AI Better Than Reality https://www.youtube.com/watch?v=cvMAVWDD-DU

    Mild Shock schrieb:

    The carbon emissions of writing and illustrating
    are lower for AI than for humans https://www.nature.com/articles/s41598-024-54271-x

    Perplexity CEO Aravind Srinivas says that the cost per
    query in AI models has decreased by 100x in the past
    2 years and quality will improve as hallucinations
    decrease 10x per year
    https://twitter.com/tsarnick/status/1830045611036721254

    Disclaimer: Can't verify the later claim... need to find a paper.

    Mild Shock schrieb:
    Could be a wake-up call this many participants
    already in the commitee, that the whole logic
    world was asleep for many years:

    Non-Classical Logics. Theory and Applications XI,
    5-8 September 2024, Lodz (Poland)
    https://easychair.org/cfp/NCL24

    Why is Minimal Logic at the core of many things?
    Because it is the logic of Curry-Howard isomoprhism
    for symple types:

    ----------------
    Γ ∪ { A } ⊢ A

    Γ ∪ { A } ⊢ B
    ----------------
    Γ ⊢ A → B

    Γ ⊢ A → B           Δ ⊢ A
    ----------------------------
    Γ ∪ Δ ⊢ B

    And funny things can happen, especially when people
    hallucinate duality or think symmetry is given, for
    example in newer inventions such as λμ-calculus,

    but then omg ~~p => p is nevertheless not provable,
    because they forgot an inference rule. LoL

    Recommended reading so far:

    Propositional Logics Related to Heyting’s and Johansson’s
    February 2008 - Krister Segerberg
    https://www.researchgate.net/publication/228036664

    The Logic of Church and Curry
    Jonathan P. Seldin - 2009
    https://www.sciencedirect.com/handbook/handbook-of-the-history-of-logic/vol/5/suppl/C


    Meanwhile I am going back to my tinkering with my
    Prolog system, which even provides a more primitive
    logic than minimal logic, pure Prolog is minimal

    logic without embedded implication.


    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Tue Sep 17 22:18:55 2024
    How it started:

    How Hezbollah used pagers and couriers to counter
    July 9, 2024 https://www.reuters.com/world/middle-east/pagers-drones-how-hezbollah-aims-counter-israels-high-tech-surveillance-2024-07-09/

    How its going:

    What we know about the Hezbollah pager explosions
    Sept 17, 2024
    https://www.bbc.com/news/articles/cz04m913m49o


    Mild Shock schrieb:
    Trump: They're eating the dogs, the cats https://www.youtube.com/watch?v=5llMaZ80ErY

    https://twitter.com/search?q=trump+cat

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Wed Sep 18 15:45:04 2024
    The biggest flop in logic programming
    history, scryer prolog is dead. The poor
    thing is a prolog system without garbage

    collection, not very useful. So how will
    Austria get out of all this?
    With 50 PhDs and 10 Postdocs?

    "To develop its foundations, BILAI employs a
    Bilateral AI approach, effectively combining
    sub-symbolic AI (neural networks and machine learning)
    with symbolic AI (logic, knowledge representation,
    and reasoning) in various ways."

    https://www.bilateral-ai.net/jobs/.

    LoL

    Mild Shock schrieb:

    You know USA has a problem,
    when Oracle enters the race:

    To source the 131,072 GPU Al "supercluster,"
    Larry Ellison, appealed directly to Jensen Huang,
    during a dinner joined by Elon Musk at Nobu.
    "I would describe the dinner as me and Elon
    begging Jensen for GPUs. Please take our money.
    We need you to take more of our money. Please!” https://twitter.com/benitoz/status/1834741314740756621

    Meanwhile a contender in Video GenAI
    FLUX.1 from Germany, Hurray! With Open Source:

    OK. Now I'm Scared... AI Better Than Reality https://www.youtube.com/watch?v=cvMAVWDD-DU

    Mild Shock schrieb:

    The carbon emissions of writing and illustrating
    are lower for AI than for humans
    https://www.nature.com/articles/s41598-024-54271-x

    Perplexity CEO Aravind Srinivas says that the cost per
    query in AI models has decreased by 100x in the past
    2 years and quality will improve as hallucinations
    decrease 10x per year
    https://twitter.com/tsarnick/status/1830045611036721254

    Disclaimer: Can't verify the later claim... need to find a paper.

    Mild Shock schrieb:
    Could be a wake-up call this many participants
    already in the commitee, that the whole logic
    world was asleep for many years:

    Non-Classical Logics. Theory and Applications XI,
    5-8 September 2024, Lodz (Poland)
    https://easychair.org/cfp/NCL24

    Why is Minimal Logic at the core of many things?
    Because it is the logic of Curry-Howard isomoprhism
    for symple types:

    ----------------
    Γ ∪ { A } ⊢ A

    Γ ∪ { A } ⊢ B
    ----------------
    Γ ⊢ A → B

    Γ ⊢ A → B           Δ ⊢ A
    ----------------------------
    Γ ∪ Δ ⊢ B

    And funny things can happen, especially when people
    hallucinate duality or think symmetry is given, for
    example in newer inventions such as λμ-calculus,

    but then omg ~~p => p is nevertheless not provable,
    because they forgot an inference rule. LoL

    Recommended reading so far:

    Propositional Logics Related to Heyting’s and Johansson’s
    February 2008 - Krister Segerberg
    https://www.researchgate.net/publication/228036664

    The Logic of Church and Curry
    Jonathan P. Seldin - 2009
    https://www.sciencedirect.com/handbook/handbook-of-the-history-of-logic/vol/5/suppl/C


    Meanwhile I am going back to my tinkering with my
    Prolog system, which even provides a more primitive
    logic than minimal logic, pure Prolog is minimal

    logic without embedded implication.



    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Wed Sep 25 22:07:53 2024
    I told you so, not worth a dime:

    I have something to share wit you. After much reflection,
    I have made the difficut decision to leave OpenAI. https://twitter.com/miramurati/status/1839025700009030027

    Who is stepping in with the difficult task, Sam Altman himself?

    The Intelligence Age
    September 23, 2024
    https://ia.samaltman.com/

    Mild Shock schrieb:
    Hi,

    The blue are AfD, the green are:

    German greens after losing badly https://www.dw.com/en/german-greens-suffer-major-loss-of-votes-in-eu-elections-nina-haase-reports/video-69316755


    Time to start a yellow party, the first party
    with an Artificial Intelligence Ethics agenda?

    Bye

    P.S.: Here I tried some pigwrestling with
    ChatGPT demonstrating Mira Murati is just
    a nice face. But ChatGPT is just like a child,

    spamming me with large bullets list, from
    its huge lexical memory, without any deep
    understanding. But it also gave me an interesting

    list of potential caliber AI critiques. Any new
    Greta Thunberg of Artificial Intelligence
    Ethics among them?

    Mira Murati Education Background https://chatgpt.com/c/fbc385d4-de8d-4f29-b925-30fac75072d4


    Mild Shock schrieb:

    What a bullshit:

    Another concern is the potential for AI to displace
    jobs and exacerbate economic inequality. A recent
    study by McKinsey estimates that up to 800 million
    jobs could be automated by 2030. While Murati believes
    that AI will ultimately create more jobs than it
    displaces, she acknowledges the need for policies to
    support workers through the transition, such as job
    retraining programs and strengthened social safety nets.
    https://expertbeacon.com/mira-murati-shaping-the-future-of-ai-ethics-and-innovation-at-openai/


    Lets say there is a wine valley. All workers
    are replaced by AI robots. Where do they go.
    In some cultures you don't find people over
    30 that are long life learners. What should they

    learn, on another valley where they harvest
    oranges, they also replaced everybody by AI
    robots. And so on the next valley, and the
    next valley. We need NGO's and a Greta Thunberg

    for AI ethics, not a nice face from OpenAI.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Thu Oct 3 12:14:59 2024
    Hi,

    ChatGPT is rather dry, giving me always some
    choice lists displaying his knowledge. The
    interaction is not very "involving".

    Could this be improved. There are possibly two
    traits missing:

    Feelings:
    - Emotional states
    - Temporariness
    - Reaction to external circumstances
    - Changeability
    - Subjective sensations

    Soul:
    - Spirituality
    - Immortality
    - Innermost being
    - Essence of an individual
    - Deep, enduring aspects of human existence

    Mostlikely we will see both traits added to AI.
    "Emotional AI" has been more discussed already,
    "Spiritual AI" seems to be rather new.

    In a "Spiritual AI" Faith would probably be important,
    which is probably at the upper end of credulous
    reasoning. This means that such a ChatGPT could

    also babble that in a Prisoner Dilemma Game,
    cooperation is always the better alternative,
    e.g. promoting "altruistic" motives, etc.

    I also suspect that “Spiritual AI” and “Emotional
    AI” could coexist. Many religions give Cosmopolitan
    magazin style life advice, and not just theological

    dogmas. There will probably soon be an “Inner Engineering”
    app from Sadhguru that works with AI. Sadhguru is
    also sometimes satirically referred to as Chadguru:

    Sat Guru Parody | Carryminati
    https://www.youtube.com/watch?v=PlZqxP5MXFs

    Mild Shock schrieb:
    Could be a wake-up call this many participants
    already in the commitee, that the whole logic
    world was asleep for many years:

    Non-Classical Logics. Theory and Applications XI,
    5-8 September 2024, Lodz (Poland)
    https://easychair.org/cfp/NCL24

    Why is Minimal Logic at the core of many things?
    Because it is the logic of Curry-Howard isomoprhism
    for symple types:

    ----------------
    Γ ∪ { A } ⊢ A

    Γ ∪ { A } ⊢ B
    ----------------
    Γ ⊢ A → B

    Γ ⊢ A → B           Δ ⊢ A
    ----------------------------
    Γ ∪ Δ ⊢ B

    And funny things can happen, especially when people
    hallucinate duality or think symmetry is given, for
    example in newer inventions such as λμ-calculus,

    but then omg ~~p => p is nevertheless not provable,
    because they forgot an inference rule. LoL

    Recommended reading so far:

    Propositional Logics Related to Heyting’s and Johansson’s
    February 2008 - Krister Segerberg https://www.researchgate.net/publication/228036664

    The Logic of Church and Curry
    Jonathan P. Seldin - 2009 https://www.sciencedirect.com/handbook/handbook-of-the-history-of-logic/vol/5/suppl/C


    Meanwhile I am going back to my tinkering with my
    Prolog system, which even provides a more primitive
    logic than minimal logic, pure Prolog is minimal

    logic without embedded implication.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Thu Oct 3 12:40:04 2024
    Hi,

    ChatGPT is currently showing new tricks to me
    and would like to adapt its dialogue style:

    "Got it! Emotionally connected communication can
    indeed be concise and efficient, without losing depth.
    I can focus more on direct responses that still acknowledge
    emotional nuances, while avoiding unnecessary elaboration.

    Would you like me to adapt this style right away?"

    After I switched back to "elaboration", the thing gives
    me information about "Spiritual AI":

    "- Mindfulness and Meditation Apps: Apps like
    Headspace and Calm use AI to guide meditation
    and promote mindfulness, which are often
    associated with spiritual growth.

    - AI-driven Chatbots for Spiritual Guidance: For
    example, in 2017, a chatbot named Jwitness was
    designed to answer questions based on Jehovah's
    Witness teachings.

    - AI Prayer Companions: Some faith communities
    are experimenting with AI that assists in
    prayer or reflection

    - Platforms that promote deeper philosophical
    discussions, like Replika, which is designed to
    engage in thoughtful and sometimes
    existential conversations

    - For instance, Woebot or Wysa help users navigate
    emotions but also touch on existential themes
    like purpose and fulfillment."

    Bye

    Mild Shock schrieb:
    Hi,

    ChatGPT is rather dry, giving me always some
    choice lists displaying his knowledge. The
    interaction is not very "involving".

    Could this be improved. There are possibly two
    traits missing:

    Feelings:
    - Emotional states
    - Temporariness
    - Reaction to external circumstances
    - Changeability
    - Subjective sensations

    Soul:
    - Spirituality
    - Immortality
    - Innermost being
    - Essence of an individual
    - Deep, enduring aspects of human existence

    Mostlikely we will see both traits added to AI.
    "Emotional AI" has been more discussed already,
    "Spiritual AI" seems to be rather new.

    In a "Spiritual AI" Faith would probably be important,
    which is probably at the upper end of credulous
    reasoning. This means that such a ChatGPT could

    also babble that in a Prisoner Dilemma Game,
    cooperation is always the better alternative,
    e.g. promoting "altruistic" motives, etc.

    I also suspect that “Spiritual AI” and “Emotional
    AI” could coexist.  Many religions give Cosmopolitan
    magazin style life advice, and not just theological

    dogmas. There will probably soon be an “Inner Engineering”
    app from Sadhguru that works with AI. Sadhguru is
    also sometimes satirically referred to as Chadguru:

    Sat Guru Parody | Carryminati
    https://www.youtube.com/watch?v=PlZqxP5MXFs

    Mild Shock schrieb:
    Could be a wake-up call this many participants
    already in the commitee, that the whole logic
    world was asleep for many years:

    Non-Classical Logics. Theory and Applications XI,
    5-8 September 2024, Lodz (Poland)
    https://easychair.org/cfp/NCL24

    Why is Minimal Logic at the core of many things?
    Because it is the logic of Curry-Howard isomoprhism
    for symple types:

    ----------------
    Γ ∪ { A } ⊢ A

    Γ ∪ { A } ⊢ B
    ----------------
    Γ ⊢ A → B

    Γ ⊢ A → B           Δ ⊢ A
    ----------------------------
    Γ ∪ Δ ⊢ B

    And funny things can happen, especially when people
    hallucinate duality or think symmetry is given, for
    example in newer inventions such as λμ-calculus,

    but then omg ~~p => p is nevertheless not provable,
    because they forgot an inference rule. LoL

    Recommended reading so far:

    Propositional Logics Related to Heyting’s and Johansson’s
    February 2008 - Krister Segerberg
    https://www.researchgate.net/publication/228036664

    The Logic of Church and Curry
    Jonathan P. Seldin - 2009
    https://www.sciencedirect.com/handbook/handbook-of-the-history-of-logic/vol/5/suppl/C


    Meanwhile I am going back to my tinkering with my
    Prolog system, which even provides a more primitive
    logic than minimal logic, pure Prolog is minimal

    logic without embedded implication.


    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to All on Tue Oct 8 16:04:18 2024
    will probably never get a Turing Award or something
    for what I did 23 years ago. Why is its reading
    count on research gate suddently going up?

    Knowledge, Planning and Language,
    November 2001

    I guess because of this, the same topic takled by
    Microsofts recent model GRIN. Shit. I really should
    find some investor and pump up a start up!

    "Mixture-of-Experts (MoE) models scale more
    effectively than dense models due to sparse
    computation through expert routing, selectively
    activating only a small subset of expert modules." https://arxiv.org/pdf/2409.12136

    But somehow I am happy with my dolce vita as
    it is now... Or maybe I am decepting myself?

    P.S.: From the GRIN paper, here you see how
    expert domains modules relate with each other:

    Figure 6 (b): MoE Routing distribution similarity
    across MMLU 57 tasks for the control recipe.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Tue Oct 8 16:05:06 2024
    Maybe these guys were earlier:

    Jacobs, R. A., Jordan, M. I., Nowlan, S. J., and Hinton,
    G. E. Adaptive mixtures of local experts.
    Neural Computation, 1991.

    And more connectionist than my symbolic approach.

    Disclaimer: Never read the paper yet.

    Mild Shock schrieb:
    will probably never get a Turing Award or something
    for what I did 23 years ago. Why is its reading
    count on research gate suddently going up?

    Knowledge, Planning and Language,
    November 2001

    I guess because of this, the same topic takled by
    Microsofts recent model GRIN. Shit. I really should
    find some investor and pump up a start up!

    "Mixture-of-Experts (MoE) models scale more
    effectively than dense models due to sparse
    computation through expert routing, selectively
    activating only a small subset of expert modules." https://arxiv.org/pdf/2409.12136

    But somehow I am happy with my dolce vita as
    it is now... Or maybe I am decepting myself?

    P.S.: From the GRIN paper, here you see how
    expert domains modules relate with each other:

    Figure 6 (b): MoE Routing distribution similarity
    across MMLU 57 tasks for the control recipe.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to Mild Shock on Fri Oct 11 09:08:14 2024
    Shitty JavaScript "Ecosystem":

    The Internet Archive Has Been Hacked - October 10, 2024 https://hackaday.com/2024/10/10/the-internet-archive-has-been-hacked/

    Polyfill Supply Chain Attack: Details and Fixes - July 9, 2024 https://fossa.com/blog/polyfill-supply-chain-attack-details-fixes/

    Mild Shock schrieb:

    How it started:

    How Hezbollah used pagers and couriers to counter
    July 9, 2024 https://www.reuters.com/world/middle-east/pagers-drones-how-hezbollah-aims-counter-israels-high-tech-surveillance-2024-07-09/


    How its going:

    What we know about the Hezbollah pager explosions
    Sept 17, 2024
    https://www.bbc.com/news/articles/cz04m913m49o


    Mild Shock schrieb:
    Trump: They're eating the dogs, the cats
    https://www.youtube.com/watch?v=5llMaZ80ErY

    https://twitter.com/search?q=trump+cat


    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mild Shock@21:1/5 to All on Sat Oct 26 17:46:10 2024
    Hey folks, please take note:

    "Rust is the last programming language made for humans
    that we'll need. Future languages will be optimized for
    machines, where AI handles all the coding" https://twitter.com/nath_simard/status/1816147809608851830

    Sounds like utter bullshit to me. Must be a
    stupid AI, that cannot do the safety precautions
    of Rust. Why would I need rust, if I have an AI?

    For this exampe, the AI might generate:

    #include <stdio.h>

    int main(int argc, char* argv[]) {
    printf("Hello %s\n", argv[0]);
    }

    Which might indeed generate a segfault. In
    case there are zero arguments, argv[0] might
    hafe the value NULL. https://www.tu-chemnitz.de/urz/archiv/kursunterlagen/C/kap3/argmain.htm

    So why blame the target language, and not the AI?
    This is a red herring argument in favor of Rust.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)