Publications

The university provides a database of the publications created at the KGRC since 2005. You can browse the database online here.


2012


Müller M, Flum J. Some definitorial suggestions for parameterized proof complexity. In 7th International Symposium on Parameterized and Exact Computation (IPEC), Lecture Notes in Computer Science, 7535.. 2012. p. 73-84

Friedman SD, Honzík R. Supercompactness and failures of GCH. Fundamenta Mathematicae. 2012;219(1-2):15-36. doi: 10.4064/fm219-1-2

Carson J, Fokina E, Harizanov V, Knight J, Quinn SM, Safranski C et al. The computable embedding problem. Algebra and Logic. 2012;50(6):478-493. doi: 10.1007/s10469-012-9160-2

Miller B. The graph-theoretic approach to descriptive set theory. Bulletin of Symbolic Logic. 2012;18(4):554-575. doi: 10.2178/bsl.1804030

Friedman SD. The Stable Core. Bulletin of Symbolic Logic. 2012;18(2):261-267.

2011


Welch P. Weak systems of Determinacy and Quasi-Inductive definitions. Journal of Symbolic Logic. 2011 May 19;76(2):418-436. doi: 10.2178/jsl/1305810756


Caicedo A, Friedman SD. Bpfa and projective well-orderings of the reals. Journal of Symbolic Logic. 2011;76(4):1126-1136.

Fokina E, Knight J, Melnikov AG, Quinn SM, Safranski C. Classes of Ulm type and coding rank-homogeneous trees in other structures. Journal of Symbolic Logic. 2011;76(3):846-869.

Friedman SD, Holy P. Condensation and Large Cardinals. Fundamenta Mathematicae. 2011;215(2):133-166.

Müller M, Chen Y, Flum J. Consistency and optimality. In Proceedings of the 7th Computability in Europe (CiE), Lecture Notes in Computer Science 6735,. Springer. 2011. p. 61-70

Caicedo A, Clemens J, Conley C, Miller B. Definability of small puncture sets. Fundamenta Mathematicae. 2011;215(1). doi: 10.4064/fm215-1-2