Home >> Journal of Philosophical Logic, Volume 35, Number 3

Note on Some Fixed Point Constructions in Provability Logic

Author: Lindström, Per

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

Publisher: Springer

Buy & download fulltext article:

OR

Price: $47.00 plus tax (Refund Policy)

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: http://dx.doi.org/10.1007/s10992-005-9013-8

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

Publication date: 2006-06-01

Related content
Marked list

Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content

Text size:

A | A | A | A
^ Back to top
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page