Some useful preservation theorems

DOI10.2307/2273560MaRDI QIDQ3674627zbMATH OpenOpenAlexFDO

Authors Kevin J. Compton

Publication date 1983

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

Full work available at URL https://doi.org/10.2307/2273560

zbMATH Keywords

componentfirst-order preservation theoremsrelational structures

Mathematics Subject Classification ID

Categoricity and completeness of theories (03C35) Interpolation, preservation, definability (03C40)

Cites work

• An introduction to recursively saturated and resplendent models
• Asymptotic Methods in Enumeration
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• Probability of Indecomposability of a Random Mapping Function
• The Expected Number of Components Under a Random Mapping Function

Cited in

(7)

• A logical approach to asymptotic combinatorics I. First order properties
• Modal and guarded characterisation theorems over finite transition systems
• Certain answers as objects and knowledge
• Logics of finite Hankel rank
• Universal Horn Sentences and the Joint Embedding Property
• Negative knowledge for certain query answers
• Datalog queries distributing over components

This page was built for publication: Some useful preservation theorems

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