Results 301 to 310 of about 1,435,923 (372)
Some of the next articles are maybe not open access.
On Many-Valued Modal Probabilistic Logics
IEEE International Symposium on Multiple-Valued LogicExtending Hájek’s work on propositional probabilistic logic, we introduce a semantic framework for modal probabilistic logics based on modal Łukasiewicz logic. We demonstrate the expressiveness of the framework with a number of examples.
Ondrej Majer, Igor Sedlár
semanticscholar +1 more source
2000
The study of many-valued logic was initiated by Jan Lukasiewicz around 1920. He started with a three-valued logic, introducing in particular an implication for it (see [Lukasiewicz 1920, 1930] and [Lukasiewicz & Tarski 1930], a selection of Lukasiewicz’s papers can be found in [Borkowski 1970]).
Erich Peter Klement +2 more
openaire +1 more source
The study of many-valued logic was initiated by Jan Lukasiewicz around 1920. He started with a three-valued logic, introducing in particular an implication for it (see [Lukasiewicz 1920, 1930] and [Lukasiewicz & Tarski 1930], a selection of Lukasiewicz’s papers can be found in [Borkowski 1970]).
Erich Peter Klement +2 more
openaire +1 more source
Philosophical Problems of Many-Valued Logic.
The Journal of Philosophy, 1966T. J. Smiley +3 more
openaire +2 more sources
1981
I shall endeavour to cover as many branches of many-valued logic and as much of the work done in these branches as space permits. Much must, of course, be omitted, and I should therefore like to refer to an excellent bibliography of many-valued logics by Nicholas Rescher in his book (Many-Valued Logic, McGraw Hill 51893,1969).
openaire +1 more source
I shall endeavour to cover as many branches of many-valued logic and as much of the work done in these branches as space permits. Much must, of course, be omitted, and I should therefore like to refer to an excellent bibliography of many-valued logics by Nicholas Rescher in his book (Many-Valued Logic, McGraw Hill 51893,1969).
openaire +1 more source
1981
The term ‘many-valued logic’ is most often used to denote logics which are constructed by means of introduction of additional truth-values, while classical logic is construed as a two-valued logic (cf. “Sentence logic” §1.1).
openaire +1 more source
The term ‘many-valued logic’ is most often used to denote logics which are constructed by means of introduction of additional truth-values, while classical logic is construed as a two-valued logic (cf. “Sentence logic” §1.1).
openaire +1 more source
Generalized Truth Values and Many-Valued Logics: Harmonious Many-Valued Logics
2011In this chapter, we reconsider the notion of an \(n\)-valued propositional logic. In many-valued logic, sometimes a distinction is made not only between designated and undesignated (not designated) truth values, but also between designated and antidesignated truth values.
Yaroslav Shramko, Heinrich Wansing
openaire +1 more source
1993
Abstract The book attempts an elementary exposition of the topics connected with many-valued logics. It gives an account of the constructions being "many-valued" at their origin, i.e. those obtained through intended introduction of logical values next to truth and falsity.
openaire +1 more source
Abstract The book attempts an elementary exposition of the topics connected with many-valued logics. It gives an account of the constructions being "many-valued" at their origin, i.e. those obtained through intended introduction of logical values next to truth and falsity.
openaire +1 more source
Many valued paraconsistent logic
Proceedings 31st IEEE International Symposium on Multiple-Valued Logic, 2002In contrast to most logics, in paraconsistent logic it is not true that everything followed from a contradiction. The semantics for one of the best known paraconsistent logics, LP, permits sentences to be both true and false; but at the same time, the semantic characterization of the logical particles is classical.
openaire +1 more source
Many-valued computational logics
Journal of Philosophical Logic, 1989This paper deals with the problem of decidability of propositional logics defined by finite generalized matrices. The notions of computational logic and of computational semantics are introduced and it is shown that for finitely-valued logics, the class of computational calculi coincides with the class of logics with computational semantics.
openaire +2 more sources