Some useful preservation theorems

DOI10.2307/2273560zbMath0523.03021OpenAlexW2115765258MaRDI QIDQ3674627

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

relational structurescomponentfirst-order preservation theorems

Mathematics Subject Classification ID

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

Related Items (7)

Datalog Queries Distributing over Components ⋮ Universal Horn Sentences and the Joint Embedding Property ⋮ Modal and guarded characterisation theorems over finite transition systems ⋮ Certain answers as objects and knowledge ⋮ A logical approach to asymptotic combinatorics I. First order properties ⋮ Logics of Finite Hankel Rank ⋮ Negative Knowledge for Certain Query Answers

Cites Work

• Unnamed Item
• Asymptotic Methods in Enumeration
• An introduction to recursively saturated and resplendent models
• The Expected Number of Components Under a Random Mapping Function
• Probability of Indecomposability of a Random Mapping Function

This page was built for publication: Some useful preservation theorems