Conditional terms in semantic programming

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.

Uložené v:
Podrobná bibliografia
Vydané v:Siberian mathematical journal Ročník 58; číslo 5; s. 794 - 800
Hlavný autor: Goncharov, S. S.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Moscow Pleiades Publishing 01.09.2017
Springer Nature B.V
Predmet:
Lists
Mathematics
Mathematics and Statistics
semantic programming
Δ
conditional term
computability
formula
term
computability over abstract structures
restricted quantifier
Σ-formula
ISSN:0037-4466, 1573-9260
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0037-4466
1573-9260
DOI:10.1134/S0037446617050068