Logical Foundations of Computer Science

International Symposium, LFCS 2020, Deerfield Beach, FL, USA, January 4–7, 2020, Proceedings

AvSergei Artemov,Anil Nerode

Häftad, Engelska, 2019

Del i serien Lecture Notes in Computer Science

533 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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. domain theory logics; logical foundations of database theory; intelligent and multiple-agent system logics; distributed system logics; system design logics;

Produktinformation

Utgivningsdatum:2019-12-14
Mått:155 x 235 x 17 mm
Vikt:458 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:287
Förlag:Springer Nature Switzerland AG
ISBN:9783030367541

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Matematikens grunder inom Naturvetenskap och teknik
Artificiell intelligens inom Data och IT

Innehållsförteckning

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.