Parameterized metareasoning in membership equational logic

Authors:
Manuel Clavel;Narciso Martí-Oliet;Miguel Palomino
Affiliations:
Departamento de Sistemas Informáticos y Computación, Universidad Complutense de Madrid, Spain;Departamento de Sistemas Informáticos y Computación, Universidad Complutense de Madrid, Spain;Departamento de Sistemas Informáticos y Computación, Universidad Complutense de Madrid, Spain
Venue:
Formal modeling
Year:
2011

Citing 6
Cited 0

Institutions: abstract model theory for specification and programming

Journal of the ACM (JACM)
Specification and proof in membership equational logic

Theoretical Computer Science - Trees in algebra and programming
Structuring metatheory on inductive definitions

Information and Computation
Membership algebra as a logical framework for equational specification

WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Reflective metalogical frameworks

ACM Transactions on Computational Logic (TOCL)
Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Basin, Clavel, and Meseguer showed in [1] that membership equational logic is a good metalogical framework because of its initial models and support of reflective reasoning. A development and an application of those ideas was presented later in [4]. Here we further extend the metalogical reasoning principles proposed there to consider classes of parameterized theories and apply this reflective methodology to the proof of different parameterized versions of the deduction theorem for minimal logic of implication.