In general, every logic L comes equipped with a syntax, a semantics, and an algorithmic procedure. In some cases, formulae up to equivalence form an interesting class of algebraic structures. One such case is the infinite-valued calculus of Lukasiewicz. This paper reviews semantic-algorithmic issues for this logic, with particular reference to recent research.
Consequence and complexity in infinite-valued logic: a survey / V. Marra, D. Mundici - In: Proceedings of the 32. IEEE Intenational Symposium on Multiple-Valued Logic : May 15-18, Boston, Massachusetts, USA / IEEE Computer Society Technical Committee on Multiple-Valued Logic. - Los Alamitos : IEEE Computer Society, 2002. - ISBN 0769514626. - pp. 104-114 (( Intervento presentato al 32. convegno IEEE International Symposium on Multiple-Valued Logic tenutosi a Boston, Massachussets nel 2002.
Consequence and complexity in infinite-valued logic: a survey
V. MarraPrimo
;
2002
Abstract
In general, every logic L comes equipped with a syntax, a semantics, and an algorithmic procedure. In some cases, formulae up to equivalence form an interesting class of algebraic structures. One such case is the infinite-valued calculus of Lukasiewicz. This paper reviews semantic-algorithmic issues for this logic, with particular reference to recent research.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
