LEADER 05580nam 22006975 450 001 996664554003316 005 20250619125358.0 010 $a3-031-95908-6 024 7 $a10.1007/978-3-031-95908-0 035 $a(MiAaPQ)EBC32163401 035 $a(Au-PeEL)EBL32163401 035 $a(CKB)39395916400041 035 $a(DE-He213)978-3-031-95908-0 035 $a(OCoLC)1525618684 035 $a(EXLCZ)9939395916400041 100 $a20250619d2025 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aCrossroads of Computability and Logic: Insights, Inspirations, and Innovations $e21st Conference on Computability in Europe, CiE 2025, Lisbon, Portugal, July 14?18, 2025, Proceedings /$fedited by Arnold Beckmann, Isabel Oitavem, Florin Manea 205 $a1st ed. 2025. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2025. 215 $a1 online resource (1119 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v15764 311 08$a3-031-95907-8 327 $a -- Invited Papers. -- The CDSAT Method for Satisfiability Modulo Theories and Assignment: an Exposition. -- Effective second countability in computable analysis. -- Towards a Computational Quantum Logic: An Overview of an Ongoing Research Program. -- Represented spaces of represented spaces. -- Computation with Real Numbers and Continuous-Time Dynamical Systems. -- Proof-Carrying Neuro-Symbolic Code. -- Uniform Functional Interpretations. -- Computable Analysis for Extraction of Certified Programs and its Applications. -- Contributed Papers. -- The existence of primitive recursive structures. -- Space-bounded online Kolmogorov complexity is additive. -- On learning existentially definable subsets in a computable structure. -- Transfinite structured programming. -- Computability of Real Functions with Oracle Pointer Machines implies Real-Time simulation of Chemical Reaction Networks. -- Computability of Initial Value Problems. -- Full generalized effective reducibility. -- On S-Degrees of some Representations of Irrational Numbers. -- Circuit metaconstruction in logspace for Rice-like complexity lower bounds in ANs and SGRs. -- Binary Expansions of Regular Reals and Reordered Computable Numbers. -- Properties of Range Sets of Continuous Functions in Reverse Mathematics. -- The theory of reachability of trace-pushdown systems. -- A point to set principle for finite-state dimension and relativized equidistribution porperties. -- Some structural complexity results for $\exists \mathbb R$. -- On the computational power of C-random strings. -- Generalized learnability of stochastic principles. -- Computably discrete represented spaces. -- Multidimensional tilings and MSO logic. -- Injectivity of polynomials over finite discrete dynamical systems. -- Weihrauch problems as containers. -- On the reverse mathematics of cut-elimination and determinacy. -- $L {\omega\omega}$, $L {\omega 1\omega}$, and Wadge hierarchy. -- Ordinal Invariants of the $h$-Preorder on $k$-Labeled Forests. -- Completeness theorems for modal logic in second-order arithmetic. -- Variants of Solovay reducibility. -- Constructive Analysis of Maximal Ideals in Z[X] by the Material Interpretation. -- Alternation-Bounded Semi-Unbounded Fan-in Cascading Circuits and the Complementation Closure Property. 330 $aThis book constitutes the refereed proceedings of the 21st Conference on Computability and Logic, CiE 2025, held in Lisbon, Portugal, during July 14?18, 2025. The 27 full papers included in this book were carefully reviewed and selected from 49 submissions. They focus on computability-related science, ranging over mathematics, computer science and applications in various natural and engineering sciences, such as physics and biology, as well as related fields, such as philosophy and history of computing. CiE 2025 had as its motto Crossroads of Computability and Logic: Insights, Inspirations, and Innovations, drawing on the numerous interconnections between computability research and broader logical methodologies, considering both well-established perspectives as well as recent innovations. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v15764 606 $aComputer science 606 $aLogic, Symbolic and mathematical 606 $aMachine theory 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aTheory of Computation 606 $aMathematical Logic and Foundations 606 $aFormal Languages and Automata Theory 606 $aDesign and Analysis of Algorithms 606 $aMathematics of Computing 615 0$aComputer science. 615 0$aLogic, Symbolic and mathematical. 615 0$aMachine theory. 615 0$aAlgorithms. 615 0$aComputer science$xMathematics. 615 14$aTheory of Computation. 615 24$aMathematical Logic and Foundations. 615 24$aFormal Languages and Automata Theory. 615 24$aDesign and Analysis of Algorithms. 615 24$aMathematics of Computing. 676 $a004.0151 700 $aBeckmann$b Arnold$01752879 701 $aOitavem$b Isabel$01830100 701 $aManea$b Florin$01376495 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996664554003316 996 $aCrossroads of Computability and Logic: Insights, Inspirations, and Innovations$94402551 997 $aUNISA