Search Results for ""

Curry (1977, p. 5) uses the term pseudoparadox to describe an apparent paradox, such as the catalogue paradox, for which there is no underlying actual contradiction.

Even though real arithmetic is uncountable, it possesses a countable "model."

A paradox or contradiction.

The process of taking the complement of a set or truth function. In the latter case, complementation is equivalent to the NOT operation.

There are several versions of the Berry paradox, the original version of which was published by Bertrand Russell and attributed to Oxford University librarian Mr. G. Berry. ...

The set of all sets is its own power set. Therefore, the cardinal number of the set of all sets must be bigger than itself.

A reduction system is said to posses the Church-Rosser property if, for all x and y such that x<->_*y, there exists a z such that x->_*z and y->_*z. A reduction system is ...

The Church-Rosser theorem states that lambda calculus as a reduction system with lambda conversion rules satisfies the Church-Rosser property.

Let x->y and u->v be two rules of a term rewriting system, and suppose these rules have no variables in common. If they do, rename the variables. If x_1 is a subterm of x (or ...

The cut elimination theorem, also called the "Hauptsatz" (Gentzen 1969), states that every sequent calculus derivation can be transformed into another derivation with the ...