Logical Foundations of Computer Science

International Symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10–13, 2022, Proceedings

AvSergei Artemov,Anil Nerode

Häftad, Engelska, 2021

Del 13137 i serien Lecture Notes in Computer Science

796 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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. domain theory logics; logical foundations of database theory;

Produktinformation

Utgivningsdatum:2021-12-17
Mått:155 x 235 x 26 mm
Vikt:594 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:377
Förlag:Springer Nature Switzerland AG
ISBN:9783030930998

Utforska kategorier

Innehållsförteckning

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.