Results 261 to 270 of about 86,588 (304)
Some of the next articles are maybe not open access.
Soft Computing, 1998
In this paper we prove that the class of product algebras is a variety of bounded hoops, that this variety is the equivalent algebraic semantics (in the sense of [1]) of Product logic [11] and that the only axiomatic extension of Product logic that has the Deduction–Detachment Theorem is the Classical propositional logic.
Roma Adillon
exaly +2 more sources
In this paper we prove that the class of product algebras is a variety of bounded hoops, that this variety is the equivalent algebraic semantics (in the sense of [1]) of Product logic [11] and that the only axiomatic extension of Product logic that has the Deduction–Detachment Theorem is the Classical propositional logic.
Roma Adillon
exaly +2 more sources
Finite-valued approximations of product logic
Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000), 2002 In this paper we shall propose a method for the reduction of the problem of decidability in propositional infinite-valued Product Logic to suitably determined finite-valued approximating logics. In order to do so, functions associated with formulas of product logic are defined and their properties are exploited.
Stefano Aguzzoli, Brunella Gerla
openaire +4 more sources
Archive for Mathematical Logic, 2004
The authors develop a so-called product Łukasiewicz logic \(P{\L}\) which has the class of product MV-algebras as its semantic counterpart. These algebras have been investigated, e.g., by \textit{A. Di Nola} and \textit{A. Dvurečenskij} [Mult.-Valued Log. 6, No. 1--2, 193--215 (2001; Zbl 1016.06006)].
Petr Cintula +2 more
exaly +3 more sources
The authors develop a so-called product Łukasiewicz logic \(P{\L}\) which has the class of product MV-algebras as its semantic counterpart. These algebras have been investigated, e.g., by \textit{A. Di Nola} and \textit{A. Dvurečenskij} [Mult.-Valued Log. 6, No. 1--2, 193--215 (2001; Zbl 1016.06006)].
Petr Cintula +2 more
exaly +3 more sources
Product logic and probabilistic Ulam games
Fuzzy Sets and Systems, 2007 There is a well-known game semantics for Lukasiewicz logic, introduced by Daniele Mundici, namely the Rényi–Ulam game. Records in a Rény–Ulam game are coded by functions, which constitute an MV-algebra, and it is possible to prove a completeness ...
Franco Montagna
exaly +2 more sources
Embedding Logics into Product Logic
Studia Logica, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Matthias Baaz +3 more
openaire +1 more source
Enterprise logic vs product logic: the development of GE’s computer product line
Business History, 2017 The following article focuses on corporate strategies at General Electric (GE) and how corporate-level interventions impacted the market performance of the firm’s general purpose commercial mainframe product set in the period 1960–1968.
Edwards, Roy, Gandy, Anthony
exaly +2 more sources
On the Products of Linear Modal Logics
Journal of Logic and Computation, 2001Two-dimensional Cartesian products of modal logics determined by infinite or arbitrarily long finite linear orders are studied. It is proved that in many cases these products are undecidable (in particular the squares of standard linear logics like \textbf{K4.3, S4.3, GL.3, Grz.3} or the logic determined by the Cartesian square of any infinite linear ...
Mark Reynolds 0001 +1 more
openaire +3 more sources
Product Łukasiewicz Quantum Logic
International Journal of Theoretical Physics, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BERTINI, Cesarino, LEPORINI, Roberto
openaire +3 more sources
Analytic Calculi for Product Logics
Archive for Mathematical Logic, 2004This interesting paper offers a considerable progress in the proof theory for two product-related t-norm-based propositional infinite-valued logics: for the standard product logic \(\Pi\) and for the cancellative hoop logic \textbf{CHL}. The authors first give hypersequent calculi for these logics, then introduce sequent calculi for labelled formulae ...
George Metcalfe +2 more
openaire +3 more sources
Products of Modal Logics. Part 3: Products of Modal and Temporal Logics
Studia Logica, 2002In this paper we improve the results of [2] by proving the product f.m.p. for the product of minimal n-modal and minimal n-temporal logic. For this case we modify the finite depth method introduced in [1]. The main result is applied to identify new fragments of classical first-order logic and of the equational theory of relation algebras, that are ...
Gabbay, D, Shehtman, V
openaire +2 more sources