English
Related papers

Related papers: Model theory of term algebras revisited

200 papers

We study various formulations of the completeness of first-order logic phrased in constructive type theory and mechanised in the Coq proof assistant. Specifically, we examine the completeness of variants of classical and intuitionistic…

Logic in Computer Science · Computer Science 2021-12-15 Yannick Forster , Dominik Kirst , Dominik Wehr

It is known that any finite idempotent algebra that satisfies a nontrivial Maltsev condition must satisfy the linear one-equality Maltsev condition (a variant of the term discovered by M. Siggers and refined by K. Kearnes, P. Markovi\'c,…

Rings and Algebras · Mathematics 2018-07-25 Alexandr Kazda

We study expansions of Hilbert spaces with a bounded normal operator $T$. We axiomatize this theory in a natural language and identify all of its completions. We prove the definability of the adjoint $T^*$ and prove quantifier elimination…

Logic · Mathematics 2025-07-30 Alexander Berenstein , Nicolás Cuervo Ovalle , Isaac Goldbring

We give an exposition of results of Baldwin-Shelah on saturated free algebras, at the level of generality of complete first order theories $T$ with a saturated model $M$ which is in the algebraic closure of an indiscernible set. We then…

Logic · Mathematics 2014-10-01 Anand Pillay , Rizos Sklinos

A $\mu$-algebra is a model of a first order theory that is an extension of the theory of bounded lattices, that comes with pairs of terms $(f,\mu_{x}.f)$ where $\mu_{x}.f$ is axiomatized as the least prefixed point of $f$, whose axioms are…

Rings and Algebras · Mathematics 2007-05-23 Luigi Santocanale

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…

Discrete Mathematics · Computer Science 2017-08-08 Emmanuel Jeandel

For every algebraically closed field $\boldsymbol k$ of characteristic different from $2$, we prove the following: (1) Generic finite dimensional (not necessarily associative) $\boldsymbol k$-algebras of a fixed dimension, considered up to…

Algebraic Geometry · Mathematics 2015-01-20 Vladimir L. Popov

By operations on models we show how to relate completeness with respect to permissive-nominal models to completeness with respect to nominal models with finite support. Models with finite support are a special case of permissive-nominal…

Logic in Computer Science · Computer Science 2013-05-28 Murdoch J. Gabbay

This paper is concerned with the algebraic K-theory of locally convex algebras stabilized by operator ideals, and its comparison with topological K-theory. We show that the obstruction for the comparison map between algebraic and…

K-Theory and Homology · Mathematics 2011-08-03 Guillermo Cortiñas , Andreas Thom

We introduce a model-complete theory which completely axiomatizes the structure $Z_{\alpha}=(Z, +, 0, 1, f)$ where $f : x \to \lfloor{\alpha} x \rfloor $ is a unary function with $\alpha$ a fixed transcendental number. When $\alpha$ is…

Logic · Mathematics 2025-10-16 Mohsen Khani , Ali N. Valizadeh , Afshin Zarei

We prove two completeness results for Kleene algebra with tests and a top element, with respect to guarded string languages and binary relations. While the equational theories of those two classes of models coincide over the signature of…

Formal Languages and Automata Theory · Computer Science 2024-10-09 Damien Pous , Jana Wagemaker

Term algebras are important objects in computer science and are correspondingly well-studied. A natural generalization is to quotient these algebras by finitely many ground term equations, obtaining what we call almost free algebras. One of…

Logic · Mathematics 2026-04-28 Yifan Jia , Heer Tern Koh , Bakh Khoussainov

This expository paper treats the model theory of probability spaces using the framework of continuous $[0,1]$-valued first order logic. The metric structures discussed, which we call probability algebras, are obtained from probability…

Logic · Mathematics 2023-02-06 Alexander Berenstein , C. Ward Henson

We extend the concept of "almost indiscernible theory" introduced by Pillay and Sklinos in [Bull. Symb. Log., 2015] (which was itself a modernization and expansion of Baldwin and Shelah [Algebra Universalis, 1983]), to uncountable languages…

Logic · Mathematics 2022-01-14 T. G. Kucera , Anand Pillay

In this paper, we first present a classification theorem of infinite-dimensional simple Novikov algebras over an algebraically closed field with characteristic 0. Then we classify all the irreducible modules of a certain…

Quantum Algebra · Mathematics 2007-05-23 Xiaoping Xu

This paper continues the investigation of quasilength, of content of local cohomology with respect to generators of the support ideal, and of robust algebras begun in joint work of Hochster and Huneke. We settle several questions raised by…

Commutative Algebra · Mathematics 2016-09-23 Mel Hochster , Wenliang Zhang

We investigate atomicity of free algebras and various forms of amalgamation for BL and MV algebras, and also Heyting algebras, though the latter algebras may not be linearly ordered, so strictly speaking their corresponding intuitionistic…

Logic · Mathematics 2013-04-05 Tarek Sayed Ahmed

A brief introduction to universal algebra and the theory of topological algebras, their varieties, and free topological algebras is presented. Free topological Mal'tsev algebras are studied. Their properties, relationship with topological…

General Mathematics · Mathematics 2024-12-17 Ol'ga V. Sipacheva , Aleksandr A. Solonkov

'Skolem arithmetic' is the complete theory $T$ of the multiplicative monoid $(\mathbb{N},\cdot)$. We give a full characterization of the $\varnothing$-definable stably embedded sets of $T$, showing in particular that, up to the relation of…

Logic · Mathematics 2021-09-03 Atticus Stonestrom

We give algebraic conditions about a finite algebra $B$ over a perfect field of positive characteristic, which are equivalent to the companionability of the theory of fields with "$B$-operators" (i.e. the operators coming from homomorphisms…

Logic · Mathematics 2019-05-16 Özlem Beyarslan , Daniel Max Hoffmann , Moshe Kamensky , Piotr Kowalski
‹ Prev 1 2 3 10 Next ›