相关论文: Von Neumann coordinatization is not first-order

A partial lattice P is ideal-projective, with respect to a class C of lattices, if for every K $\in$ C and every homomorphism $\phi$ of partial lattices from P to the ideal lattice of K, there are arbitrarily large choice functions f : P…

We show that all balanced d-lattices must be complemented, answering a question of Chajda and Eigenthaler. (A bounded lattice is balanced if any two congruences agree on their 1-classes iff they agree on their 0-classes.) Our main tool is…

Let I be a dense linear order with a left endpoint but no right endpoint. We consider the lattice L(I) of finite unions of closed intervals of I. This lattice arises naturally in the setting of o-minimality, as these are precisely the…

We introduce a class of integrable $l$-field first-order lattices together with corresponding Lax equations. These lattices may be represented as consistency condition for auxiliary linear systems defined on sequences of formal dressing…

We start a systematic analysis of the first-order model theory of free lattices. Firstly, we prove that the free lattices of finite rank are not positively indistinguishable, as there is a positive $\exists \forall$-sentence true in…

We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among FINITE graphs. (This fact is a consequence of a general theorem proved by L. Ham and M. Jackson, and the…

We address the primary decomposition of the knot concordance group in terms of the solvable filtration and higher-order von Neumann $\rho$-invariants by Cochran, Orr, and Teichner. We show that for a nonnegative integer n, if the connected…

Svenonius theorem reduces the problem of first-order definability to the problem of relationship between groups of permutations. In the present paper we use this approach to describe the lattice of definable relations for the structure of…

A lattice L is called opc if every monotone function f : L^n -> L is induced by a polynomial. We show here: If L is a lattice with the interpolation property whose cardinality is a strong limit cardinal of uncountable cofinality, then some…

In this paper we primarily study monomial ideals and their minimal free resolutions by studying their associated LCM lattices. In particular, we formally define the notion of coordinatizing a finite atomic lattice P to produce a monomial…

In this paper we discuss the properties of the biordered set obtained from a complemented modular lattice and defines an operation using the sandwich elements of the biordered set. Further we describe a biordered subset satisfying certain…

Let $M$ be an uniformizable Anderson t-motive and $L(M)$ its lattice. First, we prove by an explicit construction that for the non-mixed $M$ the lattice map $M\mapsto L(M)$ is not injective. Second, we show that some lattices which do not…

A lattice L is spatial if every element of L is a join of completely join-irreducible elements of L (points), and strongly spatial if it is spatial and the minimal coverings of completely join-irreducible elements are well-behaved.…

Recently, in Axioms 10(2): 119 (2021), a nonclassical first-order theory T of sets and functions has been introduced as the collection of axioms we have to accept if we want a foundational theory for (all of) mathematics that is not weaker…

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…

A new result of G. Cz\'edli states that for an ordered set $P$ with at least two elements and a group $G$, there exists a bounded lattice $L$ such that the ordered set of principal congruences of $L$ is isomorphic to $P$ and the…

This paper gives a new way of characterizing L-space $3$-manifolds by using orderability of quandles. Hence, this answers a question of Adam Clay et al. [Question 1.1 of Canad. Math. Bull. 59 (2016), no. 3, 472-482]. We also investigate…

We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…

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…

We study (strong) first countability of locally solid convergence structures on Archimedean vector lattices. Among other results, we characterise those vector lattices for which relatively unform-, order-, and $\sigma$-order convergence,…