Properties of Interval Truth Values with Certainty Factor

Author(s):  
Masashi Emoto ◽  
◽  
Masao Mukaidono

Until now some truth values in fuzzy logic were suggested such as numerical truth value, interval truth value, fuzzy truth value and etc. Fuzzy truth value is considered as the most generalized truth values in fuzzy logic. Truth values except fuzzy truth value were suggested to clarify the properties of fuzzy truth values. However it is not sufficient to clarify the properties of fuzzy truth values from the properties of other truth values, because fuzzy truth value may not be convex or normal. On the other hand, the other truth values do have to be convex and normal. In this paper, we consider subnormal truth value and propose interval truth value with certainty factor. Then, we clarify the properties of interval truth value with certainty factor.

Author(s):  
Shawn Hedman

In propositional logic, atomic formulas are propositions. Any assertion will do. For example, . . . A = “Aristotle is dead,” B = “Barcelona is on the Seine,” and C = “Courtney Love is tall” . . . are atomic formulas. Atomic formulas are the building blocks used to construct sentences. In any logic, a sentence is regarded as a particular type of formula. In propositional logic, there is no distinction between these two terms. We use “formula” and “sentence” interchangeably. In propositional logic, as with all logics we study, each sentence is either true or false. A truth value of 1 or 0 is assigned to the sentence accordingly. In the above example, we may assign truth value 1 to formula A and truth value 0 to formula B. If we take proposition C literally, then its truth is debatable. Perhaps it would make more sense to allow truth values between 0 and 1. We could assign 0.75 to statement C if Miss Love is taller than 75% of American women. Fuzzy logic allows such truth values, but the classical logics we study do not. In fact, the content of the propositions is not relevant to propositional logic. Henceforth, atomic formulas are denoted only by the capital letters A, B, C,. . . (possibly with subscripts) without referring to what these propositions actually say. The veracity of these formulas does not concern us. Propositional logic is not the study of truth, but of the relationship between the truth of one statement and that of another. The language of propositional logic contains words for “not,” “and,” “or,” “implies,” and “if and only if.” These words are represented by symbols: . . . ¬ for “not,” ∧ for “and,” ∨ for “or,” → for “implies,” and ↔ for “if and only if.” . . . As is always the case when translating one language into another, this correspondence is not exact. Unlike their English counterparts, these symbols represent concepts that are precise and invariable. The meaning of an English word, on the other hand, always depends on the context.


2015 ◽  
Vol 42 (1) ◽  
pp. 79-111
Author(s):  
Lei Ma

Abstract The paper presents a method of truth-graph by truth-tables. On the one hand, the truth-graph constituted by truth value coordinate and circumference displays a more visual representation of the different combinations of truth-values for the simple or complex propositions. Truth-graphs make sure that you don’t miss any of these combinations. On the other hand, they provide a more convenient tool to discern the validity of a complex proposition made up by simple compositions. The algorithm involving in setting up all the truth conditions is proposed to distinguish easily among tautologous, contradictory and consistent expressions. Furthermore, the paper discusses a certain connection between the truth graphs and the symbols for propositional connectives proposed by Stanisław Leśniewski.


2021 ◽  
pp. 66-85
Author(s):  
Matteo Greco

Function words are commonly considered to be a small and closed class of words in which each element is associated with a specific and fixed logical meaning. Unfortunately, this is not always true as witnessed by negation: on the one hand, negation does reverse the truth-value conditions of a proposition, and the other hand, it does not, realizing what is called Expletive Negation. This chapter aims to investigate whether a word that is established on the basis of its function can be ambiguous by discussing the role of the syntactic derivation in some instances of so-called Expletive Negation clauses, a case in which negation seems to lose its capacity to deny the proposition associated with its sentence. Both a theoretical and an experimental approach has been adopted.


Philosophia ◽  
2021 ◽  
Author(s):  
Eduardo Pérez-Navarro

