Corpus ID: 11838355

First-Order Logic with Counting: At Least, Weak Hanf Normal Forms Always Exist and Can Be Computed!

@article{Kuske2017FirstOrderLW,
  title={First-Order Logic with Counting: At Least, Weak Hanf Normal Forms Always Exist and Can Be Computed!},
  author={Dietrich Kuske and Nicole Schweikardt},
  journal={ArXiv},
  year={2017},
  volume={abs/1703.01122}
}
  • Dietrich Kuske, Nicole Schweikardt
  • Published in LICS 2017
  • Mathematics, Computer Science
  • We introduce the logic FOCN(P) which extends first-order logic by counting and by numerical predicates from a set P, and which can be viewed as a natural generalisation of various counting logics that have been studied in the literature. We obtain a locality result showing that every FOCN(P)-formula can be transformed into a formula in Hanf normal form that is equivalent on all finite structures of degree at most d. A formula is in Hanf normal form if it is a Boolean combination of formulas… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    1
    Twitter Mention

    Citations

    Publications citing this paper.
    SHOWING 1-6 OF 6 CITATIONS

    Learning Concepts Definable in First-Order Logic with Counting

    VIEW 8 EXCERPTS
    CITES METHODS, RESULTS & BACKGROUND
    HIGHLY INFLUENCED

    Learning Concepts Definable in First-Order Logic with Counting

    VIEW 8 EXCERPTS
    CITES METHODS, RESULTS & BACKGROUND
    HIGHLY INFLUENCED

    First-Order Query Evaluation with Cardinality Conditions

    VIEW 8 EXCERPTS
    CITES METHODS & BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 29 REFERENCES

    Hanf normal form for first-order logic with unary counting quantifiers

    VIEW 10 EXCERPTS

    Counting Modulo Quantifiers on Finite Structures

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    An optimal construction of Hanf sentences

    VIEW 4 EXCERPTS

    Linear Time Computable Problems and First-Order Descriptions

    • Detlef Seese
    • Mathematics, Computer Science
    • Mathematical Structures in Computer Science
    • 1996
    VIEW 2 EXCERPTS
    HIGHLY INFLUENTIAL