MLSS is a decidable fragment of set theory involving the predicates membership and set equality and the operators union, intersection, set difference, and singleton. In this paper we extend MLSS with the iterated membership predicate, that is, with a predicate denoting the transitive closure of the membership relation. We call the resulting language MLSS+. We prove that MLSS+ is decidable by providing a decision procedure for it based on Smullyan semantic tableaux. As an application of our results, we show how our decision procedure can be used as a black box in order to allow an interactive theorem prover to verify some basic properties of the ordinal numbers.
|Titolo:||A tableau-based decision procedure for a fragment of set theory with iterated membership|
|Data di pubblicazione:||2005|
|Citazione:||A tableau-based decision procedure for a fragment of set theory with iterated membership / CANTONE D; ZARBA C.G; RUGGERI CANNATA R. - In: JOURNAL OF AUTOMATED REASONING. - ISSN 0168-7433. - 34:1(2005), pp. 49-72.|
|Appare nelle tipologie:||1.1 Articolo in rivista|