Crossroads of Computability and Logic: Insights, Inspirations, and Innovations 21st Conference on Computability in Europe, CiE 2025, Lisbon, Portugal, July 14–18, 2025, Proceedings /

This 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 scienc...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Beckmann, Arnold (Editor), Oitavem, Isabel (Editor), Manea, Florin (Editor)
Formato: Electrónico eBook
Lenguaje:inglés
Publicado: Cham : Springer Nature Switzerland : Imprint: Springer, 2025.
Edición:1st ed. 2025.
Colección:Lecture Notes in Computer Science, 15764
Materias:
Acceso en línea:https://doi.org/10.1007/978-3-031-95908-0
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!

MARC

LEADER 00000nam a22000005i 4500
001 978-3-031-95908-0
003 DE-He213
005 20260706120050.0
007 cr nn 008mamaa
008 250619s2025 sz | s |||| 0|eng d
020 |a 9783031959080  |9 978-3-031-95908-0 
024 7 |a 10.1007/978-3-031-95908-0  |2 doi 
050 4 |a QA75.5-76.95 
072 7 |a UYA  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a UYA  |2 thema 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a Crossroads of Computability and Logic: Insights, Inspirations, and Innovations  |h [electronic resource] :  |b 21st Conference on Computability in Europe, CiE 2025, Lisbon, Portugal, July 14–18, 2025, Proceedings /  |c edited by Arnold Beckmann, Isabel Oitavem, Florin Manea. 
250 |a 1st ed. 2025. 
264 1 |a Cham :  |b Springer Nature Switzerland :  |b Imprint: Springer,  |c 2025. 
300 |a XXI, 512 p. 42 illus., 17 illus. in color.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
341 0 |b Table of contents navigation  |2 onix 
341 0 |b Single logical reading order  |2 onix 
341 0 |b Short alternative textual descriptions  |2 onix 
341 0 |b Use of color is not sole means of conveying information  |2 onix 
341 0 |b Use of high contrast between text and background color  |2 onix 
341 0 |b Next / Previous structural navigation  |2 onix 
341 0 |b All non-decorative content supports reading without sight  |2 onix 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 1611-3349 ;  |v 15764 
505 0 |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. 
520 |a This 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. 
532 8 |a Accessibility summary: This PDF does not fully comply with PDF/UA standards, but does feature limited screen reader support, described non-text content (images, graphs), bookmarks for easy navigation and searchable, selectable text. Users of assistive technologies may experience difficulty navigating or interpreting content in this document. We recognize the importance of accessibility, and we welcome queries about accessibility for any of our products. If you have a question or an access need, please get in touch with us at accessibilitysupport@springernature.com. 
532 8 |a No reading system accessibility options actively disabled 
532 8 |a Publisher contact for further accessibility information: accessibilitysupport@springernature.com 
650 0 |a Computer science. 
650 0 |a Mathematical logic. 
650 0 |a Machine theory. 
650 0 |a Algorithms. 
650 0 |a Computer science  |x Mathematics. 
650 1 4 |a Theory of Computation. 
650 2 4 |a Mathematical Logic and Foundations. 
650 2 4 |a Formal Languages and Automata Theory. 
650 2 4 |a Design and Analysis of Algorithms. 
650 2 4 |a Mathematics of Computing. 
700 1 |a Beckmann, Arnold.  |e editor.  |0 (orcid)0000-0001-7958-5790  |1 https://orcid.org/0000-0001-7958-5790  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Oitavem, Isabel.  |e editor.  |0 (orcid)0000-0002-3573-9281  |1 https://orcid.org/0000-0002-3573-9281  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Manea, Florin.  |e editor.  |0 (orcid)0000-0001-6094-3324  |1 https://orcid.org/0000-0001-6094-3324  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783031959073 
776 0 8 |i Printed edition:  |z 9783031959097 
830 0 |a Lecture Notes in Computer Science,  |x 1611-3349 ;  |v 15764 
856 4 0 |u https://doi.org/10.1007/978-3-031-95908-0 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-SXPS 
912 |a ZDB-2-LNC 
912 |a ZDB-2-238 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710) 
950 |a Springer Nature Proceedings Computer Science (SpringerNature-85344) 
950 |a Focus Bundle Foundational Computer Science (SpringerNature-85408)