Publisher's Synopsis
Excerpt from Decision Procedures for Elementary Sublanguages of Set Theory: XI. Multilevel Syllogistic Extended by Some Elementary Map Constructs
This paper tackles the satisfiability problem for the one-sorted language E, which properly extends the purely set-theoretical part (i.e. With no cardinality constructs) of the theory considered in [fos]. In particular we will exhibit a finite and uniform procedure which decides for any given formula P of E whether P has a model or not. 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.
