Some new results in definability

DOI10.1090/S0002-9904-1964-11244-1MaRDI QIDQ5509680zbMATH OpenOpenAlexFDO

Authors C. C. Chang

Publication date 1964

Published in Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/s0002-9904-1964-11244-1

zbMATH Keywords

mathematical logic

Cites work

• Homogeneous Universal Models.
• scientific article; zbMATH DE number 3085803 (Why is no real title available?)
• On a generalization of a theorem of E. W. Beth
• The completeness of logic with the added quantifier "there are uncountable many"

Cited in

(7)

• Constituents and finite identifiability
• Game sentences, recursive saturation and definability
• Global definability theory in 𝐿_{𝜔₁𝜔}
• Weak definability in infinitary languages
• Characterizing downwards closed, strongly first-order, relativizable dependencies
• A new theorem on definability in a positive second order logic with countable conjunctions and disjunctions
• Synthesizing nested relational queries from implicit specifications: via model theory and via proof theory

This page was built for publication: Some new results in definability

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