Related papers: Noetherian theories
A complete first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition.…
A first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition. Equationality…
We introduce a combinatorial criterion for verifying whether a formula is not the conjunction of an equation and a co-equation. Using this, we give a proof for the nonequationality of the free group. Furthermore, we generalize the latter…
A noetherian form is an abstract self-dual framework suitable for establishing homomorphism theorems (such as the isomorphism theorems and homological diagram lemmas) for group-like structures. In this paper we identify and carry out an…
This paper provides a canonical construction of a Noetherian least fixed point topology. While such least fixed point are not Noetherian in general, we prove that under a mild assumption, one can use a topological minimal bad sequence…
In this article, we describe the relation between the properties of being equational noetherian and ascending chain condition on ideals of an arbitrary algebra. We also give a formulation of Hilbert's basis theorem for varieties of algebras…
In recent years, researchers have discovered various large algebraic structures that have surprising finiteness properties, such as FI-modules and Delta-modules. In this paper, we add another example to the growing list: we show that…
We prove that any finite-degree polynomial functor is topologically Noetherian. This theorem is motivated by the recent resolution of Stillman's conjecture and a recent Noetherianity proof for the space of cubics. Via work by…
A first-order theory $T$ is a model-complete core theory if every first-order formula is equivalent modulo $T$ to an existential positive formula; the core companion of a theory $T$ is a model-complete core theory $S$ such that every model…
The first and second Noether theorems are formulated in a general case of reducible degenerate Grassmann-graded Lagrangian theory of even and odd variables on graded bundles. Such Lagrangian theory is characterized by a hierarchy of…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
This article discusses completeness of Boolean Algebra as First Order Theory in Goedel's meaning. If Theory is complete then any possible transformation is equivalent to some transformation using axioms, predicates etc. defined for this…
First order formulas in a relational signature can be considered as operations on the relations of an underlying set, giving rise to multisorted algebras we call first order algebras. We present universal axioms so that an algebra satisfies…
For any first order theory T we construct a Boolean valued model M, in which precisely the T--provable formulas hold, and in which every (Boolean valued) subset which is invariant under all automorphisms of M is definable by a first order…
Let K be any field and G be a finite group. Noether's problem asks whether the fixed field is rational (=purely transcendental) over K. We will prove that if G is a non-abelian p-group of order p^n containing a cyclic subgroup of index p…
From a logical point of view, Stone duality for Boolean algebras relates theories in classical propositional logic and their collections of models. The theories can be seen as presentations of Boolean algebras, and the collections of models…
Let $P_3(\mathbf{C}^{\infty})$ be the space of complex cubic polynomials in infinitely many variables. We show that this space is $\mathbf{GL}_{\infty}$-noetherian, meaning that any $\mathbf{GL}_{\infty}$-stable Zariski closed subset is cut…
We rewrite simplicially the standard definitions of a complete first order theory, a model of it, and various characterisations of stability of a complete first order theory. In our reformulations the simplicial language replaces the…
Polynomial reduction is one of the main tools in computational algebra with innumerable applications in many areas, both pure and applied. Since many years both the theory and an efficient design of the related algorithm have been solidly…
Let K be a field of characteristic zero. Motivated by the conjecture that an enveloping algebra U(g) is Noetherian only if g is finite dimensional, we define the notion of weakly Noetherian Lie algebras. The main result, Theorem A, states…