𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Effective extensions of partial orders

✍ Scribed by Dev Kumar Roy


Publisher
John Wiley and Sons
Year
1990
Tongue
English
Weight
241 KB
Volume
36
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Unitary extensions of partial isometries
✍ Nieves Amoretti; Marisela Domínguez 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB

If S (n ,m ) (n ,m )≥(0, 0) is a multiplicative family of partial isometries on Z 2 with the lexicographic order, then S (1, 0) and S (0, 1) commute in a certain weak sense. Let A and B be commuting unitary extensions of S (1, 0) and S (0, 1) . We give a sufficient condition for A n B m (n ,m )∈Z 2

On the extension of measures with values
✍ Zdena Riečanová; Ivica Rosová 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 422 KB

Clearly the sum as well as the maximum of two real numbers can be presented as a semigroup operation. So the measure with values in a partially ordered semigroup is a common generalization of additive or subadditive and maxitive measures (see Section 4). The extension of such measures we realize by

Phase Transitions in the Evolution of Pa
✍ Hans Jürgen Prömel; Angelika Steger; Anusch Taraz 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 331 KB

We determine the approximate number of partial orders with a fixed number of comparable pairs, give a complete description of the evolution of partial orders, and prove that infinitely many phase transitions occur. This answers questions posed by Dhar, Kleitman, and Rothschild 20 years ago.

Fregean Extensions of First-Order Theori
✍ John L. Bell 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 205 KB

## Abstract It is shown by Parsons [2] that the first‐order fragment of Frege's (inconsistent) logical system in the __Grundgesetze der Arithmetic__ is consistent. In this note we formulate and prove a stronger version of this result for arbitrary first‐order theories. We also show that a natural a

Stability of representations of effectiv
✍ Jens Blanck; Viggo Stoltenberg-Hansen; John V. Tucker 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 171 KB

An algebra is effective if its operations are computable under some numbering. When are two numberings of an effective partial algebra equivalent? For example, the computable real numbers form an effective field and two effective numberings of the field of computable reals are equivalent if the limi

A Robinson–Schensted Algorithm for a Cla
✍ Thomas S. Sundquist; David G. Wagner; Julian West 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 378 KB

Let P be a finite partial order which does not contain an induced subposet isomorphic with 3+1, and let G be the incomparability graph of P. Gasharov has shown that the chromatic symmetric function X G has nonnegative coefficients when expanded in terms of Schur functions; his proof uses the dual Ja