1974
DOI: 10.1002/malq.19740201903
|View full text |Cite
|
Sign up to set email alerts
|

The Notion of Logical Consequence in the Logic of Inexact Predicates

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
19
0

Year Published

1975
1975
2009
2009

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 38 publications
(19 citation statements)
references
References 0 publications
0
19
0
Order By: Relevance
“…After some discussion, he proposes that the old truth values be understood in terms of "degrees of error in deviation from the truth". This is not very far from the idea of degrees of truth 11 . Moreover, since the intersection of all the sets [a) is the set [1) = {1}, it is clear that the theorems 12 of L α are the same as those of L α .…”
Section: Scott's Ideamentioning
confidence: 90%
See 2 more Smart Citations
“…After some discussion, he proposes that the old truth values be understood in terms of "degrees of error in deviation from the truth". This is not very far from the idea of degrees of truth 11 . Moreover, since the intersection of all the sets [a) is the set [1) = {1}, it is clear that the theorems 12 of L α are the same as those of L α .…”
Section: Scott's Ideamentioning
confidence: 90%
“…10 He explains his proposal in the concrete case of 5-valued logic in [46], and of 6-valued logic in [47], but the idea is clearly the general one. 11 Another close interpretation is found in the framework of Rényi-Ulam games with lies, which interprets Lukasiewicz's truth values as measuring the distance from each value to the condition of falsifying too many answers (which means falsity); see [41]. 12 For semantically defined logics there is a tendency to speak of tautologies rather than theorems.…”
Section: Scott's Ideamentioning
confidence: 98%
See 1 more Smart Citation
“…Also, GBL is regarded as a logic with strong negation. sequent calculi for the →-free parts of Nelson's logics N − and N + 6) presented in [1], and C be Cleave's logic [3] 7) . We can conclude the following fact 8) :…”
Section: Correspondence Between DC and Gj −mentioning
confidence: 99%
“…A constructive logic N − , which is a variant of logics with strong negation, was proposed by Almukdad and Nelson [1], who showed a relationship between constructive logics N − and N + , and Cleave's three-valued logic [3]. Logics such as N − , N and N + have been studied by many logicians and computer scientists (e. g. [9,11,12,14,15]).…”
Section: Introductionmentioning
confidence: 99%