Let A be a subset of an aggregate and B be a subset of an aggregate; by Com(A, B) we denote the class of all computable functions from A into B, so Com(A, B) F(A, B). If we have an X-Y-representative model for
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...
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.Alexander GavruskinBakhadyr KhoussainovThe nature of computation: logic, algorithms, applications: 9th Conference on Computability in Europe, CiE...
Shifts with decidable language and non- computable entropy. Discrete Mathematics and Theoretical Computer Science, 10:75- 93, 2008.Hertling, P. and C. Spandl, Shifts with decidable language and non-computable entropy (2006), preprint.Peter Hertling and Christoph Spandl. Shifts with Decidable ...
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.Alexander GavruskinBakhadyr KhoussainovCiE 2013A. Gavryushkin and B. Khoussainov. On decidable and computable models of the- ories. ...
Given a family S of general recursive functions, we construct a unar m s and find the family S for which m s is the desired counterexample.doi:10.1007/BF02367027O. V. KudinovKluwer Academic Publishers-Plenum PublishersAlgebra & LogicO.V. Kudinov, An autostable 1-decidable model without a ...
The index set of computable structures with decidable theory for some fixed infinite language σ{sup}* is m-complete (Σ{sub}2){sup}(0,0{sup}(ω)).Ekaterina B. FokinaComputation and Logic in the Real World: Third Conference on Computability in Europe(CiE 2007) June 18-23, 2007 Siena...