| Publication | Date of Publication | Type |
|---|
| My writing | 2026-04-29 | Paper |
| Emancipatory aspects of learning and teaching mathematics | 2026-04-29 | Paper |
| Extensions and limits of the Specker-Blatter theorem | 2026-02-19 | Paper |
| Meta-theorems for graph polynomials | 2026-02-10 | Paper |
| The Specker-Blatter theorem: an application of logic to combinatorial counting | 2025-12-04 | Paper |
Counting finite topologies
Enumerative Combinatorics and Applications | 2025-02-01 | Paper |
Extensions and limits of the Specker-Blatter theorem
Journal of Symbolic Logic | 2024-11-25 | Paper |
| Axiomatizing origami planes | 2024-10-01 | Paper |
How I got to like graph polynomials
Model Theory | 2024-08-27 | Paper |
Logics capturing relativized complexity classes uniformly
Lecture Notes in Computer Science | 2023-12-12 | Paper |
| How I got to like graph polynomials | 2023-09-06 | Paper |
MC-finiteness of restricted set partition functions
(available as arXiv preprint) | 2023-08-28 | Paper |
| MC-finiteness of restricted set partition functions | 2023-08-28 | Paper |
The exact complexity of the Tutte polynomial
Handbook of the Tutte Polynomial and Related Topics | 2023-04-28 | Paper |
Harary polynomials
Enumerative Combinatorics and Applications | 2022-12-07 | Paper |
Almost unimodal and real-rooted graph polynomials
European Journal of Combinatorics | 2022-12-01 | Paper |
To Yuri at 80 and More than 40 Years of Friendship
Fields of Logic and Computation III | 2022-11-09 | Paper |
On the Tutte and Matching Polynomials for Complete Graphs
Fundamenta Informaticae | 2022-10-07 | Paper |
Capturing complexity classes with Lindström quantifiers
Mathematical Foundations of Computer Science 1994 | 2022-08-18 | Paper |
| Extensions and Limits of the Specker-Blatter Theorem | 2022-06-24 | Paper |
| Some thoughts on computational models: from massive human computing to abstract state machines, and beyond | 2022-03-22 | Paper |
On the Tutte and matching polynomials for complete graphs
(available as arXiv preprint) | 2021-12-13 | Paper |
| Weighted automata and monadic second order logic | 2021-06-09 | Paper |
Weighted automata and monadic second order logic
(available as arXiv preprint) | 2021-06-09 | Paper |
Almost Unimodal and Real-Rooted Graph Polynomials
(available as arXiv preprint) | 2021-01-30 | Paper |
| Axiomatizing Origami planes | 2020-12-06 | Paper |
Weakly distinguishing graph polynomials on addable properties
Moscow Journal of Combinatorics and Number Theory | 2020-11-10 | Paper |
Extensions for open default theories via the domain closure assumption
Logics in Artificial Intelligence | 2019-10-08 | Paper |
A logician's view of graph polynomials
Annals of Pure and Applied Logic | 2019-09-18 | Paper |
On weakly distinguishing graph polynomials
(available as arXiv preprint) | 2019-05-23 | Paper |
| On weakly distinguishing graph polynomials | 2019-05-23 | Paper |
Can one design a geometry engine? Can one design a geometry engine? On the (un)decidability of certain affine Euclidean geometries
Annals of Mathematics and Artificial Intelligence | 2019-05-16 | Paper |
| The undecidability of orthogonal and origami geometries | 2018-10-18 | Paper |
| Finiteness conditions for graph algebras over tropical semirings | 2018-08-29 | Paper |
Finiteness conditions for graph algebras over tropical semirings
(available as arXiv preprint) | 2018-08-29 | Paper |
On the exact learnability of graph parameters: the case of partition functions
(available as arXiv preprint) | 2018-03-21 | Paper |
Keeping logic in the trivium of computer science: a teaching perspective
Formal Methods in System Design | 2018-02-14 | Paper |
On the complexity of generalized chromatic polynomials
Advances in Applied Mathematics | 2018-01-11 | Paper |
On the complexity of generalized chromatic polynomials
Advances in Applied Mathematics | 2018-01-11 | Paper |
On sequences of polynomials arising from graph invariants
European Journal of Combinatorics | 2017-10-10 | Paper |
A computational framework for the study of partition functions and graph polynomials
Proceedings of the 12th Asian Logic Conference | 2017-05-31 | Paper |
Semantic equivalence of graph polynomials definable in second order logic
Logic, Language, Information, and Computation | 2016-09-09 | Paper |
Hankel matrices for weighted visibly pushdown automata
Language and Automata Theory and Applications | 2016-04-13 | Paper |
Hankel Matrices: From Words to Graphs (Extended Abstract)
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Efficient computation of generalized Ising polynomials on graphs with fixed clique-width
Topics in Theoretical Computer Science | 2016-04-01 | Paper |
Logics of finite Hankel rank
Fields of Logic and Computation II | 2015-09-22 | Paper |
Generalizing Parikh's theorem
Games, Norms and Reasons | 2015-07-03 | Paper |
On the clique-width of graph with few \(P_{4}\)'s
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
Connection matrices and the definability of graph parameters
Logical Methods in Computer Science | 2014-11-13 | Paper |
On the location of roots of graph polynomials
European Journal of Combinatorics | 2014-09-02 | Paper |
Recurrence relations for graph polynomials on bi-iterative families of graphs
European Journal of Combinatorics | 2014-09-02 | Paper |
A representation theorem for (q-)holonomic sequences
Journal of Computer and System Sciences | 2013-12-13 | Paper |
| The universal edge elimination polynomial and the dichromatic polynomial | 2013-11-01 | Paper |
Fifty years of the spectrum problem: survey and new results
The Bulletin of Symbolic Logic | 2013-01-17 | Paper |
Fifty years of the spectrum problem: survey and new results
The Bulletin of Symbolic Logic | 2013-01-17 | Paper |
| Connection matrices and the definability of graph parameters | 2012-11-22 | Paper |
| Definability and Complexity of Graph Parameters (Invited Talk). | 2012-11-22 | Paper |
Remembering Ernst Specker (1920--2011)
Elemente der Mathematik | 2012-09-21 | Paper |
| Model theory in computer science: my own recurrent themes | 2012-09-18 | Paper |
A representation theorem for holonomic sequences based on counting lattice paths
Fundamenta Informaticae | 2012-07-11 | Paper |
Graph polynomials: from recursive definitions to subset expansion formulas
Journal of Logic and Computation | 2012-05-07 | Paper |
BCNF via attribute splitting
Conceptual Modelling and Its Theoretical Foundations | 2012-03-09 | Paper |
| On counting generalized colorings | 2012-03-02 | Paper |
| Application of logic to combinatorial sequences and their recurrence relations | 2012-03-02 | Paper |
| Indistinguishability by default | 2011-06-21 | Paper |
The Specker-Blatter theorem revisited
Lecture Notes in Computer Science | 2011-03-18 | Paper |
Application of logic to integer sequences: a survey
Logic, Language, Information and Computation | 2010-09-29 | Paper |
Definability of combinatorial functions and their linear recurrence relations
Fields of Logic and Computation | 2010-09-03 | Paper |
The Ackermann Award 2010
Computer Science Logic | 2010-09-03 | Paper |
Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions
Theory of Computing Systems | 2010-08-13 | Paper |
Incremental model checking for decomposable structures
Lecture Notes in Computer Science | 2010-06-17 | Paper |
A graph polynomial arising from community structure (extended abstract)
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
NCE graph grammars and clique-width.
Lecture Notes in Computer Science | 2010-01-12 | Paper |
An extension of the bivariate chromatic polynomial
European Journal of Combinatorics | 2009-12-01 | Paper |
The Ackermann Award 2009
Computer Science Logic | 2009-11-12 | Paper |
From Hilbert's program to a logic tool box
Annals of Mathematics and Artificial Intelligence | 2009-07-06 | Paper |
Notions of sameness by default and their application to anaphora, vagueness, and uncertain reasoning
Journal of Logic, Language and Information | 2009-06-17 | Paper |
From a zoo to a zoology: Towards a general theory of graph polynomials
Theory of Computing Systems | 2009-05-08 | Paper |
The Ackermann Award 2007
Computer Science Logic | 2009-03-05 | Paper |
Connection Matrices for MSOL-Definable Structural Invariants
Logic and Its Applications | 2009-02-12 | Paper |
Evaluations of Graph Polynomials
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
A Most General Edge Elimination Polynomial
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
On Counting Generalized Colorings
Computer Science Logic | 2008-11-20 | Paper |
Computing Graph Polynomials on Graphs of Bounded Clique-Width
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
| Encounters with A. Mostowski | 2008-07-01 | Paper |
Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants
Logic and Theory of Algorithms | 2008-06-19 | Paper |
Complexity of the Bollobás-Riordan Polynomial
Computer Science – Theory and Applications | 2008-06-05 | Paper |
Linear Recurrence Relations for Graph Polynomials
Pillars of Computer Science | 2008-03-25 | Paper |
Counting truth assignments of formulas of bounded tree-width or clique-width
Discrete Applied Mathematics | 2008-02-26 | Paper |
Logical Approaches to Computational Barriers
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2006-11-01 | Paper |
On spectra of sentences of monadic second order logic with counting
Journal of Symbolic Logic | 2005-08-29 | Paper |
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
Discrete Applied Mathematics | 2005-02-22 | Paper |
The parametrized complexity of knot polynomials
Journal of Computer and System Sciences | 2004-08-19 | Paper |
Algorithmic uses of the Feferman-Vaught theorem
Annals of Pure and Applied Logic | 2004-08-06 | Paper |
On the algebraic complexity of some families of coloured Tutte polynomials
Advances in Applied Mathematics | 2004-06-15 | Paper |
| scientific article; zbMATH DE number 1859215 (Why is no real title available?) | 2003-09-11 | Paper |
Tree-width and the monadic quantifier hierarchy.
Theoretical Computer Science | 2003-08-17 | Paper |
Farrell polynomials on graphs of bounded tree width
Advances in Applied Mathematics | 2003-07-29 | Paper |
Linear time solvable optimization problems on graphs of bounded clique-width
Theory of Computing Systems | 2003-03-18 | Paper |
Fusion in relational structures and the verification of monadic second-order properties
Mathematical Structures in Computer Science | 2002-10-16 | Paper |
| Colored Tutte polynomials and Kauffman brackets for graphs of bounded tree width | 2002-06-30 | Paper |
| scientific article; zbMATH DE number 1678371 (Why is no real title available?) | 2001-12-04 | Paper |
| scientific article; zbMATH DE number 1670492 (Why is no real title available?) | 2001-12-03 | Paper |
| scientific article; zbMATH DE number 1504634 (Why is no real title available?) | 2001-11-09 | Paper |
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
Discrete Applied Mathematics | 2001-11-09 | Paper |
| Capturing relativized complexity classes with Lindström quantifiers | 2001-09-03 | Paper |
| scientific article; zbMATH DE number 1555186 (Why is no real title available?) | 2001-01-22 | Paper |
| scientific article; zbMATH DE number 1499101 (Why is no real title available?) | 2000-09-03 | Paper |
| scientific article; zbMATH DE number 1342210 (Why is no real title available?) | 2000-04-25 | Paper |
| scientific article; zbMATH DE number 1262783 (Why is no real title available?) | 1999-12-13 | Paper |
Extensions for open default theories via the domain closure assumption
Journal Of Logic And Computation | 1998-11-19 | Paper |
| scientific article; zbMATH DE number 1163938 (Why is no real title available?) | 1998-08-04 | Paper |
Dependency preserving refinements and the fundamental problem of database design
Data & Knowledge Engineering | 1998-06-30 | Paper |
Finitary sketches
Journal of Symbolic Logic | 1998-04-05 | Paper |
Restrictions of minimum spanner problems
Information and Computation | 1997-12-14 | Paper |
| scientific article; zbMATH DE number 1088200 (Why is no real title available?) | 1997-11-17 | Paper |
| scientific article; zbMATH DE number 733393 (Why is no real title available?) | 1997-01-13 | Paper |
Arity and alternation in second-order logic
Annals of Pure and Applied Logic | 1996-10-30 | Paper |
On Average Case Complexity of SAT for Symmetric Distribution
Journal Of Logic And Computation | 1996-06-25 | Paper |
| scientific article; zbMATH DE number 408785 (Why is no real title available?) | 1993-09-06 | Paper |
Query languages for hierarchic databases
Information and Computation | 1993-01-17 | Paper |
The expressive power of side effects in prolog
The Journal of Logic Programming | 1992-08-13 | Paper |
Weak second order characterizations of various program verification systems
Theoretical Computer Science | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4108154 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4080897 (Why is no real title available?) | 1988-01-01 | Paper |
On the existence of polynomial time algorithms for interpolation problems in propositional logic
Notre Dame Journal of Formal Logic | 1988-01-01 | Paper |
Unification as a complexity measure for logic programming
The Journal of Logic Programming | 1987-01-01 | Paper |
Why Horn formulas matter in computer science: initial structures and generic examples
Journal of Computer and System Sciences | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3942990 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3976395 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4049167 (Why is no real title available?) | 1986-01-01 | Paper |
On the expressive power of data dependencies
Acta Informatica | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3898209 (Why is no real title available?) | 1985-01-01 | Paper |
Propositional dynamic logic with local assignments
Theoretical Computer Science | 1985-01-01 | Paper |
Vopěnka's principle and compact logics
Journal of Symbolic Logic | 1985-01-01 | Paper |
A proof rule for fair termination of guarded commands
Information and Control | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3881877 (Why is no real title available?) | 1984-01-01 | Paper |
Characterizing specification languages which admit initial semantics
Theoretical Computer Science | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3827186 (Why is no real title available?) | 1983-01-01 | Paper |
Positive results in abstract model theory: a theory of compact logics
Annals of Pure and Applied Logic | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3776840 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3815000 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3729440 (Why is no real title available?) | 1981-01-01 | Paper |
The theorems of beth and Craig in abstract model theory II. Compact logics
Archiv für Mathematische Logik und Grundlagenforschung | 1981-01-01 | Paper |
Topological model theory with an interior operator: Consistency properties and back — and forth arguments
Archiv für Mathematische Logik und Grundlagenforschung | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3729439 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3623539 (Why is no real title available?) | 1979-01-01 | Paper |
Theorems of Beth and Craig in Abstract Model Theory. I The Abstract Settin
Transactions of the American Mathematical Society | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3735785 (Why is no real title available?) | 1978-01-01 | Paper |
Some observations on Uniform Reduction for properties invariant on the range of definable relations
Fundamenta Mathematicae | 1978-01-01 | Paper |
Problemi di decidibilita in logica topologica
Rendiconti del Seminario Matematico della Università di Padova | 1978-01-01 | Paper |
Problemi di decidibilita in logica topologica
Rendiconti del Seminario Matematico della Università di Padova | 1978-01-01 | Paper |
Some model theory for monotone quantifiers
Archiv für Mathematische Logik und Grundlagenforschung | 1977-01-01 | Paper |
Completeness Theorems For Modal Model Theory With the Montague‐Chang Semantics I
Mathematical Logic Quarterly | 1977-01-01 | Paper |
δ-Logics and generalized quantifiers
Annals of Mathematical Logic | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3485741 (Why is no real title available?) | 1975-01-01 | Paper |
On some conjectures connected with complete sentences
Fundamenta Mathematicae | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3428889 (Why is no real title available?) | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3420735 (Why is no real title available?) | 1972-01-01 | Paper |
Counting Finite Topologies
(available as arXiv preprint) | N/A | Paper |
Meta-theorems for Graph Polynomials
(available as arXiv preprint) | N/A | Paper |
