Počet záznamů: 1  

Finite and algorithmic model theory

  1. Údaje o názvuFinite and algorithmic model theory / edited by Javier Esparza, Christian Michaux, Charles Steinhorn
    NakladatelCambridge ; New York : Cambridge University Press, 2011
    Fyz.popis1 online zdroj (xi, 341 stran) : ilustrace
    ISBN9781139127097 (online ; pdf)
    1139127098
    9780511974960
    0511974965
    9781139116435
    1139116436
    EdiceLondon Mathematical Society lecture note series ; 379
    Poznámky o skryté bibliografii a rejstřícíchObsahuje bibliografické odkazy a rejstřík
    Úplný obsahPreface / Javier Esparza, Christian Michaux and Charles Steinhorn -- Automata-based presentations of infinite structures / Vince Bárány, Erich Grädel and Sasha Rubin -- Logical aspects of spatial databases / Bart Kuijpers and Jan Van den Bussche -- Some connections between finite and infinite model theory / Vera Koponen -- Definability in classes of finite structures / Dugald Macpherson and Charles Steinhorn -- Algorithmic meta-theorems / Stephan Kreutzer -- Model theoretic methods for fragments of FO and special classes of (finite) structures / Martin Otto.
    Poznámky k dostupnostiPřístup pouze pro oprávněné uživatele
    PoznámkyZpůsob přístupu: World Wide Web
    DefektyeBooks on EBSCOhost
    Dal.odpovědnost Esparza, Javier, 1964- (editor)
    Michaux, Christian (editor)
    Steinhorn, Charles (editor)
    Předmět.hesla metoda konečných prvků finite element method * teorie modelů model theory * algoritmy algorithms
    Forma, žánr elektronické knihy electronic books
    Konspekt510 - Obecné úvahy o matematice
    MDT 510.5 , 510.67 , 519.63 , (0.034.2:08)
    Země vyd.Velká Británie ; Spojené státy americké
    Jazyk dok.angličtina
    Druh dok.Elektronické zdroje
    URLhttp://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=399283
    kniha

    kniha


    "Intended for researchers and graduate students in theoretical computer science and mathematical logic, this volume contains accessible surveys by leading researchers from areas of current work in logical aspects of computer science, where both finite and infinite model-theoretic methods play an important role. Notably, the articles in this collection emphasize points of contact and connections between finite and infinite model theory in computer science that may suggest new directions for interaction. Among the topics discussed are: algorithmic model theory, descriptive complexity theory, finite model theory, finite variable logic, model checking, model theory for restricted classes of finite structures, and spatial databases. The chapters all include extensive bibliographies facilitating deeper exploration of the literature and further research"--Provided by publisher.

    Preface / Javier Esparza, Christian Michaux and Charles Steinhorn -- Automata-based presentations of infinite structures / Vince Bárány, Erich Grädel and Sasha Rubin -- Logical aspects of spatial databases / Bart Kuijpers and Jan Van den Bussche -- Some connections between finite and infinite model theory / Vera Koponen -- Definability in classes of finite structures / Dugald Macpherson and Charles Steinhorn -- Algorithmic meta-theorems / Stephan Kreutzer -- Model theoretic methods for fragments of FO and special classes of (finite) structures / Martin Otto.

Počet záznamů: 1  

  Tyto stránky využívají soubory cookies, které usnadňují jejich prohlížení. Další informace o tom jak používáme cookies.