Results 111 to 120 of about 20,509 (144)
Review: Christian U. Jensen and Helmut Lenzing, Model theoretic algebra
openaire +1 more source
Model-theoretic algebra C. U. Jensen and H. Lenzing, Gordon & Breach, 1988, 443 pp.
openaire +1 more source
openaire
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Model theoretic properties in the variety generated by a primal algebra
Algebra Universalis, 1993Let \({\mathbf P}\) denote a primal algebra (i.e. a finite algebra for which every function is a term function), let \({\mathbf B}\) be a Boolean algebra and let \({\mathbf P}[{\mathbf B}]\) denote the bounded Boolean power of \({\mathbf P}\) by \({\mathbf B}\).
openaire +3 more sources
Model Theoretic Algebra Selected Topics
Lecture Notes in Mathematics, 1976Greg Cherlin
openaire +3 more sources
Model Theoretic Algebra with particular emphasis on Fields, Rings, Modules
2022Christian U. Jensen, Helmut Lenzing
openaire +3 more sources
The Journal of Symbolic Logic, 1976
Since the late 1940's model theory has found numerous applications to algebra. I would like to indicate some of the points of contact between model theoretic methods and strictly algebraic concerns by means of a few concrete examples and typical applications. §1.
openaire +2 more sources
Since the late 1940's model theory has found numerous applications to algebra. I would like to indicate some of the points of contact between model theoretic methods and strictly algebraic concerns by means of a few concrete examples and typical applications. §1.
openaire +2 more sources
Algebraic and Model Theoretic Techniques for Fusion Decidability in Modal Logics
2003We introduce a new method (derived from model theoretic general combination procedures in automated deduction) for proving fusion decidability in modal systems. We apply it to show fusion decidability in case not only the boolean connectives, but also a universal modality and nominals are shared symbols.
Santocanale, Luigi, Ghilardi, Silvio
openaire +1 more source
Journal of Symbolic Logic, 1981
AbstractWe prove the following algebraic characterization of elementary equivalence: ≡ restricted to countable structures of finite type is minimal among the equivalence relations, other than isomorphism, which are preserved under reduct and renaming and which have the Robinson property; the latter is a faithful adaptation for equivalence relations of ...
openaire +2 more sources
AbstractWe prove the following algebraic characterization of elementary equivalence: ≡ restricted to countable structures of finite type is minimal among the equivalence relations, other than isomorphism, which are preserved under reduct and renaming and which have the Robinson property; the latter is a faithful adaptation for equivalence relations of ...
openaire +2 more sources

