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 21 - 40 von 365
2019
Soukup DT. A model with Suslin trees but no minimal uncountable linear orders other than ω1 and −ω1. Israel Journal of Mathematics. 2019 Aug;233(1):199–224. doi: 10.1007/s11856-019-1899-x
Eskew M. More rigid ideals. Israel Journal of Mathematics. 2019 Aug;233(1):225–247. doi: 10.1007/s11856-019-1905-3
Laflamme C, Aranda A, Soukup DT, Woodrow R. Balanced independent sets in graphs omitting large cliques. Journal of Combinatorial Theory. Series B. 2019 Jul;137:1-9. Epub 2018 Nov 28. doi: 10.1016/j.jctb.2018.11.006
Friedman S-D, Gitman V, Kanovei V. A model of second-order arithmetic satisfying AC but not DC. Journal of Mathematical Logic. 2019 Jun;19(1):1850013. doi: 10.1142/S0219061318500137
Camerlo R, Carroy R, Marcone A. Linear orders: when embeddability and epimorphism agree. Journal of Mathematical Logic. 2019 Jun;19(1):1950003. doi: 10.1142/s021906131950003x
Atmai R. An analysis of the models L[T2n]. Journal of Symbolic Logic. 2019 Mär;84(1):1-26. doi: 10.1017/jsl.2016.63
Ellis P, Soukup DT. Cycle reversions and dichromatic number in tournaments. European Journal of Combinatorics. 2019 Mär;77:31-48. doi: 10.1016/j.ejc.2018.10.008
Soukup DT. Uncountable strongly surjective linear orders. Order. 2019 Mär;36(1):43-64. Epub 2018. doi: 10.1007/s11083-018-9454-7
Friedman S-D, Hoffelner S. A Σ
1
4 WELLORDER of the REALS with NS
ω1 SATURATED. Journal of Symbolic Logic. 2019;84(4):1466-1483. doi: 10.1017/jsl.2019.43
Fischer V, Brendle J, Khomskii Y. Definable maximal independent families. Proceedings of the American Mathematical Society. 2019;147(8):3547-3557 . doi: 10.1090/proc/14497
Carroy R, Pequignot Y, Vidnyánszky Z. Embeddability on functions: order and chaos. Transactions of the American Mathematical Society. 2019;371(9):6711-6738. doi: 10.1090/tran/7739
Sobota D. Families of sets related to Rosenthal's lemma. Archive for Mathematical Logic. 2019;58(1-2):53-69. doi: 10.1007/s00153-018-0621-8
Beckmann A, Buss S, Friedman S-D, Müller M. Feasible set functions have small circuits. Computability: The journal of the Association Computability in Europe. 2019;8(1):67-98. doi: 10.3233/COM-180096
Komjáth P, Leader I, Russell PA, Shelah S, Soukup DT, Vidnyánszky Z. Infinite monochromatic sumsets for colourings of the reals. Proceedings of the American Mathematical Society. 2019;147(6):2673-2684. doi: 10.1090/proc/14431
Barton N, Friedman S-D. Set Theory and Structures. in Centrone S, Kant D, Sarikaya D, Hrsg., Synthese Library: Univalent foundations, set theory, and general thoughts. Springer. 2019. S. 223-253. (Synthese Library, Band 407). doi: 10.1007/978-3-030-15655-8_10
Eskew M, Cox S. Strongly proper forcing and some problems of Foreman. Trans. Amer. Math. Soc. 2019;371(7):5039-5068. doi: 10.1090/tran/7725
Sobota D. The Nikodym property and cardinal characteristics of the continuum. Annals of Pure and Applied Logic. 2019;170(1):1-35. doi: 10.1016/j.apal.2018.07.003
2018
Medini A, van Mill J, Zdomskyy L. Infinite powers and Cohen reals. Canadian Mathematical Bullettin. 2018 Dez;61(4):812-821. Epub 2017. doi: 10.4153/CMB-2017-055-x
Levine MS. Stationary Sets Added When Forcing Squares. Archive for Mathematical Logic. 2018 Nov;57(7-8):909-916. doi: 10.1007/s00153-018-0613-8
Carboni Oliveira I, Pich J, Santhanam R. Hardness magnification near state-of-the-art lower bounds. Electronic colloquium on computational complexity : ECCC ; research reports, surveys and books in computational complexity. 2018 Sep 11;158:TR18-158.
Zeige Ergebnisse 21 - 40 von 365