東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Model theory, computer science, and ...

Meer, Klaus.

Linked to FindBook

Google Book

Amazon

博客來

Model theory, computer science, and graph polynomials = festschrift in honor of Johann A. Makowsky /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Model theory, computer science, and graph polynomials/ edited by Klaus Meer ... [et al.].
Reminder of title:	festschrift in honor of Johann A. Makowsky /
other author:	Meer, Klaus.
Published:	Cham :Springer Nature Switzerland : : 2025.,
Description:	xv, 577 p. :ill., digital ;24 cm.
[NT 15003449]:	- 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.
Contained By:	Springer Nature eBook
Subject:	Model theory. -
Online resource:	https://doi.org/10.1007/978-3-031-86319-6
ISBN:	9783031863196

Model theory, computer science, and graph polynomials = festschrift in honor of Johann A. Makowsky /
Model theory, computer science, and graph polynomialsfestschrift in honor of Johann A. Makowsky /[electronic resource] :edited by Klaus Meer ... [et al.]. - Cham :Springer Nature Switzerland :2025. - xv, 577 p. :ill., digital ;24 cm. - Trends in mathematics,2297-024X. - Trends in mathematics..

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

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

ISBN: 9783031863196

Standard No.: 10.1007/978-3-031-86319-6doiSubjects--Topical Terms:

560899
Model theory.

LC Class. No.: QA9.7

Dewey Class. No.: 511.34

Model theory, computer science, and graph polynomials = festschrift in honor of Johann A. Makowsky /
LDR:03484nmm a2200361 a 4500 001 2414351
003 DE-He213
005 20250806171910.0
006 m d
007 cr nn 008maaau
008 260205s2025 sz s 0 eng d
020 $a 9783031863196 $q (electronic bk.)
020 $a 9783031863189 $q (paper)
024 7 $a 10.1007/978-3-031-86319-6 $2 doi
035 $a 978-3-031-86319-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA9.7
072 7 $a PBCD $2 bicssc
072 7 $a PBC $2 bicssc
072 7 $a MAT018000 $2 bisacsh
072 7 $a PBCD $2 thema
072 7 $a PBC $2 thema
082 0 4 $a 511.34 $2 23
090 $a QA9.7 $b .M689 2025
245 0 0 $a Model theory, computer science, and graph polynomials $h [electronic resource] : $b festschrift in honor of Johann A. Makowsky / $c edited by Klaus Meer ... [et al.].
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Birkhäuser, $c 2025.
300 $a xv, 577 p. : $b ill., digital ; $c 24 cm.
490 1 $a Trends in mathematics, $x 2297-024X
505 0 $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.
520 $a 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 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.
650 0 $a Model theory. $3 560899
650 0 $a Polynomials. $3 604754
650 0 $a Computer science $x Mathematics. $3 532725
650 1 4 $a Mathematical Logic and Foundations. $3 892656
700 1 $a Meer, Klaus. $3 752381
700 1 $a Makowsky, Johann A. $3 3791002
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Trends in mathematics. $3 1620392
856 4 0 $u https://doi.org/10.1007/978-3-031-86319-6
950 $a Mathematics and Statistics (SpringerNature-11649)