Skip to main content

2017 | OriginalPaper | Buchkapitel

On the Semantics of Intensionality

verfasst von : G. A. Kavvos

Erschienen in: Foundations of Software Science and Computation Structures

Verlag: Springer Berlin Heidelberg

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this paper we propose a categorical theory of intensionality. We first revisit the notion of intensionality, and discuss 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 Čubrić, 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ödel numberings. The outcome is a unifying framework in which classic results of Kleene, Gödel, 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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
That is, a symmetric and transitive relation.
 
2
Bear in mind that this definition of the lifted assembly does not work if the PCA is total. We are mostly interested in the decidedly non-total PCA \(K_1\), so this is not an issue. There are other, more involved ways of defining the lifted assembly; see [20] in particular.
 
3
But note that this is not the complete story, as there is no guarantee that the fixed point obtained in least, which is what Kleene’s original proof in [15] gives. See also [13].
 
Literatur
1.
Zurück zum Zitat Abramsky, S.: Intensionality, definability and computation. In: Baltag, A., Smets, S. (eds.) Johan van Benthem on Logic and Information Dynamics. OCL, vol. 5, pp. 121–142. Springer, Cham (2014). doi:10.1007/978-3-319-06025-5_5 Abramsky, S.: Intensionality, definability and computation. In: Baltag, A., Smets, S. (eds.) Johan van Benthem on Logic and Information Dynamics. OCL, vol. 5, pp. 121–142. Springer, Cham (2014). doi:10.​1007/​978-3-319-06025-5_​5
9.
Zurück zum Zitat Cutland, N.: Computability: An Introduction to Recursive Function Theory. Cambridge University Press, Cambridge (1980)MATH Cutland, N.: Computability: An Introduction to Recursive Function Theory. Cambridge University Press, Cambridge (1980)MATH
15.
Zurück zum Zitat Kleene, S.C.: Introduction to Metamathematics. North-Holland, Amsterdam (1952)MATH Kleene, S.C.: Introduction to Metamathematics. North-Holland, Amsterdam (1952)MATH
18.
Zurück zum Zitat Longley, J.R.: Notions of computability at higher types I. In: Logic Colloquium 2000: Proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic. Lecture Notes in Logic, 23–31 July Paris, France, vol. 19, pp. 32–142. A. K. Peters (2005) Longley, J.R.: Notions of computability at higher types I. In: Logic Colloquium 2000: Proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic. Lecture Notes in Logic, 23–31 July Paris, France, vol. 19, pp. 32–142. A. K. Peters (2005)
24.
Zurück zum Zitat Smullyan, R.M.: Gödel’s Incompleteness Theorems. Oxford University Press, New York (1992)MATH Smullyan, R.M.: Gödel’s Incompleteness Theorems. Oxford University Press, New York (1992)MATH
Metadaten
Titel
On the Semantics of Intensionality
verfasst von
G. A. Kavvos
Copyright-Jahr
2017
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/978-3-662-54458-7_32

Premium Partner