Related papers: A first-order theory of Ulm type

We introduce higher-order support varieties for pairs of modules over a commutative local complete intersection ring, and give a complete description of which varieties occur as such support varieties. In the context of a group algebra of a…

As mathematical induction is applied to prove statements on natural numbers, {\it continuous induction} (or, {\it real induction}) is a tool to prove some statements in real analysis.(Although, this comparison is somehow an overstatement.)…

We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…

Combinatorial design theory studies set systems with certain balance and symmetry properties and has applications to computer science and elsewhere. This paper presents a modular approach to formalising designs for the first time using…

We estimate the fraction of isogeny classes of abelian varieties over a finite field which have a given characteristic polynomial P(T) modulo l. As an application we find the proportion of isogeny classes of abelian varieties with a…

A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…

Let p be an odd prime, F the field of p elements and G a finite abelian p-group with an arbitrary involutory automorphism. Extend this automorphism to the group algebra FG and consider the unitary and the symmetric normalized units of FG.…

For every $p\geq 2$ we show that each finite $p$-group with an unmixed Beauville structure is part of a surjective infinite projective system of finite $p$-groups with compatible unmixed Beauville structures. This leads to the new notion of…

We study the Modular Isomorphism Problem applying a combination of existing and new techniques. We make use of the small group algebra to give a positive answer for two classes of groups of nilpotency class 3. We also introduce a new…

We show that the common theory of all modules over a tubular algebra (over a recursive algebraically closed field) is decidable. This result supports a long standing conjecture of Mike Prest which says that a finite-dimensional algebra…

Martin-L\"of's Intuitionistic Theory of Types is becoming popular for formal reasoning about computer programs. To handle recursion schemes other than primitive recursion, a theory of well-founded relations is presented. Using primitive…

We try to understand complete types over a somewhat saturated model of a complete first order theory which is dependent (previously called NIP), by "decomposition theorems for such types". Our thesis is that the picture of dependent theory…

We prove that no infinite field is interpretable in the first-order theory of nonabelian free groups. We also obtain a characterization of Abelian groups interpretable in this theory.

The main objective of this paper is the following two results. (1) There exists a computable bi-orderable group that does not have a computable bi-ordering; (2) There exists a bi-orderable, two-generated recursively presented solvable group…

Let $p$ be an odd prime, $D_{2p}$ be the dihedral group of order 2p, and $F_{2}$ be the finite field with two elements. If * denotes the canonical involution of the group algebra $F_2D_{2p}$, then bicyclic units are unitary units. In this…

Let $L$ be the language of rings. We provide an axiomatization of the $L$-theories of quaternions and octonions and characterize their models: they coincide, up to isomorphism, with quaternion and octonion algebras over a real closed field,…

We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…

We develop algebraic models of simple type theories, laying out a framework that extends universal algebra to incorporate both algebraic sorting and variable binding. Examples of simple type theories include the unityped and simply-typed…

Let \phi be a first order formula and M be a countable model. \phi^M denotes the set of all assignments that satisfy \phi in M. Let M, N be countable models. A formula \phi distinguishes these models if |\phi^M|\neq |\phi^N|. We show that…

Let $G$ be an ordered group that is a direct sum of a rank-one torsion-free abelian group and a finite-rank torsion-free abelian group, with order structure arising from the natural order on the first summand. A necessary condition and a…