| Texto completo | |
| Autor(es): |
Agudelo, Juan C.
;
Carnielli, Walter
;
Akl, SG
;
Calude, CS
;
Dinneen, MJ
;
Rozenberg, G
;
Wareham, HT
Número total de Autores: 7
|
| Tipo de documento: | Artigo Científico |
| Fonte: | Lecture Notes in Computer Science; v. 4618, p. 3-pg., 2007-01-01. |
| Resumo | |
The classical (boolean) circuit model of computation is generalized via polynomial ring calculus, an algebraic proof method adequate to non-standard logics (namely, to all truth-functional propositional logics and to some non-truth-functional logics). Such generalization allows us to define models of computation based on non-standard logics in a natural way by using 'hidden variables' in the constitution of the model. Paraconsistent circuits for the paraconsistent logic mbC (and for some extensions) are defined as an example of such models. Some potentialities are explored with respect to computability and computational complexity. (AU) | |
| Processo FAPESP: | 04/14107-2 - Logical consequence and combinations of logics: fundaments and efficient applications |
| Beneficiário: | Walter Alexandre Carnielli |
| Modalidade de apoio: | Auxílio à Pesquisa - Temático |