Computer Science Logic
Editat de Peter G. Clote, Helmut Schwichtenbergen Limba Engleză Paperback – 9 aug 2000
Preț: 635.44 lei
Preț vechi: 794.30 lei
-20% Nou
Puncte Express: 953
Preț estimativ în valută:
112.43€ • 131.18$ • 98.29£
112.43€ • 131.18$ • 98.29£
Carte tipărită la comandă
Livrare economică 16-30 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540678953
ISBN-10: 3540678956
Pagini: 564
Ilustrații: XIV, 550 p.
Dimensiuni: 155 x 235 x 31 mm
Greutate: 0.84 kg
Ediția:2000
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540678956
Pagini: 564
Ilustrații: XIV, 550 p.
Dimensiuni: 155 x 235 x 31 mm
Greutate: 0.84 kg
Ediția:2000
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Papers.- Background, Reserve, and Gandy Machines.- Choiceless Polynomial Time Computation and the Zero-One Law.- Composition and Submachine Concepts for Sequential ASMs.- Une tentative malheureuse de construire une structure éliminant rapidement les quanteurs.- Translating Theory into Practice — Abstract State Machines within Microsoft.- Choiceless Polynomial Time Logic: Inability to Express.- Schema Revisited.- Automated Verification = Graphs, Automata, and Logic.- Contributed Papers.- A Fully Complete PER Model for ML Polymorphic Types.- Subtyping with Power Types.- The Descriptive Complexity of the Fixed-Points of Bounded Formulas.- Hypersequents and the Proof Theory of Intuitionistic Fuzzy Logic.- Continuous Functionals of Dependent Types and Equilogical Spaces.- Definability over Linear Constraints.- Bounded Arithmetic and Descriptive Complexity.- Independence: Logics and Concurrency.- Flatness Is Not a Weakness.- Sequents, Frames, and Completeness.- Disjunctive Tautologies as Synchronisation Schemes.- Axiomatizing the Least Fixed Point Operation and Binary Supremum.- Interactive Programs in Dependent Type Theory.- Modal Satisfiability Is in Deterministic Linear Space.- Logic Programming and Co-inductive Definitions.- A Theory of Explicit Mathematics Equivalent to ID 1.- On the Complexity of Explicit Modal Logics.- Finite Models and Full Completeness.- On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale.- Elimination of Negation in a Logical Framework.- Discreet Games, Light Affine Logic and PTIME Computation.- Completeness of Higher-Order Duration Calculus.- Equational Termination by Semantic Labelling.- On the Computational Interpretation of Negation.- FromPrograms to Games: Invariance and Safety for Bisimulation.- Logical Relations and Data Abstraction.- Elementary Choiceless Constructive Analysis.- On the Logic of the Standard Proof Predicate.
Caracteristici
Includes supplementary material: sn.pub/extras