Indestructibility, measurability, and degrees of supercompactness
- 作者Arthur W. Apter
- 卷第58卷
- 印刷ISSN0942-5616
- 电子ISSN1521-3870
- 文件大小141.75KB
- 发表时间2012
- DOI10.1002/malq.201020097
- 页码75-82
同作者推荐
Simple monadic theories and indiscerniblesAchim Blumensath · 2011
Axiomatising Tree-Interpretable StructuresAchim Blumensath · Theory of Computing Systems · 2004
Recognisability for algebras of infinite treesAchim Blumensath · 2011
A model-theoretic characterisation of clique widthAchim Blumensath · 2006
Linear temporal logic for regular cost functionsBlumensath, Achim; Otto, Martin; Weyer, Mark · Logical Methods in Computer Science · 2014
An algebraic proof of Rabin’s Tree TheoremBlumensath, Achim · Theoretical Computer Science · 2013
A syntactic congruence for languages of birooted treesBlumensath, Achim; Janin, David · Semigroup Forum · 2015