Searchable List of Research Output

Filter Publications
  • Şenalp, Ö. (2025) Verso un'egemonia organizattiva: Ripensare l'analisi del potere di Gramsci alla luce della Tectologia di Bogdanov. Translated title of the contribution: Towards Organizational Hegemony: Rethinking Gramscian Power Analysis in Light of Bogdanov’s Tektology
    In Ghetti, Noemi Iacarella, Andreas Şenalp, Örsan (Eds.), Bogdanov, Gramsci e l’altra rivoluzione: Cultura, organizzazione, egemonia (pp 131-196) (Saggine). Donzelli Editore.
    Chapter | UvA-DARE
  • Şenalp, Ö. (2026) The Translations of Bogdanov's "Science and the Working Class".
    Marxism and Sciences, Vol. 8 (pp 253-278)
    Comment/Letter to the editor | https://doi.org/10.56063/MS.0103.08113 | UvA-DARE
  • Şenalp, Ö. (2026) Organizational Hegemony: Rethinking Gramscian Power Analysis in Light of Bogdanov’s Tektology.
    Marxism and Sciences, Vol. 8
  • Serdyukov, P., Braslavski, P., Kamps, J. (2013) ECIR 2013: 35th European Conference on Information Retrieval.
    SIGIR Forum, Vol. 47 (pp 41-57)
  • Serdyukov, P., Braslavski, P., Kuznetsov, S.O., Kamps, J., Rüger, S., Agichtein, E., Segalovich, I., Yilmaz, E. (2013) Advances in information retrieval: 35th European Conference on IR Research, ECIR 2013, Moscow, Russia, March 24-27, 2013: proceedings.
    Lecture notes in computer science, Vol. 7814. Springer.
  • Sevenster, M., Tsarfaty, R. (2005) ILLC Magazine 7.
    ILLC Magazine
    Article | UvA-DARE
  • Sevenster, M., Tulenheimo, T.E. (2006) On Modal Logic, IF Logic, and IF Modal Logic.
    In Governatori, G. Hodkinson, I. Venema, Y. (Eds.), Proceedings of AiML 6 (pp 481-501). College Publications.
    Conference contribution | UvA-DARE
  • Sevenster, M., Tulenheimo, T.E. (2006) Partially ordered connectives and Sigma-1-1 on finite models.
    Lecture Notes in Computer Science, Vol. 3988 (pp 516-525)
  • Sevenster, M., Tulenheimo, T.E. (2006) Finite model theory for partially ordered connectives.
    PP. Institute for Logic, Language and Computation.
    Working paper | UvA-DARE
  • Sevenster, M., Tulenheimo, T.E. (2006) Approaches to Independence Friendly Modal Logic.
    PP. Institute for Logic, Language and Computation.
    Working paper | UvA-DARE
  • Sevenster, M., Tulenheimo, T.E. (2006) Partially ordered connectives and Sigma-1-1 on finite models.
    PP. Institute for Logic, Language and Computation.
    Working paper | UvA-DARE
  • Sevenster, M., van Benthem, J.F.A.K., de Jager, S.T., Liu, F., Roy, O. (2005) Games at the Institute for Logic, Language and Computation.
    BNVKI Newsletter, Vol. October (pp 101-104)
    Article | UvA-DARE
  • Sevenster, M. (2004) Signalling games and non-literal meaning.
    Poster | UvA-DARE
  • Sevenster, M. (2004) Complexity results for an independent friendly propositional Logic.
    In van Otterloo, S. McBurney, P. van der Hoek, W. Wooldridge, M. (Eds.), Proceedings of the Knowledge and games Workshop (pp 23-33). University of Liverpool.
    Conference contribution | UvA-DARE
  • Sevenster, M. (2004) Signaling games and non-literal meaning.
    In Egre, P. Alonso i Alemany, L. (Eds.), Proceedings of the 16th European Summer School in Logic, language and Information (pp 234-244). ESSLI.
    Conference contribution | UvA-DARE
  • Sevenster, M. (2004) Battleships as decision problem.
    ICGA Journal, Vol. 27 (pp 142-149)
    Article | UvA-DARE
  • Sevenster, M. (2005) A computational universal for generalized quantifiers in natural language.
    Unknown Publisher.
    Report | UvA-DARE
  • Sevenster, M. (2006) Branches of imperfect information : logic, games, and computation.
    ILLC.
    Thesis, fully internal | UvA-DARE
  • Sevenster, M. (2006) The complexity of Scotland Yard.
    PP. Institute for Logic, Language and Computation.
    Working paper | UvA-DARE
  • Sevenster, M. (2006) Henkin quantifiers: logic, games, and computation.
    PP. Institute for Logic, Language and Computation.
    Working paper | UvA-DARE

The data of this list is taken from the Pure database. If you find output is missing from the list, please follow the previous link to find out how to submit to Pure. In case there are mistakes in PURE, please contact