A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Some Properties of Pseudo-Complements of Recursively Enumerable Sets

1966
*
Transactions of the American Mathematical Society
*

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 formula which truly expresses that n0$S where n0 is an integer and S a nonrecursive recursively enumerable set. Thus, we are led to consider

doi:10.2307/1994480
fatcat:dlo6ssfwzbendnzqjzd6f4775i