Verwandte Artikel zu Decision Procedures for Elementary Sublanguages of...
Decision Procedures for Elementary Sublanguages of Set Theory; Vi; Multi-Level Syllogistic Extended by the Powerset Operator (Classic Reprint) - Softcover
Inhaltsangabe
Excerpt from Decision Procedures for Elementary Sublanguages of Set Theory; Vi; Multi-Level Syllogistic Extended by the Powerset Operator
Definition A place a of P is a O/l-valued function defined on the set of all variables in P such that c(x) a(y) V a(z) (resp. C(x) a(y) |~g429) if x y U z (resp. X y z), belongs to P, and such that c(x) E 0 if x G appears in P. Given a variable x, the place a is said tosbe:a place of P at x if a(y) (resp. A(y) 0) whenever x e y (resp. X d y) appears in P.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reseña del editor
Excerpt from Decision Procedures for Elementary Sublanguages of Set Theory; Vi; Multi-Level Syllogistic Extended by the Powerset Operator
Definition A place a of P is a O/l-valued function defined on the set of all variables in P such that c(x) a(y) V a(z) (resp. C(x) a(y) |~g429) if x y U z (resp. X y z), belongs to P, and such that c(x) E 0 if x G appears in P. Given a variable x, the place a is said tosbe:a place of P at x if a(y) (resp. A(y) 0) whenever x e y (resp. X d y) appears in P.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Neu kaufen
Diesen Artikel anzeigen
EUR 18,88
EUR 0,87 für den Versand von USA nach Deutschland
Versandziele, Kosten & DauerWeitere beliebte Ausgaben desselben Titels
Suchergebnisse für Decision Procedures for Elementary Sublanguages of...
Beispielbild für diese ISBN
Decision Procedures for Elementary Sublanguages of Set Theory Vi MultiLevel Syllogistic Extended by the Powerset Operator Classic Reprint
Anbieter: PBShop.store US, Wood Dale, IL, USA
Verkäuferbewertung 5 von 5 Sternen
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781332887477
Anzahl: 15 verfügbar
Beispielbild für diese ISBN
Decision Procedures for Elementary Sublanguages of Set Theory Vi MultiLevel Syllogistic Extended by the Powerset Operator Classic Reprint
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781332887477
Anzahl: 15 verfügbar
Foto des Verkäufers
Decision Procedures for Elementary Sublanguages of Set Theory; Vi
Print-on-DemandAnbieter: Forgotten Books, London, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: New. Print on Demand. This book delves into the realm of understanding and resolving a particular undeclared theory of sets, specifically concerning the language involving empty sets, equality, membership, union, set differences, and powersets. The theory the author explores has been previously examined but with the powerset operator omitted, while this book builds on that work by including it. Using techniques and ideas developed in the author's previous works, this text presents an algorithm that reveals whether any formula within this theory is satisfiable. Throughout the book, the author proves that the conditions presented are both necessary and sufficient for this satisfiability, marking an important contribution to the field. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Bestandsnummer des Verkäufers 9781332887477_0
Anzahl: Mehr als 20 verfügbar