scholarly journals Formative processes with applications to the decision problem in set theory: II. Powerset and singleton operators, finiteness predicate

2014 ◽  
Vol 237 ◽  
pp. 215-242 ◽  
Author(s):  
Domenico Cantone ◽  
Pietro Ursino
Keyword(s):  
Set Theory ◽  
Decision Problem

scholarly journals Formative Processes with Applications to the Decision Problem in Set Theory

2002 ◽  
Vol 172 (2) ◽  
pp. 165-201 ◽  
Author(s):  
Domenico Cantone ◽  
Pietro Ursino ◽  
Eugenio G. Omodeo
Keyword(s):  
Set Theory ◽  
Decision Problem

Effectively retractable theories and degrees of undecidability

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

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.

A Course on Set Theory

2009 ◽  
Author(s):  
Ernest Schimmerling
Keyword(s):  
Set Theory

Set Theory

2016 ◽  
Author(s):  
Daniel W. Cunningham
Keyword(s):  
Set Theory
Sign in / Sign up

Export Citation Format

Share Document