id: 06084893
dt: a
an: 06084893
au: Metcalfe, George
ti: Admissible rules: from characterizations to applications.
so: Ong, Luke (ed.) et al., Logic, language, information and computation. 19th
    international workshop, WoLLIC 2012, Buenos Aires, Argentina, September
    3‒6, 2012. Proceedings. Berlin: Springer (ISBN
    978-3-642-32620-2/pbk). Lecture Notes in Computer Science 7456, 56-69
    (2012).
py: 2012
pu: Berlin: Springer
la: EN
cc: 
ut: 
ci: 
li: doi:10.1007/978-3-642-32621-9_4
ab: Summary: The admissible rules of a logic (understood as a structural
    consequence relation) may be described as rules that can be added to
    the logic without producing any new theorems, or, equivalently, as
    rules such that any substitution making the premises into theorems,
    also makes the conclusion into a theorem. However, this equivalence
    collapses once multiple-conclusion or other, more exotic, admissible
    rules are considered. The first aim of this paper is to explain how
    such distinctions can be explained and characterized. The second aim is
    to explore how these rules can be useful in determining properties of
    classes of algebras.
rv: