Translator Disclaimer
September 2012 The Bernays—Schönfinkel—Ramsey class for set theory: decidability
Eugenio Omodeo, Alberto Policriti
J. Symbolic Logic 77(3): 896-918 (September 2012). DOI: 10.2178/jsl/1344862166

Abstract

As proved recently, the satisfaction problem for all prenex formulae in the set-theoretic Bernays—Shö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.

Citation

Download Citation

Eugenio Omodeo. Alberto Policriti. "The Bernays—Schönfinkel—Ramsey class for set theory: decidability." J. Symbolic Logic 77 (3) 896 - 918, September 2012. https://doi.org/10.2178/jsl/1344862166

Information

Published: September 2012
First available in Project Euclid: 13 August 2012

zbMATH: 1251.03025
MathSciNet: MR2987142
Digital Object Identifier: 10.2178/jsl/1344862166

Keywords: computable set theory , decision and semi-decision algorithms , satisfiability

Rights: Copyright © 2012 Association for Symbolic Logic

JOURNAL ARTICLE
23 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.77 • No. 3 • September 2012
Back to Top