 | Up a level |
Cintula, Petr; Diaconescu, Denisa; Metcalfe, George (2019). Skolemization and Herbrand Theorems for Lattice-Valued Logics. Theoretical computer science, 768, pp. 54-75. Elsevier 10.1016/j.tcs.2019.02.007
Diaconescu, Denisa; Metcalfe, George; Schnüriger, Laura Janina (2018). A real-valued modal logic. Logical methods in computer science, 14(1), pp. 1-27. Department of Theoretical Computer Science, Technical University of Braunschweig 10.23638/LMCS-14(1:10)2018
Metcalfe, George; Diaconescu, Denisa; Schnüriger, Laura Janina (2016). Axiomatizing a Real-Valued Modal Logic. In: Beklemishev, Lev; Demri, Stéphane; Máté, András (eds.) Advances in Modal Logic 11 (pp. 236-251). College Publications
Metcalfe, George; Cintula, Petr; Diaconescu, Denisa (2015). Skolemization for Substructural Logics. In: Davis, Martin; Fehnker, Ansgar; McIver, Annabelle; Voronkov, Andrei (eds.) Logic for Programming, Artificial Intelligence, and Reasoning - Proceedings of LPAR 2015. Lecture Notes in Computer Science: Vol. 9450 (pp. 1-15). Springer 10.1007/978-3-662-48899-7_1
Diaconescu, Denisa; Aguzzoli, Stefano; Flaminio, Tommaso (2014). A Logical Descriptor for Regular Languages via Stone Duality. In: Ciobanu, Gabriel; Méry, Dominique (eds.) Theoretical Aspects of Computing – ICTAC 2014. 11th International Colloquium, Bucharest, Romania, September 17-19, 2014. Proceedings. Lecture Notes in Computer Science: Vol. 8687 (pp. 25-42). Cham: Springer 10.1007/978-3-319-10882-7_3
