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.

Saved in:
Bibliographic Details
Published in:Siberian mathematical journal Vol. 58; no. 5; pp. 794 - 800
Main Author: Goncharov, S. S.
Format: Journal Article
Language:English
Published: Moscow Pleiades Publishing 01.09.2017
Springer Nature B.V
Subjects:
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 Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0037-4466
1573-9260
DOI:10.1134/S0037446617050068