The following pages link to Terrence Millar (Q1057258):
Displaying 18 items.
- Decidability and the number of countable models (Q1057259) (← links)
- Homogeneous models and decidability (Q1155600) (← links)
- Persistently Finite Theories with Hyperarithmetic Models (Q3039332) (← links)
- Persistently Finite, Persistently Arithmetic Theories (Q3043120) (← links)
- Omitting types, type spectrums, and decidability (Q3663267) (← links)
- (Q3690795) (← links)
- Prime models and almost decidability (Q3760506) (← links)
- Recursive categoricity and persistence (Q3767330) (← links)
- Tame Theories with Hyperarithmetic Homogeneous Models (Q3815287) (← links)
- Finite extensions and the number of countable models (Q3824292) (← links)
- A complete, decidable theory with two decidable models (Q3853605) (← links)
- Foundations of recursive model theory (Q3869329) (← links)
- (Q3941391) (← links)
- Vaught's theorem recursively revisited (Q3955337) (← links)
- (Q3955338) (← links)
- Type Structure Complexity and Decidability (Q3955339) (← links)
- Model completions and omitting types (Q4842638) (← links)
- (Q4934290) (← links)