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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Siberian mathematical journal Jg. 58; H. 5; S. 794 - 800
1. Verfasser: Goncharov, S. S.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Moscow Pleiades Publishing 01.09.2017
Springer Nature B.V
Schlagworte:
Lists
Mathematics
Mathematics and Statistics
semantic programming
Δ
conditional term
computability
formula
term
computability over abstract structures
restricted quantifier
Σ-formula
ISSN:0037-4466, 1573-9260
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0037-4466
1573-9260
DOI:10.1134/S0037446617050068