 | Up a level |
Röthlisberger, Christoph; Metcalfe, George (2013). Admissibility in Finitely Generated Quasivarieties. Logical Methods in Computer Science, Volume 9, Issue 2(2) International Federation for Computational Logic 10.2168/LMCS-9(2:9)2013
Metcalfe, George; Röthlisberger, Christoph (2012). Admissibility in De Morgan algebras. Soft computing, 16(11), pp. 1875-1882. Berlin: Springer-Verlag 10.1007/s00500-012-0839-z
Metcalfe, George; Röthlisberger, Christoph (2012). Unifiability and Admissibility in Finite Algebras. In: Cooper, S. Barry; Dawar, Anuj; Löwe, Benedikt (eds.) How the World Computes. Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings. Lecture Notes in Computer Science: Vol. 7318 (pp. 485-495). Heidelberg: Springer Verlag 10.1007/978-3-642-30870-3_49
Röthlisberger, Christoph (2013). Admissibility in Finitely Generated Quasivarieties (Unpublished). (Dissertation, University of Bern, Faculty of Science)
