Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 206
Number of items: 206
  • Areces, C. E., Marx, M. J., & Blackburn, P. (2000). The computational complexity of hybrid temporal logics. Logic Journal of the IGPL, 8(5), 653-679.
  • Marx, M. J., & Mikulas, S. (2000). Products, or How to Create Modal Logics of High Complexity. (Technical Reports; No. PP-2000-13). Institute for Logic, Language and Computation.
  • Marx, M. J., & Bezhanishvili, N. (2000). All proper normal extensions of S5-square have the polynomial size model property. (Technical Reports; No. PP-2000-14). Institute for Logic, Language and Computation.
  • Marx, M. J., & Venema, Y. (1999). A modal logic of relations. In E. Orlowska (Ed.), Logic at Work: Essays Dedicated to the Memory of Elena Rasiowa (pp. 124-167). Physica-Verlag.
  • Areces, C. E., Blackburn, P., & Marx, M. J. (1999). A road-map on complexity for hybrid logics. In M. Rodriguez-Artalejo, & J. Flum (Eds.), Proceedings of the 8th Annual Conference of the EACSL (pp. 307-321)
  • Areces, C. E., Blackburn, P., & Marx, M. J. (1999). Hybrid logic is the bounded fragment of first order logic. In W. Carnielli, & R. de Queiroz (Eds.), Proceedings of 6th workshop on logic, language , information and computation, WOLLIC99 (pp. 33-50)
  • Marx, M. J., Hoogland, E., & Otto, M. (1999). Beth Definability for the Guarded Fragment. In D. McAllester, H. Ganzinger, & A. Voronkov (Eds.), Logic for Programming and Automated Reasoning (Vol. 1705, pp. 273-285). Springer-Verlag.
  • Gerbrandy, J. D., Marx, M. J., de Rijke, M., & Venema, Y. (1999). JFAK. Essays Dedicated to Johan van Benthem on the Occasion of his 50th Birthday. Vossiuspers - Amsterdam University Press.
  • Marx, M. (1998). Amalgamation in relation algebras. Journal of Symbolic Logic, 63(2), 479-484. https://doi.org/10.2307/2586844
  • Areces, C. E., & Marx, M. J. (1997). Failure of interpolation. (Technical report). University of Warwick.
Page 20 of 21