Paper Info
Title
Arithmetical Complexity of First-order Predicate Fuzzy Logics Over Distinguished Semantics
Abstract
All promiment examples of first-order predicate fuzzy logics are undecidable. This leads to the problem of the arithmetical complexity of their sets of tautologies and satisfiable sentences. This article is a contribution to the general study of this problem. We propose the classes of first-order core and Δ-core fuzzy logics as a good framework to address these arithmetical complexity issues. We obtain general results providing lower bounds for the complexities associated with arbitrary semantics, and we compute upper bounds and exact positions in the arithmetical hierarchy for distinguished semantics: general semantics given by all chains, finite-chain semantics, standard semantics and rational semantics.
Year
DOI
Venue
2010
10.1093/logcom/exp052
J. Log. Comput.
Keywords
Field
DocType
standard semantics,general semantics,core fuzzy logics,distinguished semantics,finite-chain semantics,first-order predicate fuzzy logics,mathematical fuzzy logic,arithmetical complexity,arithmetical complexity issue,first- order predicate fuzzy logics,arithmetical hierarchy,rational semantics,general result,standard semantics.,arbitrary semantics,fuzzy logic,upper bound,lower bound,first order
Discrete mathematics,T-norm fuzzy logics,Operational semantics,First-order predicate,Algorithm,Arithmetical hierarchy,General semantics,Arithmetical set,Semantics,Mathematics,Well-founded semantics
Journal
Volume
Issue
ISSN
20
2
0955-792X
Citations 
PageRank 
References 
5
0.43
30
Authors
2
Name
Order
Citations
PageRank
Franco Montagna1103796.20
Carles Noguera246233.93