國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Logical foundations of computer scie...

(1998 :)

Logical foundations of computer scienceInternational Symposium, LFCS 2020, Deerfield Beach, FL, USA, January 4-7, 2020, proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Logical foundations of computer scienceedited by Sergei Artemov, Anil Nerode.
其他題名:	International Symposium, LFCS 2020, Deerfield Beach, FL, USA, January 4-7, 2020, proceedings /
其他作者:	Artemov, Sergei.
團體作者:
出版者:	Cham :Springer International Publishing :2020.
面頁冊數:	x, 287 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Computer science
電子資源:	https://doi.org/10.1007/978-3-030-36755-8
ISBN:	9783030367558$q(electronic bk.)

Logical foundations of computer scienceInternational 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. - Cham :Springer International Publishing :2020. - x, 287 p. :ill., digital ;24 cm. - Theoretical computer science and general issues ;11972. - Theoretical computer science and general issues ;11195..

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 IEL- -- 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$q(electronic bk.)

Standard No.: 10.1007/978-3-030-36755-8doiSubjects--Topical Terms:

252805
Computer science

LC Class. No.: QA75.5 / .L645 2020

Dewey Class. No.: 004

Logical foundations of computer scienceInternational Symposium, LFCS 2020, Deerfield Beach, FL, USA, January 4-7, 2020, proceedings /
LDR:03545nmm a2200349 a 4500 001 575749
003 DE-He213
005 20200520105218.0
006 m d
007 cr nn 008maaau
008 201027s2020 sz s 0 eng d
020 $a 9783030367558$q(electronic bk.)
020 $a 9783030367541$q(paper)
024 7 $a 10.1007/978-3-030-36755-8 $2 doi
035 $a 978-3-030-36755-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA75.5 $b .L645 2020
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 2020
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
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.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a x, 287 p. : $b ill., digital ; $c 24 cm.
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 IEL- -- 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 Computer science $3 252805
650 0 $a Computer logic $v Congresses. $3 443053
650 1 4 $a Mathematical Logic and Foundations. $3 274479
650 2 4 $a Mathematical Logic and Formal Languages. $3 275383
650 2 4 $a Artificial Intelligence. $3 212515
700 1 $a Artemov, Sergei. $3 339404
700 1 $a Nerode, Anil. $3 339405
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Theoretical computer science and general issues ; $v 11195. $3 824674
856 4 0 $u https://doi.org/10.1007/978-3-030-36755-8
950 $a Mathematics and Statistics (Springer-11649)