Standard

Definability of closure operations in the h-quasiorder of labeled forests. / Zhukov, A. V.; Kudinov, O. V.; Selivanov, V. L.

In: Algebra and Logic, Vol. 49, No. 2, 01.05.2010, p. 120-129.

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

Harvard

Zhukov, AV, Kudinov, OV & Selivanov, VL 2010, 'Definability of closure operations in the h-quasiorder of labeled forests', Algebra and Logic, vol. 49, no. 2, pp. 120-129. https://doi.org/10.1007/s10469-010-9084-7

APA

Zhukov, A. V., Kudinov, O. V., & Selivanov, V. L. (2010). Definability of closure operations in the h-quasiorder of labeled forests. Algebra and Logic, 49(2), 120-129. https://doi.org/10.1007/s10469-010-9084-7

Vancouver

Zhukov AV, Kudinov OV, Selivanov VL. Definability of closure operations in the h-quasiorder of labeled forests. Algebra and Logic. 2010 May 1;49(2):120-129. https://doi.org/10.1007/s10469-010-9084-7

Author

Zhukov, A. V. ; Kudinov, O. V. ; Selivanov, V. L. / Definability of closure operations in the h-quasiorder of labeled forests. In: Algebra and Logic. 2010 ; Vol. 49, No. 2. pp. 120-129.

BibTeX

@article{46491cfca9aa41559dc988104a36f02c,
title = "Definability of closure operations in the h-quasiorder of labeled forests",
abstract = "We prove that natural closure operations on quotient structures of the h-quasiorder of finite and (at most) countable k-labeled forests (k ≥ 3) are definable provided that minimal nonsmallest elements are allowed as parameters. This strengthens our previous result which holds that each element of the h-quasiorder of finite k-labeled forests is definable in the first-order language, and each element of the h-quasiorder of (at most) countable k-labeled forests is definable in the language Lω1ω; in both cases k ≥ 3 and minimal nonsmallest elements are allowed as parameters. Similar results hold true for two other relevant structures: the h-quasiorder of finite (resp. countable) k-labeled trees and k-labeled trees with a fixed label on the root element. {\textcopyright} 2010 Springer Science+Business Media, Inc.",
keywords = "Closure operation, Definability, h-quasiorder, Labeled forest, Labeled tree",
author = "Zhukov, {A. V.} and Kudinov, {O. V.} and Selivanov, {V. L.}",
year = "2010",
month = may,
day = "1",
doi = "10.1007/s10469-010-9084-7",
language = "English",
volume = "49",
pages = "120--129",
journal = "Algebra and Logic",
issn = "0002-5232",
publisher = "Springer Nature",
number = "2",

}

RIS

TY - JOUR

T1 - Definability of closure operations in the h-quasiorder of labeled forests

AU - Zhukov, A. V.

AU - Kudinov, O. V.

AU - Selivanov, V. L.

PY - 2010/5/1

Y1 - 2010/5/1

N2 - We prove that natural closure operations on quotient structures of the h-quasiorder of finite and (at most) countable k-labeled forests (k ≥ 3) are definable provided that minimal nonsmallest elements are allowed as parameters. This strengthens our previous result which holds that each element of the h-quasiorder of finite k-labeled forests is definable in the first-order language, and each element of the h-quasiorder of (at most) countable k-labeled forests is definable in the language Lω1ω; in both cases k ≥ 3 and minimal nonsmallest elements are allowed as parameters. Similar results hold true for two other relevant structures: the h-quasiorder of finite (resp. countable) k-labeled trees and k-labeled trees with a fixed label on the root element. © 2010 Springer Science+Business Media, Inc.

AB - We prove that natural closure operations on quotient structures of the h-quasiorder of finite and (at most) countable k-labeled forests (k ≥ 3) are definable provided that minimal nonsmallest elements are allowed as parameters. This strengthens our previous result which holds that each element of the h-quasiorder of finite k-labeled forests is definable in the first-order language, and each element of the h-quasiorder of (at most) countable k-labeled forests is definable in the language Lω1ω; in both cases k ≥ 3 and minimal nonsmallest elements are allowed as parameters. Similar results hold true for two other relevant structures: the h-quasiorder of finite (resp. countable) k-labeled trees and k-labeled trees with a fixed label on the root element. © 2010 Springer Science+Business Media, Inc.

KW - Closure operation

KW - Definability

KW - h-quasiorder

KW - Labeled forest

KW - Labeled tree

UR - http://www.scopus.com/inward/record.url?scp=77953917237&partnerID=8YFLogxK

U2 - 10.1007/s10469-010-9084-7

DO - 10.1007/s10469-010-9084-7

M3 - Article

AN - SCOPUS:77953917237

VL - 49

SP - 120

EP - 129

JO - Algebra and Logic

JF - Algebra and Logic

SN - 0002-5232

IS - 2

ER -

ID: 127086665