首页 | 本学科首页   官方微博 | 高级检索  
     


Note on Some Fixed Point Constructions in Provability Logic
Authors:Per Lindström
Affiliation:(1) Gatan 3, S-448 50 Tollered, Sweden
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
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号