Results 211 to 220 of about 13,015 (267)
Some of the next articles are maybe not open access.
1992
1 Preliminaries.- 2 Many-Valued Propositional Calculi.- 3 Survey of Three-Valued Propositional Calculi.- 4 Some n-valued Propositional Calculi: A Selection.- 5 Intuitionistic Propositional Calculus.- 6 First-Order Predicate Calculus for Many-Valued Logics.- 7 The Method of Finitely Generated Trees in n-valued Logical Calculi.- 8 Fuzzy Propositional ...
Leonard Bolc, Piotr Borowik
openaire +1 more source
1 Preliminaries.- 2 Many-Valued Propositional Calculi.- 3 Survey of Three-Valued Propositional Calculi.- 4 Some n-valued Propositional Calculi: A Selection.- 5 Intuitionistic Propositional Calculus.- 6 First-Order Predicate Calculus for Many-Valued Logics.- 7 The Method of Finitely Generated Trees in n-valued Logical Calculi.- 8 Fuzzy Propositional ...
Leonard Bolc, Piotr Borowik
openaire +1 more source
Designing in many-valued logic
Proceedings of the Second International Conference on Intelligent Processing and Manufacturing of Materials. IPMM'99 (Cat. No.99EX296), 1999The analysis described is based on the many-valued logic of Lukasiewitcz (1970). It leads to the construction of a simple design model when the analysis cannot be based upon a two-valued logic. The reference is based on the semantics of Kripke, immersion in a definite possible world, and on the process of verification and confirmation of Carnap.
DONNARUMMA A, PAPPALARDO, Michele
openaire +2 more sources
1996
Throughout this chapter, we shall assume that k is a natural number larger than 2. We shall denote the set {0, 1,..., k − 1} by E k . The function f(x n ) = f(x 1, x 2,...,x n ) is called a function of the k-valued logic if, on any tuple α = (α 1, α2,..., α n ) of values of the variables x 1, x 2,..., x n , where α1 ∈ E k , the value f(a) also belongs ...
G. P. Gavrilov, A. A. Sapozhenko
openaire +1 more source
Throughout this chapter, we shall assume that k is a natural number larger than 2. We shall denote the set {0, 1,..., k − 1} by E k . The function f(x n ) = f(x 1, x 2,...,x n ) is called a function of the k-valued logic if, on any tuple α = (α 1, α2,..., α n ) of values of the variables x 1, x 2,..., x n , where α1 ∈ E k , the value f(a) also belongs ...
G. P. Gavrilov, A. A. Sapozhenko
openaire +1 more source
2018
Many-valued logics may be distinguished from classical logic on purely semantic grounds. One of the simplifying assumptions on which classical logic is based is the thesis of bivalence, which states that there are only two truth-values – true and false – and every sentence must be one or the other.
openaire +1 more source
Many-valued logics may be distinguished from classical logic on purely semantic grounds. One of the simplifying assumptions on which classical logic is based is the thesis of bivalence, which states that there are only two truth-values – true and false – and every sentence must be one or the other.
openaire +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
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