Delwedd Flaen

Model Theory, Computer Science, and Graph Polynomials Festschrift in Honor of Johann A. Makowsky /

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

Disgrifiad llawn

Wedi'i Gadw mewn:
Manylion Llyfryddiaeth
Awdur Corfforaethol: SpringerLink (Online service)
Awduron Eraill: Meer, Klaus (Golygydd), Rabinovich, Alexander (Golygydd), Ravve, Elena (Golygydd), Villaveces, Andrés (Golygydd)
Fformat: Electronig eLyfr
Iaith:Saesneg
Cyhoeddwyd: Cham : Springer Nature Switzerland : Imprint: Birkhäuser, 2025.
Rhifyn:1st ed. 2025.
Cyfres:Trends in Mathematics,
Pynciau:
Mathematical logic.
Mathematical Logic and Foundations.
Mynediad Ar-lein:https://doi.org/10.1007/978-3-031-86319-6
Tagiau: Ychwanegu Tag
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
Tabl Cynhwysion:
  • - 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.

Eitemau Tebyg