scholarly journals The Decision Problem for a Three-sorted Fragment of Set Theory with Restricted Quantification and Finite Enumerations

2016 ◽  
Vol 322 ◽  
pp. 69-86 ◽  
Author(s):  
Domenico Cantone ◽  
Marianna Nicolosi-Asmundo
2002 ◽  
Vol 172 (2) ◽  
pp. 165-201 ◽  
Author(s):  
Domenico Cantone ◽  
Pietro Ursino ◽  
Eugenio G. Omodeo
Keyword(s):  

1970 ◽  
Vol 34 (4) ◽  
pp. 597-604
Author(s):  
J. P. Jones
Keyword(s):  

In this paper a new property of theories, called effective retractability is introduced and used to obtain a characterization for the degrees of subtheories of arithmetic and set theory. By theory we understand theory in standard formalization as defined by Tarski [10]. The word degree refers to the Kleene-Post notion of degree of recursive unsolvability [2]. By the degree of a theory we mean, of course, the degree associated with its decision problem via Gödel numbering.


Author(s):  
Ernest Schimmerling
Keyword(s):  

Author(s):  
Daniel W. Cunningham
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document