Related papers: Iteratively algebraic orders

A partial algebra construction of Gr\"atzer and Schmidt from "Characterizations of congruence lattices of abstract algebras" (Acta Sci. Math. (Szeged) 24 (1963), 34-59) is adapted to provide an alternative proof to a well-known fact that…

A very short proof of G\"odel's second incompleteness theorem (for set theory, second order arithmetic etc.)

We study certain lattices constructed from finite abelian groups. We show that such a lattice is eutactic, thereby confirming a conjecture by B\"ottcher, Eisenbarth, Fukshansky, Garcia, Maharaj. Our methods also yield simpler proofs of two…

Zilber's Theorem states that a finite lattice $L$ is planar if{}f it has a complementary order relation. We provide a new proof for this crucial result and discuss some applications, including a canonical form for finite planar lattices and…

We describe a natural generalization of irreducibility in order lattices with arbitrary metrics. We analyse the special cases of valuation metrics and more general metrics for lattices. This article is mainly based on a part of the author's…

We show that the first order theory of the lattice of open sets in some natural topological spaces is $m$-equivalent to second order arithmetic. We also show that for many natural computable metric spaces and computable domains the first…

We continue the algebraic investigation of PBZ*-lattices, a notion introduced in [12] in order to obtain insights into the structure of certain algebras of effects of a Hilbert space, lattice-ordered under the spectral ordering.

For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…

The direct application of the definition of sorting in lattices is impractical because it leads to an algorithm with exponential complexity. In this paper we present for distributive lattices a recursive formulation to compute the sort of a…

Let $ R \subset \R $ be a GCD-domain. In this paper, Weinberg's conjecture on the $ n \times n $ matrix algebra $ M_{n}(R) \ (n \geq 2) $ is proved. Moreover, all the lattice orders (up to isomorphisms) on a full $ 2 \times 2 $ matrix…

We give an elementary proof of low rank cases of the conjecture that the tensor product of two semistable Euclidean lattices is again semistable.

For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…

Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…

We give a new proof of the fundamental theorem of algebra. It is entirely elementary, focused on using long division to its fullest extent. Further, the method quickly recovers a more general version of the theorem recently obtained by…

We give a "soft" proof of Alberti's Luzin-type theorem in [1] (G. Alberti, A Lusintype theorem for gradients, J. Funct. Anal. 100 (1991)), using elementary geometric measure theory and topology. Applications to the $C^2$-rectifiability…

In this paper we present a surprisingly short proof of Minkowski's second theorem. The author hopes there is no mistake in it, though the argument seems to be too plain to contain one. Also, we apply the main construction of the proof to…

We prove a Ramsey theorem for finite sets equipped with a partial order and a fixed number of linear orders extending the partial order. This is a common generalization of two recent Ramsey theorems due to Soki\'c. As a bonus, our proof…

We give a short direct proof of Agler's factorization theorem that uses the abstract characterization of operator algebras. the key ingredient of this proof is an operator algebra factorization theorem. Our proof provides some additional…

One of the longstanding problems in universal algebra is the question of which finite lattices are isomorphic to the congruence lattices of finite algebras. This question can be phrased as which finite lattices can be represented as…

This paper proposes a totally constructive approach for the proof of Hilbert's theorem on ternary quartic forms. The main contribution is the ladder technique, with which the Hilbert's theorem is proved vividly.