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...

Full description

Saved in:
Bibliographic Details
Published in:Siberian mathematical journal Vol. 59; no. 6; pp. 1014 - 1023
Main Authors: Goncharov, S. S., Sviridenko, D. I.
Format: Journal Article
Language:English
Published: Moscow Pleiades Publishing 01.11.2018
Springer Nature B.V
Subjects:
ISSN:0037-4466, 1573-9260
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract 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.
AbstractList 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.
Author Sviridenko, D. I.
Goncharov, S. S.
Author_xml – sequence: 1
  givenname: S. S.
  surname: Goncharov
  fullname: Goncharov, S. S.
  email: s.s.goncharov@math.nsc.ru
  organization: Sobolev Institute of Mathematics
– sequence: 2
  givenname: D. I.
  surname: Sviridenko
  fullname: Sviridenko, D. I.
  organization: Sobolev Institute of Mathematics
BookMark eNp9kE9Lw0AQxRepYFv9AN4CHjxFZ7PJbnKU4j8oKLaew2YyKVuaTd1NBb-9GyIIip7m8N5v5s2bsYntLDF2zuGKc5FerwCESlMpeQ4SIMuP2JRnSsRFImHCpoMcD_oJm3m_BeAAspiyyxfCg_PmnaI1udZHxkYrarXtDUbPrts43bbGbk7ZcaN3ns6-5py93t2uFw_x8un-cXGzjFFw2cd1llaqVqIhrBugEEDqRBBmNalGK5SSUoV5kqhUFLLKmyIQWPFCaJSYoZizi3Hv3nVvB_J9ue0OzoaTZcIlKFWEd4NLjS50nfeOmhJNr3vT2d5psys5lEMr5a9WAsl_kHtnWu0-_mWSkfHBazfkvjP9DX0CCtNzZw
CitedBy_id crossref_primary_10_1134_S0037446619030029
crossref_primary_10_3390_math9172102
crossref_primary_10_1134_S1055134423010066
crossref_primary_10_1134_S1055134422040058
Cites_doi 10.1134/S0037446617050068
10.1007/3-540-16444-8_13
10.1007/3-540-18740-5_28
10.1142/9781848162778_0006
10.1023/B:ALLO.0000028930.44605.68
ContentType Journal Article
Copyright Pleiades Publishing, Ltd. 2018
Copyright Springer Science & Business Media 2018
Copyright_xml – notice: Pleiades Publishing, Ltd. 2018
– notice: Copyright Springer Science & Business Media 2018
DBID AAYXX
CITATION
DOI 10.1134/S0037446618060058
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList

DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 1573-9260
EndPage 1023
ExternalDocumentID 10_1134_S0037446618060058
GroupedDBID -52
-5D
-5G
-BR
-EM
-Y2
-~C
-~X
.86
.VR
06D
0R~
0VY
123
1N0
1SB
2.D
2J2
2JN
2JY
2KG
2KM
2LR
2P1
2VQ
2~H
30V
4.4
408
409
40D
40E
5QI
5VS
642
67Z
6NX
8TC
8UJ
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYZH
ABAKF
ABBBX
ABBXA
ABDBF
ABDZT
ABECU
ABFTV
ABHLI
ABHQN
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACNCT
ACOKC
ACOMO
ACPIV
ACSNA
ACUHS
ACZOJ
ADHHG
ADHIR
ADIMF
ADINQ
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AETLH
AEVLU
AEXYK
AFBBN
AFEXP
AFFNX
AFGCZ
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHSBF
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARMRJ
ASPBG
AVWKF
AXYYD
AZFZN
B-.
B0M
BA0
BAPOH
BBWZM
BDATZ
BGNMA
BSONS
CAG
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DU5
EAD
EAP
EBLON
EBS
EIOEI
EJD
EMK
EPL
ESBYG
ESX
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ6
GQ7
GQ8
GXS
H13
HF~
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
IHE
IJ-
IKXTQ
ITM
IWAJR
IXC
IXE
IZIGR
IZQ
I~X
I~Z
J-C
JBSCW
JCJTX
JZLTJ
KDC
KOV
KOW
LAK
LLZTM
M4Y
MA-
N2Q
NB0
NDZJH
NHB
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
OVD
P19
P2P
P9R
PF0
PT4
PT5
QOK
QOS
R4E
R89
R9I
RHV
RIG
RNI
ROL
RPX
RSV
RZC
RZE
RZK
S16
S1Z
S26
S27
S28
S3B
SAP
SCLPG
SDD
SDH
SDM
SHX
SISQX
SJYHP
SMT
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TEORI
TN5
TSG
TSK
TSV
TUC
TUS
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
WH7
WK8
XOL
XU3
YLTOR
Z7U
ZMTXR
ZWQNP
~8M
~A9
~EX
AAPKM
AAYXX
ABDBE
ABFSG
ABJCF
ABRTQ
ACSTC
ADHKG
AEZWR
AFDZB
AFFHD
AFHIU
AFKRA
AFOHR
AGQPQ
AHPBZ
AHWEU
AIXLP
AMVHM
ATHPR
AZQEC
BENPR
BGLVJ
CCPQU
CITATION
DWQXO
GNUQQ
HCIFZ
M2P
M7S
PHGZM
PHGZT
PQGLB
PTHSS
ID FETCH-LOGICAL-c316t-d54b7d73fecdf0e5736a23ec5de7fa7c66e47c82274396b8f9d54cb193ac6c5c3
IEDL.DBID RSV
ISICitedReferencesCount 4
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000454441000005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0037-4466
IngestDate Thu Sep 25 01:06:22 EDT 2025
Sat Nov 29 01:33:37 EST 2025
Tue Nov 18 21:19:18 EST 2025
Fri Feb 21 02:33:26 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 6
Keywords semantic programming
hereditary finite set
computability
computability over abstract structures
restricted quantifier
Σ-formula
Δ
conditional term
recursive term
formula
term
model
Δ-formula
hereditary finite list
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c316t-d54b7d73fecdf0e5736a23ec5de7fa7c66e47c82274396b8f9d54cb193ac6c5c3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 2160779113
PQPubID 2043542
PageCount 10
ParticipantIDs proquest_journals_2160779113
crossref_citationtrail_10_1134_S0037446618060058
crossref_primary_10_1134_S0037446618060058
springer_journals_10_1134_S0037446618060058
PublicationCentury 2000
PublicationDate 2018-11-01
PublicationDateYYYYMMDD 2018-11-01
PublicationDate_xml – month: 11
  year: 2018
  text: 2018-11-01
  day: 01
