Axiomatisability problems for S-posets

DOI10.1007/S00233-010-9273-7zbMATH Open1215.06007arXiv0912.4666OpenAlexW1990299321MaRDI QIDQ535221FDOQ535221

Authors: Lubna Shaheen, Victoria Gould 

Publication date: 11 May 2011

Published in: Semigroup Forum (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/0912.4666

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

zbMATH Keywords

freeprojectiveflataxiomatisability\(S\)-posets

Mathematics Subject Classification ID

Model theory of ordered structures; o-minimality (03C64) Ordered semigroups and monoids (06F05) Connections of semigroups with homological algebra and category theory (20M50)

Cites Work

• Monoids, acts and categories. With applications to wreath products and graphs. A handbook for students and researchers
• Title not available (Why is that?)
• INDECOMPOSABLE, PROJECTIVE, AND FLATS-POSETS
• Absolute flatness and amalgams in pomonoids
• Subpullbacks and Flatness Properties of S-Posets
• ORDER-CONGRUENCES ON S-POSETS
• Lazard's Theorem for S ‐posets
• Strongly Flat andPO-FlatS-Posets
• Axiomatizability and completeness of some classes of \(S\)-polygons
• Axiomatizability and completeness of some classes of partially ordered polygons
• AXIOMATISABILITY OF WEAKLY FLAT, FLAT, AND PROJECTIVES-ACTS
• Axiomatisability Problems for S -Systems
• Model-theoretic properties of free, projective, and flat \(S\)-acts
• Flatness properties of \(S\)-posets: an overview.
• Examples concerning absolute flatness and amalgamation in pomonoids.
• Axiomatisability problems for \(S\)-acts, revisited.
• Axiomatizability of free \(S\)-posets
• On condition (EP)
• Title not available (Why is that?)
• Perfection for pomonoids

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
• Title not available (Why is that?)

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)