Logical Foundations of Computer Science, 1st ed. 2020 International Symposium, LFCS 2020, Deerfield Beach, FL, USA, January 4-7, 2020, Proceedings Theoretical Computer Science and General Issues Series
Coordonnateurs : Artemov Sergei, Nerode Anil
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.
Date de parution : 12-2019
Ouvrage de 287 p.
15.5x23.5 cm
Disponible chez l'éditeur (délai d'approvisionnement : 15 jours).
Prix indicatif 52,74 €
Ajouter au panierThème de Logical Foundations of Computer Science :
Mots-clés :
artificial intelligence; complexity; computability; computer science; constructive type theory; first-order logic; formal logic; GPAC-generable functions; highre-order arithmetics; knowledge of uncertain worlds; modal logic; non-normal modal logics; observable models; primitive recursion; problem solving; semanitic systems; theorem proving