Some model theory for monotone quantifiers. - Johann A. Makowsky; Sauro Tulipani (Arch. Math. Log., 1977)

Completeness Theorems For Modal Model Theory With the Montague-Chang Semantics I. - Johann A. Makowsky; Annalisa Marcja (Math. Log. Q., 1977)

Measuring the Expressive Power of Dynamic Logics: An Application of Abstract Model Theory. - Johann A. Makowsky (ICALP, 1980)

Characterizing Data Base Dependencies. - Johann A. Makowsky (ICALP, 1981)

Errata: Measuring the Expressive Power of Dynamic Logics: An Application of Abstract Model Theory. - Johann A. Makowsky (ICALP, 1981)

Embedded Implicational Dependencies and their Inference Problem - Ashok K. Chandra; Harry R. Lewis; Johann A. Makowsky (STOC, 1981)

Topological model theory with an interior operator: Consistency properties and back - and forth arguments. - Johann A. Makowsky; Martin Ziegler 002 (Arch. Math. Log., 1981)

The theorems of beth and Craig in abstract model theory II. Compact logics. - Johann A. Makowsky; Johann Shelah (Arch. Math. Log., 1981)

An axiomatic approach to semantics of specification languages. - Johann A. Makowsky; Bernd Mahr (Theoretical Computer Science, 1983)

Positive results in abstract model theory: a theory of compact logics. - Johann A. Makowsky; Saharon Shelah (Ann. Pure Appl. Log., 1983)

Characterizing Specification Languages which Admit Initial Semantics. - Bernd Mahr; Johann A. Makowsky (Theor. Comput. Sci., 1984)

Why Horn Formulas Matter in Computer Science: Initial Structures and Generic Examples (Extended Abstract). - Johann A. Makowsky (TAPSOFT, Vol.1, 1985)

A Proof Rule for Fair Termination of Guarded Commands - Orna Grumberg; Nissim Francez; Johann A. Makowsky; Willem P. de Roever (Inf. Control., 1985)

Vopenka's Principle and Compact Logics. - Johann A. Makowsky (J. Symb. Log., 1985)

Propositional Dynamic Logic with Local Assignments. - Michael L. Tiomkin; Johann A. Makowsky (Theor. Comput. Sci., 1985)

Computable Directory Queries. - Elias Dahlhaus; Johann A. Makowsky (CAAP, 1986)

The Choice of Programming Primitives for SETL-Like Programming Languages. - Elias Dahlhaus; Johann A. Makowsky (ESOP, 1986)

Entity-Relationship Consistency for Relational Schemas. - Johann A. Makowsky; Victor M. Markowitz; Nimrod Rotics (ICDT, 1986)

Musician - A Music Processing and Synthesis System. - A. Ban; Johann A. Makowsky (ICMC, 1986)

On the Equivalence of Weak Second Order and Nonstandard Time Semantics For Various Program Verification Systems - Johann A. Makowsky; Ildikó Sain (LICS, 1986)

On the Expressive Power of Data Dependencies. - Johann A. Makowsky; Moshe Y. Vardi (Acta Informatica, 1986)

Incremental Reorganization of Relational Databases. - Victor M. Markowitz; Johann A. Makowsky (VLDB, 1987)

Why Horn Formulas Matter in Computer Science: Initial Structures and Generic Examples. - Johann A. Makowsky (J. Comput. Syst. Sci., 1987)

Unification as a Complexity Measure for Logic Programming. - Alon Itai; Johann A. Makowsky (J. Log. Program., 1987)

Incremental Restructuring of Relational Schemas. - Victor M. Markowitz; Johann A. Makowsky (ICDE, 1988)

On the existence of polynomial time algorithms for interpolation problems in propositional logic. - Elias Dahlhaus; Amos Israeli; Johann A. Makowsky (Notre Dame J. Formal Log., 1988)

Weak Second Order Characterizations of Various Program Verification Systems. - Johann A. Makowsky; Ildikó Sain (Theor. Comput. Sci., 1989)

