Vera Koponen
Senior Lecturer/Associate Professor at Department of Mathematics; Academic staff
- Telephone:
- +46 18 471 31 85
- E-mail:
- vera.koponen@math.uu.se
- Visiting address:
- Ångströmlaboratoriet, Regementsvägen 10
- Postal address:
- Box 480
751 06 UPPSALA
Download contact information for Vera Koponen at Department of Mathematics; Academic staff
Senior Lecturer/Associate Professor at Department of Mathematics; Algebra, Logic and Representation Theory
- Telephone:
- +46 18 471 31 85
- E-mail:
- Vera.Koponen@math.uu.se
- Visiting address:
- Ångströmlaboratoriet, Regementsvägen 10
- Postal address:
- Box 480
751 06 UPPSALA
Research
I do research in mathematical logic and related areas. Within logic my speciality is model theory which is the study of structures in a quite general sense, but common for it is that formal logical languages play a central role (e.g. for description and classification of structures).
During 2024-2027 I lead the project A model theoretic approach to relational learning in artificial intelligence funded by the Swedish Research Council.
A bit more about my research, including preprints that have not yet been published, is found here: http://www2.math.uu.se/~vera/research/index.html

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