- Provable Consistency Relative Consistency
- Acknowledgements III ffl J.A. Makowsky and E. Ravve, Dependency Preserv
- [JO95a] B. Jamison and S. Olariu. A lineartime algorithm to recognize p4 reducible graphs. Theoret. Comput. Sci., 145:329--344, 1995.
- [Pap94] C. Papadimitriou. Computational Complexity. Addison Wesley, 1994. [Rav98] E. Ravve. Decomposition of Databases with Translation Schemes. PhD the
- Complexity of the Bollobas-Riordan Polynomial Exceptional Points and Uniform Reductions
- [KMb] G.P. Kogan and J.A. Makowsky. Solving SAT via the permanent. in preparation.
- Haifa Logic Seminar 2000 Lecture 3 ffl Is the Tutte polynomial in VNP k
- ON THE ALGEBRAIC COMPLEXITY OF SOME FAMILIES OF COLOURED TUTTE POLYNOMIALS
- [EFT94] H.D. Ebbinghaus, J. Flum, and W. Thomas. Mathematical Logic, 2nd edition. Undergraduate Texts in Mathematics. SpringerVerlag, 1994.
- tional query languages and dependencies covering all the relevant material with great care. The first five parts of this monograph deal with the relational model
- BRICS'2001 Lecture 1 Logical Methods in
- ALGORITHMIC USES FEFERMANVAUGHT THEOREM
- Computing Graph Polynomials on Graphs of Bounded Clique-Width
- Concepts and their Representations
- [12] T. Przymusinski, On the declarative and procedural semantics of logic programs, Journal of Automated Reasoning 5 (1989), 167--205.
- Colored Tutte Polynomials and Kauffman Brackets for
- NCE Graph Grammars and CliqueWidth Alexander Glikson and Johann A. Makowsky ?
- [ADD + 93] I. Althofer, G. Das, D. Dobkin, D. Joseph, and J. Soares. On sparse spanners of weighted graphs. Discrete Comput. Geom., 9:81--100, 1993.
- [BCS97] P. Burgisser, M. Clausen, and M.A. Shokrollahi. Algebraic Complexity The ory, volume 315 of Grundlehren. Springer Verlag, 1997.
- BRICS'2001 Lecture 5 Knot Theory
- Bordeaux'2000 Lecture 1 Logical Methods in
- Advanced Course for ESSLLI'99 Utrecht, 16-20 August, 1999
- FINITARY SKETCHES J. Ad' amek 1) , P. T. Johnstone, J. M. Makowsky 2) , J. Rosick' y 1) 3)
- Polynomials of bounded treewidth Janos A. Makowsky 1 and Klaus Meer ?2
- Warsaw, May 2001 Tarski Centennial Algorithmic Uses
- Translation Schemes: Main definitions and examples
- [PDGV89] J. Paredaens, P. De Bra, M. Gyssens, and D. Van Gucht, editors. The Structure of the Relational Database Model, volume 17 of EATCS Mono
- On the Fixed Parameter Complexity of Graph Enumeration Problems
- Colored Tutte Polynomials and Kauffman Brackets for
- [Imm87] N. Immerman. Languages that capture complexity classes. SIAM Journal on Computing, 16(4):760--778, Aug 1987.
- LPAR 2007 Eriwan, October 2007 From Hilbert's Program
- From Hilbert's Program Logic Tool Box
- Definability of Combinatorial Functions and Their Linear Recurrence Relations
- Notions of Sameness by Default and their Application to Anaphora, Vagueness, and
- ENCOUNTERS WITH A. MOSTOWSKI J.A. MAKOWSKY
- This article was published in an Elsevier journal. The attached copy is furnished to the author for non-commercial research and
- From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials
- Logic and Combinatorics, Montpezat, June 2005 Title Logical Methods in Combinatorics
- Arcachon, May 2002 J.A. Makowsky BCNF revisited
- Haifa Logic Seminar 2000 Lecture 1 On the Complexity of
- Mathematics as a literary genre J.A. Makowsky
- [KM] G. Kogan and J.A. Makowsky. Computing the permanent over fields of characteristic 3: Where and why it becomes difficult. Technion--Israel
- [29] M. Vardi. The complexity of relational query languages. In STOC'82, pages 137--146. ACM, 1982.
- Bordeaux'2000 Lecture 3 What is so special about MSOL ?
- BRICS'2001 Lecture 4 Graph Polynomials
- 4.2 Algorithm for Ham(A) We now present the algorithm to compute Ham(A) for
- The Fundamental Problem of Database Design Theory,
- Emancipatory Aspects of Learning (and Teaching) Mathematics
- Farrell Polynomials on Graphs of Bounded Tree Width
- [Knu69] D. E. Knuth. The Art of Computer Programming, volume 1. Addison Wesley, 1969.
- BRICS'2001 Lecture 3 Inductive classes of structures
- The SpeckerBlatter Theorem Revisited: Generating Functions for
- Minimum Spanners 24 [28] A.P.Sprague, An O(n log n) algorithm for bandwidth of interval graphs,
- A MOTIVATING EXAMPLE 14 Observations
- Definability ffl Proving definability in steps
- From Parikh's Theorem to Many-Sorted Spectra J.A. Makowsky
- Bombay'07 Spectrum The spectrum problem and Parikh's theorem
- Connection Matrices for MSOL-Definable Structural Invariants
- Zurich, January 2007 Graph polynomials Logical methods in combinatorics
- Bordeaux'2000 Lecture 2 Graph Polynomials and Knot Theory
- Proof of theorem 178 (Contd): Finding an advice sequence
- Proposition 146 (Craig, Beth, MakowskyRosen)
- A Most General Edge Elimination Polynomial Ilia Averbouch
- From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials
- Evaluations of Graph Polynomials B. Godlin, T. Kotek, and J.A. Makowsky
- Translations, Interpretations and
- [EF95] H.D. Ebbinghaus and J. Flum. Finite Model Theory. Perspectives in Mathe matical Logic. Springer, 1995.
- [6] V. Lifschitz, On open defaults, in Computational Logic: Symposium Pro ceedings, J.W. Lloyd Ed., SpringerVerlag, Berlin, 1990, pp. 8095.
- Linear Recurrence Relations for Graph Polynomials
- Paris, February 2010 Holonomic Sequences Application of Logic to Generating Functions
- THE ENUMERATION OF VERTEX INDUCED SUBGRAPHS WITH RESPECT TO THE NUMBER OF COMPONENTS
- PROD. TYPE: COM PP:1-19 (col.fig.: nil)
- [Fag74] R. Fagin. Generalized firstorder spectra and polynomial time recognizable sets. American Math. Society Proc., 7:27--41, 1974.
- Lecture 6: Database Design Prepared with the help of E. Ravve
- Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width
- The Parametrized Complexity of Knot Polynomials
- On the Clique--Width of Graphs with Few J.A. Makowsky \Lambda and U. Rotics
- The SpeckerBlatter Theorem Revisited E. Fischer ? and J.A. Makowsky ??
- Treewidth and the Monadic Quantifier Hierarchy
- Chapters of Mathematics Recall that chapters are equivalence classes
- ON SPECTRA OF SENTENCES OF MONADIC SECOND ORDER LOGIC WITH COUNTING
- POLYNOMIAL INVARIANTS OF GRAPHS TOTALLY CATEGORICAL THEORIES
- [Tha91] B. Thalheim. Dependencies in Relational Databses, volume 126 of Teubner--Texte zur Mathematik. B.G. Teubner Verlagsgesellschaft, Leipzig, 1991.
- Descriptive Complexity ffl Complexity classes of structures
- Polynomials of Bounded Tree Width (Extended Abstract)
- BRICS'2001 Lecture 2 Tools to show nondefinability
- The Complexity of Multivariate Matching Polynomials Ilia Averbouch
- An extension of the bivariate chromatic I. AVE RBOUCH
- Finite Automaten und Turing Maschinen (nach O. Wiener)
- [GG98] E. Gradel and Y. Gurevich. Metafinite model theory. Information and Computation, 140:26--81, 1998. See also: D. Leivant (Ed.), Logic and Computational Complexity,