Identifying Extended Entity-Relationship Object Structures in Relational Schemas. - Victor M. Markowitz; Johann A. Makowsky (IEEE Trans. Software Eng., 1990)

The Expressive Power of Transitive Closue and 2-way Multihead Automata. - Yaniv Bargury; Johann A. Makowsky (CSL, 1991)

Decidability of Finite Probablistic Propositional Dynamic Logics - Michael L. Tiomkin; Johann A. Makowsky (Inf. Comput., 1991)

The Ehrenfeucht-Fraisse Games for Transitive Closure. - A. Calò; Johann A. Makowsky (LFCS, 1992)

Formal Interactive Menu Design. - Jacob P. Ukelson; Johann A. Makowsky (Interact. Comput., 1992)

The Expressive Power of Side Effects in Prolog. - Johann A. Makowsky; J.-C. Gregoire; Shmuel Sagiv (J. Log. Program., 1992)

Query Languages for Hierarchic Databases - Elias Dahlhaus; Johann A. Makowsky (Inf. Comput., 1992)

Oracles and Quantifiers. - Johann A. Makowsky; Y. B. Pnueli (CSL, 1993)

Book Review: Predicate Transformer Semantics. By Ernest G. Manes. (Cambridge University Press, 1992, 233pp. ISBN 0-521-42036-9. $39.95). - Johann A. Makowsky (SIGACT News, 1993)

Logics Capturing Relativized Complexity Classes Uniformly. - Johann A. Makowsky; Y. B. Pnueli (LCC, 1994)

Arity vs. Alternation in Second Order Logic. - Johann A. Makowsky; Y. B. Pnueli (LFCS, 1994)

Capturing Complexity Classes with Lindström Quantifiers. - Johann A. Makowsky (MFCS, 1994)

Incremental Model Checking for Decomposable Structures (Extended Abstract). - Johann A. Makowsky; Elena V. Ravve (MFCS, 1995)

On Average Case Complexity of SAT for Symmetric Distribution. - Johann A. Makowsky; Abraham Sharell (J. Log. Comput., 1995)

Translation Schemes and the Fundamental Problem of Database Design. - Johann A. Makowsky; Elena V. Ravve (ER, 1996)

Arity and Alternation in Second-Order Logic. - Johann A. Makowsky; Y. B. Pnueli (Ann. Pure Appl. Log., 1996)

Invariant Definability (Extended Abstract). - Johann A. Makowsky (Kurt Gödel Colloquium, 1997)

The Fundamental Problem of Database Design. - Johann A. Makowsky; Elena V. Ravve (SOFSEM, 1997)

Restrictions of Minimum Spanner Problems. - G. Venkatesan; Udi Rotics; M. S. Madanlal; Johann A. Makowsky; C. Pandu Rangan (Inf. Comput., 1997)

Finitary Sketches. - Jirí Adámek; Peter T. Johnstone; Johann A. Makowsky; Jirí Rosický (J. Symb. Log., 1997)

Invariant Definability and P/poly. - Johann A. Makowsky (CSL, 1998)

Erratum to "Arity and Alternation in Second-Order Logic". - Johann A. Makowsky; Y. B. Pnueli (Ann. Pure Appl. Log., 1998)

Dependency Preserving Refinements and the Fundamental Problem of Database Design. - Johann A. Makowsky; Elena V. Ravve (Data Knowl. Eng., 1998)

Extensions for Open Default Theories via the Domain Closure Assumption. - Michael Kaminski; Johann A. Makowsky; Michael L. Tiomkin (J. Log. Comput., 1998)

On the Clique-Width of Graphs with Few P4's. - Johann A. Makowsky; Udi Rotics (Int. J. Found. Comput. Sci., 1999)

On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale. - Johann A. Makowsky; Klaus Meer (CSL, 2000)

Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width. - Bruno Courcelle; Johann A. Makowsky; Udi Rotics (Theory Comput. Syst., 2000)

