LEADER 04283nam 22005895 450 001 9911018661303321 005 20260223140511.0 010 $a3-031-86319-4 024 7 $a10.1007/978-3-031-86319-6 035 $a(MiAaPQ)EBC32256169 035 $a(Au-PeEL)EBL32256169 035 $a(CKB)40138055600041 035 $a(DE-He213)978-3-031-86319-6 035 $a(EXLCZ)9940138055600041 100 $a20250806d2025 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aModel Theory, Computer Science, and Graph Polynomials $eFestschrift in Honor of Johann A. Makowsky /$fedited by Klaus Meer, Alexander Rabinovich, Elena Ravve, Andrés Villaveces 205 $a1st ed. 2025. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Birkhäuser,$d2025. 215 $a1 online resource (944 pages) 225 1 $aTrends in Mathematics,$x2297-024X 311 08$a3-031-86318-6 327 $a- Part I: Personal Notes -- My writing -- Some personal remarks about Johann A. Makowsky -- The Swiss Connection -- From a Friend and Publisher -- From graph polynomials to the software industry Lessons from Janos -- Emancipatory Aspects of Learning and Teaching Mathematics -- Part II: Scientific Contributions -- Epsilon Calculus Provides Shorter Cut-Free Proofs -- Variations on a Theme of Makowsky -- Automatic structures and the problem of natural well-orderings -- On the Counting Complexity of the Cover Polynomial for Simple Graphs -- Polynomial Threshold Functions of Bounded Tree-Width: Some Explainability and Complexity Aspects -- Some Equalities are More Equal than Others -- On the bipartition polynomials for rooted caterpillars -- NP-completeness by first-order and quantifier-free interpretations and related topics -- Bounded languages over infinite alphabets -- Linear Algebraic Quantifiers -- A coarse Tutte polynomial for hypermaps -- Graph polynomials: some questions on the edge -- Pixelating relations and functions without adding substructures -- Reflection and Recurrence -- Provenance Analysis and Semiring Semantics for First-Order Logic -- Reversify any sequential algorithm -- Gentzen in the 3- and 4-valued jungle -- Characterizing Data Dependencies Then and Now -- On Consistency of Graphically Defined Specifications -- The path-bifurcation hierarchy does not collapse to ?1 in infinite abelian groups -- Data with Logical and Statistical constraints -- Relating Information and Knowledge -- Science and Practice of Modelling -- Graph Polynomials and Local Graph Operations. 330 $aThis festschrift honors Johann A. Makowsky on the occasion of his 75th birthday. Gathering 24 research articles authored by scientific companions, friends, and colleagues, it covers a broad variety of areas to which Johann A. Makowsky made significant contributions himself. These include several areas of mathematical logic and its relevance for Computer Science including Graph polynomials, Algorithms for graph invariants, Algorithms and descriptive complexity theory, complexity of real and algebraic computations, Mathematical logic, Model theory, Design and theory of databases, Logic in computer science and AI and Logic programming. The volume is enriched with 4 biographical essays, and two contributions by the celebrant himself. 410 0$aTrends in Mathematics,$x2297-024X 606 $aLogic, Symbolic and mathematical 606 $aMathematical Logic and Foundations 606 $aInformātica$2thub 606 $aTeoria de models$2thub 606 $aLōgica matemātica$2thub 608 $aLlibres electrōnics$2thub 615 0$aLogic, Symbolic and mathematical. 615 14$aMathematical Logic and Foundations. 615 7$aInformātica 615 7$aTeoria de models 615 7$aLōgica matemātica 676 $a511.3 700 $aMeer$b Klaus$01836720 701 $aRabinovich$b Alexander$01836721 701 $aRavve$b Elena$01836722 701 $aVillaveces$b Andre?s$01836723 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9911018661303321 996 $aModel Theory, Computer Science, and Graph Polynomials$94414909 997 $aUNINA