---
title: Two-variable logic
slug: two-variable-logic
qid: 
snapshot: enwiki-001110079464
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1110079464
tags: [23615796, 29176662]
---

# Two-variable logic

> [!note] Provenance
> Snapshot `enwiki-001110079464` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1110079464> · Licensed CC BY-SA 4.0

In mathematical logic and computer science, two-variable logic is the fragment of first-order logic where formulae can be written using only two different variables. This fragment is usually studied without function symbols.

In mathematical logic and computer science, two-variable logic is the fragment of first-order logic where formulae can be written using only two different variables. This fragment is usually studied without function symbols. Counting quantifiers actually improve the expressiveness of finite-variable logics as they allow to say that there is a node with n neighbors, namely \Phi = \exists x \exists^{\geq n} y E(x,y) . Without counting quantifiers n+1 variables are needed for the same formula.
