First-Order Logic with Equicardinality in Random Graphs

Simi Haber*, Tal Hershko*, Mostafa Mirabi*, Saharon Shelah*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We answer a question of Blass and Harary about the validity of the zero-one law in random graphs for extensions of first-order logic (FOL). For a given graph property P, the Lindström extension of FOL by P is defined as the minimal (regular) extension of FOL able to express P. For several graph properties P (e.g. Hamiltonicity), it is known that the Lindström extension by P is also able to interpret a segment of arithmetic, and thus strongly disobeys the zero-one law. Common to all these properties is the ability to express the Härtig quantifier, a natural extension of FOL testing if two definable sets are of the same size. We prove that the Härtig quantifier is sufficient for the interpretation of arithmetic, thus providing a general result which implies all known cases of Lindström extensions which are able to interpret a segment of arithmetic.

Original languageEnglish
Title of host publication33rd EACSL Annual Conference on Computer Science Logic, CSL 2025
EditorsJorg Endrullis, Sylvain Schmitz
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959773621
DOIs
StatePublished - 3 Feb 2025
Event33rd EACSL Annual Conference on Computer Science Logic, CSL 2025 - Amsterdam, Netherlands
Duration: 10 Feb 202514 Feb 2025

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume326
ISSN (Print)1868-8969

Conference

Conference33rd EACSL Annual Conference on Computer Science Logic, CSL 2025
Country/TerritoryNetherlands
CityAmsterdam
Period10/02/2514/02/25

Bibliographical note

Publisher Copyright:
© Simi Haber, Tal Hershko, Mostafa Mirabi, and Saharon Shelah.

Keywords

  • equicardinality
  • finite model theory
  • first-order logic
  • generalized quantifiers
  • monadic second-order logic
  • random graphs
  • zero-one laws

Fingerprint

Dive into the research topics of 'First-Order Logic with Equicardinality in Random Graphs'. Together they form a unique fingerprint.

Cite this