home bbs files messages ]

Forums before death by AOL, social media and spammers... "We can't have nice things"

   comp.ai.philosophy      Perhaps we should ask SkyNet about this      59,235 messages   

[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]

   Message 59,050 of 59,235   
   olcott to Tristan Wibberley   
   Systems such as PA with proof-theoretic    
   15 Jan 26 18:24:12   
   
   XPost: sci.logic, sci.math, comp.theory   
   From: polcott333@gmail.com   
      
   On 1/15/2026 5:10 PM, Tristan Wibberley wrote:   
   > I understand a schematic system is one whose deduction rules or,   
   > perhaps, inference rules (if there's a difference) are specified as   
   > axioms of the same system.   
   >   
   > 1. Can that be a syntactical system or a formal system just as well and   
   > still be called a schematic system?   
   >   
   > 2. Suppose it's a positive intuitionist system, what are the most   
   > notable things to consider vis-a-vis extensions?   
   >   
      
   A formal system anchored in proof-theoretic semantics   
   with PA as its axioms expresses all of PA and is not   
   incomplete.   
      
      
   --   
   Copyright 2026 Olcott

              My 28 year goal has been to make
       "true on the basis of meaning expressed in language"
       reliably computable.

              This required establishing a new foundation
              --- SoupGate-Win32 v1.05        * Origin: you cannot sedate... all the things you hate (1:229/2)   

[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]


(c) 1994,  bbs@darkrealms.ca