東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Logical foundations of computer scie...

LFCS (Symposium) ((2022 :)

FindBook

Google Book

Amazon

博客來

Logical foundations of computer science = international symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10-13, 2022 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Logical foundations of computer science/ edited by Sergei Artemov, Anil Nerode.
其他題名:	international symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10-13, 2022 : proceedings /
其他題名:	LFCS 2022
其他作者:	Artemov, Sergei.
團體作者:	LFCS (Symposium)
出版者:	Cham :Springer International Publishing : : 2022.,
面頁冊數:	x, 377 p. :ill. (some col.), digital ;24 cm.
內容註:	A Non-Hyperarithmetical Godel 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.
Contained By:	Springer Nature eBook
標題:	Computer science - Congresses. -
電子資源:	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] :LFCS 2022edited by Sergei Artemov, Anil Nerode. - Cham :Springer International Publishing :2022. - x, 377 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,131370302-9743 ;. - Lecture notes in computer science ;13137..

A Non-Hyperarithmetical Godel 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:

606819
Computer science
--Congresses.

LC Class. No.: QA75.5 / .L43 2022

Dewey Class. No.: 004

Logical foundations of computer science = international symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10-13, 2022 : proceedings /
LDR:03963nmm a2200373 a 4500 001 2296972
003 DE-He213
005 20211215233417.0
006 m d
007 cr nn 008maaau
008 230324s2022 sz s 0 eng d
020 $a 9783030931001 $q (electronic bk.)
020 $a 9783030930998 $q (paper)
024 7 $a 10.1007/978-3-030-93100-1 $2 doi
035 $a 978-3-030-93100-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA75.5 $b .L43 2022
072 7 $a PBC $2 bicssc
072 7 $a MAT018000 $2 bisacsh
072 7 $a PBC $2 thema
072 7 $a PBCD $2 thema
082 0 4 $a 004 $2 23
090 $a QA75.5 $b .L687 2022
111 2 $a LFCS (Symposium) $d (2022 : $c Deerfield Beach, Fla.) $3 3592083
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.
246 3 $a LFCS 2022
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a x, 377 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 13137
490 1 $a Theoretical computer science and general issues
505 0 $a A Non-Hyperarithmetical Godel 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 Computer science $v Congresses. $3 606819
650 0 $a Computer logic $x Congresses. $3 726280
650 1 4 $a Mathematical Logic and Foundations. $3 892656
700 1 $a Artemov, Sergei. $3 1002461
700 1 $a Nerode, Anil. $3 1002462
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 13137. $3 3592084
830 0 $a Theoretical computer science and general issues. $3 3382501
856 4 0 $u https://doi.org/10.1007/978-3-030-93100-1
950 $a Computer Science (SpringerNature-11645)