Publications
The university provides a database of the publications created at the KGRC since 2005. You can browse the database online here.
Showing entries 361 - 380 out of 529
2012
Miller B. Incomparable treeable equivalence relations. Journal of Mathematical Logic. 2012;12(1):121-162. doi: 10.1142/S0219061312500043
Friedman SD, Golshani Gharyeali M. Independence of higher Kurepa hypotheses. Archive for Mathematical Logic. 2012;51(5-6):621-633.
Fokina E, Friedman SD, Harizanov V, Knight J, McCoy C, Montalban A. Isomorphism relations on computable structures. Journal of Symbolic Logic. 2012;77(1):122-132.
Aschenbrenner M. Logarithms of iteration matrices, and proof of a conjecture by
Shadrin and Zvonkine. Journal of Combinatorial Theory, Series A. 2012;119(§):627-654. doi: 10.1016/j.jcta.2011.11.008
Friedman SD, Hyttinen T. On Borel Equivalence Relations In Generalized Baire Space. Archive for Mathematical Logic. 2012;51(3-4):299-304. doi: 10.1007/s00153-011-0266-3
Fokina E, Friedman SD. On Sigma 1 1 equivalence relations over the natural numbers. Mathematical Logic Quarterly. 2012;58(1-2):113-124.
Motto Ros L. On the complexity of the relations of isomorphism and bi-embeddability. Proceedings of the American Mathematical Society. 2012;140:309-323.
Repovs D, Zdomskyy L. On the Menger covering property and D-Spaces. Proceedings of the American Mathematical Society. 2012;140(3):1069-1074.
Brendle JD, Khomskii Y. Polarized partitions on the second level of the projective hierarchy. Annals of Pure and Applied Logic. 2012;163:1345-1357.
Fischer V, Friedman SD, Tornquist A. Projective maximal families of orthogonal measures with large continuum. Journal of Logic and Analysis. 2012;4(9):1-15.
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
Coskey S, Hamkins JD, Miller R. The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility. Computability: The journal of the Association Computability in Europe. 2012;1(1):15-38.
Medini A, Milovich D. The topology of ultrafilters as subspaces of 2^omega. Topology and Its Applications: a journal devoted to general, geometric, set-theoretic and algebraic topology. 2012;159(5):1318-1333. doi: 10.1016/j.topol.2011.12.009
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
Miller B. A classical proof of the Kanovei-Zapletal canonization. Contemporary Mathematics (CONM). 2011;533:281-285.
Showing entries 361 - 380 out of 529