PublicationDecade 2010
PublicationPlace Moscow
PublicationPlace_xml – name: Moscow
– name: New York
PublicationTitle Siberian mathematical journal
PublicationTitleAbbrev Sib Math J
PublicationYear 2018
Publisher Pleiades Publishing
Springer Nature B.V
Publisher_xml – name: Pleiades Publishing
– name: Springer Nature B.V
References Ershov, Goncharov, Sviridenko (CR5) 1986; 31
Ershov (CR10) 1996
Goncharov (CR11) 1986; 114
Goncharov (CR1) 2017; 58
Goncharov, Sviridenko (CR6) 1986; 31
Ershov (CR9) 1983; 28
Ospichev, Ponomarev (CR16) 2018; 15
Goncharov, Sviridenko (CR3) 1987; 120
Goncharov, Sviridenko (CR4) 1986; 215
Ershov, Goncharov, Sviridenko (CR7) 1987; 278
Ershov (CR8) 1983; 27
Ershov, Puzarenko, Stukachev (CR14) 2011
Goncharov, Sviridenko (CR2) 1989; 142
Goncharov (CR12) 1989; 143
Ershov, Goncharov, Nerode, Remmel (CR13) 1998
Morozov, Puzarenko (CR15) 2004; 43
S. S. Goncharov (445_CR4) 1986; 215
Yu. L. Ershov (445_CR13) 1998
Yu. L. Ershov (445_CR9) 1983; 28
Yu. L. Ershov (445_CR8) 1983; 27
S. S. Goncharov (445_CR12) 1989; 143
S. S. Goncharov (445_CR6) 1986; 31
S. Ospichev (445_CR16) 2018; 15
Yu. L. Ershov (445_CR14) 2011
A. S. Morozov (445_CR15) 2004; 43
S. S. Goncharov (445_CR11) 1986; 114
S. S. Goncharov (445_CR3) 1987; 120
Yu. L. Ershov (445_CR7) 1987; 278
S. S. Goncharov (445_CR1) 2017; 58
S. S. Goncharov (445_CR2) 1989; 142
Yu. L. Ershov (445_CR5) 1986; 31
Yu. L. Ershov (445_CR10) 1996
References_xml – volume: 142
  start-page: 101
  year: 1989
  end-page: 121
  ident: CR2
  article-title: Σ-Programming
  publication-title: Trans. Amer. Math. Soc.
– volume: 58
  start-page: 794
  issue: 5
  year: 2017
  end-page: 800
  ident: CR1
  article-title: Conditional terms in semantic programming
  publication-title: Sib. Math. J.
  doi: 10.1134/S0037446617050068
– volume: 27
  start-page: 670
  issue: 4
  year: 1983
  end-page: 672
  ident: CR8
  article-title: The principle of Σ-enumeration
  publication-title: Soviet Math. Dokl.
– volume: 15
  start-page: 987
  year: 2018
  end-page: 995
  ident: CR16
  article-title: A note on the complexity of formulas in semantic programming
  publication-title: Sib. Elektron. Mat. Izv.
– volume: 215
  start-page: 169
  year: 1986
  end-page: 179
  ident: CR4
  article-title: Theoretical aspects of Σ-programming
  publication-title: Lect. Notes Comput. Sci.
  doi: 10.1007/3-540-16444-8_13
– volume: 143
  start-page: 139
  year: 1989
  end-page: 152
  ident: CR12
  article-title: Data models and languages for their description
  publication-title: Trans. Amer. Math. Soc.
– volume: 31
  start-page: 608
  issue: 6
  year: 1986
  end-page: 610
  ident: CR6
  article-title: Mathematical bases of semantic programming
  publication-title: Soviet Math. Dokl.
– year: 1996
  ident: CR10
  publication-title: Definability and Computability
– volume: 278
  start-page: 116
  year: 1987
  end-page: 122
  ident: CR7
  article-title: Semantic foundations of programming
  publication-title: Lect. Notes Comput. Sci.
  doi: 10.1007/3-540-18740-5_28
– volume: 120
  start-page: 24
  year: 1987
  end-page: 51
  ident: CR3
  article-title: Σ-Programming and their semantics
  publication-title: Vychisl. Systemy
– start-page: 169
  year: 2011
  end-page: 242
  ident: CR14
  article-title: HF-computability
  publication-title: Computability in Context, Imperial College Press
  doi: 10.1142/9781848162778_0006
– volume: 28
  start-page: 739
  issue: 5
  year: 1983
  end-page: 742
  ident: CR9
  article-title: Dynamic logic over admissible sets
  publication-title: Soviet Math. Dokl.
– volume: 31
  start-page: 1113
  year: 1986
  end-page: 1120
  ident: CR5
  article-title: Semantic programming
  publication-title: Information Processing 86. Proc. IFIP 10th World Comput. Congress, Dublin
– volume: 43
  start-page: 162
  issue: 3
  year: 2004
  end-page: 178
  ident: CR15
  article-title: Σ-subsets of natural numbers
  publication-title: Algebra and Logic
  doi: 10.1023/B:ALLO.0000028930.44605.68
