On very true
The author considers a notion ``very true in the context of fuzzy logic. He builds a logic \(\text{BL}_{\text{vt}}\) on the ground of the basic fuzzy logic BL appending to its set of axioms three new axioms corresponding to the unary connective vt (very true). Then the author gives examples of particular vt operators in different t-norm logics, e.g., in Łukasiewicz many-valued logic, one can take \(\max(0,2x-1)\) to define the ``very true connective vt\((x)\), but in this case the axioms for ``very true fail to be tautologies for another t-norm logic, the product logic. Also a deduction theorem and a completeness theorem for \(\text{BL}_{\text{vt}}\) are given. The author points out that the question of standard completeness for the Łukasiewicz and the product logics with the vt operator and its additional axioms remains an open problem. I believe that the author's work presented in this paper is essential for the development of basic fuzzy logic and for the investigation of interconnections between different t-norm logics, but it doesn't seem quite new in the framework of many-valued logic to introduce an operator on the real interval \([0,1]\) which evaluates truth values in the way of ``very true. A lot of people did it before. Nothing would change if one redid their work under the slogan of fuzziness.
- Computing sets of graded attribute implications with witnessed non-redundancy
- Closure structures parameterized by systems of isotone Galois connections
- Representation of fuzzy subsets by Galois connections
- An expansion of basic logic with fixed points
- On sets of graded attribute implications with witnessed non-redundancy
- Extending fuzzy logics with many hedges
- Very true operators in effect algebras
- L-concept lattices with positive and negative attributes: modeling uncertainty and reduction of size
- Multi-adjoint concept lattices with heterogeneous conjunctors and hedges.
- Algebraic and proof-theoretic characterizations of truth stressers for MTL and its extensions
- Relational division in rank-aware databases
- A reduction theorem to compute fixpoints of fuzzy closure operators
- Decidability of order-based modal logics
- On very true operators on pocrims
- Factorization of fuzzy concept lattices with hedges by modification of input data
- Monotone operators on Gödel logic
- Fuzzy Horn logic. I. Proof theory.
- Formal concept analysis and linguistic hedges
- On terminological issues regarding linguistic hedges
- Attribute dependencies for data with grades I,
- Fuzzy Concept Lattices with Incomplete Knowledge
- True V or Not True V, That Is the Question
- Fuzzy attribute logic over complete residuated lattices
- FUZZY ATTRIBUTE IMPLICATIONS AND THEIR EXPRESSIVE POWER
- FAST FACTORIZATION BY SIMILARITY OF FUZZY CONCEPT LATTICES WITH HEDGES
- BASIC ALGORITHM FOR ATTRIBUTE IMPLICATIONS AND FUNCTIONAL DEPENDENCIES IN GRADED SETTING
- Bivalent and other solutions of fuzzy relational equations via linguistic hedges
- Algebraic models of deviant modal operators based on De Morgan and Kleene lattices
- The sorites paradox and fuzzy logic
- On finitely-valued fuzzy description logics
- On similarity preservation in fuzzy relation systems with hedges
- Triadic concept lattices in the framework of aggregation structures
- Very true GE-algebras
- On minimal sets of graded attribute implications
- Fuzzy logic programming reduced to reasoning with attribute implications
- Fuzzy and rough formal concept analysis: a survey
- Direct Factorization by Similarity of Fuzzy Concept Lattices by Factorization of Input Data
- Graded LinClosure and Its Role in Relational Data Analysis
- Isotone fuzzy Galois connections with hedges
- Introduction
- Automated prover for attribute dependencies in data with grades
- Multi-adjoint lattice logic and truth-stressing hedges
- A logical characterization of multi-adjoint algebras
- Formal concept analysis approach to understand digital evidence relationships
- Constraint heterogeneous concept lattices and concept lattices with heterogeneous hedges
- Theories, models and bases of attribute implications in multi-adjoint concept lattices with hedges
- Attribute implications in multi-adjoint concept lattices with hedges
- Very true operators on pre-semi-Nelson algebras
- An algebraic approach to linguistic hedges in Zadeh's fuzzy logic
- Fuzzy functional dependencies: a comparative survey
- Derivation digraphs for dependencies in ordinal and similarity-based data
- Very true operators on MTL-algebras
- Adaptive fuzzy logics for contextual hedge interpretation
- Very true pseudo-BCK algebras
- Non-commutative Łukasiewicz propositional logic
- Fuzzy Horn logic. II. Implicationally defined classes.
- Functional completeness of bounded structures of fuzzy logic with wvt-operators
- Truth-depressing hedges and BL-logic
- Truth values on generalizations of some commutative fuzzy structures
- A logic of graded attributes
- On \(v\)-filters and normal \(v\)-filters of a residuated lattice with a weak \(vt\)-operator
- Linguistic truth-valued lattice-valued propositional logic system \(\ell P(X)\) based on linguistic truth-valued lattice implication algebra
This page was built for publication: On very true
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1349204)
