A local normal form theorem for infinitary logic with unary quantifiers

Mathematical Logic Quarterly 51 (2):137-144 (2005)
  Copy   BIBTEX

Abstract

We prove a local normal form theorem of the Gaifman type for the infinitary logic L∞ωω whose formulas involve arbitrary unary quantifiers but finite quantifier rank. We use a local Ehrenfeucht-Fraïssé type game similar to the one in [9]. A consequence is that every sentence of L∞ωω of quantifier rank n is equivalent to an infinite Boolean combination of sentences of the form ψ, where ψ has counting quantifiers restricted to the -neighborhood of y

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 101,956

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2013-10-31

Downloads
57 (#385,219)

6 months
2 (#1,626,901)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Game-based notions of locality over finite models.Marcelo Arenas, Pablo Barceló & Leonid Libkin - 2008 - Annals of Pure and Applied Logic 152 (1-3):3-30.

Add more citations

References found in this work

Logical Hierarchies in PTIME.Lauri Hella - 1996 - Information And Computation 129 (1):1--19.

Add more references