Some Properties of Pseudo-complements of Recursively Enumerable Sets

  • ROBERT A. DI PAOLAi
  • Published 2010

Abstract

Introductory remarks. Those first order systems which exhibit some real mathematical pretensions fall into what is called in [1] the class of arithmetical logics; it is there demonstrated that that any oj-consistent and adequate arithmetical logic is incomplete and brought out that the undecidable sentence can always be taken to be a closed well-formed… (More)

Topics

  • Presentations referencing similar topics