– volume: 114
  start-page: 84
  year: 1986
  end-page: 95
  ident: CR11
  article-title: The theory of lists, and its models
  publication-title: Vychisl. Systemy
– year: 1998
  ident: CR13
  publication-title: Introduction to the Handbook of Recursive Mathematics
– volume: 120
  start-page: 24
  year: 1987
  ident: 445_CR3
  publication-title: Vychisl. Systemy
– volume: 28
  start-page: 739
  issue: 5
  year: 1983
  ident: 445_CR9
  publication-title: Soviet Math. Dokl.
– volume: 58
  start-page: 794
  issue: 5
  year: 2017
  ident: 445_CR1
  publication-title: Sib. Math. J.
  doi: 10.1134/S0037446617050068
– volume: 278
  start-page: 116
  year: 1987
  ident: 445_CR7
  publication-title: Lect. Notes Comput. Sci.
  doi: 10.1007/3-540-18740-5_28
– volume: 15
  start-page: 987
  year: 2018
  ident: 445_CR16
  publication-title: Sib. Elektron. Mat. Izv.
– volume: 27
  start-page: 670
  issue: 4
  year: 1983
  ident: 445_CR8
  publication-title: Soviet Math. Dokl.
– volume: 43
  start-page: 162
  issue: 3
  year: 2004
  ident: 445_CR15
  publication-title: Algebra and Logic
  doi: 10.1023/B:ALLO.0000028930.44605.68
– volume-title: Introduction to the Handbook of Recursive Mathematics
  year: 1998
  ident: 445_CR13
– volume: 215
  start-page: 169
  year: 1986
  ident: 445_CR4
  publication-title: Lect. Notes Comput. Sci.
  doi: 10.1007/3-540-16444-8_13
– volume-title: Definability and Computability
  year: 1996
  ident: 445_CR10
– start-page: 169
  volume-title: Computability in Context, Imperial College Press
  year: 2011
  ident: 445_CR14
  doi: 10.1142/9781848162778_0006
– volume: 142
  start-page: 101
  year: 1989
  ident: 445_CR2
  publication-title: Trans. Amer. Math. Soc.
– volume: 114
  start-page: 84
  year: 1986
  ident: 445_CR11
  publication-title: Vychisl. Systemy
– volume: 143
  start-page: 139
  year: 1989
  ident: 445_CR12
  publication-title: Trans. Amer. Math. Soc.
– volume: 31
  start-page: 608
  issue: 6
  year: 1986
  ident: 445_CR6
  publication-title: Soviet Math. Dokl.
– volume: 31
  start-page: 1113
  year: 1986
  ident: 445_CR5
  publication-title: Information Processing 86. Proc. IFIP 10th World Comput. Congress, Dublin
