Excerpt from Decision Procedures for Elementary Sublanguages of Set Theory: X. Multilevel Syllogistic Extended by the Singleton and Powerset Operators
The intended meaning of the language is that in which variables range over (possibly infinite) sets in the standard universe of 'naive' set theory, and the var ious standard set-theoretic Operator and predicate symbols have their standard meanings; hence an interpretation M of a set of sentences d) of our language is a function which maps every variable a: into a set M 2. If all the sentences of p are true under some interpretation of this kind, is said to be satisfiable and each interpretation which satisfies P is called a model of (note that all our considerations are easily formalizable in zpo, and in fact even in weaker set-theoretical systems, since the language with which we work includes only a very few constructs. But we will not belabor this technical point since this paper is concerned with computational rather than foundational questions.)
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.
"synopsis" may belong to another edition of this title.
Shipping:
FREE
From United Kingdom to U.S.A.
Seller: Forgotten Books, London, United Kingdom
Paperback. Condition: New. Print on Demand. This book explores the intersection of set theory and propositional logic, focusing on the satisfiability problem and relationships to model theory. The author, a respected figure in mathematical logic, provides an in-depth analysis of the class of formulae involving set-theoretic atoms, Boolean operators, equality, and membership predicates. The book delves into decision procedures for these formulae, establishing solvable satisfiability problems for a specific class within this wider group. Moreover, it demonstrates a fundamental connection between satisfiability and the existence of hereditarily finite models for these formulae, providing novel insights into the interplay between syntax and model theory. Through detailed proofs and technical exposition, this book offers a significant contribution to the study of set theory and its applications in propositional logic and model theory. 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. Seller Inventory # 9781333072308_0
Quantity: Over 20 available
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781333072308
Quantity: 15 available
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781333072308
Quantity: 15 available