Some classes of sets of structures definable without quantifiers

MaRDI QIDQ5094890zbMATH OpenFDO

Authors

Publication date 4 August 2022

Mathematics Subject Classification ID

Logic in computer science (03B70) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1104369
• On languages piecewise testable in the strict sense
• An Algebraic Characterization of Strictly Piecewise Languages
• Relativized adjacency
• Piecewise testable tree languages

Cited in

(3)

• ∑ n Definable Sets without ∑ n Induction
• WHICH CLASSES OF STRUCTURES ARE BOTH PSEUDO-ELEMENTARY AND DEFINABLE BY AN INFINITARY SENTENCE?
• Relativized adjacency

This page was built for publication: Some classes of sets of structures definable without quantifiers

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