Colored Tutte polynomials and Kaufman brackets for graphs of bounded tree width. - Johann A. Makowsky (SODA, 2001)

On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. - Bruno Courcelle; Johann A. Makowsky; Udi Rotics (Discret. Appl. Math., 2001)

Fusion in Relational Structures and the Verification of Monadic Second-Order Properties. - Bruno Courcelle; Johann A. Makowsky (Math. Struct. Comput. Sci., 2002)

The Specker-Blatter Theorem Revisited. - Eldar Fischer; Johann A. Makowsky (COCOON, 2003)

NCE Graph Grammars and Clique-Width. - Alexander Glikson; Johann A. Makowsky (WG, 2003)

Farrell polynomials on graphs of bounded tree width. - Johann A. Makowsky; Julian Mariño (Adv. Appl. Math., 2003)

The parametrized complexity of knot polynomials. - Johann A. Makowsky; Julian Mariño (J. Comput. Syst. Sci., 2003)

Tree-width and the monadic quantifier hierarchy. - Johann A. Makowsky; Julian Mariño (Theor. Comput. Sci., 2003)

On the algebraic complexity of some families of coloured Tutte polynomials. - Martin Lotz; Johann A. Makowsky (Adv. Appl. Math., 2004)

Algorithmic uses of the Feferman-Vaught Theorem. - Johann A. Makowsky (Ann. Pure Appl. Log., 2004)

On spectra of sentences of monadic second order logic with counting. - Eldar Fischer; Johann A. Makowsky (J. Symb. Log., 2004)

Indistinguishability by Default. - Ariel Cohen 004; Michael Kaminski; Johann A. Makowsky (We Will Show Them! (1), 2005)

The Ackermann Award 2005. - Erich Grädel; Janos Makowsky; Alexander A. Razborov (CSL, 2005)

Clemens Lautemann: 1951-2005 An Obituary. - Johann A. Makowsky (CSL, 2005)

Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width. - Johann A. Makowsky (Discret. Appl. Math., 2005)

From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials. - Johann A. Makowsky (CiE, 2006)

The Ackermann Award 2006. - Samson Abramsky; Erich Grädel; Johann A. Makowsky (CSL, 2006)

Computing Graph Polynomials on Graphs of Bounded Clique-Width. - Johann A. Makowsky; Udi Rotics; Ilya Averbouch; Benny Godlin (WG, 2006)

The Ackermann Award 2007. - Martin Grohe; Martin Hyland; Johann A. Makowsky; Damian Niwinski (CSL, 2007)

From Hilbert's Program to a Logic Toolbox. - Johann A. Makowsky (LPAR, 2007)

Linear Recurrence Relations for Graph Polynomials. - Eldar Fischer; Johann A. Makowsky (Pillars of Computer Science, 2008)

Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants. - Johann A. Makowsky (CiE, 2008)

The Ackermann Award 2008. - Johann A. Makowsky; Damian Niwinski (CSL, 2008)

Complexity of the Bollobás-Riordan Polynomial. - Markus Bläser; Holger Dell; Johann A. Makowsky (CSR, 2008)

A Most General Edge Elimination Polynomial. - Ilya Averbouch; Benny Godlin; Johann A. Makowsky (WG, 2008)

Evaluations of Graph Polynomials. - Benny Godlin; Tomer Kotek; Johann A. Makowsky (WG, 2008)

From Hilbert's program to a logic tool box. - Johann A. Makowsky (Ann. Math. Artif. Intell., 2008)

Counting truth assignments of formulas of bounded tree-width or clique-width. - Eldar Fischer; Johann A. Makowsky; Elena V. Ravve (Discret. Appl. Math., 2008)

Notions of Sameness by Default and their Application to Anaphora, Vagueness, and Uncertain Reasoning. - Ariel Cohen 004; Michael Kaminski; Johann A. Makowsky (J. Log. Lang. Inf., 2008)

From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials. - Johann A. Makowsky (Theory Comput. Syst., 2008)

