Results 251 to 260 of about 1,033,736 (302)
The specifics of the Galois field GF(257) and its use for digital signal processing. [PDF]
Sci RepBakirov A +4 more
europepmc +1 more source
Motivation to continue and the value of care work among French Red Cross volunteers and workers during the COVID-19 pandemic: a mixed methods study. [PDF]
BMC Public HealthHeyerdahl LW +4 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Calculi for Many-Valued Logics
Logica Universalis, 2021We present a number of equivalent calculi for many-valued logics and prove soundness and strong completeness theorems. The calculi are obtained from the truth tables of the logic under consideration in a straightforward manner and there is a natural duality among these calculi. We also prove the cut elimination theorems for the sequent-like systems.
Michael Kaminski, Nissim Francez
openaire +3 more sources
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 +3 more sources
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 +3 more sources
2001
Let me begin with a brief discussion of the name of this chapter: the adjective “advanced” in the title can only be understood in the temporal sense; the bulk of Urquhart’s chapter in this Handbook was written for the first edition in the early 1980s and, therefore, does not cover recent results in depth.
Reiner Hähnle
openaire +3 more sources
Let me begin with a brief discussion of the name of this chapter: the adjective “advanced” in the title can only be understood in the temporal sense; the bulk of Urquhart’s chapter in this Handbook was written for the first edition in the early 1980s and, therefore, does not cover recent results in depth.
Reiner Hähnle
openaire +3 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
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 +3 more sources
An Introduction to Many-valued Logics
Philosophical Studies, 1968B. Rundle
semanticscholar +5 more sources
Mathematical Proceedings of the Cambridge Philosophical Society, 1958
McCallum and Smith (1) have developed a logical computer which solves problems which are essentially of the following kind.
M. H. A. Newman, Alan Rose
openaire +3 more sources
McCallum and Smith (1) have developed a logical computer which solves problems which are essentially of the following kind.
M. H. A. Newman, Alan Rose
openaire +3 more sources