Fuzzy logic, continuity and effectiveness

@article{Biacino2002FuzzyLC,
  title={Fuzzy logic, continuity and effectiveness},
  author={Loredana Biacino and Giangiacomo Gerla},
  journal={Archive for Mathematical Logic},
  year={2002},
  volume={41},
  pages={643-667}
}
Abstract. It is shown the complete equivalence between the theory of continuous (enumeration) fuzzy closure operators and the theory of (effective) fuzzy deduction systems in Hilbert style. Moreover, it is proven that any truth-functional semantics whose connectives are interpreted in [0,1] by continuous functions is axiomatizable by a fuzzy deduction system (but not by an effective fuzzy deduction system, in general). 

Effectiveness and multivalued logics

TLDR
Effective domain theory is applied to fuzzy logic to give suitable notions of semi-decidable and decidable L-subset and to investigate about the effectiveness of the fuzzy deduction apparatus.

Church Thesis for fuzzy logic

TLDR
Effective domain theory is applied to fuzzy logic to give suitable notions of semi-decidable and decidable L-subset and shows the inadequateness of these definitions and the difficulties in formulating an analogue of Church Thesis for fuzzy logic.

Chapter 15 FUZZY REASONING

Fuzzy Reasoning is based on the theory of fuzzy sets and it encompasses Artificial IntelHgence, information processing and theories from logic to pure and applied mathematics, like graph theory,

Multi-valued Logics, Effectiveness and Domains

TLDR
Effective domain theory is applied to fuzzy logic to give suitable notions of semi-decidable and decidable L-subset and shows the inadequateness of these definitions and the difficulties in formulating an analogue of Church Thesis for fuzzy logic.

Comments on some theories of fuzzy computation

TLDR
The basic idea of this paper is that the presence of real numbers in the interval [0,1] forces us to refer to endless approximation processes ( as in recursive analysis) and not to processes terminating after a finite number of steps and giving the exact output (as in recursive arithmetic).

Automata theory based on complete residuated lattice-valued logic

TLDR
A fundamental framework of automata theory based on complete residuated lattice-valued logic is established and its basic properties are discussed, from which it follows that the two fuzzy operators are exactly fuzzy closure operators.

Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages

TLDR
The concept of non-deterministic fuzzy Turing machine - NTFM is generalized, replacing the t-norm operator for several aggregation functions and establishing the languages accepted by these machines, called fuzzy recursively enumerable languages or simply LFRE and which classes of LFRE are closed under unions and intersections.

Giangiacomo Gerla VAGUENESS AND FORMAL FUZZY LOGIC : Some criticisms

In the common man reasoning the presence of vague predicates is pervasive and under the name “fuzzy logic in narrow sense” or “formal fuzzy logic” there are a series of attempts to formalize such a

The Continuous Logic

TLDR
This paper presents the continuous logic with the truth value of a proposition falls into the con-tinuous range [0,1], where 0 stands for complete falsity and 1 for complete truth.
...

References

SHOWING 1-10 OF 42 REFERENCES

Closure Operators in Fuzzy Set Theory

TLDR
In this chapter the theory of closure operators is proposed as a unifying tool for fuzzy logics and it is proved that Pavelka's logic, similarity logic and graded consequence theory can be represented in this way.

Fuzzy subsets: a constructive approach

Metamathematics of Fuzzy Logic

  • P. Hájek
  • Philosophy, Computer Science
    Trends in Logic
  • 1998
TLDR
This paper presents a meta-analysis of many-Valued Propositional Logic, focusing on the part of Lukasiewicz's Logic that deals with Complexity, Undecidability and Generalized Quantifiers and Modalities.

Logics with approximate premises

TLDR
It is shown that, in a sense, Ying’s apparatus can be reduced to a fuzzy logic as defined by Pavelka.

On Fuzzy Logic III. Semantical completeness of some many-valued propositional calculi

TLDR
The case when the underlying lattice of B is a chain is investigated, viz. an abstract set of formulas, which poses the problem of axiomatizability of the 8-valued propositional calculus over P.

Fuzzy logic and approximate reasoning

  • L. Zadeh
  • Computer Science, Philosophy
    Synthese
  • 2004
The term fuzzy logic is used in this paper to describe an imprecise logical system, FL, in which the truth-values are fuzzy subsets of the unit interval with linguistic labels such as true, false,

Fuzzy Logic: Mathematical Tools for Approximate Reasoning

TLDR
This logic is to investigate the wonderful human capacity of reasoning with vague notions by attempting to formalize the "approximate reasoning" the authors use in everyday life by proposing a general framework based on three mathematical tools: the theory of fuzzy closure operators, an extension principle for crisp logics and the Theory of recursively enumerable fuzzy subsets.

On decidable consequence operators

The main theorem says that a consequence operator is an effective part of the consequence operator for the classical prepositional calculus iff it is a consequence operator for a logic satisfying the

Theory of Logical Calculi: Basic Theory of Consequence Operations

0. Introduction.- 1. Basic Concepts.- 2. Deductive Bases and Interpretations.- 3. Logical Matrices.- 4. Tabular Semantics.- 5. Referential Semantics.- 6. Propositional vs. Predicate Logics.-