相关论文: Von Neumann coordinatization is not first-order
In 1954 B. H. Neumann discovered that if $G$ is a group in which all conjugacy classes have finite cardinality at most $m$, then the derived group $G'$ is finite of $m$-bounded order. In 2018 G. Dierings and P. Shumyatsky showed that if…
Let $\mathcal M=(M,<,...)$ be a linearly ordered first-order structure and $T$ its complete theory. We investigate conditions for $T$ that could guarantee that $\mathcal M$ is not much more complex than some colored orders (linear orders…
Necessary and sufficient conditions are presented for the (first-order) theory of a universal class of algebraic structures (algebras) to admit a model completion, extending a characterization provided by Wheeler. For varieties of algebras…
This article is part of my upcoming masters thesis which investigates the following open problem from the book, Free Lattices, by R.Freese, J.Jezek, and J.B. Nation published in 1995: "Which lattices (and in particular which countable…
We here present a sufficient condition for general arrowing problems to be non definable in first order logic, based in well known tools of finite model theory e.g. Hanf's Theorem and known concepts in finite combinatorics, like senders and…
We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show that it is decidable to determine whether a constraint satisfaction…
We prove a general criterion for a von Neumann algebra $M$ in order to be in standard form. It is formulated in terms of an everywhere defined, invertible, antilinear, a priori not necessarily bounded operator, intertwining $M$ with its…
L. P. Belluce, A. Di Nola and B. Gerla established a connection between MV-algebras and (dually) lattice ordered semirings by means of so-called coupled semirings. A similar connection was found for basic algebras and semilattice ordered…
We investigate the complexity of the partial order relation of Young's lattice. The definable relations are characterized by establishing the maximal definability property modulo the single automorphism given by conjugation; consequently,…
We introduce a new class of lattices, the modernistic lattices, and their duals, the comodernistic lattices. We show that every modernistic or comodernistic lattice has shellable order complex. We go on to exhibit a large number of examples…
Structures involving a lattice and join-endomorphisms on it are ubiquitous in computer science. We study the cardinality of the set $\mathcal{E}(L)$ of all join-endomorphisms of a given finite lattice $L$. In particular, we show for…
Mittag-Leffler modules occur naturally in algebra, algebraic geometry, and model theory, [18], [12], [17]. If $R$ is a non-right perfect ring, then it is known that in contrast with the classes of all projective and flat modules, the class…
This paper pursues an investigation on groups equipped with an $L$-ordered relation, where $L$ is a fixed complete complete Heyting algebra. First, by the concept of join and meet on an $L$-ordered set, the notion of an $L$-lattice is…
We use the concept of a regular object with respect to another object in an arbitrary category, defined in \cite{dntd}, in order to obtain the transfer of regularity in the sense of Zelmanowitz between the categories $R-$mod and $S-$mod,…
This paper concerns the lattice $L_n$ of subsets of $\{1,\ldots,n\}$ that are arithmetic progressions, under the inclusion order. For $n\geq 4$, this poset is not graded and thus not semimodular. We give three independent proofs of the fact…
One of the nice properties of the first-order logic is the compactness of satisfiability. It state that a finitely satisfiable theory is satisfiable. However, different degrees of satisfiability in many-valued logics, poses various kind of…
We consider first-order logic with monoidal quantifiers over words. We show that all languages with a neutral letter, definable using the addition numerical predicate are also definable with the order predicate as the only numerical…
This article is part of my upcoming masters thesis which investigates the following open problem from the book, Free Lattices, by R.Freese, J.Jezek, and J.B. Nation published in 1995: "Which lattices (and in particular which countable…
In the second edition of the congruence lattice book, Problem 22.1 asks for a characterization of subsets $Q$ of a finite distributive lattice $D$ such that there is a finite lattice $L$ whose congruence lattice is isomorphic to $D$ and…
For a poset $(P,\leqslant)$ we consider the first-order theory, that is defined by set $P$ and relation $\leqslant$. The problem of undecidability of combinatorial theories attracts significant attention. Recently A. Wires proved the…