Leonid Libkin
Research Subjects
Research Interests
Leonid Libkin has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
Michael Benedikt
2 shared publications- Gabriel Kuper1 shared publication
Jan Chomicki
1 shared publication- Jan Paredaens
University of Antwerp
1 shared publication - Lauri Hella
Tampere University, Tampere, Finland
1 shared publication
Latest Publications
- 1 January 2000
- Published by Springer Nature
- p. 1-16
Introduction
- Open Access
- 1 December 1999
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 64 (4) , 1751-1773
Notions of locality and their logical characterizations over finite models
Many known tools for proving expressibility bounds for first-ordér logic are based on one of several locality properties. In this paper we characterize the relationship between those notions of locality. We note that Gaifman's locality theorem gives rise to two notions: one deals with sentences and one with open formulae. We prove that the former implies Hanf's notion of locality, which in turn implies Gaifman's locality for open formulae. Each of these implies the bounded degree property, which is one of the easiest tools for proving expressibility bounds. These results apply beyond the first-order case. We use them to derive expressibility bounds for first-order logic with unary quantifiers and counting. We also characterize the notions of locality on structures of small degree.
- 1 December 1999
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 64 (4) , 1751-1773
Open AccessNotions of locality and their logical characterizations over finite models
Many known tools for proving expressibility bounds for first-ordér logic are based on one of several locality properties. In this paper we characterize the relationship between those notions of locality. We note that Gaifman's locality theorem gives rise to two notions: one deals with sentences and one with open formulae. We prove that the former implies Hanf's notion of locality, which in turn implies Gaifman's locality for open formulae. Each of these implies the bounded degree property, which is one of the easiest tools for proving expressibility bounds. These results apply beyond the first-order case. We use them to derive expressibility bounds for first-order logic with unary quantifiers and counting. We also characterize the notions of locality on structures of small degree.
- 1 January 1998
- Published by Springer Nature
- p. 170-208
A semantics-based approach to design of query languages for partial information
- 1 January 1998
- Published by Springer Nature
- p. 170-208
A semantics-based approach to design of query languages for partial information