Metcalfe, George

Up a level
Export as [feed] RSS
Group by: Date | Item Type | Refereed | No Grouping
Jump to: 2017 | 2016 | 2015 | 2014 | 2013 | 2012 | 2011 | 2010 | 2009

2017

Metcalfe, George; Tsinakis, Constantine (2017). Density revisited. Soft computing, 21(1), pp. 175-189. Springer 10.1007/s00500-016-2420-7

2016

Galatos, Nikolaos; Metcalfe, George (2016). Proof theory for lattice-ordered groups. Annals of pure and applied logic, 167(8), pp. 707-724. Elsevier 10.1016/j.apal.2016.04.004

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 (2016). An Avron rule for fragments of R-mingle. Journal of logic and computation, 26(1), pp. 381-393. Oxford University Press 10.1093/logcom/ext031

2015

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

Metcalfe, George; Cabrer, Leonardo Manuel (2015). Exact Unification and Admissibility. Logical methods in computer science, 11(3), pp. 1-15. Department of Theoretical Computer Science, Technical University of Braunschweig 10.2168

Cabrer, Leonardo Manuel; Metcalfe, George (2015). Admissibility via natural dualities. Journal of pure and applied algebra, 219(9), pp. 4229-4253. North-Holland 10.1016/j.jpaa.2015.02.015

2014

Metcalfe, George; Marti, Michel (2014). A Hennessy-Milner Property for Many-Valued Modal Logics. In: Goré, Rajeev; Kooi, Barteld; Kurucz, Agi (eds.) Advances in Modal Logic. Advances in Modal Logic: Vol. 10 (pp. 407-420). London: College Publications

Metcalfe, George; Montagna, Franco; Tsinakis, Constantine (2014). Amalgamation and interpolation in ordered algebras. JOURNAL OF ALGEBRA, 402, pp. 21-82. Elsevier 10.1016/j.jalgebra.2013.11.019

2013

Röthlisberger, Christoph; Metcalfe, George (2013). Admissibility in Finitely Generated Quasivarieties. Logical Methods in Computer Science, 9(2) International Federation for Computational Logic 10.2168/LMCS-9(2:9)2013

Caicedo, Xavier; Metcalfe, George; Rodriguez, Ricardo; Rogger, Jonas (2013). A Finite Model Property for Gödel Modal Logics. In: Libkin, L.; Kohlenbach, U.; de Queiroz, R. (eds.) Proceedings of WoLLIC 2013. Lecture Notes in Computer Science: Vol. 8071 (pp. 226-237). Springer 10.1007/978-3-642-39992-3_20

Cintula, Petr; Metcalfe, George (2013). Herbrand Theorems for Substructural Logics. In: LPAR 2013. Lecture Notes in Computer Science: Vol. 8312 (pp. 584-600). Springer 10.1007/978-3-642-45221-5_39

2012

Marchioni, Enrico; Metcalfe, George (2012). Craig interpolation for semilinear substructural logics. Mathematical logic quarterly, 58(6), pp. 468-481. Weinheim: Wiley-VCH 10.1002/malq.201200004

Metcalfe, George; Röthlisberger, Christoph (2012). Admissibility in De Morgan algebras. Soft computing, 16(11), pp. 1875-1882. Berlin: Springer 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

Metcalfe, George (2012). Admissible Rules: From Characterizations to Applications. In: Ong, Luke; de Queiroz, Ruy (eds.) Logic, Language, Information and Computation. 19th International Workshop, WoLLIC 2012, Buenos Aires, Argentina, September 3-6, 2012. Proceedings. Lecture Notes in Computer Science: Vol. 7456 (pp. 56-69). Heidelberg: Springer Verlag 10.1007/978-3-642-32621-9_4

2011

Metcalfe, George (2011). Proof Theory of Mathematical Fuzzy Logic. In: Handbook of Mathematical Fuzzy Logic. Studies in Logic: Vol. 37 (pp. 209-282). College Publications

Metcalfe, George; Olivetti, Nicola (2011). Towards a Proof Theory of Gödel Modal Logics. Logical methods in computer science, 7(2), p. 27. Braunschweig: Department of Theoretical Computer Science, Technical University of Braunschweig 10.2168/LMCS-7(2:10)2011

2010

Metcalfe, George; Paoli, Francesco; Tsinakis, Constantine (2010). Ordered Algebras and Logic. In: Hykel, Hosni; Montagna, Franco (eds.) Probability, Uncertainty and Rationality. Publications of the Scuola Normale Superiore: Vol. 10 (pp. 3-83). Pisa: Edizioni della Normale - Scuola Normale Superiore

Baaz, Matthias; Metcalfe, George (2010). Herbrand's Theorem, Skolemization and Proof Systems for First-Order Lukasiewicz Logic. Journal of logic and computation, 20(1), pp. 35-54. Oxford: Oxford University Press 10.1093/logcom/exn059

Ciabattoni, Agata; Metcalfe, George; Montagna, Franco (2010). Algebraic and proof-theoretic characterizations of truth stressers for MTL and its extensions. Fuzzy sets and systems, 161(3), pp. 369-389. Amsterdam: Elsevier 10.1016/j.fss.2009.09.001

Cintula, Petr; Metcalfe, George (2010). Admissible rules in the implication-negation fragment of intuitionistic logic. Annals of pure and applied logic, 162(2), pp. 162-171. Amsterdam: Elsevier 10.1016/j.apal.2010.09.001

Marchioni, Enrico; Metcalfe, George (2010). Interpolation Properties for Uninorm Based Logics. In: Proceedings of ISMVL 2010 (pp. 205-210). Washington, DC: IEEE Computer Society 10.1109/ISMVL.2010.46

2009

Cintula, Petr; Metcalfe, George (2009). Structural Completeness in Fuzzy Logics. Notre Dame journal of formal logic, 50(2), pp. 153-183. Durham, N.C.: Duke University Press 10.1215/00294527-2009-004

Fermüller, Christian G.; Metcalfe, George (2009). Giles's Game and the Proof Theory of Lukasiewicz Logic. Studia logica, 92(1), pp. 27-61. Dordrecht: Springer Science + Business Media 10.1007/s11225-009-9185-2

Iemhoff, Rosalie; Metcalfe, George (2009). Proof Theory for Admissible Rules. Annals of pure and applied logic, 159(1-2), pp. 171-186. Amsterdam: Elsevier 10.1016/j.apal.2008.10.011

Metcalfe, George (2009). A Sequent Calculus for Constructive Logic with Strong Negation as a Substructural Logic. Bulletin of the Section of Logic, 38(1-2), pp. 5-11. Łódź (PL): University of Łódź

Iemhoff, Rosalie; Metcalfe, George (2009). Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics. In: Artemov, Sergei; Nerode, Anil (eds.) Logical Foundations of Computer Science. International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings. Lecture Notes in Computer Science: Vol. 5407 (pp. 230-245). Heidelberg: Springer Verlag 10.1007/978-3-540-92687-0_16

Metcalfe, George; Olivetti, Nicola (2009). Proof Systems for a Gödel Modal Logic. In: Giese, Martin; Waaler, Arild (eds.) Automated Reasoning with Analytic Tableaux and Related Methods. 18th International Conference, TABLEAUX 2009, Oslo, Norway, July 6-10, 2009. Proceedings. Lecture Notes in Computer Science: Vol. 5607 (pp. 265-279). Heidelberg: Springer Verlag 10.1007/978-3-642-02716-1_20

Provide Feedback