Prime models and almost decidability
type: Item
instance of: scholarly article
title: Prime models and almost decidability
zbMATH Open document ID: 0623.03011
DOI: 10.2307/2274064
author: Terrence Millar
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 03B25
Mathematics Subject Classification ID: 03C50
zbMATH DE Number: 4010477
zbMATH Keywords: almost decidable structures
zbMATH Keywords: complete decidable theory
zbMATH Keywords: prime model
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.2307/2274064
OpenAlex ID: W4237923603
Recommended article: Prime models of computably enumerable degree
Recommended article: On decidable categoricity and almost prime models
Recommended article: Decidability and undecidability of theories with a predicate for the primes
Recommended article: Constructivizability of a prime model
Recommended article: Computable trees, prime models, and relative decidability
Recommended article: Prime models of theories of computable linear orderings
Recommended article: DECIDABILITY AND CLASSIFICATION OF THE THEORY OF INTEGERS WITH PRIMES
Recommended article: Q3476803
Recommended article: Q3001100
published in: Journal of Symbolic Logic
description: scientific article