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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

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

Symmetric generalized galois logics.Katalin Bimbó & J. Michael Dunn - 2009 - Logica Universalis 3 (1):125-152.
Arithmetic definability by formulas with two quantifiers.Shih Ping Tung - 1992 - Journal of Symbolic Logic 57 (1):1-11.
Reducts of (c, +, ⋅) which contain +.D. Marker & A. Pillay - 1990 - Journal of Symbolic Logic 55 (3):1243-1251.
On revision operators.P. D. Welch - 2003 - Journal of Symbolic Logic 68 (2):689-711.
Stratified languages.A. Pétry - 1992 - Journal of Symbolic Logic 57 (4):1366-1376.
Omitting quantifier-free types in generic structures.Angus Macintyre - 1972 - Journal of Symbolic Logic 37 (3):512-520.
Semi-Bounded Relations in Ordered Modules.Oleg Belegradek - 2004 - Journal of Symbolic Logic 69 (2):499 - 517.

Analytics

Added to PP
2010-08-24

Downloads
30 (#504,503)

6 months
7 (#350,235)

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