{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T19:38:34Z","timestamp":1703187514433},"reference-count":27,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":5215,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[1999,12]]},"abstract":"Abstract<\/jats:title>Many known tools for proving expressibility bounds for first-ord\u00e9r 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.<\/jats:p>","DOI":"10.2307\/2586810","type":"journal-article","created":{"date-parts":[[2006,5,6]],"date-time":"2006-05-06T18:03:57Z","timestamp":1146938637000},"page":"1751-1773","source":"Crossref","is-referenced-by-count":32,"title":["Notions of locality and their logical characterizations over finite models"],"prefix":"10.1017","volume":"64","author":[{"given":"Lauri","family":"Hella","sequence":"first","affiliation":[]},{"given":"Leonid","family":"Libkin","sequence":"additional","affiliation":[]},{"given":"Juha","family":"Nurmonen","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200012883_ref008","volume-title":"Finite model theory","author":"Ebbinghaus","year":"1995"},{"key":"S0022481200012883_ref019","volume-title":"Complexity theory retrospective","author":"Immerman","year":"1990"},{"key":"S0022481200012883_ref011","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1100"},{"key":"S0022481200012883_ref003","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(90)90022-D"},{"key":"S0022481200012883_ref014","doi-asserted-by":"publisher","DOI":"10.1145\/235767.235770"},{"key":"S0022481200012883_ref012","volume-title":"Proceedings of the Herbrand Symposium, Logic Colloquium '81","author":"Gaifman","year":"1982"},{"key":"S0022481200012883_ref023","unstructured":"Luosto K. , Hierarchies of monadic generalized quantifiers, this Journal (to appear)."},{"key":"S0022481200012883_ref005","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1996.561300"},{"key":"S0022481200012883_ref021","first-page":"204","volume-title":"Proceedings of 12th IEEE Symposium on Logic in Computer Science","author":"Libkin","year":"1996"},{"key":"S0022481200012883_ref002","first-page":"113","volume":"55","author":"Ajtai","year":"1990","journal-title":"Reachability is harder for directed than for undirected graphs"},{"key":"S0022481200012883_ref006","first-page":"140","volume-title":"Theoretical Computer Science","author":"Dong","year":"1997"},{"key":"S0022481200012883_ref001","volume-title":"Foundations of databases","author":"Abiteboul","year":"1995"},{"key":"S0022481200012883_ref015","first-page":"1","volume-title":"Current trends in theoretical computer science","author":"Gurevich","year":"1988"},{"key":"S0022481200012883_ref017","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0070"},{"key":"S0022481200012883_ref020","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(94)00025-X"},{"key":"S0022481200012883_ref022","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1523"},{"key":"S0022481200012883_ref004","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1998.2731"},{"key":"S0022481200012883_ref007","first-page":"25","volume-title":"Model-theoretic logics","author":"Ebbinghaus","year":"1985"},{"key":"S0022481200012883_ref009","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1485"},{"key":"S0022481200012883_ref010","first-page":"1","volume-title":"Descriptive complexity and finite models","author":"Fagin","year":"1997"},{"key":"S0022481200012883_ref013","first-page":"437","volume-title":"Proceedings of conference on mathematical foundations of computer science (MFCS'98)","volume":"1450","author":"Grohe","year":"1998"},{"key":"S0022481200012883_ref016","first-page":"132","volume-title":"The theory of models","author":"Hanf","year":"1965"},{"key":"S0022481200012883_ref018","first-page":"1127","article-title":"Descriptive complexity: A logician's approach to computation","volume":"42","author":"Immerman","year":"1995","journal-title":"Notices of the American Mathemtical Society"},{"key":"S0022481200012883_ref024","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/6.6.779"},{"key":"S0022481200012883_ref025","unstructured":"Nurmonen J. , Unary quantifiers and finite structures, Ph.D. thesis , University of Helsinki, 1996."},{"key":"S0022481200012883_ref026","first-page":"484","volume-title":"Information and Computation","author":"Nurmonen","year":"1996"},{"key":"S0022481200012883_ref027","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(95)00030-5"}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200012883","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T19:57:54Z","timestamp":1557431874000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200012883\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,12]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1999,12]]}},"alternative-id":["S0022481200012883"],"URL":"https:\/\/doi.org\/10.2307\/2586810","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,12]]}}}