Interpretations in Trees with Countably Many Branches

DOI10.1109/LICS.2012.65zbMath1364.03017OpenAlexW2018197592MaRDI QIDQ2986832

Sasha Rubin, Alexander Rabinovich

Publication date: 16 May 2017

Published in: 2012 27th Annual IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/lics.2012.65

zbMATH Keywords

monadic second-order logiccomposition methodfinite-set interpretationsinfinite scattered trees

Mathematics Subject Classification ID

Trees (05C05)

Related Items (1)

Regular languages of thin trees

This page was built for publication: Interpretations in Trees with Countably Many Branches