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


Reflection of Long Game Formulas
Authors:Heikki Heikkil  ,Jouko V    n  nen
Affiliation:Heikki Heikkilä,Jouko Väänänen
Abstract:We study game formulas the truth of which is determined by a semantical game of uncountable length. The main theme is the study of principles stating reflection of these formulas in various admissible sets. This investigation leads to two weak forms of strict-II11 reflection (or ∑1-compactness). We show that admissible sets such as H2) and Lω2 which fail to have strict-II11 reflection, may or may not, depending on set-theoretic hypotheses satisfy one or both of these weaker forms. Mathematics Subject Classification : 03C70, 03C75.
Keywords:Game quantifiers  Admissible sets  Infinitary logic
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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