AbstractThe particular behavior exhibited by sentences featuring predicates of personal taste such as “tasty” may drive us to claim that their truth depends on the context of assessment, as MacFarlane does. MacFarlane considers two ways in which the truth of a sentence can depend on the context of assessment. On the one hand, we can say that the sentence expresses a proposition whose truth-value depends on the context of assessment. This is MacFarlane’s position, which he calls “truth relativism” and, following Weatherson, I rebrand as “nonindexical relativism”. On the other hand, we can say that what proposition a sentence expresses depends on the context of assessment. MacFarlane calls this position “content relativism” and rejects it on the grounds that it leads to implausible readings of certain sentences and is unable to account for the speaker’s authority over the content of her assertions. In this paper, I too argue against content relativism, which, again following Weatherson, I rebrand as “indexical relativism”. However, my arguments against the theory are different from MacFarlane’s, which I prove unsound. In particular, I show that any version of indexical relativism will be unable to account for at least one of the phenomena that have been standardly used to motivate nonindexical relativism—faultless disagreement and retraction—in most of the ways in which it has been proposed to understand them.


2016 ◽  
Vol 19 (3) ◽  
pp. 465
Author(s):  
Kherian Gracher

http://dx.doi.org/10.5007/1808-1711.2015v19n3p465Saul Kripke (1972) argued for the existence of a priori propositions that are contingently true. Kripke uses the example of a case presented by Wittgenstein (1953) about the Standard Meter of Paris. The Standard Meter is an object to determine the standard lenght, in the measure system, of a one meter unit. Wittgenstein argued that we can’t affirm that the Standard Meter has one meter, since it is the standard for measure and works as a rule in the language. Therefore, the phrase “the standard meter has one meter” doesn’t have a truth-value. On the other hand, Kripke argued that that phrase expresses a true proposition and can be known a priori by whom stipulated that this object will be the standard for measure. I will argue in favor a kripkean position, analyzing the dispute and thereafter answering possible objections from proponents of the wittgensteinian position.


2018 ◽  
Vol 28 (5) ◽  
pp. 712-746 ◽  
Author(s):  
Bruno Da Ré ◽  
Federico Pailos ◽  
Damian Szmuc

AbstractInfectious logics are systems that have a truth-value that is assigned to a compound formula whenever it is assigned to one of its components. This paper studies four-valued infectious logics as the basis of transparent theories of truth. This take is motivated (i) as a way to treat different pathological sentences (like the Liar and the Truth-Teller) differently, namely, by allowing some of them to be truth-value gluts and some others to be truth-value gaps and (ii) as a way to treat the semantic pathology suffered by at least some of these sentences as infectious. This leads us to consider four distinct four-valued logics: one where truth-value gaps are infectious, but gluts are not; one where truth-value gluts are infectious, but gaps are not; and two logics where both gluts and gaps are infectious, in some sense. Additionally, we focus on the proof theory of these systems, by offering a discussion of two related topics. On the one hand, we prove some limitations regarding the possibility of providing standard Gentzen sequent calculi for these systems, by dualizing and extending some recent results for infectious logics. On the other hand, we provide sound and complete four-sided sequent calculi, arguing that the most important technical and philosophical features taken into account to usually prefer standard calculi are, indeed, enjoyed by the four-sided systems.


1975 ◽  
Vol 28 (5) ◽  
pp. 449-460 ◽  
Author(s):  
B. Christopher Kaiser

The theological literature has been greatly enriched in recent decades by detailed studies of the nature of religious ‘discernment’ or ‘divination’. The works of Rudolf Otto, Mircea Eliade, and Ian Ramsey, in particular, and from various perspectives, have contributed much to our understanding of characteristic situations in which men may intuit or apprehend the immediate presence of deity. This ‘empirical-phenomenological’ approach (to characterise it as broadly as possible) represents a significant departure from the more traditional ‘proofs’ of deity based on logical argument or citations of scripture in that (a) it requires an empirical ‘grounding’ in concrete, historically conditioned situations, and (b) it necessarily leaves the question of truth value open to review and re-evaluation by its appeal to specific acts of personal intuition or discernment. Therefore, in comparison with the traditional ‘proofs’, there is a certain loss of cogency, but, on the other hand, a distinct gain in concreteness and accessibility to the religious imagination of the individual.


