On the semantics of intensionality

DOI10.1007/978-3-662-54458-7_32MaRDI QIDQ2988392zbMATH OpenOpenAlexFDO

Authors G. A. Kavvos

Publication date 19 May 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1602.01365

Mathematics Subject Classification ID

Categorical logic, topoi (03G30) Definitions and generalizations in theory of categories (18A05)

Abstract: In this paper we propose a categorical theory of intensionality. We first revisit the notion of intensionality, and discuss we its relevance to logic and computer science. It turns out that 1-category theory is not the most appropriate vehicle for studying the interplay of extension and intension. We are thus led to consider the P-categories of v{C}ubri'{c}, Dybjer and Scott, which are categories only up to a partial equivalence relation (PER). In this setting, we introduce a new P-categorical construct, that of exposures. Exposures are very nearly functors, except that they do not preserve the PERs of the P-category. Inspired by the categorical semantics of modal logic, we begin to develop their theory. Our leading examples demonstrate that an exposure is an abstraction of well-behaved intensional devices, such as G"odel numberings. The outcome is a unifying framework in which classic results of Kleene, G"odel, Tarski and Rice find concise, clear formulations, and where each logical device or assumption involved in their proofs can be expressed in the same algebraic manner.

Recommendations

• scientific article; zbMATH DE number 431759
• Intensionality, definability and computation
• scientific article; zbMATH DE number 554485
• A note on intensionalization
• scientific article; zbMATH DE number 3939314

Cites work

• A judgmental reconstruction of modal logic
• A modal analysis of staged computation
• A uniform approach to domain theory in realizability models
• Categorical simulations
• Diagonal arguments and Cartesian closed categories (with author commentary)
• Higher-order computability
• scientific article; zbMATH DE number 3900744 (Why is no real title available?)
• scientific article; zbMATH DE number 3700811 (Why is no real title available?)
• scientific article; zbMATH DE number 53543 (Why is no real title available?)
• scientific article; zbMATH DE number 2204752 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• Intensionality, definability and computation
• Introduction to generalized type systems
• Introduction to Turing categories
• Normalization and the Yoneda embedding
• On an intuitionistic modal logic
• On notation for ordinal numbers
• Realizability. An introduction to its categorical side
• The Logic of Provability

Cited in

(5)

• Expressiveness of concurrent intensionality
• A note on intensionalization
• Validity in intensional languages: A new approach
• Intensionality, definability and computation
• On denotational versus predicative semantics

Describes a project that uses

Uses Software

• MiniML

This page was built for publication: On the semantics of intensionality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988392)