The Bernays-Schönfinkel-Ramsey class for set theory: decidability
type: Item
instance of: scholarly article
title: The Bernays-Schönfinkel-Ramsey class for set theory: decidability
zbMATH Open document ID: 1251.03025
author: Alberto Policriti
author: Eugenio Omodeo
publication date: 2012-09-19T00:00:00Z
full work available at URL: https://projecteuclid.org/euclid.jsl/1344862166
Mathematics Subject Classification ID: 03B25
Mathematics Subject Classification ID: 03E99
zbMATH DE Number: 6083957
zbMATH Keywords: satisfiability
zbMATH Keywords: prenex formula
zbMATH Keywords: decision algorithms
zbMATH Keywords: semi-decision algorithms
zbMATH Keywords: computable set theory
MaRDI profile type: Publication
OpenAlex ID: W4233684349
cites work: Q5691140
cites work: Q2740887
cites work: {log}: A language for programming in logic with finite sets
cites work: Set theory. An introduction to independence proofs. 2nd print
cites work: The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability
cites work: The Logically Simplest Form of the Infinity Axiom
DOI: 10.2178/JSL/1344862166
published in: The Journal of Symbolic Logic
description: scientific article; zbMATH DE number 6083957