2021 ◽  
pp. 000313482110298
Author(s):  
Baris Sandal ◽  
Yuksel Hacioglu ◽  
Ziya Salihoglu ◽  
Nurkan Yagiz

Background and Objective Pre-operative risk classification of patients undergoing anesthesia is an essential interest and has been the focus of many research and categorizations. On the other hand, the ideal categorization system, based on medical doctors’ clinical experience and cooperation with other disciplines, has not been developed yet. Methods In this study, 218 consecutive patient undergoing laparoscopic cholecystectomy operations were included. A novel fuzzy logic evaluation model consisting of 270 rules was constructed. Five major (pulmonary, cardiac, diabetes mellitus and renal or liver disease) and three minor criteria (patientsʼ age, cigarette smoking and body mass index) were chosen to be used during high-risk groups determination. Results The verification of the success of risk value decision with the proposed novel fuzzy logic algorithm is the main goal of this study. On the other hand, though not essential aim, a statistical consistency check was also included to have a deeper understanding and evaluation of the graphical results. During the statistical analysis the 0-30%, 30-60% and 60-90% risk ranges were found to be in a very strong positive relationship with complication occurrence. In this study, 172, 31, 15 patients were in 0-30, 30-60 and 60-90% risk ranges, respectively. Complication rates were 7/172 (4.07%) in 0-30% range, 3/31 (9.68%) in 30-60% range; and 2/15 (13.33%) in 60-90% range. Conclusions Fuzzy based risk classification model was successfully used to predict medical results for patients undergoing laparoscopic cholecystectomy operations and reliable deductions were reached.


2010 ◽  
Vol 10 (4-6) ◽  
pp. 627-642 ◽  
Author(s):  
MARIO RODRÍGUEZ-ARTALEJO ◽  
CARLOS A. ROMERO-DÍAZ

AbstractUncertainty in Logic Programming has been investigated during the last decades, dealing with various extensions of the classical LP paradigm and different applications. Existing proposals rely on different approaches, such as clause annotations based on uncertain truth values, qualification values as a generalization of uncertain truth values, and unification based on proximity relations. On the other hand, the CLP scheme has established itself as a powerful extension of LP that supports efficient computation over specialized domains while keeping a clean declarative semantics. In this paper we propose a new scheme SQCLP designed as an extension of CLP that supports qualification values and proximity relations. We show that several previous proposals can be viewed as particular cases of the new scheme, obtained by partial instantiation. We present a declarative semantics for SQCLP that is based on observables, providing fixpoint and proof-theoretical characterizations of least program models as well as an implementation-independent notion of goal solutions.


Author(s):  
Yong Su ◽  
Hua-Wen Liu ◽  
Witold Pedrycz

Distributivity between two operations is a property posed many years ago — that is especially interesting in the framework of logical connectives because of its applications to fuzzy logic and approximate reasoning as their applications. Since semi-uninorms have been used in these topics, the study of the distributivity between two semi-uninorms becomes of particular interest that calls for thorough studies. The distributivity between two semi-uninorms, which are non-commutative and non-associative uninorms, has been developed only in the cases when both semi-uninorms are examples of very special classes of semi-uninorms. On the other hand, in general, the distributivity does not rely on the commutativity and associativity. The objective of this work is twofold. The first one is to show new solutions to distributivity equations for semi-uninorms. The second one is to check whether the results concerning the distributivity between two uninorms are valid for semi-uninorms. We investigate the distributivity involving two semi-uninorms when only one semi-uninrom lies in the most studied classes of semi-uninorms, achieving the above two objectives simultaneously.


Sign in / Sign up

Export Citation Format

Share Document