Application of logic to combinatorial sequences and their recurrence relations. - Eldar Fischer; Tomer Kotek; Johann A. Makowsky (AMS-ASL Joint Special Session, 2009)

On Counting Generalized Colorings. - Tomer Kotek; Johann A. Makowsky; Boris Zilber (AMS-ASL Joint Special Session, 2009)

The Ackermann Award 2009. - Johann A. Makowsky; Alexander A. Razborov (CSL, 2009)

Connection Matrices for MSOL-Definable Structural Invariants. - Johann A. Makowsky (ICLA, 2009)

A Graph Polynomial Arising from Community Structure (Extended Abstract). - Ilya Averbouch; Johann A. Makowsky; Peter Tittmann 001 (WG, 2009)

Definability of Combinatorial Functions and Their Linear Recurrence Relations. - Tomer Kotek; Johann A. Makowsky (Fields of Logic and Computation, 2010)

The Ackermann Award 2010. - Johann A. Makowsky; Damian Niwinski (CSL, 2010)

Application of Logic to Integer Sequences: A Survey. - Johann A. Makowsky (WoLLIC, 2010)

An extension of the bivariate chromatic polynomial. - Ilya Averbouch; Benny Godlin; Johann A. Makowsky (Eur. J. Comb., 2010)

Complexity of the Bollobás-Riordan Polynomial. Exceptional Points and Uniform Reductions. - Markus Bläser; Holger Dell; Johann A. Makowsky (Theory Comput. Syst., 2010)

Model Theory in Computer Science: My Own Recurrent Themes. - Johann A. Makowsky (CSL, 2011)

The enumeration of vertex induced subgraphs with respect to the number of components. - Peter Tittmann 001; Ilya Averbouch; Johann A. Makowsky (Eur. J. Comb., 2011)

The Universal Edge Elimination Polynomial and the Dichromatic Polynomial. - Ilya Averbouch; Tomer Kotek; Johann A. Makowsky; Elena V. Ravve (Electron. Notes Discret. Math., 2011)

BCNF via Attribute Splitting. - Johann A. Makowsky; Elena V. Ravve (Conceptual Modelling and Its Theoretical Foundations, 2012)

Definability and Complexity of Graph Parameters (Invited Talk). - Johann A. Makowsky (CSL, 2012)

A Computational Framework for the Study of Partition Functions and Graph Polynomials. - Tomer Kotek; Johann A. Makowsky; Elena V. Ravve (SYNASC, 2012)

Fifty years of the spectrum problem: survey and new results. - Arnaud Durand 001; Neil D. Jones; Johann A. Makowsky; Malika More (Bull. Symb. Log., 2012)

A Representation Theorem for Holonomic Sequences Based on Counting Lattice Paths. - Tomer Kotek; Johann A. Makowsky (Fundam. Informaticae, 2012)

Foreword. - Sri Gopal Mohanty; Simone Rinaldi; Johann A. Makowsky (Fundam. Informaticae, 2012)

Graph Polynomials: From Recursive Definitions to Subset Expansion Formulas. - Benny Godlin; Emilia Katz; Johann A. Makowsky (J. Log. Comput., 2012)

Weighted Automata and Monadic Second Order Logic. - Nadia Labai; Johann A. Makowsky (GandALF, 2013)

On the Location of Roots of Graph Polynomials. - Johann A. Makowsky; Elena V. Ravve (Electron. Notes Discret. Math., 2013)

Connection Matrices and the Definability of Graph Parameters. - Tomer Kotek; Johann A. Makowsky (Log. Methods Comput. Sci., 2014)

Recurrence relations for graph polynomials on bi-iterative families of graphs. - Tomer Kotek; Johann A. Makowsky (Eur. J. Comb., 2014)

On the location of roots of graph polynomials. - Johann A. Makowsky; Elena V. Ravve; N. K. Blanchard 001 (Eur. J. Comb., 2014)

A representation theorem for (q-)holonomic sequences. - Tomer Kotek; Johann A. Makowsky (J. Comput. Syst. Sci., 2014)

