scholarly journals PROFINITENESS IN FINITELY GENERATED VARIETIES IS UNDECIDABLE

2018 ◽  
Vol 83 (04) ◽  
pp. 1566-1578 ◽  
Author(s):  
ANVAR M. NURAKUNOV ◽  
MICHAŁ M. STRONKOWSKI
Keyword(s):  
Finite Type ◽  
Finite Algebra ◽  
Topological Algebra ◽  
Inverse Limits ◽  
Finitely Generated ◽  
Finite Algebras ◽  
Image Position ◽  
Profinite Algebras

AbstractProfinite algebras are exactly those that are isomorphic to inverse limits of finite algebras. Such algebras are naturally equipped with Boolean topologies. A variety ${\cal V}$ is standard if every Boolean topological algebra with the algebraic reduct in ${\cal V}$ is profinite.We show that there is no algorithm which takes as input a finite algebra A of a finite type and decide whether the variety $V\left( {\bf{A}} \right)$ generated by A is standard. We also show the undecidability of some related properties. In particular, we solve a problem posed by Clark, Davey, Freese, and Jackson.We accomplish this by combining two results. The first one is Moore’s theorem saying that there is no algorithm which takes as input a finite algebra A of a finite type and decides whether $V\left( {\bf{A}} \right)$ has definable principal subcongruences. The second is our result saying that possessing definable principal subcongruences yields possessing finitely determined syntactic congruences for varieties. The latter property is known to yield standardness.

scholarly journals Finite algebras that generate an injectively complete modular variety

1991 ◽  
Vol 44 (2) ◽  
pp. 303-324 ◽  
Author(s):  
Keith A. Kearnes
Keyword(s):  
Finite Type ◽  
Finite Algebra ◽  
Finitely Generated ◽  
Modular Variety ◽  
Finite Algebras ◽  
Congruence Modular Variety ◽  
Congruence Distributive

We extend Kollár's result on finitely generated, injectively complete congruence distributive varieties to the congruence modular setting. By doing so we show that, given any finite algebra A of finite type, there is an algorithm to decide whether V(A) is an injectively complete, congruence modular variety.

Intensional interpretations of functionals of finite type I

1967 ◽  
Vol 32 (2) ◽  
pp. 198-212 ◽  
Author(s):  
W. W. Tait
Keyword(s):  
Finite Type ◽  
Type I ◽  
Axiom Schema ◽  
Image Position ◽  
Intuitionistic Arithmetic

T0 will denote Gödel's theory T[3] of functionals of finite type (f.t.) with intuitionistic quantification over each f.t. added. T1 will denote T0 together with definition by bar recursion of type o, the axiom schema of bar induction, and the schemaof choice. Precise descriptions of these systems are given below in §4. The main results of this paper are interpretations of T0 in intuitionistic arithmetic U0 and of T1 in intuitionistic analysis is U1. U1 is U0 with quantification over functionals of type (0,0) and the axiom schemata AC00 and of bar induction.

A First Approximation to {X, Y}

1969 ◽  
Vol 21 ◽  
pp. 702-711 ◽  
Author(s):  
Benson Samuel Brown
Keyword(s):  
Homotopy Theory ◽  
Abelian Groups ◽  
Classification Theorem ◽  
Finitely Generated ◽  
Finite Abelian Groups ◽  
First Approximation ◽  
Image Position

If ℭ and ℭ′ are classes of finite abelian groups, we write ℭ + ℭ′ for the smallest class containing the groups of ℭ and of ℭ′. For any positive number r, ℭ < r is the smallest class of abelian groups which contains the groups Zp for all primes p less than r.Our aim in this paper is to prove the following theorem.THEOREM. Iƒ ℭ is a class of finite abelian groups and(i) πi(Y) ∈ℭ for i < n,(ii) H*(X; Z) is finitely generated,(iii) Hi(X;Z)∈ ℭ for i > n + k,ThenThis statement contains many of the classical results of homotopy theory: the Hurewicz and Hopf theorems, Serre's (mod ℭ) version of these theorems, and Eilenberg's classification theorem. In fact, these are all contained in the case k = 0.

Quotients and Inverse Limits of Spaces of Orderings

1979 ◽  
Vol 31 (3) ◽  
pp. 604-616 ◽  
Author(s):  
Murray A. Marshall
Keyword(s):  
Quadratic Forms ◽  
Sums Of Squares ◽  
Inverse Limits ◽  
Witt Ring ◽  
Spaces Of Orderings ◽  
Image Position

