Publications
The university provides a database of the publications created at the KGRC since 2005. You can browse the database online here.
Showing entries 301 - 320 out of 522
2014
Honzik R, Friedman SD, Cody B. Easton functions and supercompactness. Fundamenta Mathematicae. 2014;226(3):279-296. doi: 10.4064/fm226-3-6
Kulikov V, Friedman SD. Failures of the Silver Dichotomy in the Generalised Baire Space. Journal of Symbolic Logic. 2014.
Ternullo C, sergioli G. Fallacious Analogical Reasoning and the Metaphoric Fallacy to a Deductive Inference (MFDI). Isonomia. 2014;5:159-178.
Friedman SD, Hyttinen T, Kulikov V. Generalized Descriptive Set Theory and Classification Theory. Memoirs of the American Mathematical Society. 2014;230(1081). Epub 2013 Dec 16. doi: 10.1090/memo/1081
Turetsky D, Lempp S, Miller J, Weber R, Ng KM. Lowness for Effective Hausdorff Dimension. Journal of Mathematical Logic. 2014;14(2):1450011. doi: 10.1142/S0219061314500111
Müller M, Chen H. One hierarchy spawns another: graph deconstructions and the complexity classification of conjunctive queries. In Proceedings of the Joint Meeting of the 23rd EACSL Annual Conference on Computer Science Logic, CSL 2014 and the 29th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2014: Vienna, Austria — July 14 - 18, 2014. Association for Computing Machinery (ACM). 2014. 32 doi: 10.1145/2603088.2603107
Kulikov V. The Class of Purely Unrectifiable Sets in $\ell_2$ is $\Pi^1_1$-complete. Real Analysis Exchange. 2014;39(2):323-334.
Friedman SD. The completeness of isomorphism. Ontos Mathematical Logic. 2014;4:157-164. doi: 10.1515/9781614518044.157
2013
Müller M, Montoya JA. Parameterized random complexity. Theory of Computing Systems. 2013 Feb;52(2):221-270. doi: 10.1007/s00224-011-9381-0
Diamondstone D, Greenberg N, Turetsky D. A Van Lambalgen Theorem for Demuth Randomness. In Proceedings of the 12th Asian Logic Colloquium. World Scientific Publishing Co. Pte. Ltd. 2013. p. 115-124
Schröder M. Admissible Kleene-Kreisel-based Representations. 2013. Paper presented at Computability and Complexity in Analysis, Nancy, France.
Müller M, Chen H. An algebraic preservation theorem for Aleph_0 categorical quantified constraint satisfaction. Logical Methods in Computer Science. 2013;9(1):1-23. 15. doi: 10.2168/LMCS-9(1:15)2013
Aspero D, Friedman SD, Mota MA, Sabok M. Baumgartner's conjecture and bounded forcing axioms. Annals of Pure and Applied Logic. 2013;164(12):1178-1186. doi: 10.1016/j.apal.2013.06.006
Kulikov V. Borel reductions and cub games in generalised descriptive set theory. Journal of Symbolic Logic. 2013;78(2):439-458.
Fischer V, Friedman SD, Zdomskyy L. Cardinal characteristics, projective wellorders and large continuum. Annals of Pure and Applied Logic. 2013;164:763-770.
Fokina E, Friedman SD, Knight J, Miller R. Classes of computable structures with universe a subset of $\omega_1$. Journal of Logic and Computation. 2013;23(6):1249-1265.
Fischer V, Friedman SD, Khomskii Y. Co-analytic MAD families and definable wellorders. Archive for Mathematical Logic. 2013;52:809-822.
Downey R, Kach A, Lempp S, Turetsky D. Computable Categoricity Versus Relative Computable Categoricity. Fundamenta Mathematicae. 2013;221(2).
Müller M, Flum J, Chen Y. Consistency, optimality and incompleteness. Annals of Pure and Applied Logic. 2013;164(12):1224-1235.
Friedman SD. Equivalence relations in set theory, computation theory, model theory and complexity theory. In Tennant N, editor, Foundational Adventures: Essays in Honor of Harvey M. Friedman. 2013
Showing entries 301 - 320 out of 522