Logical Foundations of Computer Science : International Symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10–13, 2022, Proceedings / edited by Sergei Artemov, Anil Nerode.

Format:

Book

Author/Creator:

Artemov., author.

Nerode, Anil,., author.

Contributor:

Sergei.

Series:

Theoretical Computer Science and General Issues, 2512-2029 ; 13137

Language:

English

Subjects (All):

Logic, Symbolic and mathematical.

Mathematical Logic and Foundations.

Local Subjects:

Mathematical Logic and Foundations.

Physical Description:

1 online resource (386 pages)

Edition:

1版. 2022.

Place of Publication:

Cham : Springer International Publishing : Imprint: Springer, 2022.

Summary:

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.

Contents:

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.

Other Format:

Print version: Artemov, Sergei Logical Foundations of Computer Science

ISBN:

3-030-93100-5

OCLC:

1289369779