Some useful preservation theorems

DOI10.2307/2273560zbMATH Open0523.03021OpenAlexW2115765258MaRDI QIDQ3674627FDOQ3674627

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

componentrelational structuresfirst-order preservation theorems

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• An introduction to recursively saturated and resplendent models
• Asymptotic Methods in Enumeration
• The Expected Number of Components Under a Random Mapping Function
• Probability of Indecomposability of a Random Mapping Function

Cited In (7)

• A logical approach to asymptotic combinatorics I. First order properties
• Universal Horn Sentences and the Joint Embedding Property
• Modal and guarded characterisation theorems over finite transition systems
• Negative knowledge for certain query answers
• Certain answers as objects and knowledge
• Logics of finite Hankel rank
• 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)