recursive enumerability
Recently Published Documents


TOTAL DOCUMENTS

37
(FIVE YEARS 0)

H-INDEX

5
(FIVE YEARS 0)

2019 ◽  
Vol 30 (2) ◽  
pp. 549-560 ◽  
Author(s):  
Mikhail Rybakov ◽  
Dmitry Shkatov

Abstract We investigate the relationship between recursive enumerability and elementary frame definability in first-order predicate modal logic. On one hand, it is well known that every first-order predicate modal logic complete with respect to an elementary class of Kripke frames, i.e. a class of frames definable by a classical first-order formula, is recursively enumerable. On the other, numerous examples are known of predicate modal logics, based on ‘natural’ propositional modal logics with essentially second-order Kripke semantics, that are either not recursively enumerable or Kripke incomplete. This raises the question of whether every Kripke complete, recursively enumerable predicate modal logic can be characterized by an elementary class of Kripke frames. We answer this question in the negative, by constructing a normal predicate modal logic which is Kripke complete, recursively enumerable, but not complete with respect to an elementary class of frames. We also present an example of a normal predicate modal logic that is recursively enumerable, Kripke complete, and not complete with respect to an elementary class of rooted frames, but is complete with respect to an elementary class of frames that are not rooted.


2013 ◽  
Vol 19 ◽  
pp. 68-99
Author(s):  
Е.А. Котикова ◽  
М.Н. Рыбаков

We consider the logic QCTL, a first-order exten- sion of CTL defined as a logic of Kripke frames for CTL. We study the question about recursive enumerability of its fragments specified by a set of temporal modalities we use. Then we discuss some questions concerned axiomatizability and Kripke completeness.


2012 ◽  
Vol 77 (1) ◽  
pp. 21-32 ◽  
Author(s):  
Mingzhong Cai

AbstractIn this paper we prove that a degree a is array nonrecursive (ANR) if and only if every degree b ≥ a is r.e. in and strictly above another degree (RRE). This result will answer some questions in [ASDWY]. We also deduce an interesting corollary that every n-REA degree has a strong minimal cover if and only if it is array recursive.


2012 ◽  
Vol 77 (1) ◽  
pp. 33-48 ◽  
Author(s):  
Mingzhong Cai ◽  
Richard A. Shore

AbstractWe present some abstract theorems showing how domination properties equivalent to being or array nonrecursive can be used to construct sets generic for different notions of forcing. These theorems are then applied to give simple proofs of some known results. We also give a direct uniform proof of a recent result of Ambos-Spies, Ding, Wang, and Yu [2009] that every degree above any in is recursively enumerable in a 1-generic degree strictly below it. Our major new result is that every array nonrecursive degree is r.e. in some degree strictly below it. Our analysis of array nonrecursiveness and construction of generic sequences below ANR degrees also reveal a new level of uniformity in these types of results.


2011 ◽  
pp. 79-102
Author(s):  
Herbert B. Enderton

2005 ◽  
Vol 12 (1) ◽  
Author(s):  
Mayer Goldberg

We show that the set of fixed-point combinators forms a recursively-enumerable subset of a larger set of terms we call non-standard fixed-point combinators. These terms are observationally equivalent to fixed-point combinators in any computable context, but the set of on-standard fixed-point combinators is not recursively enumerable.


2004 ◽  
Vol 11 (25) ◽  
Author(s):  
Mayer Goldberg

We show that the set of fixed-point combinators forms a recursively-enumerable subset of a larger set of terms that is (A) not recursively enumerable, and (B) the terms of which are observationally equivalent to fixed-point combinators in any computable context.


2001 ◽  
Vol 31 (1) ◽  
pp. 199-211 ◽  
Author(s):  
Antonín Kucera ◽  
T. Slaman

1999 ◽  
Vol 64 (3) ◽  
pp. 927-945
Author(s):  
Stephan Wehner

AbstractIt is an open problem within the study of recursively enumerable classes of recursively enumerable sets to characterize those recursively enumerable classes which can be recursively enumerated without repetitions. This paper is concerned with a weaker property of r.e. classes, namely that of being recursively enumerable with at most finite repetitions.This property is shown to behave more naturally: First we prove an extension theorem for classes satisfying this property. Then the analogous theorem for the property of recursively enumerable classes of being recursively enumerable with a bounded number of repetitions is shown not to hold. The index set of the property of recursively enumerable classes “having an enumeration with finite repetitions” is shown to be -complete.


Sign in / Sign up

Export Citation Format

Share Document