Order-isomorphic -orderings in Cohen extensions

Matrix-Isomorphic MaximalZ-Orders

✍ A.W. Chatters 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 124 KB

We construct many pairwise non-isomorphic maximal Z-orders A and B which have isomorphic n by n matrix rings for every positive integer n / 1. In most cases Ž . A also has the property that every one-sided ideal of M A is principal but not 2 every one-sided ideal of A is principal.

Isomorphism and higher order equivalence

✍ M. Ajtai 📂 Article 📅 1979 🏛 Elsevier Science ⚖ 833 KB

## A (K, A) tree is normal if Vx ~ T3y, z ~ T(y fi z A y < x A z < x A h,r(y) = h,r(Z) --hT(x)+ 1), The elements p, q of an arbitrary partially ordered set P are called incompatible if they have no common lower bound in P. An antichain is a set of pairwise incompatible elements in P. B is an a-b

Order isomorphisms of Fourier algebras

✍ Wolfgang Arendt; Jean De Cannière 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 397 KB

A First-Order Isomorphism Theorem

✍ Allender, Eric; Balcázar, José; Immerman, Neil 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 292 KB

Weak-order extensions of an order

✍ Karell Bertet; Jens Gustedt; Michel Morvan 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 304 KB

In this paper, at ÿrst we describe a digraph representing all the weak-order extensions of a partially ordered set and algorithms for generating them. Then we present a digraph representing all of the minimal weak-order extensions of a partially ordered set. This digraph also implies generation algo

Conditional ordering extensions

✍ José C. R. Alcantud 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 154 KB