Location of Repository

Explicit fixed points in interpretability logic

By D. de Jongh and A. Visser

Abstract

The basic theorems of Provability Logic arethree in number. First is the Arithmetical Completeness\ud Theorem. The second place is shared by the theorems affirming the Uniqueness of Fixed Points and\ud the Explicit Definability of Fixed Points. In this paper we consider the problem of Uniqueness and:\ud Explicit Definability of Fixed Points for Interpretability Logic. It turns out that Uniqueness is an\ud immediate corollary of a theorem of Smoryriski, so. most of the paper, is devoted to proving Explicit\ud Definability.The basic theorems of Provability Logic arethree in number. First is the Arithmetical Completeness\ud Theorem. The second place is shared by the theorems affirming the Uniqueness of Fixed Points and\ud the Explicit Definability of Fixed Points. In this paper we consider the problem of Uniqueness and:\ud Explicit Definability of Fixed Points for Interpretability Logic. It turns out that Uniqueness is an\ud immediate corollary of a theorem of Smoryriski, so. most of the paper, is devoted to proving Explicit\ud Definability

Topics: Wijsbegeerte
Year: 1989
OAI identifier: oai:dspace.library.uu.nl:1874/26418
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://dspace.library.uu.nl:80... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.