Mendeley出力
Logical Foundations of Computer Science : International Symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10–13, 2022, Proceedings / edited by Sergei Artemov, Anil Nerode
(Theoretical Computer Science and General Issues. ISSN:25122029 ; 13137)
| データ種別 | 電子ブック |
|---|---|
| 版 | 1st ed. 2022. |
| 出版者 | (Cham : Springer International Publishing : Imprint: Springer) |
| 出版年 | 2022 |
| 大きさ | X, 377 p. 18 illus., 2 illus. in color : online resource |
| 著者標目 | Artemov, Sergei editor Nerode, Anil editor SpringerLink (Online service) |
書誌詳細を非表示
| 一般注記 | A Non-Hyperarithmetical Gödel Logic -- Shorten Resolution Proofs Non-Elementarily -- The Isomorphism Problem for FST Injection Structures -- Justification Logic and Type Theory as Formalizations of Intuitionistic Propositional Logic -- Hyperarithmetical Worm Battles -- Parametric Church’s Thesis: Synthetic Computability Without Choice -- Constructive and Mechanised Meta-Theory of Intuitionistic Epistemic Logic -- A Parametrized Family of Tversky Metrics Connecting the Jaccard Distance to an Analogue of the Normalized Information Distance -- A Parameterized View on the Complexity of Dependence Logic -- A Logic of Interactive Proofs -- Recursive Rules With Aggregation: A Simple Unified Semantics -- Computational Properties of Partial Non-deterministic Matrices and Their Logics -- Soundness and Completeness Results for LEA and Probability Semantics -- On Inverse Operators in Dynamic Epistemic Logic -- Computability Models Over Categories and Presheaves -- Reducts of Relation Algebras: The Aspects of Axiomatisability and Finite Representability -- Between Turing and Kleene -- Propositional Dynamic Logic With Quantification Over Regular Computation Sequences -- Finite Generation and Presentation Problems for Lambda Calculus and Combinatory Logic -- Exact and Parameterized Algorithms for Read-Once Refutations in Horn Constraint Systems -- Logical Principles -- Small Model Property Reflects in Games and Automata This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2022, held in Deerfield Beach, FL, USA, in January 2022. The 23 revised full papers were carefully reviewed and selected from 35 submissions. The scope of the Symposium is broad and includes constructive mathematics and type theory; homotopy type theory; logic, automata, and automatic structures; computability and randomness; logical foundations of programming; logical aspects of computational complexity; parameterized complexity; logic programming and constraints; automated deduction and interactive theorem proving; logical methods in protocol and program verification; logical methods in program specification and extraction; domain theory logics; logical foundations of database theory; equational logic and term rewriting; lambda and combinatory calculi; categorical logic and topological semantics; linear logic; epistemic and temporal logics; intelligent and multiple-agent system logics; logics of proof and justification; non-monotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics; mathematical fuzzy logic; system design logics; other logics in computer science HTTP:URL=https://doi.org/10.1007/978-3-030-93100-1 |
|---|---|
| 件 名 | LCSH:Mathematical logic FREE:Mathematical Logic and Foundations |
| 分 類 | LCC:QA8.9-10.3 DC23:511.3 |
| 書誌ID | EB00002027 |
| ISBN | 9783030931001 |
類似資料
この資料の利用統計
このページへのアクセス回数：2回
※2019年3月27日以降
全貸出数：0回
(1年以内の貸出：0回)
※2019年3月27日以降