On Decidable and Computable Models of Theories

About this item

Title

On Decidable and Computable Models of Theories

Content partner

University of Otago

Collection

Otago University Research Archive

Description

In this paper we obtain two results using amalgamation classes and Fraïssé limits. First, we construct a decidable theory T whose types are all decidable yet whose prime model is not decidable. Millar [15] constructed such example but his example uses an infinite language in an essential way. Our example uses one binary predicate symbol, that is, the models we construct are graphs. Second, for any finite lattice \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepacka...

Read more

Format

Research paper

Research format

Scholarly text / Book item

Thesis level

Book Section

Date created

2013

Creator

Gavruskin, Alexander / Khoussainov, Bakhadyr

URL

https://hdl.handle.net/10523/39583

Related subjects

Countable Model / Decidable Model / Decidable Theory / Prime Model / Saturated Model

What is the copyright status of this item?

All Rights Reserved

This item is all rights reserved, which means you'll have to get permission from University of Otago before using it.

What can I do with this item?

You must always check with University of Otago to confirm the specific terms of use, but this is our understanding:

Non-infringing use

NZ Copyright law does not prevent every use of a copyright work. You should consider what you can and cannot do with a copyright work.

No sharing

You may not copy and/or share this item with others without further permission. This includes posting it on your blog, using it in a presentation, or any other public use.

No modifying

You are not allowed to adapt or remix this item into any other works.

No commercial use

You may not use this item commercially.