國立虎尾科技大學 |

Logical Foundations of Computer Science = International Symposium, LFCS 2020, Deerfield Beach, FL, USA, January 4–7, 2020, 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 2020, Deerfield Beach, FL, USA, January 4–7, 2020, Proceedings /
other author:	Artemov, Sergei.
Description:	X, 287 p. 418 illus., 3 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Mathematical logic. -
Online resource:	https://doi.org/10.1007/978-3-030-36755-8
ISBN:	9783030367558

Logical Foundations of Computer Science = International Symposium, LFCS 2020, Deerfield Beach, FL, USA, January 4–7, 2020, Proceedings /
Logical Foundations of Computer ScienceInternational Symposium, LFCS 2020, Deerfield Beach, FL, USA, January 4–7, 2020, Proceedings /[electronic resource] :edited by Sergei Artemov, Anil Nerode. - 1st ed. 2020. - X, 287 p. 418 illus., 3 illus. in color.online resource. - Theoretical Computer Science and General Issues ;11972. - Theoretical Computer Science and General Issues ;9163.

Computability of Algebraic and Definable Closure -- Observable Models -- Countermodel Construction via Optimal Hypersequent Calculi for Non-Normal Modal Logics -- Completeness Theorems for First-Order Logic Analysed in Constructive Type Theory -- On the Constructive Truth and Falsity in Peano Arithmetic -- Belief Expansion in Subset Models -- Finitism, Concrete Programs and Primitive Recursion -- Knowledge of Uncertain Worlds: Programming with Logical Constraints -- A Globally Sound Analytic Calculus for Henkin Quantifiers -- Feedback Hyperjump -- Syntactic Cut-Elimination for Intuitionistic Fuzzy Logic via Linear Nested Sequents -- On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems -- Parameterised Complexity of Abduction in Schaefer's Framework -- Tracking Computability of GPAC-Generable Functions -- Modal Type Theory Based on the Intuitionistic Modal Logic ��! -- Lifting Recursive Counterexamples to Higher-Order Arithmetic -- On the Tender Line Separating Generalizations and Boundary-Case Exceptions for the Second Incompleteness Theorem under Semantic Tableaux Deduction.

This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2020, held in Deerfield Beach, FL, USA, in January 2020. The 17 revised full papers were carefully reviewed and selected from 30 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: 9783030367558

Standard No.: 10.1007/978-3-030-36755-8doiSubjects--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 2020, Deerfield Beach, FL, USA, January 4–7, 2020, Proceedings /
LDR:03954nam a22004215i 4500 001 1019193
003 DE-He213
005 20200701042801.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783030367558 $9 978-3-030-36755-8
024 7 $a 10.1007/978-3-030-36755-8 $2 doi
035 $a 978-3-030-36755-8
050 4 $a QA8.9-10.3
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 511.3 $2 23
245 1 0 $a Logical Foundations of Computer Science $h [electronic resource] : $b International Symposium, LFCS 2020, Deerfield Beach, FL, USA, January 4–7, 2020, Proceedings / $c edited by Sergei Artemov, Anil Nerode.
250 $a 1st ed. 2020.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a X, 287 p. 418 illus., 3 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 ; $v 11972
505 0 $a Computability of Algebraic and Definable Closure -- Observable Models -- Countermodel Construction via Optimal Hypersequent Calculi for Non-Normal Modal Logics -- Completeness Theorems for First-Order Logic Analysed in Constructive Type Theory -- On the Constructive Truth and Falsity in Peano Arithmetic -- Belief Expansion in Subset Models -- Finitism, Concrete Programs and Primitive Recursion -- Knowledge of Uncertain Worlds: Programming with Logical Constraints -- A Globally Sound Analytic Calculus for Henkin Quantifiers -- Feedback Hyperjump -- Syntactic Cut-Elimination for Intuitionistic Fuzzy Logic via Linear Nested Sequents -- On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems -- Parameterised Complexity of Abduction in Schaefer's Framework -- Tracking Computability of GPAC-Generable Functions -- Modal Type Theory Based on the Intuitionistic Modal Logic ��! -- Lifting Recursive Counterexamples to Higher-Order Arithmetic -- On the Tender Line Separating Generalizations and Boundary-Case Exceptions for the Second Incompleteness Theorem under Semantic Tableaux Deduction.
520 $a This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2020, held in Deerfield Beach, FL, USA, in January 2020. The 17 revised full papers were carefully reviewed and selected from 30 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 0 $a Artificial intelligence. $3 559380
650 1 4 $a Mathematical Logic and Foundations. $3 669393
650 2 4 $a Mathematical Logic and Formal Languages. $3 670059
650 2 4 $a Artificial Intelligence. $3 646849
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 9783030367541
776 0 8 $i Printed edition: $z 9783030367565
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-36755-8
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
912 $a ZDB-2-LNC
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)