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 / D. MUNDICI; V. MARRA. - STAMPA. - (2002), pp. 104-114. (Intervento presentato al convegno PROC. 32ST IEEE INT. SYMP. ON MULTIPLE-VALUED LOGIC, ISMVL tenutosi a BOSTON) [10.5555/850982.855283].
CONSEQUENCE AND COMPLEXITY IN INFINITE-VALUED LOGIC: A SURVEY
MUNDICI, DANIELE;
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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
