Results 221 to 230 of about 73,209 (264)

Analytic Calculi for Product Logics

Archive for Mathematical Logic, 2004
This 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, Nicola Olivetti, Dov M. Gabbay   +2 more
openaire   +3 more sources

Products of Modal Logics. Part 3: Products of Modal and Temporal Logics

Studia Logica, 2002
In 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

Multimo dal Logics of Products of Topologies

Studia Logica, 2006
If modal logics \(L_1,L_2\) with modalities \(\square_1,\square_2\) are determined by classes \(\mathbb{F}_1,\mathbb{F}_{2}\) of Kripke frames, then \(L_1 \times L_2\) is determined by the class of products \(\mathbb{F}_1 \times \mathbb{F}_{2}= \langle W_1 \times W_2,R_1,R_2\rangle\) and is axiomatized (by D. Gabbay and V.
Johan van Benthem, Guram Bezhanishvili, Balder ten Cate, Darko Sarenac   +3 more
openaire   +3 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   +3 more sources

Product Logic, Gödel Logic (and Boolean Logic)

1998
We 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

LSS: A system for production logic synthesis

IBM Journal of Research and Development, 1984
For some time we have been exploring methods of transforming functional specifications into hardware implementations that are suitable for production. The complexity of this task and the potential value have continued to grow with the increasing complexity of processor design and the mounting pressure to shorten machine design times.
John A. Darringer, Daniel Brand, John V. Gerbi, William H. Joyner Jr., Louise Trevillyan   +4 more
openaire   +1 more source

Complexity of products of modal logics

Journal of Logic and Computation, 1999
A product of Kripke frames is the product of their underlying sets with the original relations preserved along the corresponding coordinates. Products of frames and products of logics were introduced by the reviewer [Math. Notes 23, 417-424 (1978); translation from Mat.
openaire   +3 more sources

The Tensor Product of Operational Logics

Canadian Journal of Mathematics, 1986
The concept of an operational logic has been developed by Randall and Foulis ([l]-[4], [10], [11]) as a part of a larger effort to obtain a formalism suitable for expressing, comparing, and evaluating various approaches to empirical science, statistics, and in particular, quantum mechanics.
openaire   +1 more source

On states on the product of logics

International Journal of Theoretical Physics, 1981
We take up the question of when a state (= σ-additive measure) on the product of logics (=σ-orthomodular posets) depends on at most countably many coordinates. We show that it is always so provided there are no real-measurable cardinals. The manner of dependence is a kind of convex combination. We derive some consequences of the latter statement.
Manasova, V., Pták, P.
openaire   +1 more source

Reduced products and nonstandard logics

Journal of Symbolic Logic, 1969
The results of the present paper were announced in [1]. The work is divided into our parts. In the first part we define relations (relations between relational struc tures) and we show their connection with the equivalence of the languages LΚ,λ (Theorem 1).
openaire   +2 more sources