000 04742nam a22005295i 4500
001 978-3-030-93100-1
003 DE-He213
005 20240730180957.0
007 cr nn 008mamaa
008 211215s2022 sz | s |||| 0|eng d
020 _a9783030931001
_9978-3-030-93100-1
024 7 _a10.1007/978-3-030-93100-1
_2doi
050 4 _aQA8.9-10.3
072 7 _aPBCD
_2bicssc
072 7 _aPBC
_2bicssc
072 7 _aMAT018000
_2bisacsh
072 7 _aPBCD
_2thema
072 7 _aPBC
_2thema
082 0 4 _a511.3
_223
245 1 0 _aLogical Foundations of Computer Science
_h[electronic resource] :
_bInternational Symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10-13, 2022, Proceedings /
_cedited by Sergei Artemov, Anil Nerode.
250 _a1st ed. 2022.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2022.
300 _aX, 377 p. 18 illus., 2 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v13137
505 0 _aA 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 _aThis 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 _aMathematical logic.
_92258
650 1 4 _aMathematical Logic and Foundations.
_934712
700 1 _aArtemov, Sergei.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9122792
700 1 _aNerode, Anil.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9122793
710 2 _aSpringerLink (Online service)
_9122794
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030930998
776 0 8 _iPrinted edition:
_z9783030931018
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v13137
_9122795
856 4 0 _uhttps://doi.org/10.1007/978-3-030-93100-1
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c90619
_d90619