Vera Koponen
Universitetslektor vid Matematiska institutionen; Akademisk personal
- Telefon:
- 018-471 31 85
- E-post:
- vera.koponen@math.uu.se
- Besöksadress:
- Ångströmlaboratoriet, Regementsvägen 10
- Postadress:
- Box 524
751 20 UPPSALA
Ladda ned kontaktuppgifter för Vera Koponen vid Matematiska institutionen; Akademisk personal
Universitetslektor vid Matematiska institutionen; Algebra, logik och representationsteori
- Telefon:
- 018-471 31 85
- E-post:
- Vera.Koponen@math.uu.se
- Besöksadress:
- Ångströmlaboratoriet, Regementsvägen 10
- Postadress:
- Box 524
751 20 UPPSALA
- Akademiska meriter:
- FD, docent
Forskning
Jag forskar inom matematisk logik och relaterade områden. Inom logiken är mitt specialområde modellteori som är studiet av strukturer i mycket vid mening, men gemensamt för modellteoretiska studier är att formella logiska språk spelar en central roll.
Under 2024-2027 så leder jag projektet En modellteoretisk studie av sambandsinlärning inom artificiell intelligens som finansieras av Vetenskapsrådet.
Lite mer om min forskning, inklusive en lista som innehåller artiklar som inte ännu har publicerats, finner du här http://www2.math.uu.se/~vera/research/index.html.