SSID ssj0010069
Score 2.1693358
Snippet For constructing an enrichment of a language with restricted quantifiers, we extend the notion of term by the construction of the terms conditional and...
SourceID proquest
crossref
springer
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1014
SubjectTerms Mathematics
Mathematics and Statistics
Title Recursive Terms in Semantic Programming
URI https://link.springer.com/article/10.1134/S0037446618060058
https://www.proquest.com/docview/2160779113
Volume 59
WOSCitedRecordID wos000454441000005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAVX
  databaseName: SpringerLINK Contemporary 1997-Present
  customDbUrl:
  eissn: 1573-9260
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0010069
  issn: 0037-4466
  databaseCode: RSV
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS8MwED90-qAPfovTKX0QBKXQNWmSPoo4fHGMbcreSnpJYKCdrNW_36QfG36CPt8lDZfk7tL7-AGcR0yExlX0cGUin8qA-kKkaC-eYhRVoNHIEmyC9_tiMokHdR133mS7NyHJUlNXuCPU1fQS7qKPXREwh4a3CmvW2gmH1zAcPS5CB673btWLkfuOvQ5lfjvFR2O09DA_BUVLW9Pb_tcqd2Crdi296-os7MKKzvZg837RlzXfh4uh-73uMta9sVXJuTfNvJGlZpbsDapUrWf7uQN46N2Ob-78GirBR9Jlha8imnLFidGoTKAjTpgMicZIaW4kR8Y05WidAff-YKkwsR2BqfXeJDKMkBxCK5tl-gi8OEC77NDVoKaUS2vRFZGaSobIujrmbQgamSVY9xF3cBZPSfmeIDT5IoM2XC6GvFRNNH5j7jQbkdT3KU9C1wePW8VM2nDVCH5J_nGy4z9xn8CG9YdEVWrYgVYxf9WnsI5vxTSfn5XH7B1X3Mez
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS8MwED90CuqD3-J0ah8EQSl0TZq0jyIOxW2MbcreSnpJYKBV1unfb9KPDT9Bn--Shktyd-nd_Q7gNGChr21FD5c6cKnwqBuGCZqLJxlF6SnUIm82wbvdcDSKemUdd1Zlu1chyVxTF31HqK3pJdxGH5uhx2w3vEVYosZgWcD8_uBhFjqw2LsFFiN3LXsZyvx2io_GaO5hfgqK5ramtfGvVW7CeulaOpfFWdiCBZVuw1pnhsua7cBZ3_5etxnrztCo5MwZp87AUFNDdnpFqtaT-dwu3Leuh1c3btkqwUXSZFNXBjThkhOtUGpPBZww4ROFgVRcC46MKcrROAP2_cGSUEdmBCbGexPIMECyB7X0OVX74EQemmX7tgY1oVwYiy6JUFQwRNZUEa-DV8ksxhJH3LazeIzz9wSh8RcZ1OF8NuSlANH4jblRbURc3qcs9i0OHjeKmdThohL8nPzjZAd_4j6BlZthpx23b7t3h7BqfKOwKDtsQG06eVVHsIxv03E2Oc6P3Du-KsqX
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3dS8MwED90iuiD3-J0ah8EQSl2TZp0j6IORR3DTdlbSS8JDLSOtfr3m_Rjw08Qn3NJQ77urnf3-wEcBiz0ta3o4VIHLhUedcMwRnPxJKMoPYVa5GQTvNMJB4NWt-Q5Tats9yokWdQ0WJSmJDsdSV1ykFBb30u4jUQ2Q49ZZrxZmKM2j966673HSRjB4vAWuIzcteJlWPPbIT4qpqm1-SlAmuud9sq_Z7wKy6XJ6ZwVZ2QNZlSyDkt3E7zWdAOO7u1vd5vJ7vTNU506w8TpmdbENDvdIoXr2Xx6Ex7al_3zK7ekUHCRNFnmyoDGXHKiFUrtqYATJnyiMJCKa8GRMUU5GiPB-iUsDnXL9MDYWHUCGQZItqCWvCRqG5yWh2bavq1NjSkXRtNLIhQVDJE1VYvXwavWL8ISX9zSXDxFuZ9BaPRlDepwPOkyKsA1fhNuVJsSlfcsjXyLj8fNg03qcFJtwrT5x8F2_iR9AAvdi3Z0e9252YVFYzKFRTViA2rZ-FXtwTy-ZcN0vJ-fvnddTdN7
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Recursive+Terms+in+Semantic+Programming&rft.jtitle=Siberian+mathematical+journal&rft.au=Goncharov%2C+S+S&rft.au=Sviridenko%2C+D+I&rft.date=2018-11-01&rft.pub=Springer+Nature+B.V&rft.issn=0037-4466&rft.eissn=1573-9260&rft.volume=59&rft.issue=6&rft.spage=1014&rft_id=info:doi/10.1134%2FS0037446618060058&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0037-4466&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0037-4466&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0037-4466&client=summon