Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini (Q4361575): Difference between revisions

Latest revision as of 21:32, 29 December 2024

scientific article; zbMATH DE number 1080088

Language	Label	Description	Also known as
English	Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini	scientific article; zbMATH DE number 1080088

Statements

instance of

scholarly article

0 references

title

Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini (English)

0 references

0 references

0 references

0 references

RAIRO - Theoretical Informatics and Applications

0 references

publication date

11 June 1998

0 references

full work available at URL

https://eudml.org/doc/92559

0 references

zbMATH Keywords

hereditarily finite sets

0 references

describes a project that uses

CHIP

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Decidability of systems of set constraints with negative constraints

0 references

Towards the automation of set theory and its logic

0 references

Q3999861

0 references

Q4729329

0 references

The automation of syllogistic. II: Optimization and complexity issues

0 references

{log}: A language for programming in logic with finite sets

0 references

Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions

0 references

Q4281553

0 references

Q4282516

0 references

Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini

0 references

Q4391452

0 references

Q3785940

0 references

Consistency in networks of relations

0 references

Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability

0 references

Undecidability results for restricted universally quantified formulae of set theory

0 references

Automatic theorem proving in set theory

0 references

A note on the parallel complexity of anti-unification

0 references

Q3484383

0 references

Q3741005

0 references

Q3489527

0 references

Identifiers

zbMATH Open document ID

0889.68062

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

10.1051/ITA/1997310302051

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4361575

@@ Property / DOI @@
-.1051/ita/1997310302051
@@ Property / DOI: 10.1051/ita/1997310302051 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+CHIP
@@ Property / describes a project that uses: CHIP / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1658779621
@@ Property / OpenAlex ID: W1658779621 / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability of systems of set constraints with negative constraints
+Normal rank
@@ Property / cites work @@
+Towards the automation of set theory and its logic
+Normal rank
@@ Property / cites work @@
+Q3999861
@@ Property / cites work: Q3999861 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4729329
@@ Property / cites work: Q4729329 / rank @@
+Normal rank
@@ Property / cites work @@
+The automation of syllogistic. II: Optimization and complexity issues
+Normal rank
@@ Property / cites work @@
+{log}: A language for programming in logic with finite sets
+Normal rank
@@ Property / cites work @@
+Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions
+Normal rank
@@ Property / cites work @@
+Q4281553
@@ Property / cites work: Q4281553 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4282516
@@ Property / cites work: Q4282516 / rank @@
+Normal rank
@@ Property / cites work @@
+Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini
+Normal rank
@@ Property / cites work @@
+Q4391452
@@ Property / cites work: Q4391452 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3785940
@@ Property / cites work: Q3785940 / rank @@
+Normal rank
@@ Property / cites work @@
+Consistency in networks of relations
@@ Property / cites work: Consistency in networks of relations / rank @@
+Normal rank
@@ Property / cites work @@
+Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability
+Normal rank
@@ Property / cites work @@
+Undecidability results for restricted universally quantified formulae of set theory
+Normal rank
@@ Property / cites work @@
+Automatic theorem proving in set theory
@@ Property / cites work: Automatic theorem proving in set theory / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the parallel complexity of anti-unification
+Normal rank
@@ Property / cites work @@
+Q3484383
@@ Property / cites work: Q3484383 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3741005
@@ Property / cites work: Q3741005 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3489527
@@ Property / cites work: Q3489527 / rank @@
+Normal rank
@@ Property / DOI @@
+.1051/ITA/1997310302051
@@ Property / DOI: 10.1051/ITA/1997310302051 / rank @@
+Normal rank