Pages that link to "Item:Q5308141"

The following pages link to On the computability-theoretic complexity of trivial, strongly minimal models (Q5308141):

Displaying 17 items.

• Model completeness for trivial, uncountably categorical theories of Morley rank \(1\) (Q862348) (← links)
• Partial collapses of the \(\Sigma _1\) complexity hierarchy in models for fragments of bounded arithmetic (Q866557) (← links)
• On two problems of Turing complexity for strongly minimal theories (Q954212) (← links)
• A purely model-theoretic proof of the exponential succinctness gap between CTL\(^{+}\) and CTL (Q975478) (← links)
• Special issue: Selected papers of the workshop on model theory and computable model theory, Gainesville, FL, USA, February 5--10, 2007 (Q1005921) (← links)
• The elementary diagram of a trivial, weakly minimal structure is near model complete (Q1005929) (← links)
• Minimal models of minimal theories (Q1327649) (← links)
• Strongly minimal theories with recursive models (Q1644487) (← links)
• Building models of strongly minimal theories (Q2039552) (← links)
• Algorithmic complexity of countable models of strongly minimal theories (Q2885255) (← links)
• A computable ℵ₀-categorical structure whose theory computes true arithmetic (Q3570169) (← links)
• (Q4443550) (← links)
• IS A SPECTRUM OF A NON-DISINTEGRATED FLAT STRONGLY MINIMAL MODEL COMPLETE THEORY IN A LANGUAGE WITH FINITE SIGNATURE (Q5021931) (← links)
• (Q5419868) (← links)
• Computable embeddings and strongly minimal theories (Q5422316) (← links)
• Applications of Kolmogorov complexity to computable model theory (Q5422317) (← links)
• (Q5428934) (← links)