Index sets of constructive models of bounded signature that are autostable relative to strong constructivizations

Keywords: model, computable model, constructive model, auto stability, index sets. We evaluate algorithmic complexity of the class of computable models of bounded signature that have a strong constructivization and are autostable relative to strong constructivizations.

Saved in:
Bibliographic Details
Published in:Algebra and Logic 2015, Vol.54 (2), p.108
Main Authors: Goncharov, S.S, Marchuk, M.I
Format: Report
Language:English
Subjects:
Algorithms
Mathematical models
Mathematical research
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue 2
container_start_page 108
container_title Algebra and Logic
container_volume 54
creator Goncharov, S.S
Marchuk, M.I
description Keywords: model, computable model, constructive model, auto stability, index sets. We evaluate algorithmic complexity of the class of computable models of bounded signature that have a strong constructivization and are autostable relative to strong constructivizations.
doi_str_mv 10.1007/s10469-015-9331-z
format report
fullrecord <record><control><sourceid>gale</sourceid><recordid>TN_cdi_gale_infotracacademiconefile_A451410328</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A451410328</galeid><sourcerecordid>A451410328</sourcerecordid><originalsourceid>FETCH-gale_infotracacademiconefile_A4514103283</originalsourceid><addsrcrecordid>eNqVjM1Ow0AMhPdQJMrPA3DzC2zxZpO2OVYIBHfu1TZxwqLtrho7CPXpsSoOXJEP4xn7G2MeHK4c4uaRHdbr1qJrbOu9s-eFWSJiZZvKV9fmhvlTbbve4tKc3nJP38AkDGWArmSWae4kfhEcS0_pEh_KrG89cBxzkHkikI8gEHQJsxSWcEgEE6VwAaWAtpQ8_u2LZz2qvTNXQ0hM9796a1Yvz-9Pr3YMifYxD0Wm0On0dIzK0xA139WNqx36auv_DfwAV31Z_Q</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>report</recordtype></control><display><type>report</type><title>Index sets of constructive models of bounded signature that are autostable relative to strong constructivizations</title><source>Springer Nature</source><creator>Goncharov, S.S ; Marchuk, M.I</creator><creatorcontrib>Goncharov, S.S ; Marchuk, M.I</creatorcontrib><description>Keywords: model, computable model, constructive model, auto stability, index sets. We evaluate algorithmic complexity of the class of computable models of bounded signature that have a strong constructivization and are autostable relative to strong constructivizations.</description><identifier>ISSN: 0002-5232</identifier><identifier>DOI: 10.1007/s10469-015-9331-z</identifier><language>eng</language><publisher>Springer</publisher><subject>Algorithms ; Mathematical models ; Mathematical research</subject><ispartof>Algebra and Logic, 2015, Vol.54 (2), p.108</ispartof><rights>COPYRIGHT 2015 Springer</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>776,780,4476,27902</link.rule.ids></links><search><creatorcontrib>Goncharov, S.S</creatorcontrib><creatorcontrib>Marchuk, M.I</creatorcontrib><title>Index sets of constructive models of bounded signature that are autostable relative to strong constructivizations</title><title>Algebra and Logic</title><description>Keywords: model, computable model, constructive model, auto stability, index sets. We evaluate algorithmic complexity of the class of computable models of bounded signature that have a strong constructivization and are autostable relative to strong constructivizations.</description><subject>Algorithms</subject><subject>Mathematical models</subject><subject>Mathematical research</subject><issn>0002-5232</issn><fulltext>true</fulltext><rsrctype>report</rsrctype><creationdate>2015</creationdate><recordtype>report</recordtype><sourceid/><recordid>eNqVjM1Ow0AMhPdQJMrPA3DzC2zxZpO2OVYIBHfu1TZxwqLtrho7CPXpsSoOXJEP4xn7G2MeHK4c4uaRHdbr1qJrbOu9s-eFWSJiZZvKV9fmhvlTbbve4tKc3nJP38AkDGWArmSWae4kfhEcS0_pEh_KrG89cBxzkHkikI8gEHQJsxSWcEgEE6VwAaWAtpQ8_u2LZz2qvTNXQ0hM9796a1Yvz-9Pr3YMifYxD0Wm0On0dIzK0xA139WNqx36auv_DfwAV31Z_Q</recordid><startdate>20150501</startdate><enddate>20150501</enddate><creator>Goncharov, S.S</creator><creator>Marchuk, M.I</creator><general>Springer</general><scope/></search><sort><creationdate>20150501</creationdate><title>Index sets of constructive models of bounded signature that are autostable relative to strong constructivizations</title><author>Goncharov, S.S ; Marchuk, M.I</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-gale_infotracacademiconefile_A4514103283</frbrgroupid><rsrctype>reports</rsrctype><prefilter>reports</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Algorithms</topic><topic>Mathematical models</topic><topic>Mathematical research</topic><toplevel>online_resources</toplevel><creatorcontrib>Goncharov, S.S</creatorcontrib><creatorcontrib>Marchuk, M.I</creatorcontrib></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Goncharov, S.S</au><au>Marchuk, M.I</au><format>book</format><genre>unknown</genre><ristype>RPRT</ristype><atitle>Index sets of constructive models of bounded signature that are autostable relative to strong constructivizations</atitle><jtitle>Algebra and Logic</jtitle><date>2015-05-01</date><risdate>2015</risdate><volume>54</volume><issue>2</issue><spage>108</spage><pages>108-</pages><issn>0002-5232</issn><abstract>Keywords: model, computable model, constructive model, auto stability, index sets. We evaluate algorithmic complexity of the class of computable models of bounded signature that have a strong constructivization and are autostable relative to strong constructivizations.</abstract><pub>Springer</pub><doi>10.1007/s10469-015-9331-z</doi></addata></record>
fulltext fulltext
identifier ISSN: 0002-5232
ispartof Algebra and Logic, 2015, Vol.54 (2), p.108
issn 0002-5232
language eng
recordid cdi_gale_infotracacademiconefile_A451410328
source Springer Nature
subjects Algorithms
Mathematical models
Mathematical research
title Index sets of constructive models of bounded signature that are autostable relative to strong constructivizations
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-24T03%3A36%3A24IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=unknown&rft.atitle=Index%20sets%20of%20constructive%20models%20of%20bounded%20signature%20that%20are%20autostable%20relative%20to%20strong%20constructivizations&rft.jtitle=Algebra%20and%20Logic&rft.au=Goncharov,%20S.S&rft.date=2015-05-01&rft.volume=54&rft.issue=2&rft.spage=108&rft.pages=108-&rft.issn=0002-5232&rft_id=info:doi/10.1007/s10469-015-9331-z&rft_dat=%3Cgale%3EA451410328%3C/gale%3E%3Cgrp_id%3Ecdi_FETCH-gale_infotracacademiconefile_A4514103283%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_galeid=A451410328&rfr_iscdi=true