书籍详情
计算机科学逻辑（会议录）
作者：Julian Bradfield 著
出版社：湖南文艺出版社
出版时间：2002-12-01
ISBN：9783540442400
定价：¥768.40
购买这本书可以去
内容简介
This book constitutes the refereed proceedings of the 16th International Workshop on Computer Science Logic， CSL 2002， held as the 11th Annual Conference of the EACSL in Edinburgh， Scotland， UK， in September 2002.The 37 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 111 submissions. The papers are organized in topical sections on rewriting and constructive mathematics; fixpoints and recursion; linear and resource logics; semantics; temporal logics and games; probability， games， and fixpoints; complexity and proof complexity; ludics and linear logics， lambda-calculi; and resolution and proofs.
作者简介
暂缺《计算机科学逻辑（会议录）》作者简介
目录
Invited Lectures
Limit-Computable Mathematics and Its Applications
Automata, Logic, and XML
u-Calculus via Games (Extended Abstract)
Rewriting and Constructive Mathematics
Bijections between Partitions by Two-Directional Rewriting Techniques
On Continuous Normalization
Variants of Realizability for Propositional Formulas and the Logic of the Weak Law of Excluded Middle
Compactness and Continuity, Constructively Revisited
Fixpoints and Recursion
Hoare Logics for Recursive Procedures and Unbounded Nondeterminisrn
A Fixpoint Theory for Non-monotonic Parallelism
Greibach Normal Form in Algebraically Complete Semirings
Linear and Resource Logics
Proofnets and Context Semantics for the Additives
A Tag-Frame System of Resource Management for Proof Search in Linear-Logic Programming
Resource Tableaux
Semantics
Configuration Theories
A Logic for Probabilities in Semantics
Possible World Semantics for General Storage in Call-By-Value
A Fully Abstract Relational Model of Syntactic Control of Interference
Temporal Logics and Games
Optimal Complexity Bounds for Positive LTL Games
The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL
Trading Probability for Fairness
Probability, Games and Fixpoints
A Logic of Probability with Decidable Model-Checking
Solving Pushdown Games with a Za Winning Condition
Partial Fixed-Point Logic on Infinite Structures
On the Variable Hierarchy of the Modal #-Calculus
Complexity and Proof Complexity
Ludics and Linear Logic
Lambda-Calculi
Resolution and Proofs
Author Index
Limit-Computable Mathematics and Its Applications
Automata, Logic, and XML
u-Calculus via Games (Extended Abstract)
Rewriting and Constructive Mathematics
Bijections between Partitions by Two-Directional Rewriting Techniques
On Continuous Normalization
Variants of Realizability for Propositional Formulas and the Logic of the Weak Law of Excluded Middle
Compactness and Continuity, Constructively Revisited
Fixpoints and Recursion
Hoare Logics for Recursive Procedures and Unbounded Nondeterminisrn
A Fixpoint Theory for Non-monotonic Parallelism
Greibach Normal Form in Algebraically Complete Semirings
Linear and Resource Logics
Proofnets and Context Semantics for the Additives
A Tag-Frame System of Resource Management for Proof Search in Linear-Logic Programming
Resource Tableaux
Semantics
Configuration Theories
A Logic for Probabilities in Semantics
Possible World Semantics for General Storage in Call-By-Value
A Fully Abstract Relational Model of Syntactic Control of Interference
Temporal Logics and Games
Optimal Complexity Bounds for Positive LTL Games
The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL
Trading Probability for Fairness
Probability, Games and Fixpoints
A Logic of Probability with Decidable Model-Checking
Solving Pushdown Games with a Za Winning Condition
Partial Fixed-Point Logic on Infinite Structures
On the Variable Hierarchy of the Modal #-Calculus
Complexity and Proof Complexity
Ludics and Linear Logic
Lambda-Calculi
Resolution and Proofs
Author Index
猜您喜欢
