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 some aggregates X and Y, then, of course, we can ...
Decidable Computable $\\mathbb A$ -Numberings special classes, we resolve the problem of there being 1-1 computable numberings of the families of all computable sets and of all computable functions. ... VG Puzarenko - 《Algebra & Logic》 被引量: 2发表: 2002年 Semidecidable Numberings in ...
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...
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 KhoussainovCiE 2013A. Gavryushkin and B. Khoussainov. On decidable and computable models of the- ories. ...
We show that, on the other hand, any right-computable real number between 0 and 1, whether computable or not, is the entropy of some subshift with even polynomial time decidable language. In addition, we show that computability of the entropy of a subshift does not imply any kind of ...
Decidable Computable $\\mathbb A$ -Numberings special classes, we resolve the problem of there being 1-1 computable numberings of the families of all computable sets and of all computable functions. ... VG Puzarenko - 《Algebra & Logic》 被引量: 2发表: 2002年 Positive Presentations of ...
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...
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...