[Paper Review] On the Semantics of Intensionality and Intensional Recursion

G. A. Kavvos|arXiv (Cornell University)|Dec 26, 2017

Logic, programming, and type systems130 references3 citations

TL;DR

This paper introduces a formal framework for modeling intensionality and intensional recursion using a modal lambda calculus called Intensional PCF, enriched with Löb's rule. It establishes a semantics via P-categories and exposures—abstract structures based on Gödel numberings, realizability, and homological algebra—providing abstract analogues of key results in computability, such as Gödel's Incompleteness Theorem and Rice's Theorem.

ABSTRACT

Intensionality is a phenomenon that occurs in logic and computation. In the most general sense, a function is intensional if it operates at a level finer than (extensional) equality. This is a familiar setting for computer scientists, who often study different programs or processes that are interchangeable, i.e. extensionally equal, even though they are not implemented in the same way, so intensionally distinct. Concomitant with intensionality is the phenomenon of intensional recursion, which refers to the ability of a program to have access to its own code. In computability theory, intensional recursion is enabled by Kleene's Second Recursion Theorem. This thesis is concerned with the crafting of a logical toolkit through which these phenomena can be studied. Our main contribution is a framework in which mathematical and computational constructions can be considered either extensionally, i.e. as abstract values, or intensionally, i.e. as fine-grained descriptions of their construction. Once this is achieved, it may be used to analyse intensional recursion.

Motivation & Objective

• To develop a logical and categorical toolkit for analyzing intensionality in computation, where functions are sensitive to syntactic or operational differences beyond extensional equality.
• To formalize intensional recursion—where programs can access their own code—using type-theoretic and categorical structures.
• To provide a semantics for Intensional PCF that captures intensional behavior through P-categories and exposure structures.
• To establish abstract analogues of classical results in computability and logic (e.g., Gödel’s Theorem, Tarski’s Theorem) within the proposed framework.
• To unify diverse intensional phenomena—Gödel numberings, realizability, homological algebra—under a common categorical abstraction via exposures.

Proposed method

• Constructing Intensional PCF, a modal lambda calculus with non-functional operations at modal types and Löb's rule to capture intensional recursion.
• Introducing P-categories as a generalization of 1-categories to support intensional reasoning, overcoming limitations of standard category theory.
• Defining exposures as P-categorical structures that abstract well-behaved intensional devices, with three concrete examples: Gödel numberings, realizability, and homological algebra.
• Using exposures to define intensional fixed points, enabling the analysis of self-referential and recursive constructions in a categorical setting.
• Interpreting the Löb rule in the P-category of assemblies over the PCA $K_1$, linking it to Kleene's Second Recursion Theorem.
• Establishing consistency of the system via a confluence argument for Intensional PCF.

Experimental results

Research questions

• RQ1 How can intensionality—where programs are distinguished by implementation rather than output—be formally captured in a type-theoretic framework?
• RQ2 What categorical structures are necessary to support intensional recursion, where a program can access its own code?
• RQ3 Can abstract analogues of classical results in computability (e.g., Gödel’s Incompleteness Theorem) be derived in a categorical setting?
• RQ4 How can diverse intensional phenomena—Gödel numberings, realizability, homological algebra—be unified under a single abstract framework?
• RQ5 What semantics can be given to Intensional PCF that validates the Löb rule as a categorical realization of Kleene’s Second Recursion Theorem?

Key findings

• Intensional PCF, a modal lambda calculus with Löb’s rule, is consistent, as shown by a confluence argument.
• P-categories are necessary for modeling intensionality, as standard 1-category theory is insufficient to capture fine-grained intensional distinctions.
• Exposures provide a unifying categorical abstraction for diverse intensional devices, with three concrete realizations: Gödel numberings, realizability theory, and homological algebra.
• The Löb rule in Intensional PCF is semantically interpreted as Kleene’s Second Recursion Theorem when the calculus is modeled in the P-category of assemblies over the PCA $K_1$.
• The framework yields abstract analogues of classic intensional results, including Gödel’s Incompleteness Theorem, Tarski’s Undefinability Theorem, and Rice’s Theorem.
• The theory of exposures provides a solid foundation for a general theory of intensionality, enabling systematic analysis of self-referential and recursive constructions in logic and computation.