Publisher
Springer International Publishing
Reference21 articles.
1. Abramsky, S., Dawar, A., & Wang, P. (2017). The pebbling comonad in finite model theory. In 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20–23, 2017 (pp. 1–12). IEEE Computer Society.
2. Beth, E. W. (1955). Semantic entailment and formal derivability. Mededelingen der koninklijke Nederlandse Akademie van Wetenschappen, afd. Letterkunde. Nieuwe Reeks, Deel 18, No. 13. N. V. Noord-Hollandsche Uitgevers Maatschappij, Amsterdam.
3. Ehrenfeucht, A. (1960). An application of games to the completeness problem for formalized theories. Fundamenta Mathematicae, 49, 129–141 (1961).
4. Feferman, S. (1972). Infinitary properties, local functors, and systems of ordinal functions. In Conference in Mathematical Logic—London ’70 (Proceedings of the Conference, Bedford College, London, 1970). Lecture Notes in Mathematics (Vol. 255, pp. 63–97). Berlin: Springer.
5. Grohe, M. (2007). The complexity of homomorphism and constraint satisfaction problems seen from the other side. Journal of the ACM, 54(1), Art. 1, 24.