Browse by Staff
Up a level |
Article
Hirsch, R. and Mikulas, Szabolcs and Stokes, T. (2022) The algebra of non-deterministic programs: demonic operations, orders and axioms. Logic Journal of the IGPL 30 (5), pp. 886-906. ISSN 1367-0751.
Jackson, M. and Mikulás, Szabolcs (2018) Domain and range for angelic and demonic compositons. Journal of Logical and Algebraic Methods in Programming 103 , pp. 62-78. ISSN 2352-2208.
McLean, B. and Mikulás, Szabolcs (2016) The finite representation property for composition, intersection, domain and range. International Journal of Algebra and Computation 26 , p. 1199. ISSN 0218-1967.
Duntsch, I. and Mikulas, Szabolcs (2001) Cylindric structures and dependencies in relational databases. Theoretical Computer Science 269 (1/2), pp. 451-468. ISSN 0304-3975.
Marx, M. and Mikulas, Szabolcs (2001) Products, or how to create modal logics of high complexity. Logic Journal of the IGPL 9 (1), pp. 71-82. ISSN 1367-0751.
Marx, M. and Mikulas, Szabolcs (1999) Decidability of cylindric set algebras of dimension two and first-order logic with two variables. The journal of Symbolic Logic 64 (4), pp. 1563-1572. ISSN 0022-4812.
Marx, M. and Mikulas, Szabolcs and Schlobach, S. (1999) Tableau calculus for local cubic modal logic and it's implementation. Logic Journal of the IGPL 7 (6), pp. 755-778. ISSN 1367-0751.
Mikulas, Szabolcs and Marx, M. (1999) Undecidable relativizations of algebras of relations. Journal of Symbolic Logic 64 (2), pp. 747-760. ISSN 0022-4812.
Andreka, H. and Givant, S. and Mikulas, Szabolcs and Nemeti, I. and Simon, A. (1998) Notions of density that imply representability in algebraic logic. Annals of Pure and Applied Logic 91 (2/3), pp. 93-190. ISSN 0168-0072.
Mikulas, Szabolcs (1998) Taming first-order logic. Logic Journal of the IGPL 6 (2), pp. 305-316. ISSN 1367-0751.
Marx, M. and Mikulas, Szabolcs and Nemeti, I. (1995) Taming logic. Journal of Logic, Language and Information 4 (3), pp. 207-226. ISSN 0925-8531.
Andreka, H. and Mikulas, Szabolcs (1994) Lambek calculus and its relational semantics: completeness and incompleteness. Journal of Logic, Language and Information 3 (1), pp. 1-37. ISSN 0925-8531.
Book Section
Mikulas, Szabolcs (2001) Axiomatizability of algebras of binary relations. In: Lowe, B. and Piwinger, B. and Rasch, T. (eds.) Classical and New Paradigms of Computation and their Complexity Hierarchies: Papers of the conference "Foundations of the Formal Sciences III". Trends in Logic 23. Springer, pp. 187-205. ISBN 9789048167180.
Bailey, J. and Mikulas, Szabolcs (2001) Expressiveness issues and decision problems for active database event queries. In: Van den Bussche, J. and Vianu, V. (eds.) Database Theory: ICDT 2001. Lecture Notes in Computer Science 1973. Springer, pp. 68-82. ISBN 9783540414568.
Marx, M. and Mikulas, Szabolcs and Reynolds, M. (2000) The mosaic method for temporal logics. In: Dyckhoff, R. (ed.) Automated Reasoning with Analytic Tableaux and Related Methods: International Conference, TABLEAUX 2000. Lecture Notes in Computer Science 1874. Springer, pp. 324-340. ISBN 9783540676973.
Conference or Workshop Item
Hodkinson, I.M. and Mikulas, Szabolcs (1998) Colorful reducts. In: RelMiCS: 4th International Seminar, 1998, Warsaw, Poland. (Unpublished)
Mikulas, Szabolcs (1997) A note on expressing infinity in cylindrlc-relativised set algebras. In: Third International Seminar on the Use of Relational Methods in Computer Science, 1997, Hammamet, Tunisia. (Unpublished)