Definability with a predicate for a semi-linear set

DOI10.2178/JSL/1045861516MaRDI QIDQ4457736zbMATH OpenOpenAlexFDO

Authors Michael Benedikt, H. Jerome Keisler

Publication date 25 March 2004

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2178/jsl/1045861516

zbMATH Keywords

definabilityconstraint setsfirst-order linear constraint languagefoundations of spatial databases

Mathematics Subject Classification ID

Database theory (68P15) Logic in computer science (03B70)

Recommendations

• scientific article; zbMATH DE number 1670479
• scientific article; zbMATH DE number 5000345
• Definable predicates of standardness in internal set theory
• TOWARDS A THEORY OF DEFINABLE SETS
• scientific article; zbMATH DE number 1264815
• scientific article; zbMATH DE number 4097336
• Semilattices of Definable Subalgebras
• scientific article; zbMATH DE number 535104
• Definability under duality
• Definability with bounded number of bound variables

Cites work

• scientific article; zbMATH DE number 1395614 (Why is no real title available?)
• Definability of Geometric Properties in Algebraically Closed Fields
• Relational expressive power of constraint query languages

Cited in

(1)

• scientific article; zbMATH DE number 1670479 (Why is no real title available?)

This page was built for publication: Definability with a predicate for a semi-linear set

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