Summary
Paradox is a logical phenomenon. Usually, it is produced in type theory, on a type Ω of “truth values”. A formula Ψ (i.e., a term of type Ω) is presented, such that Ψ↔¬Ψ (with negation as a term¬∶Ω→Ω)-whereupon everything can be proved:
In Sect. 1 we describe a general pattern which many constructions of the formula Ψ follow: for example, the well known arguments of Cantor, Russell, and Gödel. The structure uncovered behind these paradoxes is generalized in Sect. 2. This allows us to show that Reynolds' [R] construction of a typeA ≃℘℘A in polymorphic λ-calculus cannot be extended, as conjectured, to give a fixed point ofevery variable type derived from the exponentiation: for some (contravariant) types, such a fixed point causes a paradox.
Pursueing the idea that
the language of categories appears here as a natural medium for logical structures. It allows us to abstract from the specific predicates that appear in particular paradoxes, and to display the underlying constructions in “pure state”. The essential role of cartesian closed categories in this context has been pointed out in [L]. The paradoxes studied here remain within the limits of the cartesian closed structure of types, as sketched in this Lawvere's seminal paper — and do not depend on any logical operations on the type Ω. Our results can be translated in simply typed λ-calculus in a straightforward way (although some of them do become a bit messy).
Similar content being viewed by others
References
[L] Lawvere, F.W.: Diagonal arguments and cartesian closed categories. In: Hilton, P. (ed.) Category Theory, Homology Theory and their Applications II. (Lect. Notes Math., vol. 92, pp. 134–145) Berlin Heidelberg New York: Springer 1969
[LSc] Lambek, J., Scott, P.J.: Introduction to higher categorical logic. Camb. Stud. Adv. Math.7 (1986)
[P] Pavlović, D.: On structure of paradoxes. Preprint No. 570. Dept. of Mathematics, State University Utrecht 1989
[R] Reynolds, J.C.: Polymorphism is not set-theoretic. Semantics of data types. Lect. Notes Comput. Sci.173, 145–156 (1984)
[RP] Reynolds, J. C., Plotkin, G.: On functors expressible in the polymorphic typed lambda calculus. In: Huet, G. (ed.) Logical foundations of functional programming. Addison Wesley: Reading, Mass. 1990, pp. 127–152
[S] Smorynski, C.: Self-reference and modal logic. Universitext. Berlin Heidelberg New York: Springer 1985
[TvD] Troelstra, A.S., van Dalen, D.: Constructivism in mathematics. An introduction, Stud. Logic Found. Math., vols. 121, 123 (1988)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Pavlović, D. On the structure of paradoxes. Arch Math Logic 31, 397–406 (1992). https://doi.org/10.1007/BF01277482
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01277482