1. Forum
  2. USENET
  3. comp.theory

  • Re: on ignoring the undecidable --- proof theoretic semantics

    From olcott@polcott333@gmail.com to sci.logic,comp.theory,sci.math on Mon Feb 9 19:37:21 2026
    From Newsgroup: comp.theory

    On 2/9/2026 10:43 AM, Tristan Wibberley wrote:
    On 09/02/2026 14:57, Mikko wrote:
    Logic is not paralyzed. Separating semantics from inference rules
    ensures that semantic problems don't affect the study of proofs
    and provability.

    Would you agree that inference rules are a formalisation of some semantics.

    a) in a sense
    b) yes, properly

    ?

    And then a syntactical system is one in which there remains no
    unformalised semantics (or, indeed, pragmatics), not even identification
    of thought objects.


    Completely replacing the foundation of truth conditional
    semantics with proof theoretic semantics then an expression
    is "true on the basis of meaning expressed in language"
    only to the extent that its meaning is entirely comprised
    of its inferential relations to other expressions of that
    language.
    --
    Copyright 2026 Olcott<br><br>

    My 28 year goal has been to make <br>
    "true on the basis of meaning expressed in language"<br>
    reliably computable for the entire body of knowledge.<br><br>

    This required establishing a new foundation<br>
    --- Synchronet 3.21b-Linux NewsLink 1.2