Axiomatisability problems for S-posets
From MaRDI portal
Abstract: Let C be a class of algebras of a given fixed type t. Associated with the type is a first order language L_t. One can then ask the question, when is the class C axiomatisable by sentences of L_t. In this paper we will be considering axiomatisability problems for classes of left S-posets over a pomonoid S (that is, a monoid S equipped with a partial order compatible with the binary operation). We aim to determine the pomonoids S such that certain categorically defined classes are axiomatisable. The classes we consider are the free S-posets, the projective S-posets and classes arising from flatness properties. Some of these cases have been studied in a recent article by Pervukhin and Stepanova. We present some general strategies to determine axiomatisability, from which their results for the classes of weakly po-flat and po-flat S-posets will follow. We also consider a number of classes not previously examined.
Recommendations
- Axiomatizability of free \(S\)-posets
- Axiomatisability Problems for S -Systems
- Axiomatisability Problems for S -Systems
- Finite axiomatizations for existentially closed posets and semilattices
- Recursive axiomatizations for representable posets
- scientific article; zbMATH DE number 966840
- Axiomatisability problems for S-acts, revisited.
- scientific article; zbMATH DE number 978246
- Poset extensions, convex sets, and semilattice presentations
- Induced and non-induced poset saturation problems
Cites work
- scientific article; zbMATH DE number 3859196 (Why is no real title available?)
- scientific article; zbMATH DE number 5492069 (Why is no real title available?)
- AXIOMATISABILITY OF WEAKLY FLAT, FLAT, AND PROJECTIVES-ACTS
- Absolute flatness and amalgams in pomonoids
- Axiomatisability Problems for S -Systems
- Axiomatisability problems for S-acts, revisited.
- Axiomatizability and completeness of some classes of \(S\)-polygons
- Axiomatizability and completeness of some classes of partially ordered polygons
- Axiomatizability of free \(S\)-posets
- Examples concerning absolute flatness and amalgamation in pomonoids.
- Flatness properties of \(S\)-posets: an overview.
- INDECOMPOSABLE, PROJECTIVE, AND FLATS-POSETS
- Lazard's Theorem for S ‐posets
- Model-theoretic properties of free, projective, and flat \(S\)-acts
- Monoids, acts and categories. With applications to wreath products and graphs. A handbook for students and researchers
- ORDER-CONGRUENCES ON S-POSETS
- On condition (EP)
- Perfection for pomonoids
- Strongly Flat andPO-FlatS-Posets
- Subpullbacks and Flatness Properties of S-Posets
Cited in
(8)- INDECOMPOSABLE, PROJECTIVE, AND FLATS-POSETS
- Axiomatisability Problems for S -Systems
- Perfection for pomonoids
- Axiomatisability problems for S-acts, revisited.
- A non-messing-up phenomenon for posets
- Axiomatizability of free \(S\)-posets
- On regular partially ordered polygons
- scientific article; zbMATH DE number 6131650 (Why is no real title available?)
This page was built for publication: Axiomatisability problems for \(S\)-posets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q535221)