000 | 04611nam a22005775i 4500 | ||
---|---|---|---|
001 | 978-3-030-36755-8 | ||
003 | DE-He213 | ||
005 | 20240423125027.0 | ||
007 | cr nn 008mamaa | ||
008 | 191213s2020 sz | s |||| 0|eng d | ||
020 |
_a9783030367558 _9978-3-030-36755-8 |
||
024 | 7 |
_a10.1007/978-3-030-36755-8 _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 2020, Deerfield Beach, FL, USA, January 4–7, 2020, Proceedings / _cedited by Sergei Artemov, Anil Nerode. |
250 | _a1st ed. 2020. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2020. |
|
300 |
_aX, 287 p. 418 illus., 3 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 ; _v11972 |
|
505 | 0 | _aComputability 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 | _aThis 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 | _aMathematical logic. | |
650 | 0 | _aMachine theory. | |
650 | 0 | _aArtificial intelligence. | |
650 | 1 | 4 | _aMathematical Logic and Foundations. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
650 | 2 | 4 | _aArtificial Intelligence. |
700 | 1 |
_aArtemov, Sergei. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aNerode, Anil. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783030367541 |
776 | 0 | 8 |
_iPrinted edition: _z9783030367565 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v11972 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-030-36755-8 |
912 | _aZDB-2-SMA | ||
912 | _aZDB-2-SXMS | ||
912 | _aZDB-2-LNC | ||
942 | _cSPRINGER | ||
999 |
_c173396 _d173396 |