Edizione | [1st ed. 2010.] |
Pubbl/distr/stampa |
Berlin ; ; New York, : Springer, c2010
|
Descrizione fisica |
1 online resource (XIII, 627 p. 49 illus.)
|
Disciplina |
004.0151
|
Altri autori (Persone) |
BlassAndreas <1947->
DershowitzNachum
ReisigWolfgang <1950->
|
Collana |
Lecture notes in computer science
|
Soggetto topico |
Computer algorithms
Logic, Symbolic and mathematical
|
ISBN |
1-280-38827-7
9786613566195
3-642-15025-X
|
Formato |
Materiale a stampa ![](img/format/mas.png) |
Livello bibliografico |
Monografia |
Lingua di pubblicazione |
eng
|
Nota di contenuto |
On Yuri Gurevich -- Yuri, Logic, and Computer Science -- Database Theory, Yuri, and Me -- Technical Papers -- Tracking Evidence -- Strict Canonical Constructive Systems -- Decidable Expansions of Labelled Linear Orderings -- Existential Fixed-Point Logic, Universal Quantifiers, and Topoi -- Three Paths to Effectiveness -- The Quest for a Tight Translation of Büchi to co-Büchi Automata -- Normalization of Some Extended Abstract State Machines -- Finding Reductions Automatically -- On Complete Problems, Relativizations and Logics for Complexity Classes -- Effective Closed Subshifts in 1D Can Be Implemented in 2D -- The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey -- A Logic for PTIME and a Parameterized Halting Problem -- Inferring Loop Invariants Using Postconditions -- ASMs and Operational Algorithmic Completeness of Lambda Calculus -- Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs -- Ibn S?n? on Analysis: 1. Proof Search. Or: Abstract State Machines as a Tool for History of Logic -- Abstract State Machines and the Inquiry Process -- The Algebra of Adjacency Patterns: Rees Matrix Semigroups with Reversion -- Definability of Combinatorial Functions and Their Linear Recurrence Relations -- Halting and Equivalence of Program Schemes in Models of Arbitrary Theories -- Metrization Theorem for Space-Times: From Urysohn’s Problem towards Physically Useful Constructive Mathematics -- Thirteen Definitions of a Stable Model -- DKAL and Z3: A Logic Embedding Experiment -- Decidability of the Class E by Maslov’s Inverse Method -- Logics for Two Fragments beyond the Syllogistic Boundary -- Choiceless Computation and Symmetry -- Hereditary Zero-One Laws for Graphs -- On Monadic Theories of Monadic Predicates.
|
Record Nr. | UNINA-9910483367003321 |