Two-variable logic revisited

08/20/2019
by   Yanger Ma, et al.
0

In this paper we present another proof for the well-known small model property of two-variable logic. As far as we know, existing proofs of this property rely heavily on model theoretic concepts. In contrast, ours is combinatorial in nature and uses only a very simple counting argument, which we find intuitive and elegant. We also consider matching lower bounds.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/10/2020

Weighted First-Order Model Counting in the Two-Variable Fragment With Counting Quantifiers

It is known due to the work of Van den Broeck et al [KR, 2014] that weig...
research
01/28/2020

Automated Proof of Bell-LaPadula Security Properties

Almost fifty years ago, D.E. Bell and L. LaPadula published the first fo...
research
02/16/2022

Resolution with Counting: Lower Bounds for Proofs of Membership in the Complement of a Linear Map Image of the Boolean Cube

We propose a new approach to proving lower bounds for sizes of dag-like ...
research
06/14/2021

Entropy-Based Proofs of Combinatorial Results on Bipartite Graphs

This work considers new entropy-based proofs of some known, or otherwise...
research
03/30/2019

FO = FO3 for linear orders with monotone binary relations

We show that over the class of linear orders with additional binary rela...
research
04/25/2023

Simulating Logspace-Recursion with Logarithmic Quantifier Depth

The fixed-point logic LREC= was developed by Grohe et al. (CSL 2011) in ...
research
09/13/2018

Towards Coinductive Theory Exploration in Horn Clause Logic: Position Paper

Coinduction occurs in two guises in Horn clause logic: in proofs of self...

Please sign up or login with your details

Forgot password? Click here to reset