On Logics and Homomorphism Closure

Predicate logic is the premier choice for specifying classes of relational structures. Homomorphisms are key to describing correspondences between relational structures. Questions concerning the interdependencies between these two means of characterizing (classes of) structures are of fundamental interest and can be highly non-trivial to answer. We investigate several problems regarding the homomorphism closure (homclosure) of the class of all (finite or arbitrary) models of logical sentences: membership of structures in a sentence’s homclosure; sentence homclosedness; homclosure characterizability in a logic; normal forms for homclosed sentences in certain logics. For a wide variety of fragments of first- and second-order predicate logic, we clarify these problems’ computational properties.

[1]  Joseph S. Wholey,et al.  Review: Janos Suranyi, Reduktionstheorie des Entscheidungsproblems im Pradikatenkalkul der Ersten Stufe , 1960, Journal of Symbolic Logic.

[2]  Phokion G. Kolaitis,et al.  On the Decision Problem for Two-Variable First-Order Logic , 1997, Bulletin of Symbolic Logic.

[3]  Martin Grohe,et al.  The Quest for a Logic Capturing PTIME , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

[4]  Harry R. Lewis,et al.  Complexity Results for Classes of Quantificational Formulas , 1980, J. Comput. Syst. Sci..

[5]  Benjamin Rossman.  An improved homomorphism preservation theorem from lower bounds in circuit complexity , 2016, SIGL.

[6]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[7]  Georg Gottlob,et al.  Querying the Guarded Fragment , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[8]  Sebastian Rudolph,et al.  Finite Model Theory of the Triguarded Fragment and Related Logics , 2021 .

[9]  Sebastian Rudolph,et al.  Datalog-Expressibility for Monadic and Guarded Second-Order Logic , 2020, ICALP.

[10]  K. Schütte.  Untersuchungen zum Entscheidungsproblem der mathematischen Logik , 1934 .

[11]  Balder ten Cate,et al.  Guarded Negation , 2011, Advances in Modal Logic.

[12]  Sebastian Rudolph,et al.  The Triguarded Fragment of First-Order Logic , 2018, LPAR.

[13]  Neil Immerman,et al.  Relational queries computable in polynomial time (Extended Abstract) , 1982, STOC '82.

[14]  Benjamin Rossman,et al.  Homomorphism preservation theorems , 2008, JACM.

[15]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[16]  Hao Wang.  Dominoes and the Aea Case of the Decision Problem , 1990 .

[17]  Y. Gurevich,et al.  Remarks on Berger's paper on the domino problem , 1972 .

[18]  Yuri Gurevich,et al.  The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.

[19]  Sebastian Rudolph,et al.  Flag & check: data access with monadically defined queries , 2013, PODS '13.

[20]  Saharon Shelah,et al.  Fixed-point extensions of first-order logic , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[21]  Neil D. Jones,et al.  Space-Bounded Reducibility among Combinatorial Problems , 1975, J. Comput. Syst. Sci..

[22]  Manuel Bodirsky,et al.  Complexity of Infinite-Domain Constraint Satisfaction , 2021 .

[23]  Balder ten Cate,et al.  Guarded Fragments with Constants , 2005, J. Log. Lang. Inf..

[24]  Erich Grädel,et al.  On the Restraining Power of Guards , 1999, Journal of Symbolic Logic.

[25]  A. Church.  An Unsolvable Problem of Elementary Number Theory , 1936 .

[26]  Neil Immerman,et al.  Descriptive Complexity , 1999, Graduate Texts in Computer Science.

[27]  Ronald Fagin.  Generalized first-order spectra, and polynomial. time recognizable sets , 1974 .

[28]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[29]  Robert L. Berger.  The undecidability of the domino problem , 1966 .

[30]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.