Opis
Excerpt from Decision Procedures for Elementary Sublanguages of Set Theory
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.
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.
Szczegóły książki
Format
Miękka okładka
Strony
41 stron
Język
Angielski
Opublikowany
Aug 24, 2018
Wydawca
Forgotten Books
ISBN-10
133304254X
ISBN-13
9781333042547