Relational structures constructible by quantifier free definable operations

Saharon Shelah; Mor Doron

doi:10.2178/jsl/1203350786

Relational structures constructible by quantifier free definable operations

Saharon Shelah^*
, Mor Doron

^*Corresponding author for this work

Einstein Institute of Mathematics

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	1283-1298
Number of pages	16
Journal	Journal of Symbolic Logic
Volume	72
Issue number	4
DOIs	https://doi.org/10.2178/jsl/1203350786
State	Published - Dec 2007

Access to Document

10.2178/jsl/1203350786

Cite this

@article{5c8d004641f34cfba36976f819cf0732,

title = "Relational structures constructible by quantifier free definable operations",

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.",

author = "Saharon Shelah and Mor Doron",

year = "2007",

month = dec,

doi = "10.2178/jsl/1203350786",

language = "אנגלית",

volume = "72",

pages = "1283--1298",

journal = "Journal of Symbolic Logic",

issn = "0022-4812",

publisher = "Cambridge University Press",

number = "4",

}

TY - JOUR

T1 - Relational structures constructible by quantifier free definable operations

AU - Shelah, Saharon

AU - Doron, Mor

PY - 2007/12

Y1 - 2007/12

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/38049109886

U2 - 10.2178/jsl/1203350786

DO - 10.2178/jsl/1203350786

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:38049109886

SN - 0022-4812

VL - 72

SP - 1283

EP - 1298

JO - Journal of Symbolic Logic

JF - Journal of Symbolic Logic

IS - 4

ER -

Relational structures constructible by quantifier free definable operations

Abstract

Access to Document

Other files and links

Fingerprint

Cite this