The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations (Q737087)

scientific article

In more languages

Language	Label	Description	Also known as
English	The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations	scientific article

Statements

The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations (English)

Marianna Nicolosi-Asmundo

0 references

publication date

5 August 2016

0 references

full work available at URL

https://arxiv.org/abs/1506.01476

0 references

zbMATH Keywords

satisfiability problem

0 references

set theory

0 references

restricted quantification

0 references

finite enumerations

0 references

MaRDI profile type

MaRDI publication profile

Decision procedures for elementary sublanguages of set theory: X. Multilevel syllogistic extended by the singleton and powerset operators

0 references

Q4234182

0 references

Techniques of computable set theory with applications to proof verification

0 references

Decision procedures for elementary sublanguages of set theory. IV. Formulae involving a rank operator or one occurrence of Σ(x)={{y}|y εx}

0 references

Q3999861

0 references

Web ontology representation and reasoning via fragments of set theory

0 references

On the Satisfiability Problem for a 4-level Quantified Syllogistic and Some Applications to Modal Logic

0 references

The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations

0 references

Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators

0 references

Q2740887

0 references

A set-theoretic translation method for polymodal logics

Computational Logic and Set Theory

0 references

Identifiers

Sitelinks

Mathematics(1 entry)

mardi Publication:737087