Forums before death by AOL, social media and spammers... "We can't have nice things"
|    sci.logic    |    Logic -- math, philosophy & computationa    |    262,912 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 262,549 of 262,912    |
|    olcott to Tristan Wibberley    |
|    Re: Systems such as PA with proof-theore    |
|    15 Jan 26 19:18:36    |
      XPost: sci.math, comp.theory, comp.ai.philosophy       From: polcott333@gmail.com              On 1/15/2026 6:47 PM, Tristan Wibberley wrote:       > On 16/01/2026 00:24, olcott wrote:       >> 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.       >       > Well done, have a cookie.       >              My system anchored in proof-theoretic semantics fulfills       My 28 year goal has been to make       "true on the basis of meaning expressed in language"       ALWAYS reliably computable.              --       Copyright 2026 Olcott |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca