Abstract
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}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$\cal F$\end{document} we construct a theory T with countably many models such that the fundamental order determined by T is isomorphic to \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$\cal F$\end{document}. As a by-product of this example, we propose the investigation of computable and decidable models of T by connecting them to the fundamental order of T.