Note on Some Fixed Point Constructions in Provability Logic

Author: Lindström, Per1

Source: Journal of Philosophical Logic, Volume 35, Number 3, June 2006 , pp. 225-230(6)

Publisher: Springer

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content

Abstract:

We present a quite simple proof of the fixed point theorem for GL. We also use this proof to show that Sambin's algorithm yields a fixed point.

Keywords: fixed point; GL; Sambin's algorithm

Document Type: Research article

DOI: 10.1007/s10992-005-9013-8

Affiliations: 1: Email: per.lindstrom@mbox334.swipnet.se

The full text electronic article is available for purchase. You will be able to download the full text electronic article after payment.

$47.00 plus tax      Refund Policy

 

OR

Back to top

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages.
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A