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:

2014


Goldstern M, Kellner J, Shelah S, Wohofsky W. Borel conjecture and dual Borel conjecture. Transactions of the American Mathematical Society. 2014;366(1):245-307. doi: 10.1090/S0002-9947-2013-05783-2

Müller M, Chen Y. Bounded variable logic, parameterized logarithmic space and Savitch's theorem. in Proceedings of 39th Mathematical Foundations of Computer Science (MFCS). Springer. 2014

Fokina E, Harizanov V, Melnikov A. Computable model theory. in Turing’s Legacy: ASL Lecture Notes in Logic. 2014. S. 124-194

Friedman S-D. Consistency of the Silver dichotomy in generalised Baire space. Fundamenta Mathematicae. 2014;227(2):179-186. doi: 10.4064/fm227-2-4

Repovs D, Zdomskyy L, Zhang S. Countable dense homogeneous filters and the Menger covering property. Fundamenta Mathematicae. 2014;224(3):233-240. doi: 10.4064/fm224-3-3

Honzik R, Friedman S-D, Cody B. Easton functions and supercompactness. Fundamenta Mathematicae. 2014;226(3):279-296. doi: 10.4064/fm226-3-6

Friedman S-D, Hyttinen T, Kulikov V. Generalized Descriptive Set Theory and Classification Theory. Memoirs of the American Mathematical Society. 2014;230(1081). Epub 2013 Dez 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

Friedman S-D. 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: https://doi.org/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. S. 115-124

Schröder M. Admissible Kleene-Kreisel-based Representations. 2013. Beitrag in Computability and Complexity in Analysis, Nancy, Frankreich.

Aspero D, Friedman S-D, 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