Standard

Conditional terms in semantic programming. / Goncharov, S. S.

In: Siberian Mathematical Journal, Vol. 58, No. 5, 01.09.2017, p. 794-800.

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

Harvard

Goncharov, SS 2017, 'Conditional terms in semantic programming', Siberian Mathematical Journal, vol. 58, no. 5, pp. 794-800. https://doi.org/10.1134/S0037446617050068

APA

Goncharov, S. S. (2017). Conditional terms in semantic programming. Siberian Mathematical Journal, 58(5), 794-800. https://doi.org/10.1134/S0037446617050068

Vancouver

Goncharov SS. Conditional terms in semantic programming. Siberian Mathematical Journal. 2017 Sept 1;58(5):794-800. doi: 10.1134/S0037446617050068

Author

Goncharov, S. S. / Conditional terms in semantic programming. In: Siberian Mathematical Journal. 2017 ; Vol. 58, No. 5. pp. 794-800.

BibTeX

@article{43346ab08701475ca9128b2270491679,
title = "Conditional terms in semantic programming",
abstract = "For constructing an enrichment of the language with restricted quantifiers, we extend the construction of conditional terms. We show that the so-obtained extension of the language of formulas with restricted quantifiers over structures with hereditary finite lists is a conservative enrichment.",
keywords = "computability, computability over abstract structures, conditional term, formula, restricted quantifier, semantic programming, term, Δ-formula, Σ-formula",
author = "Goncharov, {S. S.}",
year = "2017",
month = sep,
day = "1",
doi = "10.1134/S0037446617050068",
language = "English",
volume = "58",
pages = "794--800",
journal = "Siberian Mathematical Journal",
issn = "0037-4466",
publisher = "MAIK NAUKA/INTERPERIODICA/SPRINGER",
number = "5",

}

RIS

TY - JOUR

T1 - Conditional terms in semantic programming

AU - Goncharov, S. S.

PY - 2017/9/1

Y1 - 2017/9/1

N2 - For constructing an enrichment of the language with restricted quantifiers, we extend the construction of conditional terms. We show that the so-obtained extension of the language of formulas with restricted quantifiers over structures with hereditary finite lists is a conservative enrichment.

AB - For constructing an enrichment of the language with restricted quantifiers, we extend the construction of conditional terms. We show that the so-obtained extension of the language of formulas with restricted quantifiers over structures with hereditary finite lists is a conservative enrichment.

KW - computability

KW - computability over abstract structures

KW - conditional term

KW - formula

KW - restricted quantifier

KW - semantic programming

KW - term

KW - Δ-formula

KW - Σ-formula

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

U2 - 10.1134/S0037446617050068

DO - 10.1134/S0037446617050068

M3 - Article

AN - SCOPUS:85032035771

VL - 58

SP - 794

EP - 800

JO - Siberian Mathematical Journal

JF - Siberian Mathematical Journal

SN - 0037-4466

IS - 5

ER -

ID: 9874243