Logics of Finite Hankel Rank. - Nadia Labai; Johann A. Makowsky (Fields of Logic and Computation II, 2015)

Hankel Matrices: From Words to Graphs (Extended Abstract). - Johann A. Makowsky; Nadia Labai (LATA, 2015)

Efficient Computation of Generalized Ising Polynomials on Graphs with Fixed Clique-Width. - Tomer Kotek; Johann A. Makowsky (TTCS, 2015)

Teaching Logic for Computer Science: Are We Teaching the Wrong Narrative? - Johann A. Makowsky (CoRR, 2015)

Hankel Matrices for Weighted Visibly Pushdown Automata. - Nadia Labai; Johann A. Makowsky (LATA, 2016)

On the Exact Learnability of Graph Parameters: The Case of Partition Functions. - Nadia Labai; Johann A. Makowsky (MFCS, 2016)

Semantic Equivalence of Graph Polynomials Definable in Second Order Logic. - Johann A. Makowsky; Elena V. Ravve (WoLLIC, 2016)

Graph Polynomials: Towards a Comparative Theory (Dagstuhl Seminar 16241). - Joanna A. Ellis-Monaghan; Andrew J. Goodall; Johann A. Makowsky; Iain Moffatt (Dagstuhl Reports, 2016)

Can one design a geometry engine? On the (un)decidability of affine Euclidean geometries. - Johann A. Makowsky (CoRR, 2017)

Keeping logic in the trivium of computer science: a teaching perspective. - Johann A. Makowsky; Anna Zamansky (Formal Methods Syst. Des., 2017)

The Undecidability of Orthogonal and Origami Geometries. - Johann A. Makowsky (WoLLIC, 2018)

On the complexity of generalized chromatic polynomials. - Andrew J. Goodall; Miki Hermann; Tomer Kotek; Johann A. Makowsky; Steven D. Noble (Adv. Appl. Math., 2018)

On sequences of polynomials arising from graph invariants. - Tomer Kotek; Johann A. Makowsky; Elena V. Ravve (Eur. J. Comb., 2018)

On P-unique hypergraphs. - Johann A. Makowsky; R. X. Zhang (Australas. J Comb., 2019)

Can one design a geometry engine? - On the (un)decidability of certain affine Euclidean geometries. - Johann A. Makowsky (Ann. Math. Artif. Intell., 2019)

A logician's view of graph polynomials. - Johann A. Makowsky; Elena V. Ravve; Tomer Kotek (Ann. Pure Appl. Log., 2019)

The exact complexity of the Tutte polynomial. - Tomer Kotek; Johann A. Makowsky (CoRR, 2019)

On Weakly Distinguishing Graph Polynomials. - Johann A. Makowsky; Vsevolod Rakita (Discret. Math. Theor. Comput. Sci., 2019)

To Yuri at 80 and More than 40 Years of Friendship. - Johann A. Makowsky (Fields of Logic and Computation III, 2020)

Harary polynomials. - Orli Herscovici; Johann A. Makowsky; Vsevolod Rakita (CoRR, 2020)

Some Thoughts on Computational Models: From Massive Human Computing to Abstract State Machines, and Beyond. - Johann A. Makowsky (Logic, Computation and Rigorous Methods, 2021)

On the Tutte and Matching Polynomials for Complete Graphs. - Tomer Kotek; Johann A. Makowsky (Fundam. Informaticae, 2022)

Almost unimodal and real-rooted graph polynomials. - Johann A. Makowsky; Vsevolod Rakita (Eur. J. Comb., 2023)

Extensions and Limits of the Specker-Blatter Theorem. - Eldar Fischer; Johann A. Makowsky (J. Symb. Log., 2024)

The Specker-Blatter Theorem: An Application of Logic to Combinatorial Counting. - Johann A. Makowsky (ICLA, 2025)

Courcelle's Theorem Without Logic. - Yuval Filmus; Johann A. Makowsky (CoRR, 2025)