Recursive Terms in Semantic Programming

For constructing an enrichment of a language with restricted quantifiers, we extend the notion of term by the construction of the terms conditional and recursive with respect to lists. We show that the so-obtained extension of the language of formulas with restricted quantifiers over structures with...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Siberian mathematical journal Jg. 59; H. 6; S. 1014 - 1023
Hauptverfasser: Goncharov, S. S., Sviridenko, D. I.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Moscow Pleiades Publishing 01.11.2018
Springer Nature B.V
Schlagworte:
Mathematics
Mathematics and Statistics
semantic programming
hereditary finite set
computability
computability over abstract structures
restricted quantifier
Σ-formula
Δ
conditional term
recursive term
formula
term
model
Δ-formula
hereditary finite list
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 a language with restricted quantifiers, we extend the notion of term by the construction of the terms conditional and recursive with respect to lists. 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 and the new terms are Δ-definable in the basic language.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0037-4466
1573-9260
DOI:10.1134/S0037446618060058