scientific article; zbMATH DE number 2047487

zbMATH Open1034.03047MaRDI QIDQ4451644FDOQ4451644

P. E. Alaev

Publication date: 29 February 2004

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

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

zbMATH Keywords

computable modelScott familyrecursive modelcomputable formulainfinitary formula

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Other infinitary logic (03C75)

Cited In (3)

• Title not available (Why is that?)
• Constructivizable and non-constructivizable formal arithmetic structures
• The Complexity of intrinsically r.e. subsets of existentially decidable models

   Recommendations

• Computable classes of constructivizations for models of finite constructivizability type 👍 👎
• Intrinsic bounds on complexity and definability at limit levels 👍 👎
• On \(\Sigma^0_1\)-classification of relations on computable structures 👍 👎
• Effectively infinite classes of weak constructivizations of models 👍 👎
• Relatively recursive expansions 👍 👎

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 Q4451644)