Skip Navigation



Journal of Logic and Computation Advance Access published online on January 23, 2007
Journal of Logic and Computation, doi:10.1093/logcom/exl044
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
17/2/311    most recent
exl044v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Marchioni, E.
Right arrow Articles by Montagna, F.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2007. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Original papers

Complexity and Definability Issues in Formula

Enrico Marchioni

Departamento de Lógica, Universidad de Salamanca, Campus Unamuno - Edificio FES 37007 Salamanca, Spain E-mail: marchioni{at}usal.es

Franco Montagna

Dipartimento di Matematica e Informatica, Università degli Studi di Siena, Pian dei Mantellini 44, 53100 Siena, Italy E-mail: montagna{at}unisi.it


  Abstract

In this work we investigate several complexity and definability problems for the logic Formula . We show that the universal fragment of the theory of real closed fields can be faithfully interpreted in such a logic. Then we investigate the logics of t-norms definable in Formula , and we prove that they are all in PSPACE. Finally we show that the most important fuzzy logics are complete with respect to classes of t-norms which are definable in Formula .

Keywords: Real closed fields; fuzzy logics; left-continuous t-norms; decidability


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 J Logic ComputationHome page
E. Marchioni
On Computational Complexity of Semilinear Varieties
J Logic Computation, December 1, 2008; 18(6): 941 - 958.
[Abstract] [PDF]


Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.