Publikationsliste anhand von u:cris UUIDS
Folgende Liste wurde mittels u:cris UUIDS erstellt und ist dadurch beliebig zusammenstellbar. Die UUIDS können aus u:cris exportiert werden und werden im TYPO3 Backend in ein Textfeld kopiert (eine UUID pro Zeile).
Dies ist z.B. sinnvoll für Einheiten die als solche nicht mehr existieren, darum nicht direkt abfragbar sind da die Sichtbarkeit der Einheit auf das Portal begrenzt ist.
Listenansicht:
Zeige Ergebnisse 181 - 200 von 365
2013
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, Hrsg., Foundational Adventures: Essays in Honor of Harvey M. Friedman. 2013
Friedman SD, Honzik R, Zdomskyy L. Fusion and large cardinal preservation. Annals of Pure and Applied Logic. 2013;164(2):1247-1273.
Conidis C, Greenberg N, Turetsky D. Galvin's "Racing Pawns" Game, Internal Hyperarithmetic Comprehension, and the Law of the Excluded Middle. Notre Dame Journal of Formal Logic. 2013;54(2):233-252.
Camerlo R, Marcone A, Motto Ros L. Invariantly universal analytic quasi-orders. Transactions of the American Mathematical Society. 2013;365(4):1901-1931.
Bienvenu L, Greenberg N, Kucera A, Miller J, Nies A, Turetsky D. Joining Non-Low C.E. Sets with Diagonally Non-Computable Functions. Journal of Logic and Computation. 2013;23(6):1183-1194. doi: 10.1093/logcom/ext039
Friedman SD, Golshani M. Killing GCH everywhere by a cofinality-preserving forcing notion over a model of GCH. Fundamenta Mathematicae. 2013;223:171-193. doi: 10.4064/fm223-2-3
Atserias A, Müller M, Oliva S. Lower bounds for DNF-refutations of a relativized weak pigeonhole principle. in Proceedings 28th IEEE Conference on Computational Complexity. IEEE Computer Society. 2013. S. 109-120 doi: 10.1109/CCC.2013.20
Khomskii Y, Brendle JD. Mad families constructed from perfect almost disjoint families. Journal of Symbolic Logic. 2013;78(4):1164-1180.
Banakh T, Chervak O, Zdomskyy L. On character of points in the Higson corona of a metric space. Commentationes Mathematicae Universitatis Carolinae. 2013;54(2):159-178.
Friedman SD, Hyttinen T, Koerwien M. On the non-absoluteness of model existence in uncountable cardinals for $L_{\omega_1,\omega}$. Notre Dame Journal of Formal Logic. 2013;54(2):137-151. doi: 10.1215/00294527-1960443
Duanmu H, Tall F, Zdomskyy L. Productively Lindelöf and Indestructibly Lindelöf Spaces. Topology and Its Applications: a journal devoted to general, geometric, set-theoretic and algebraic topology. 2013;160(18):2443–2453. doi: 10.1016/j.topol.2013.07.038
Khomskii Y. Projective Hausdorff Gaps. Archive for Mathematical Logic. 2013. Epub 2013 Sep 4. doi: 10.1007/s00153-013-0355-6
Müller M, Szeider S. Revisiting space in proof complexity: treewidth and pathwidth. in Proceedings of the 38th Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Computer Science 8087. 2013. S. 704-716
Friedman SD, Rathjen M, Weiermann A. Slow consistency. Annals of Pure and Applied Logic. 2013;164:382-393.
Brooke-Taylor A, Friedman SD. Subcompact cardinals, square and stationary reflection. Israel Journal of Mathematics. 2013;197(1):453-473.
Müller M, Chen H. The fine classification of conjunctive queries and parameterized logarithmic space complexity. in Proceedings of the 32th ACM Symposium on Principles of Database Systems (PODS). Association for Computing Machinery (ACM). 2013. S. 309-320
Zeige Ergebnisse 181 - 200 von 365