Metcalfe, George

Up a level
Export as [feed] RSS
Group by: Date | Item Type | Refereed | No Grouping

Fussner, Wesley; Metcalfe, George (2024). Transfer theorems for finitely subdirectly irreducible algebras. Journal of Algebra, 640, pp. 1-20. Elsevier 10.1016/j.jalgebra.2023.11.003

van Gool, Sam; Guatto, Adrien; Metcalfe, George; Santschi, Simon (2024). Deciding Equations in the Time Warp Algebra. Logical methods in computer science, 20(1) Department of Theoretical Computer Science, Technical University of Braunschweig 10.46298/lmcs-20(1:8)2024

Metcalfe, George; Reggio, Luca (2023). Model completions for universal classes of algebras: necessary and sufficient conditions. The journal of symbolic logic, 88(1), pp. 381-417. Cambridge University Press 10.1017/jsl.2022.1

Metcalfe, George; Paoli, Francesco; Tsinakis, Constantine (2023). Residuated Structures in Algebra and Logic. Mathematical Surveys and Monographs: Vol. 277. American Mathematical Society

Caicedo, Xavier; Metcalfe, George; Rodriguez, Ricardo; Tuyt, Olim (2022). One-variable fragments of intermediate logics over linear frames. Information and computation, 287, p. 104755. Elsevier 10.1016/j.ic.2021.104755

Colacito, Almudena; Galatos, Nikolaos; Metcalfe, George; Santschi, Simon (2022). From L-Groups to Distributive L-Monoids, and Back Again. Journal of algebra, 601, pp. 129-148. Elsevier 10.1016/j.jalgebra.2022.02.012

Cintula, Petr; Metcalfe, George; Tokuda, Naomi (2022). Algebraic semantics for one-variable lattice-valued logics. In: Fernández-Duque, David; Palmigiano, Alessandra; Pinchinat, Sophie (eds.) Proceedings of AiML 2022. Advances in Modal Logic: Vol. 14 (pp. 237-257). College Publications

Colacito, Almudena; Galatos, Nikolaos; Metcalfe, George (2021). Theorems of Alternatives for Substructural Logics. In: Arieli, Ofer; Zamansky, Anna (eds.) Arnon Avron on Semantics and Proof Theory of Non-Classical Logics. Outstanding Contributions to Logic: Vol. 21 (pp. 91-105). Switzerland: Springer 10.1007/978-3-030-71258-7_5

Van Gool, Samuel; Guatto, Adrien; Metcalfe, George; Santschi, Simon (2021). Time Warps, from Algebra to Algorithms. In: Fahrenberg, Uli; Gehrke, Mai; Santocanale, Luigi; Winter, Michael (eds.) Relational and Algebraic Methods in Computer Science. Lecture Notes in Computer Science: Vol. 13027 (pp. 309-324). Switzerland: Springer 10.1007/978-3-030-88701-8_19

Gil-Férez, José; Möllerström Lauridsen, Frederik; Metcalfe, George (2020). Integrally Closed Residuated Lattices. Studia logica, 108(5), pp. 1063-1086. Springer Science + Business Media 10.1007/s11225-019-09888-9

Metcalfe, George; Tuyt, Olim (2020). A monadic logic of ordered abelian groups. In: Olivetti, Nicola; Verbrugge, Rineke; Negri, Sara; Sandu, Gabriel (eds.) Proceedings of AiML 2020. Advances in Modal Logic: Vol. 13 (pp. 441-457). College Publications

Gil Férez, José; Jipsen, Peter; Metcalfe, George (2020). Structure theorems for idempotent residuated lattices. Algebra universalis, 81(2) Birkhäuser 10.1007/s00012-020-00659-5

Colacito, Almudena; Metcalfe, George (2019). Ordering Free Groups and Validity in Lattice-Ordered Groups. Journal of pure and applied algebra, 223(12), pp. 5163-5175. Elsevier 10.1016/j.jpaa.2019.03.015

Cabrer, Leonardo Manuel; Freisberg, Benjamin; Metcalfe, George; Priestley, Hilary (2019). Checking admissibility using natural dualities. ACM transactions on computational logic, 20(1), pp. 1-19. ACM

Kowalski, Tomasz; Metcalfe, George (2019). Uniform Interpolation and Coherence. Annals of pure and applied logic, 170(7), pp. 825-841. Elsevier 10.1016/j.apal.2019.02.004

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

Caicedo, Xavier; Metcalfe, George; Rodriguez, Ricardo; Tuyt, Olim Frits (2019). The One-Variable Fragment of Corsi Logic. In: Iemhoff, Rosalie; Moortgat, Michael; de Queiroz, Ruy (eds.) Logic, Language, Information, and Computation. Proceedings of WoLLIC 2019. Lecture Notes in Computer Science: Vol. 11541 (pp. 70-83). Berlin: Springer

Kowalski, Tomasz; Metcalfe, George (2018). Coherence in Modal Logic. In: Advances in Modal Logic Volume 12. Advances in Modal Logic: Vol. 12 (pp. 451-464). College Publications, London

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

Marti, Michel; Metcalfe, George (2018). Expressivity in chain-based modal logics. Archive for mathematical logic, 57(3-4), pp. 361-380. Springer International 10.1007/s00153-017-0573-4

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

Caicedo, Xavier; Metcalfe, George; Rodriguez, Ricardo; Rogger, Jonas (2017). Decidability in Order-Based Modal Logics. Journal of computer and system sciences, 88, pp. 53-74. Elsevier 10.1016/j.jcss.2017.03.012

Van Gool, Samuel Jacob; Metcalfe, George; Tsinakis, Constantine (2017). Uniform Interpolation and Compact Congruences. Annals of pure and applied logic, 168(10), pp. 1927-1948. Elsevier 10.1016/j.apal.2017.05.001

Colacito, Almudena; Metcalfe, George (2017). Proof Theory and Ordered Groups. In: Kennedy, Juliette; de Queiroz, Ruy J.G.B. (eds.) Proceedings of WoLLIC 2017. Logic, Language, Information, and Computation. Lecture Notes in Computer Science: Vol. 10388 (pp. 80-91). Springer-Verlag Berlin Heidelberg 10.1007/978-3-662-55386-2_6

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

Rogger, Jonas (2016). Decidability of Order-Based Modal Logics. (Dissertation, University of Bern, Faculty of Science)

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

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/LMCS-11(3:23)2015

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

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

Röthlisberger, Christoph (2013). Admissibility in Finitely Generated Quasivarieties (Unpublished). (Dissertation, University of Bern, Faculty of Science)

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

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: McMillan, Ken; Middeldorp, Aart; Voronkov, Andrei (eds.) Logic for Programming, Artificial Intelligence, and Reasoning. Lecture Notes in Computer Science: Vol. 8312 (pp. 584-600). Springer 10.1007/978-3-642-45221-5_39

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-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

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

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

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

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