國立虎尾科技大學 |

Logical Foundations of Computer Science = International Symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10–13, 2022, Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Logical Foundations of Computer Science/ edited by Sergei Artemov, Anil Nerode.
Reminder of title:	International Symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10–13, 2022, Proceedings /
other author:	Artemov, Sergei.
Description:	X, 377 p. 18 illus., 2 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Mathematical logic. -
Online resource:	https://doi.org/10.1007/978-3-030-93100-1
ISBN:	9783030931001

Logical Foundations of Computer Science = International Symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10–13, 2022, Proceedings /
Logical Foundations of Computer ScienceInternational Symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10–13, 2022, Proceedings /[electronic resource] :edited by Sergei Artemov, Anil Nerode. - 1st ed. 2022. - X, 377 p. 18 illus., 2 illus. in color.online resource. - Theoretical Computer Science and General Issues,131372512-2029 ;. - Theoretical Computer Science and General Issues,12865.

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.

ISBN: 9783030931001

Standard No.: 10.1007/978-3-030-93100-1doiSubjects--Topical Terms:

810627
Mathematical logic.

LC Class. No.: QA8.9-10.3

Dewey Class. No.: 511.3

Logical Foundations of Computer Science = International Symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10–13, 2022, Proceedings /
LDR:04260nam a22004335i 4500 001 1091828
003 DE-He213
005 20220308133506.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 $a 9783030931001 $9 978-3-030-93100-1
024 7 $a 10.1007/978-3-030-93100-1 $2 doi
035 $a 978-3-030-93100-1
050 4 $a QA8.9-10.3
072 7 $a PBCD $2 bicssc
072 7 $a PBC $2 bicssc
072 7 $a MAT018000 $2 bisacsh
072 7 $a PBCD $2 thema
072 7 $a PBC $2 thema
082 0 4 $a 511.3 $2 23
245 1 0 $a Logical Foundations of Computer Science $h [electronic resource] : $b International Symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10–13, 2022, Proceedings / $c edited by Sergei Artemov, Anil Nerode.
250 $a 1st ed. 2022.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a X, 377 p. 18 illus., 2 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues, $x 2512-2029 ; $v 13137
505 0 $a 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.
520 $a 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.
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 1 4 $a Mathematical Logic and Foundations. $3 669393
700 1 $a Artemov, Sergei. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 897130
700 1 $a Nerode, Anil. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 897131
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030930998
776 0 8 $i Printed edition: $z 9783030931018
830 0 $a Theoretical Computer Science and General Issues, $x 2512-2029 ; $v 12865 $3 1365719
856 4 0 $u https://doi.org/10.1007/978-3-030-93100-1
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)