Estimation of the algorithmic complexity of classes of computable models

MaRDI QIDQ3545596zbMATH OpenFDO

Authors E. N. Pavlovskij

Publication date 11 December 2008

Full work available at URL https://eudml.org/doc/55574, http://www.emis.de/journals/SMZ/2008/03/635.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

index setcomputable model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Categoricity and completeness of theories (03C35) Computable structure theory, computable model theory (03C57)

Recommendations

• The complexity of index sets for several classes of models
• Index sets of constructive models that are autostable under strong constructivizations
• scientific article; zbMATH DE number 5175704
• Complexity of categorical theories with computable models
• Complexity estimates for the relation of coincidence of model-theoretic properties with an application to semantic classes

Cited in

(13)

• On the computational complexity of cost efficiency analysis models
• Index sets of constructive models of finite and graph signatures that are autostable relative to strong constructivizations
• On the Computational Capabilities of Several Models
• Algorithmic complexity of countable models of strongly minimal theories
• scientific article; zbMATH DE number 4145883 (Why is no real title available?)
• The complexity of index sets for several classes of models
• Computing the complexity for Schelling segregation models
• Index sets of constructive models of bounded signature that are autostable relative to strong constructivizations
• Polynomial-time versus recursive models
• Index sets of constructive models that are autostable under strong constructivizations
• Complexity of Ehrenfeucht models
• Computable numberings of the class of Boolean algebras with distinguished endomorphisms
• Complexity estimates for the relation of coincidence of model-theoretic properties with an application to semantic classes

This page was built for publication: Estimation of the algorithmic complexity of classes of computable models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545596)