Abstract
AbstractEmbedded finite model theory refers to a formalism for describing finite structures over an uninterpreted signature, which sit within an infinite interpreted structures. Some theory was developed in the 1990s and early 2000s, with a focus on the real field. But the theory applies to arbitrary theories, and is relevant to recent development on graph querying and analysis of data-driven programs involving arithmetic.In this invited paper we review the framework and some of the basic results on it. We also discuss some open questions, along with some work in progress, joint with Ehud Hrushovski.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
