The number of computable indexations of finite classes of constructive models

DOI10.1007/BF01159572zbMATH Open0626.03028MaRDI QIDQ580331FDOQ580331

V. P. Dobritsa

Publication date: 1986

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

computable classcomputable indexationfinitely many constructive models

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• The number of nonequivalent computable indexations for a fixed family of sets
• Computable classes of constructive models with non-limit-equivalent indexations
• Title not available (Why is that?)
• A.D. Taimanov and model theory in Kazakhstan

Recommendations

• Semilattices of computable indexations of classes of constructive models 👍 👎
• Complexity of index sets of calculable classes with a finite number of constructive systems 👍 👎
• Computable classes of constructivizations for models of finite constructivizability type 👍 👎
• Computable classes of constructive models with non-limit-equivalent indexations 👍 👎
• Conditions of effective infinity for the set of computable indexings of a class of constructive models 👍 👎
• Computability of the set of computable indexing schemes of the class of constructible models 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: The number of computable indexations of finite classes of constructive models

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