Publikationer
Senaste publikationer
-
A general approach to asymptotic elimination of aggregation functions and generalized quantifiers
Ingår i Archive for mathematical logic, s. 363-390, 2026
- DOI för A general approach to asymptotic elimination of aggregation functions and generalized quantifiers
- Ladda ner fulltext (pdf) av A general approach to asymptotic elimination of aggregation functions and generalized quantifiers
-
A convergence law for continuous logic and continuous structures with finite domains
Ingår i Information and Computation, 2026
- DOI för A convergence law for continuous logic and continuous structures with finite domains
- Ladda ner fulltext (pdf) av A convergence law for continuous logic and continuous structures with finite domains
-
Random expansions of finite structures with bounded degree
Ingår i Annals of Pure and Applied Logic, 2026
- DOI för Random expansions of finite structures with bounded degree
- Ladda ner fulltext (pdf) av Random expansions of finite structures with bounded degree
-
Convergence Laws for Expansions of Linear Preorders
Ingår i Logic, Language, Information, and Computation, s. 101-118, 2025
-
Random expansions of trees with bounded height
Ingår i Theoretical Computer Science, 2025
Alla publikationer
Artiklar i tidskrift
-
A general approach to asymptotic elimination of aggregation functions and generalized quantifiers
Ingår i Archive for mathematical logic, s. 363-390, 2026
- DOI för A general approach to asymptotic elimination of aggregation functions and generalized quantifiers
- Ladda ner fulltext (pdf) av A general approach to asymptotic elimination of aggregation functions and generalized quantifiers
-
A convergence law for continuous logic and continuous structures with finite domains
Ingår i Information and Computation, 2026
- DOI för A convergence law for continuous logic and continuous structures with finite domains
- Ladda ner fulltext (pdf) av A convergence law for continuous logic and continuous structures with finite domains
-
Random expansions of finite structures with bounded degree
Ingår i Annals of Pure and Applied Logic, 2026
- DOI för Random expansions of finite structures with bounded degree
- Ladda ner fulltext (pdf) av Random expansions of finite structures with bounded degree
-
Random expansions of trees with bounded height
Ingår i Theoretical Computer Science, 2025
-
On the relative asymptotic expressivity of inference frameworks
Ingår i Logical Methods in Computer Science, 2024
- DOI för On the relative asymptotic expressivity of inference frameworks
- Ladda ner fulltext (pdf) av On the relative asymptotic expressivity of inference frameworks
-
Asymptotic elimination of partially continuous aggregation functions in directed graphical models
Ingår i Information and Computation, 2023
- DOI för Asymptotic elimination of partially continuous aggregation functions in directed graphical models
- Ladda ner fulltext (pdf) av Asymptotic elimination of partially continuous aggregation functions in directed graphical models
-
Conditional probability logic, lifted Bayesian networks, and almost sure quantifier elimination
Ingår i Theoretical Computer Science, s. 1-27, 2020
- DOI för Conditional probability logic, lifted Bayesian networks, and almost sure quantifier elimination
- Ladda ner fulltext (pdf) av Conditional probability logic, lifted Bayesian networks, and almost sure quantifier elimination
-
Supersimple omega-categorical theories and pregeometries
Ingår i Annals of Pure and Applied Logic, 2019
-
Binary simple homogeneous structures
Ingår i Annals of Pure and Applied Logic, s. 1335-1368, 2018
-
On Constraints And Dividing In Ternary Homogeneous Structures
Ingår i Journal of Symbolic Logic (JSL), s. 1691-1721, 2018
-
Binary primitive homogeneous simple structures
Ingår i Journal of Symbolic Logic (JSL), s. 183-207, 2017
-
Binary primitive homogeneous simple structures
Ingår i Journal of Symbolic Logic (JSL), s. 183-207, 2017
-
Random l-colourable structures with a pregeometry
Ingår i Mathematical logic quarterly, s. 32-58, 2017
-
Homogeneous 1-based structures and interpretability in random structures
Ingår i Mathematical logic quarterly, s. 6-18, 2017
-
Binary simple homogeneous structures are supersimple with finite rank
Ingår i Proceedings of the American Mathematical Society, s. 1745-1759, 2016
-
Limit laws and automorphism groups of random nonrigid structures
Ingår i Journal of Logic and Analysis, s. 1-53, 2015
- DOI för Limit laws and automorphism groups of random nonrigid structures
- Ladda ner fulltext (pdf) av Limit laws and automorphism groups of random nonrigid structures
-
On sets with rank one in simple homogeneous structures
Ingår i Fundamenta Mathematicae, s. 223-250, 2015
- DOI för On sets with rank one in simple homogeneous structures
- Ladda ner fulltext (pdf) av On sets with rank one in simple homogeneous structures
-
On compactness of logics that can express properties of symmetry or connectivity
Ingår i Studia Logica, s. 1-20, 2015
- DOI för On compactness of logics that can express properties of symmetry or connectivity
- Ladda ner fulltext (pdf) av On compactness of logics that can express properties of symmetry or connectivity
-
Typical automorphism groups of finite nonrigid structures
Ingår i Archive for mathematical logic, s. 571-586, 2015
- DOI för Typical automorphism groups of finite nonrigid structures
- Ladda ner fulltext (pdf) av Typical automorphism groups of finite nonrigid structures
-
A limit law of almost l-partite graphs
Ingår i Journal of Symbolic Logic (JSL), s. 911-936, 2013
- DOI för A limit law of almost l-partite graphs
- Ladda ner fulltext (pdf) av A limit law of almost l-partite graphs
-
Random graphs with bounded maximum degree: asymptotic structure and a logical limit law
Ingår i Discrete Mathematics & Theoretical Computer Science, s. 229-254, 2012
-
Asymptotic probabilities of extension properties and random l-colourable structures
Ingår i Annals of Pure and Applied Logic, s. 391-438, 2012
-
Independence and the finite submodel property
Ingår i Annals of Pure and Applied Logic, s. 58-79, 2009
-
Ingår i Archive for mathematical logic, s. 515-522, 2009
-
The finite submodel property and ω-categorical expansions of pregeometries
Ingår i Annals of Pure and Applied Logic, s. 201-229, 2006
-
Finite satisfiability and N-0-categorical structures with trivial dependence
Ingår i Journal of Symbolic Logic (JSL), s. 810-830, 2006
-
A note on orthogonality and stable embeddedness
Ingår i Journal of Symbolic Logic (JSL), s. 1359-1364, 2005
-
On first-order sentences without finite models
Ingår i Journal of Symbolic Logic (JSL), s. 329-339, 2004
-
Finite variable logic, stability and finite models
Ingår i Journal of Symbolic Logic (JSL), s. 837-858, 2001
Doktorsavhandlingar, sammanläggning
Kapitel i böcker, delar av antologi
-
Some connections between finite and infinite model theory
Ingår i Finite and Algorithmic Model Theory, s. 109-139, Cambridge University Press, 2011
Konferensbidrag
-
Convergence Laws for Expansions of Linear Preorders
Ingår i Logic, Language, Information, and Computation, s. 101-118, 2025
Rapporter
Övriga
-
Ingår i The Bulletin of Symbolic Logic, s. 114-116, 2008