Conditional terms in semantic programming


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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.

作者简介

S. Goncharov

Sobolev Institute of Mathematics Novosibirsk State University

编辑信件的主要联系方式.
Email: s.s.goncharov@math.nsc.ru
俄罗斯联邦, Novosibirsk

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Ltd., 2017