Permutability of Rules for Linear Lattices
Дата
Авторы
Negri,Sara
Journal Title
Journal ISSN
Volume Title
Издатель
Journal of Universal Computer Science
Аннотация
Описание
The theory of linear lattices is presented as a system with multiple-conclusion rules. It is shown through the permutability of the rules that the system enjoys a subterm property: all terms in a derivation can be restricted to terms in the conclusion or in the assumptions. Decidability of derivability with the rules for linear lattices follows through the termination of proof-search.
Ключевые слова
lattice theory , proof analysis , decidability