ISBN: 9781333072308 - decision procedures for elementary sublanguages of set theory: x. multilevel syllogistic extended by the singleton and powerset operators (classic rep (3 risultati)

Perfeziona la tua ricerca

  • Libri (3)

  • Nuovo (3)

a

Fascia di prezzo personalizzata (EUR)

a

  • Lingua: Inglese

    Editore: Forgotten Books, 2018

    1333072309 / 9781333072308

    • Brossura

    Da: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 26,27

     Spedizione gratuita 
    Spedito in U.S.A.

    Quantità: 15 disponibili

    PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

  • Lingua: Inglese

    Editore: Forgotten Books, 2018

    1333072309 / 9781333072308

    • Brossura

    Da: PBShop.store UK, Fairford, GLOS, Regno UnitoPBShop.store UK

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 25,18

    EUR 3,93 spedizione 
    Spedito da Regno Unito a U.S.A.

    Quantità: 15 disponibili

    PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

  • Lingua: Inglese

    Editore: Forgotten Books, London, 2018

    1333072309 / 9781333072308

    • Brossura
    • Print on Demand

    Da: Forgotten Books, London, Regno UnitoForgotten Books

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 16,51

     Spedizione gratuita 
    Spedito da Regno Unito a U.S.A.

    Quantità: Più di 20 disponibili

    Paperback. Condizione: New. No Jacket. Print on Demand. Understand a new decision procedure for a rich class of set-theoretic formulas. This work shows that the satisfiability problem remains solvable when extending multilevel syllogistic with singleton and powerset operators.Written for researchers and students in logic and theoretical computer science, the text frames how a carefully designed procedure combines syntactic and model-theoretic ideas to decide formulas built from union, intersection, set difference, powerset, and singleton, using standard set-theoretic predicates and boolean connectives. It explains the intended interpretation and proves that satisfiable formulas have boundable models, leading to a concrete decidability result.The paper surveys the progression from well-known decidability results to a decision procedure for a broader language, and outlines the key constructs that enable the proof. It emphasizes how canonical models and a nondeterministic standardization algorithm work together to test satisfiability. The language MLSSP and its injective satisfiability reduction to a simpler subtheory. The construction of places, P-nodes, and a staged algorithm that ensures correct modeling of clauses. The Main Inductive Lemma and its role in establishing partial correctness of the procedure. Culminating corollaries, including the decidability of the MLSSP class and model-size bounds.Ideal for readers of formal logic and advanced set theory who want a rigorous, computational take on satisfiability in set-theoretic languages. 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.…