George Boolos; IX*—Saving Frege from Contradiction, Proceedings of the Aristotelian Society, Volume 87, Issue 1, 1 June 1987, Pages 137–152, https://doi.org/10.

This is the only complete logic for properties, relations, and propositions (PRPS) that has been formulated to date. First, an intensional abstraction operation is adjoined to first-order quantifier logic, Then, a new algebraic semantic method is developed. The heuristic used is not that of possible worlds but rather that of PRPS taken at face value. Unlike the possible worlds approach to intensional logic, this approach yields a logic for intentional (psychological) matters, as well as modal matters. At the close of (...) the paper, the origin of incompleteness in logic is investigated. The culprit is found to be the predication relation, a relation on properties and relations that is expressed in natural language by the copula. (shrink)

§ i. After deserting for a time the old Euclidean standards of rigour, mathematics is now returning to them, and even making efforts to go beyond them. ...

We trace self-reference phenomena to the possibility of naming functions by names that belong to the domain over which the functions are defined. A naming system is a structure of the form ,{ }), where D is a non-empty set; for every a∈ D, which is a name of a k-ary function, {a}: Dk → D is the function named by a, and type is the type of a, which tells us if a is a name and, if it is, (...) the arity of the named function. Under quite general conditions we get a fixed point theorem, whose special cases include the fixed point theorem underlying Gödel's proof, Kleene's recursion theorem and many other theorems of this nature, including the solution to simultaneous fixed point equations. Partial functions are accommodated by including “undefined” values; we investigate different systems arising out of different ways of dealing with them. Many-sorted naming systems are suggested as a natural approach to general computatability with many data types over arbitrary structures. The first part of the paper is a historical reconstruction of the way Gödel probably derived his proof from Cantor's diagonalization, through the semantic version of Richard. The incompleteness proof–including the fixed point construction–result from a natural line of thought, thereby dispelling the appearance of a “magic trick”. The analysis goes on to show how Kleene's recursion theorem is obtained along the same lines. (shrink)

[Translation of Frege's 'Gedankengefüge' (1923)].