Loading…

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:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0002-5232
DOI:10.1007/s10469-015-9331-z