scientific article; zbMATH DE number 5381079

zbMATH Open1164.03334MaRDI QIDQ3545596FDOQ3545596

E. N. Pavlovskij

Publication date: 11 December 2008

Full work available at URL: https://eudml.org/doc/55574

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

Title of this publication is not available (Why is that?)

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)

Cited In (10)

• On the Computational Capabilities of Several Models
• Index sets of constructive models of finite and graph signatures that are autostable relative to strong constructivizations
• Computing the complexity for Schelling segregation models
• Index Sets of Constructive Models that are Autostable Under Strong Constructivizations
• Index sets of constructive models of bounded signature that are autostable relative to strong constructivizations
• Computable numberings of the class of Boolean algebras with distinguished endomorphisms
• Title not available (Why is that?)
• Polynomial-time versus recursive models
• On the computational complexity of cost efficiency analysis models
• Complexity of Ehrenfeucht models

This page was built for publication:

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