Languages with finite string of quantifiers on uncountable structures

MaRDI QIDQ5863858zbMATH OpenFDO

Authors Boris A. Romov

Publication date 3 June 2022

Full work available at URL https://www.oldcitypublishing.com/journals/mvlsc-home/mvlsc-issue-contents/mvlsc-volume-38-number-1-2-2022/mvlsc-38-1-2-p-197-226/

zbMATH Keywords

(weakly) homogeneous structureback-and-forth extendibilityelimination setGalois closurelanguage with finite string of quantifiers

Mathematics Subject Classification ID

Quantifier elimination, model completeness, and related topics (03C10) Models with special properties (saturated, rigid, etc.) (03C50) Operations and polynomials in algebraic structures, primal algebras (08A40)

Recommendations

• Homogeneous and strictly homogeneous criteria for partial structures
• scientific article; zbMATH DE number 444448
• Definability in infinitary languages and invariance by automorphims
• An introduction to the Scott complexity of countable structures and a survey of recent results
• scientific article; zbMATH DE number 1163948

Cites work

• Extendable local partial clones
• Homogeneous and strictly homogeneous criteria for partial structures
• scientific article; zbMATH DE number 44603 (Why is no real title available?)
• scientific article; zbMATH DE number 1007358 (Why is no real title available?)
• scientific article; zbMATH DE number 3266609 (Why is no real title available?)
• Local completeness. I
• Positive primitive structures
• Weak definability in infinitary languages
• Weakly extendable partial clones on an infinite set.

Cited in

(1)

• Existential relations on infinite structures

This page was built for publication: Languages with finite string of quantifiers on uncountable structures

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