Results 251 to 260 of about 634,908 (300)
Some of the next articles are maybe not open access.
Studia Logica, 2013
A bilattice is an algebra \(\mathbf{B} = \langle B, \land,\lor,\otimes,\oplus, \neg \rangle\) such that the reducts \(\langle B,\land, \lor \rangle\) and \(\langle B,\otimes,\oplus, \rangle\) are both lattices and the negation \(\neg\) is a unary operation anti-monotone relative to both orders and such that for every \(a \in B\) we have \(a = \neg \neg
Félix Bou, Umberto Rivieccio
openaire +1 more source
A bilattice is an algebra \(\mathbf{B} = \langle B, \land,\lor,\otimes,\oplus, \neg \rangle\) such that the reducts \(\langle B,\land, \lor \rangle\) and \(\langle B,\otimes,\oplus, \rangle\) are both lattices and the negation \(\neg\) is a unary operation anti-monotone relative to both orders and such that for every \(a \in B\) we have \(a = \neg \neg
Félix Bou, Umberto Rivieccio
openaire +1 more source
2008
We argue that the usual trace-based notions of implication and equivalence for linear temporal logics are too strong and should be complemented by the weaker notions of open implication and open equivalence. Although open implication is harder to compute, it can be used to advantage both in model checking and in synthesis.
Greimel K. +3 more
openaire +1 more source
We argue that the usual trace-based notions of implication and equivalence for linear temporal logics are too strong and should be complemented by the weaker notions of open implication and open equivalence. Although open implication is harder to compute, it can be used to advantage both in model checking and in synthesis.
Greimel K. +3 more
openaire +1 more source
A class of implications related to Yager’s f-implications
Information Sciences, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dana Hlinená +2 more
openaire +3 more sources
Journal of Philosophical Logic, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
IEEE Transactions on Electronic Computers, 1967
Correspondence between logical relations of Boolean function implicants and numerical relations between ...
openaire +3 more sources
Correspondence between logical relations of Boolean function implicants and numerical relations between ...
openaire +3 more sources
Prime Implicates and Reduced Implicate Tries
2009The reduced implicate trie (ri -trie) is a data structure that was introduced as a target language for knowledge compilation. It has the property that, even when large, it guarantees fast response to queries. It also has the property that each prime implicate of the formula it represents corresponds to a branch.
Neil V. Murray, Erik Rosenthal
openaire +1 more source
Constructive negation, implication, and co-implication
Journal of Applied Non-Classical Logics, 2008In this paper, a family of paraconsistent propositional logics with constructive negation, constructive implication, and constructive co-implication is introduced.
openaire +2 more sources
International Journal of Intelligent Systems, 1992
Summary: We study some problems of synthesizing implications by using quasi- arithmetic means. By solving several functional equations some interesting characterizations are obtained.
Claudi Alsina, Enric Trillas
openaire +2 more sources
Summary: We study some problems of synthesizing implications by using quasi- arithmetic means. By solving several functional equations some interesting characterizations are obtained.
Claudi Alsina, Enric Trillas
openaire +2 more sources
Simplified Axiom Schemes for Implication and Iterated Implication
Mathematical Logic Quarterly, 1985Let C be the primitive implication functor of Łukasiewicz [\textit{J. Łukasiewicz} and \textit{A. Tarski}, Untersuchungen über den Aussagenkalkül, C. R. Soc. Sci. Varsovie, Classe III 23, 30-50 (1930)] and let \(I_ jPQ=_ T(CP)^ jQ,\) and \(I'_ jPQ=_ TI_ jQP (j=1,2,...).\) We obtain a complete formalisation of the m-valued \((m>2)\) propositional ...
openaire +3 more sources
Comment: Implications of Implication Analysis
Sociological Methodology, 2008* We do not test theories-we evaluate them. Rarely if ever does a single "crucial test" establish or falsify a theory. Instead of futile searches for crucial tests, social scientists should evaluate theories on the basis of the weight of the evidence from a wide range of relevant evidence.
openaire +1 more source