Relational Structures Constructible by Quantifier Free Definable Operations

&
Journal of Symbolic Logic 72 (4):1283 - 1298 (2007)
  Copy   BIBTEX

Abstract

We consider the notion of bounded m-ary patch-width defined in [9], and its very close relative m-constructibility defined below. We show that the notions of m-constructibility all coincide for m ≥ 3, while 1-constructibility is a weaker notion. The same holds for bounded m-ary patch-width. The case m = 2 is left open

Categories

Keywords

Reprint years

DOI

10.2178/jsl/1203350786

Other Versions

No versions found

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

Semi-Bounded Relations in Ordered Modules.Oleg Belegradek - 2004 - Journal of Symbolic Logic 69 (2):499 - 517.
Semi-bounded relations in ordered modules.Oleg Belegradek - 2004 - Journal of Symbolic Logic 69 (2):499-517.
Quantifier-free induction for lists.Stefan Hetzl & Jannik Vierling - 2024 - Archive for Mathematical Logic 63 (7):813-835.
On the elimination of imaginaries from certain valued fields.Philip Scowcroft & Angus Macintyre - 1993 - Annals of Pure and Applied Logic 61 (3):241-276.
The natural hierarchy and quasi-hierarchy of constructibility degrees.Philip Welch - 1986 - Journal of Symbolic Logic 51 (1):130-134.
Heirs of Box Types in Polynomially Bounded Structures.Marcus Tressl - 2009 - Journal of Symbolic Logic 74 (4):1225 - 1263.
On non-wellfounded iterations of the perfect set forcing.Vladimir Kanovei - 1999 - Journal of Symbolic Logic 64 (2):551-574.
Descriptive complexity of finite structures: Saving the quantifier rank.Oleg Pikhurko & Oleg Verbitsky - 2005 - Journal of Symbolic Logic 70 (2):419-450.
On diophantine equations solvable in models of open induction.Margarita Otero - 1990 - Journal of Symbolic Logic 55 (2):779-786.
A theory of pairs for non-valuational structures.Elitzur Bar-Yehuda, Assaf Hasson & Ya’Acov Peterzil - 2019 - Journal of Symbolic Logic 84 (2):664-683.

Analytics

Added to PP
2010-08-24

Downloads
41 (#551,066)

6 months
7 (#730,543)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Das Repräsentantenproblem im Prädikatenkalkül der ersten Stufe mit Identität.Günter Asser - 1955 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 1 (4):252-263.

Add more references