First-order logic with counting

We introduce the logic FOCN(ℙ) which extends first-order logic by counting and by numerical predicates from a set ℙ, and which can be viewed as a natural generalisation of various counting logics that have been studied in the literature.

[1]  Y. Gurevich.  On Finite Model Theory , 1990 .

[2]  Martin Grohe,et al.  Descriptive Complexity, Canonisation, and Definable Graph Structure Theory , 2017, Lecture Notes in Logic.

[3]  Jouko Väänänen.  Unary Quantifiers on Finite Models , 1997, J. Log. Lang. Inf..

[4]  Stephan Kreutzer,et al.  On Hanf-equivalence and the number of embeddings of small induced subgraphs , 2014, CSL-LICS.

[5]  Lauri Hella,et al.  Notions of Locality and Their Logical Characterizations over Finite Models , 1999, J. Symb. Log..

[6]  Nicole Schweikardt,et al.  Answering FO+MOD Queries under Updates on Bounded Degree Databases , 2017, ICDT.

[7]  Luc Segoufin,et al.  First-order query evaluation on structures of bounded degree , 2011, Log. Methods Comput. Sci..

[8]  Luc Segoufin.  A glimpse on constant delay enumeration (Invited Talk) , 2014, STACS.

[9]  Leonid Libkin,et al.  Elements of Finite Model Theory , 2004, Texts in Theoretical Computer Science.

[10]  John Derrick,et al.  Meeting of the Association for Symbolic Logic Leeds 1967 , 1968, J. Symb. Log..

[11]  Martin Grohe,et al.  Deciding first-order properties of locally tree-decomposable structures , 2000, JACM.

[12]  Arnaud Durand,et al.  First-order queries on structures of bounded degree are computable with constant delay , 2005, TOCL.

[13]  Leonid Libkin,et al.  Logics with counting and local properties , 2000, TOCL.

[14]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[15]  Stephan Kreutzer,et al.  Model Theory Makes Formulas Large , 2007, ICALP.

[16]  Nicole Schweikardt,et al.  Hanf normal form for first-order logic with unary counting quantifiers , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[17]  Markus Lohrey,et al.  Automatic structures of bounded degree revisited , 2011, J. Symb. Log..

[18]  Benedikt Bollig,et al.  An optimal construction of Hanf sentences , 2011, J. Appl. Log..

[19]  Detlef Seese,et al.  Linear time computable problems and first-order descriptions , 1996, Mathematical Structures in Computer Science.

[20]  W. Hanf.  MODEL-THEORETIC METHODS IN THE STUDY OF ELEMENTARY LOGIC , 2014 .

[21]  Martin Grohe,et al.  Algorithmic Meta Theorems , 2008, WG.

[22]  Nicole Schweikardt,et al.  Answering Conjunctive Queries under Updates , 2017, PODS.

[23]  Juha Nurmonen,et al.  Counting Modulo Quantifiers on Finite Structures , 2000, Inf. Comput..

[24]  Steven Lindell.  A Normal Form for First-Order Logic over Doubly-Linked Data Structures , 2008, Int. J. Found. Comput. Sci..

[25]  Martin Grohe,et al.  The complexity of first-order and monadic second-order logic revisited , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[26]  Ronald Fagin,et al.  On monadic NP vs. monadic co-NP , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.