Definability with a predicate for a semi-linear set

DOI10.2178/JSL/1045861516zbMATH Open1045.03032OpenAlexW2039212072MaRDI QIDQ4457736FDOQ4457736

H. Jerome Keisler, Michael Benedikt

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

Recommendations

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

zbMATH Keywords

definabilityconstraint setsfirst-order linear constraint languagefoundations of spatial databases

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Relational expressive power of constraint query languages
• Definability of Geometric Properties in Algebraically Closed Fields

Cited In (1)

• Title not available (Why is that?)

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)