Show simple item record

dc.contributor.authorImmerman, Neilen_US
dc.contributor.authorKozen, Dexteren_US
dc.date.accessioned2007-04-23T17:18:39Z
dc.date.available2007-04-23T17:18:39Z
dc.date.issued1987-03en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR87-818en_US
dc.identifier.urihttp://hdl.handle.net/1813/6658
dc.description.abstractA theory satisfies the $k$-variable-property if every first-order formula is equivalent to a formula with at most $k$ bound variables (possibly reused). Gabbay has shown that a fixed time structure satisfies the $k$-variable property for some $k$ if and only if there exists a finite basis for the temporal connectives over that structure. We give a model-theoretic method for establishing the $k$-variable property, involving a restricted Ehrenfeucht-Fraisse game in which each player has only $k$ pebbles. We use the method to unify and simplify results in the literature for linear orders. We also establish new $k$-variable properties for various theories of bounded-degree trees, and in each case obtain tight upper and lower bounds on $k$. This gives the first finite basis theorems for branching-time models.en_US
dc.format.extent1566781 bytes
dc.format.extent279802 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleDefinability with Bounded Number of Bound Variablesen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics