Free constructions in algebraic institutions

Author(s):  
Andrzej Tarlecki
Keyword(s):  

2000 ◽  
pp. 361-400
Author(s):  
Luis Ribes ◽  
Pavel Zalesskii




1997 ◽  
Vol 36 (5) ◽  
pp. 288-301 ◽  
Author(s):  
V. G. Bardakov


2012 ◽  
Vol 77 (1) ◽  
pp. 291-307 ◽  
Author(s):  
Frank Stephan ◽  
Jason Teutsch

AbstractThe truth-table degree of the set of shortest programs remains an outstanding problem in recursion theory. We examine two related sets, the set of shortest descriptions and the set of domain-random strings, and show that the truth-table degrees of these sets depend on the underlying acceptable numbering. We achieve some additional properties for the truth-table incomplete versions of these sets, namely retraceability and approximability. We give priority-free constructions of bounded truth-table chains and bounded truth-table antichains inside the truth-table complete degree by identifying an acceptable set of domain-random strings within each degree.



1998 ◽  
Vol 350 (2) ◽  
pp. 571-613 ◽  
Author(s):  
O. Kharlampovich ◽  
A. Myasnikov


2020 ◽  
Vol 41 (2) ◽  
pp. 260-272
Author(s):  
E. V. Sokolov ◽  
E. A. Tumanova


2004 ◽  
Vol 11 (89) ◽  
pp. 773-793 ◽  
Author(s):  
Chao Yang ◽  
Esmond G. Ng ◽  
Pawel A. Penczek


2007 ◽  
Vol 10 (1) ◽  
Author(s):  
Susan Hermiller ◽  
Zoran Šunić


Sign in / Sign up

Export Citation Format

Share Document