Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T17:58:27.984Z Has data issue: false hasContentIssue false

Interpolation, preservation, and pebble games

Published online by Cambridge University Press:  12 March 2014

Jon Barwise
Affiliation:
Departments of Computer Science, Mathematics and Philosophy, Indiana University, Bloom Ington, IN 47405, USA E-mail: barwise@cs.indiana.edu
Johan van Benthem
Affiliation:
Institute for Logic, Language and Computation, University of Amsterdam, Amsterdam, The Netherlands E-mail: johan@wins.uva.nl

Abstract

Preservation and interpolation results are obtained for L ∞ω and sublogics ⊆ L ∞ω such that equivalence in can be characterized by suitable back-and-forth conditions on sets of partial isomorphisms.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1999

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable