Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability
type: Item
instance of: scholarly article
title: Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability
zbMATH Open document ID: 0734.03006
DOI: 10.1007/BF00243810
author: Franco Parlamento
author: Alberto Policriti
published in: Journal of Automated Reasoning
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 03B25
Mathematics Subject Classification ID: 03E99
zbMATH DE Number: 4213953
zbMATH Keywords: decision problem
zbMATH Keywords: quantified formulae
zbMATH Keywords: first order set theoretic language
zbMATH Keywords: unquantified formulae
zbMATH Keywords: choice operator
zbMATH Keywords: strong reflection principles
zbMATH Keywords: hereditarily finite sets
zbMATH Keywords: finite satisfiability
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1007/bf00243810
OpenAlex ID: W2087640143
description: scientific article; zbMATH DE number 4213953