As proved recently, the satisfiability problem for all prenex formulae in the set-theoretic Bernays-Schönfinkel-Ramsey class is semi-decidable over von Neumann's cumulative hierarchy. Here that semi-decidability result is strengthened into a decidability result for the same collection of formulae.
The Bernays-Schönfinkel-Ramsey class for set theory: decidability / Omodeo, Eugenio; Alberto, Policriti. - In: THE JOURNAL OF SYMBOLIC LOGIC. - ISSN 0022-4812. - STAMPA. - 77:3(2012), pp. http://dx.doi.org/10.2178/jsl/1344862166.896-http://dx.doi.org/10.2178/jsl/1344862166.918. [10.2178/jsl/1344862166]
The Bernays-Schönfinkel-Ramsey class for set theory: decidability.
OMODEO, EUGENIO;
2012-01-01
Abstract
As proved recently, the satisfiability problem for all prenex formulae in the set-theoretic Bernays-Schönfinkel-Ramsey class is semi-decidable over von Neumann's cumulative hierarchy. Here that semi-decidability result is strengthened into a decidability result for the same collection of formulae.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