A connection between the theory of quadratic forms defined over a given field F, and the space XF of all orderings of F is developed by A. Pfister in [12]. XF can be viewed as a set of characters acting on the group F×/ΣF×2, where ΣF×2 denotes the subgroup of F× consisting of sums of squares. Namely, each ordering P ∈ XF can be identified with the characterdefined byIt follows from Pfister's result that the Witt ring of F modulo its radical is completely determined by the pair (XF, F×/ΣF×2).

The mod ℭ Suspension Theorem

1969 ◽  
Vol 21 ◽  
pp. 684-701 ◽  
Author(s):  
Benson Samuel Brown
Keyword(s):  
Finite Group ◽  
Exact Sequence ◽  
Abelian Groups ◽  
Finitely Generated ◽  
Finite Abelian Groups ◽  
Cw Complexes ◽  
Image Position ◽  
A Finite Group

Our aim in this paper is to prove the general mod ℭ suspension theorem: Suppose that X and Y are CW-complexes,ℭ is a class offinite abelian groups, and that(i) πi(Y) ∈ℭfor all i < n,(ii) H*(X; Z) is finitely generated,(iii) Hi(X;Z) ∈ℭfor all i > k.Then the suspension homomorphismis a(mod ℭ) monomorphism for 2 ≦ r ≦ 2n – k – 2 (when r= 1, ker E is a finite group of order d, where Zd∈ ℭ and is a (mod ℭ) epimorphism for 2 ≦ r ≦ 2n – k – 2The proof is basically the same as the proof of the regular suspension theorem. It depends essentially on (mod ℭ) versions of the Serre exact sequence and of the Whitehead theorem.

scholarly journals Effective results for unit points on curves over finitely generated domains

2015 ◽  
Vol 158 (2) ◽  
pp. 331-353
Author(s):  
ATTILA BÉRCZES
Keyword(s):  
Algebraic Closure ◽  
Unit Group ◽  
Number Fields ◽  
Finitely Generated ◽  
Quotient Field ◽  
Effective Version ◽  
Formula Group ◽  
Commutative Domain ◽  
Image Position ◽  
Unit Equations

AbstractLet A be a commutative domain of characteristic 0 which is finitely generated over ℤ as a ℤ-algebra. Denote by A* the unit group of A and by K the algebraic closure of the quotient field K of A. We shall prove effective finiteness results for the elements of the set \begin{equation*} \mathcal{C}:=\{ (x,y)\in (A^*)^2 | F(x,y)=0 \} \end{equation*} where F(X, Y) is a non-constant polynomial with coefficients in A which is not divisible over K by any polynomial of the form XmYn - α or Xm - α Yn, with m, n ∈ ℤ⩾0, max(m, n) > 0, α ∈ K*. This result is a common generalisation of effective results of Evertse and Győry [12] on S-unit equations over finitely generated domains, of Bombieri and Gubler [5] on the equation F(x, y) = 0 over S-units of number fields, and it is an effective version of Lang's general but ineffective theorem [20] on this equation over finitely generated domains. The conditions that A is finitely generated and F is not divisible by any polynomial of the above type are essentially necessary.

Distinguished Subfields of Intermediate Fields

1981 ◽  
Vol 33 (5) ◽  
pp. 1085-1096 ◽  
Author(s):  
James K. Deveney ◽  
John N. Mordeson
Keyword(s):  
Finitely Generated ◽  
Separable Extension ◽  
Intermediate Field ◽  
Image Position ◽  
Separable Extensions

Let L be a finitely generated extension of a field K of characteristic p ≠ 0. If L/K is algebraic, then there is a unique intermediate field S such thatS is just the maximal separable extension of K in L. If L/K is not algebraic, then Dieudonne [4] showed there exist maximal separable extensions D of K in L such that L ⊆ Kp–∞⊗KD. In general, not every maximal separable extension of K in L has the property. Those which do have the property are called distinguished. Kraft [7] established that a maximal separable extension D of K in L is distinguished if and only if [L:D] is as small as possible. If the minimum of the [L:D] is pr, r is called the order of inseparability of L/K, denoted inor (L/K).Let L1 be an intermediate field of L/K. If L/K is algebraic, then the maximal separable extension S1 of K in L1 is contained in the maximal separable extension S of K in L, and moreover S is separable over S1.

scholarly journals VARIETIES OF DE MORGAN MONOIDS: COVERS OF ATOMS

2019 ◽  
Vol 13 (2) ◽  
pp. 338-374 ◽  
Author(s):  
T. MORASCHINI ◽  
J. G. RAFTERY ◽  
J. J. WANNENBURG
Keyword(s):  
The Other ◽  
Subdirectly Irreducible ◽  
Finitely Generated ◽  
Irreducible Algebra ◽  
Subdirectly Irreducible Algebra ◽  
Discriminator Varieties ◽  
Subvariety Lattice ◽  
Image Position

AbstractThe variety DMM of De Morgan monoids has just four minimal subvarieties. The join-irreducible covers of these atoms in the subvariety lattice of DMM are investigated. One of the two atoms consisting of idempotent algebras has no such cover; the other has just one. The remaining two atoms lack nontrivial idempotent members. They are generated, respectively, by 4-element De Morgan monoids C4 and D4, where C4 is the only nontrivial 0-generated algebra onto which finitely subdirectly irreducible De Morgan monoids may be mapped by noninjective homomorphisms. The homomorphic preimages of C4 within DMM (together with the trivial De Morgan monoids) constitute a proper quasivariety, which is shown to have a largest subvariety U. The covers of the variety (C4) within U are revealed here. There are just ten of them (all finitely generated). In exactly six of these ten varieties, all nontrivial members have C4 as a retract. In the varietal join of those six classes, every subquasivariety is a variety—in fact, every finite subdirectly irreducible algebra is projective. Beyond U, all covers of (C4) [or of (D4)] within DMM are discriminator varieties. Of these, we identify infinitely many that are finitely generated, and some that are not. We also prove that there are just 68 minimal quasivarieties of De Morgan monoids.

Finite axiomatizability for equational theories of computable groupoids

1989 ◽  
Vol 54 (3) ◽  
pp. 1018-1022 ◽  
Author(s):  
Peter Perkins
Keyword(s):  
Binary Operation ◽  
Finite Algebra ◽  
Equational Theory ◽  
Natural Numbers ◽  
Finite Axiomatizability ◽  
Finite Algebras ◽  
Equational Theories ◽  
Primitive Recursive ◽  
Positive Integers ◽  
Recursive Set

A computable groupoid is an algebra ‹N, g› where N is the set of natural numbers and g is a recursive (total) binary operation on N. A set L of natural numbers is a computable list of computable groupoids iff L is recursive, ‹N, ϕe› is a computable groupoid for each e ∈ L, and e ∈ L whenever e codes a primitive recursive description of a binary operation on N.Theorem 1. Let L be any computable list of computable groupoids. The set {e ∈ L: the equational theory of ‹N, ϕe› is finitely axiomatizable} is not recursive.Theorem 2. Let S be any recursive set of positive integers. A computable groupoid GS can be constructed so that S is inifinite iff GS has a finitely axiomatizable equational theory.The problem of deciding which finite algebras have finitely axiomatizable equational theories has remained open since it was first posed by Tarski in the early 1960's. Indeed, it is still not known whether the set of such finite algebras is recursively (or corecursively) enumerable. McKenzie [7] has shown that this question of finite axiomatizability for any (finite) algebra of finite type can be reduced to that for a (finite) groupoid.

scholarly journals EQUATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM

2008 ◽  
Vol 18 (08) ◽  
pp. 1283-1319 ◽  
Author(s):  
GEORGE F. McNULTY ◽  
ZOLTÁN SZÉKELY ◽  
ROSS WILLARD
Keyword(s):  
Finite Automata ◽  
Finite Algebra ◽  
Equational Theory ◽  
Upper And Lower Bounds ◽  
Variety Of Algebras ◽  
Membership Problem ◽  
Finite Algebras ◽  
Shift Automorphism ◽  
Positive Integers ◽  
Nonfinitely Based

We associate to each variety of algebras of finite signature a function on the positive integers called the equational complexity of the variety. This function is a measure of how much of the equational theory of a variety must be tested to determine whether a finite algebra belongs to the variety. We provide general methods for giving upper and lower bounds on the growth of equational complexity functions and provide examples using algebras created from graphs and from finite automata. We also show that finite algebras which are inherently nonfinitely based via the shift automorphism method cannot be used to settle an old problem of Eilenberg and Schützenberger.

Sign in / Sign up

Export Citation Format

Share Document