Definability in substructure orderings. I: Finite semilattices

DOI10.1007/S00012-009-0002-6zbMATH Open1181.08004OpenAlexW2106009495MaRDI QIDQ1040653FDOQ1040653

Authors: Ralph McKenzie, Jaroslav Ježek 

Publication date: 25 November 2009

Published in: Algebra Universalis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00012-009-0002-6

Recommendations

• Definability in substructure orderings. II: Finite ordered sets
• Definability in substructure orderings. III: Finite distributive lattices
• Definability in the substructure ordering of simple graphs
• Definability in substructure orderings. IV: Finite lattices
• Semilattices of definable subalgebras. II

zbMATH Keywords

finite semilatticesfinitely axiomatizable universal classesfinitely generated universal classeslattice of universal classespositive definability

Mathematics Subject Classification ID

Equational classes, universal algebra in model theory (03C05) Semilattices (06A12) Lattices of varieties (08B15) Interpolation, preservation, definability (03C40) Axiomatic model classes (08C10)

Cites Work

• Definability in the lattice of equational theories of semigroups
• Title not available (Why is that?)
• Definability in the lattice of equational theories of commutative semigroups
• The ordering of commutative terms

Cited In (29)

• Semilattices of Definable Subalgebras
• Definable Sets in Ordered Structures. II
• Rogers Semilattices of Finite Partially Ordered Sets
• Title not available (Why is that?)
• Definability in the substructure ordering of simple graphs
• Definability in substructure orderings. II: Finite ordered sets
• Definability in substructure orderings. IV: Finite lattices
• Definability in substructure orderings. III: Finite distributive lattices
• Avoidable structures. I: Finite ordered sets, semilattices and lattices
• Axiomatizing the subsumption and subword preorders on finite and infinite partial words
• The lattice of definability. Origins, recent developments, and further directions
• Definability in first order theories of graph orderings
• Defining recursive predicates in graph orders
• Definability of recursive predicates in the induced subgraph order
• Semilattices of definable subalgebras. II
• On the automorphism group of the substructure ordering of finite directed graphs
• Definability in the embeddability ordering of finite directed graphs
• Definability in the Homomorphic Quasiorder of Finite Labeled Forests
• Definability in the Subword Order
• Definability in the embeddability ordering of finite directed graphs. II
• Complexity of counting first-order logic for the subword order
• The subtrace order and counting first-order logic
• Definability in the substructure ordering of finite directed graphs
• Complexity in Young's lattice
• Lattice of definability in the order of rational numbers
• Title not available (Why is that?)
• Identical inclusions of semilattices
• Alternating complexity of counting first-order logic for the subword order
• Well-Quasi Orders and Hierarchy Theory

This page was built for publication: Definability in substructure orderings. I: Finite semilattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1040653)