Results 121 to 130 of about 266,648 (159)
Some of the next articles are maybe not open access.
IEEE Transactions on Computers, 1974
A combinational circuit realizing the switching function f(x) may be regarded as a solution verifier for the Boolean equation f(x) = 1. (*) The output of the circuit is 1, that is, if and only if the input-vector x is a solution for (*). We use the term "equational logic" to denote an approach to circuit synthesis based on (*) rather than on the ...
openaire +2 more sources
A combinational circuit realizing the switching function f(x) may be regarded as a solution verifier for the Boolean equation f(x) = 1. (*) The output of the circuit is 1, that is, if and only if the input-vector x is a solution for (*). We use the term "equational logic" to denote an approach to circuit synthesis based on (*) rather than on the ...
openaire +2 more sources
MLQ, 2002
In a previous paper, the author analyzed the groups of automorphisms of various lattices of modal logics. In this paper he goes on with the study of the structure of the group of automorphisms of the lattice NExtK (the distributive lattice of normal logics). In this way, he studies logics which are invariant under all automorphisms in the group.
openaire +3 more sources
In a previous paper, the author analyzed the groups of automorphisms of various lattices of modal logics. In this paper he goes on with the study of the structure of the group of automorphisms of the lattice NExtK (the distributive lattice of normal logics). In this way, he studies logics which are invariant under all automorphisms in the group.
openaire +3 more sources
Product Logic, Gödel Logic (and Boolean Logic)
1998We are going to investigate the second of the three most important prepositional calculi, namely PC(*II) where *II is the product t-norm; we shall call this logic just the product logic and denote it by II. Recall that the corresponding implication is Goguen and the corresponding negation is Godel negation (cf. 2.1.11,2.1.17).
openaire +1 more source
1976
Strict analysis of quantum theory has shown that for certain propositions about quantum-mechanical systems some laws of logic lose their validity. This assertion is justified by pointing out that quantum mechanics is an empirically verified theory.
openaire +1 more source
Strict analysis of quantum theory has shown that for certain propositions about quantum-mechanical systems some laws of logic lose their validity. This assertion is justified by pointing out that quantum mechanics is an empirically verified theory.
openaire +1 more source
Co-opting signalling molecules enables logic-gated control of CAR T cells
Nature, 2023Aidan Tousley +2 more
exaly
Logic-in-memory based on an atomically thin semiconductor
Nature, 2020Guilherme Migliato Marega +2 more
exaly