9781333042547 - decision procedures for elementary sublanguages of set theory (classic reprint): xi. multilevel syllogistic extended by some elementary map ... elementary map constructs (classic reprint) di cantone, d. (3 risultati)
- Brossura
Da: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 24,63
Spedizione gratuitaSpedito in U.S.A.Quantità: 15 disponibili
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
- Brossura
Da: PBShop.store UK, Fairford, GLOS, Regno UnitoPBShop.store UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 24,39
EUR 3,84 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 15 disponibili
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
- Brossura
- Print on Demand
Da: Forgotten Books, London, Regno UnitoForgotten Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 15,48
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: New. Print on Demand. This book extends the decision procedures for set theory previously developed by the author for quantied and unquantied languages. This eleventh volume of the series builds upon prior work by examining set operators, set predicates, cardinality operators, cardinality predicates and fu…nction operators within elementary Boolean connectives. It presents a finite and uniform procedure that decides whether a given formula possesses a model or not, reducing the problem to the satisability problem for conjunctions of atoms. By way of disjunctive normal form, it is demonstrated that constructs like set difference or the Singleton predicate are equisatisfiable to conjunctions of positive atoms. The author demonstrates the satisability problem for three-sorted language, which properly extends the purely set-theoretical part of the theory considered in previous volumes, exhibiting a finite and uniform procedure that is capable of deciding whether a given formula has a model. The book concludes by considering D, INV, SINGLEVALUED, PAIRIN as operators, discussing their satisability conditions, and arguing that the class of formulas in the language of the book has a solvable satisability problem. 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.
