As proved recently. the satisfaction problem for all prenex formulae in the set-theoretic Bernays-Shonfinkel-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-Schoenfinkel-Ramsey Class in Set Theory: Decidability
POLICRITI, Alberto
2012-01-01
Abstract
As proved recently. the satisfaction problem for all prenex formulae in the set-theoretic Bernays-Shonfinkel-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.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
