Wiki source code of Seminar talks fall 2013

Last modified by asaekman@helsinki_fi on 2024/01/16 08:03

Show last authors
1 ==== Talks during the fall term 2013 ====
2
3 Wed 4.9.2013 12-14, C124
4 Tapani Hyttinen: More on a cover of the multiplicative group of complex numbers
5
6 Wed 11.9.2013 12-14, C124
7 Gianluca Paolini: Dependence Logic in Algebra and Model Theory
8
9 Wed 18.9.2013 12-14, C124
10 CANCELLED
11
12 Wed 25.9.2013 12-14, C124
13 No seminar.
14
15 Wed 2.10.2013 12-14, C124
16 No seminar.
17
18 Wed 9.10.2013 12-14, C124
19 Jouko Väänänen: Extended dependence logic and set theory
20
21 Wed 16.10.2013 12-14, C124
22 Jouko Väänänen: Extended dependence logic and set theory (continued)
23
24 Wed 23.10.2013 12-14, C124
25 Misha Gavrilovich: A category theoretic point of view on Shelah's covering numbers
26
27 (% style="margin-left: 30.0px;" %)
28 Abstract: We observe that the covering numbers of Shelah, and the notion of a measurabe cardinal, can be interpreted as invariants/properties of partial orders. We also observe that these partial orders can be viewed as a model category, and this provides a homotopy theoretic point of view on these notions.
29
30 Wed 30.10.2013 12-14, C124
31 Jukka Corander: Labeled Directed Acyclic Graphs: a generalization of context-specific independence in directed graphical models
32
33 (% style="margin-left: 30.0px;" %)
34 Abstract:  We introduce a novel class of labeled directed acyclic graph (LDAG) models for finite sets of discrete variables. LDAGs generalize earlier proposals for allowing local structures in the conditional probability distribution of a node, such that unrestricted label sets determine which edges can be deleted from the underlying directed acyclic graph (DAG) for a given context. Several properties of these models are derived, including a generalization of the concept of Markov equivalence classes. Efficient Bayesian learning of LDAGs is enabled by introducing an LDAG-based factorization of the Dirichlet prior for the model parameters, such that the marginal likelihood can be calculated analytically.
35
36 Wed 6.11.2013 12-14, C124
37 Miika Hannula: Hierarchies in inclusion logic
38
39 Wed 13.11.2013 12-14, C124
40 Jouko Väänänen: Stationary logic and supercompact cardinals
41
42 Wed 20.11.2013 12-14, C124
43 Jouko Väänänen: Stationary logic and Martin's Maximum
44
45 Wed 27.11.2013 12-14, C124
46 Gianluca Paolini: (In)dependence Logic and Abstract Independence Relations
47
48 (% style="margin-left: 30.0px;" %)
49 Abstract: We generalize the results of [Paolini & Vaananen, 2013] working in the framework of abstract independence relations. We prove a general completeness theorem for the independence atom under the assumption that we are able to find a particular independence configuration in the monster model.
50
51 Wed 4.12.2013 12-14, C124
52 Kaisa Kangas: TBA
53
54 Wed 11.12.2013 12-14, C124
55 Hannu Nissinen: PTIME and Generalized Quantifiers