2005•Journal of Logic Language and InformationRequires access

Complexity of the Two-Variable Fragment with Counting Quantifiers

Ian Pratt‐Hartmann

Open publisher page 187 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 187 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Fragment (logic), Satisfiability, Boolean satisfiability problem, Variable (mathematics), Mathematics, Discrete mathematics, Computer science, Combinatorics

Back to paper search Browse research topics Original source

Complexity of the Two-Variable Fragment with Counting Quantifiers — Research Paper | ScholarLens