Publications

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

Showing entries 421 - 440 out of 520

2010

Hrusak M, Meza-Alcantara D, Minami H. Pair-splitting, pair-reaping and cardinal invariants of F-ideals. Journal of Symbolic Logic. 2010;75(2):661-677.
Friedman S-D, Zdomskyy L. Projective mad families. Annals of Pure and Applied Logic. 2010;161:1581-1587.
Thompson K. Small universal families for graphs omitting cliques without gch. Archive for Mathematical Logic. 2010;49(7):799-811.
Dobrinen N, Friedman S-D. The consistency strength of the tree property at the double successor of a measurable. Fundamenta Mathematicae. 2010;208:123-153.
Fokina E, Friedman S-D, Törnquist AD. The effective theory of Borel equivalence relations. Annals of Pure and Applied Logic. 2010;161(7):837-850.
Sasyk R, Törnquist AD. Turbulence and araki-woods factors. Journal of Functional Analysis. 2010;259(9):2238-2252.

2009

Adler H. A geometric introduction to forking and thorn-forking. Journal of Mathematical Logic. 2009;9(1):1-20. doi: 10.1142/S0219061309000811
Motto Ros L. A new characterisation of the Baire class 1 functions. Real Analysis Exchange. 2009;34(1):29-48.
Thompson K, Friedman S-D. An inner model for global domination. Journal of Symbolic Logic. 2009;(74 / 1):251-264.
Törnquist AD, Sasyk R. Borel reducibility and classification of von Neumann algebras. Bulletin of Symbolic Logic. 2009;15(2):169-183.
Motto Ros L. Borel-amenable reducibilities for sets of reals. Journal of Symbolic Logic. 2009;(74 / 1):27-49.
Welch P. Characteristics of discrete transfinite time Turing machine models: halting times, stabilization times, and normal form theorems. Theoretical Computer Science. 2009;410:426-442.
Mildenberger H. Creatures on $\omega_1$ and weak diamonds. Journal of Symbolic Logic. 2009;(74 / 1):1-16.
Kellner J, Shelah S. Decisive creatures and large continuum. Journal of Symbolic Logic. 2009;74(1):73-104. doi: 10.2178/jsl/1231082303
Törnquist AD, Weiss W. Definable Davies' theorem. Fundamenta Mathematicae. 2009;205(1):77-89.
Miller B. Ends of graphed equivalence relations, I. Israel Journal of Mathematics. 2009;169:375-392.
Greg H, Miller B. Ends of graphed equivalence relations, II. Israel Journal of Mathematics. 2009;169:393-415.
Fokina E, Friedman S-D. Equivalence relations on classes of computable structures. Lecture Notes in Computer Science. 2009;5635:198-207.
Friedman S-D. Forcing when there are large cardinals: an introduction, Acta Universitatis Carolinae / Mathematica et Physica. 2009;50(2):23-32.
Welch P. Games for Truth. Bulletin of Symbolic Logic. 2009;15(4):410-427.
Showing entries 421 - 440 out of 520