@InProceedings{sankaran:LIPIcs.CSL.2017.37,
  author =	{Sankaran, Abhisekh},
  title =	{{A Finitary Analogue of the Downward L\"{o}wenheim-Skolem Property}},
  booktitle =	{26th EACSL Annual Conference on Computer Science Logic (CSL 2017)},
  pages =	{37:1--37:21},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-045-3},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{82},
  editor =	{Goranko, Valentin and Dam, Mads},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2017.37},
  URN =		{urn:nbn:de:0030-drops-77074},
  doi =		{10.4230/LIPIcs.CSL.2017.37},
  annote =	{Keywords: downward Lowenheim-Skolem theorem, trees, nested words, tree-depth, cographs, tree representation, translation schemes, composition lemma, f.p.t., log}
}