On the public citation graph

Equivalence closure in the two-variable guarded fragment

0 signed · 40 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/malq.19750210118openalex-snapshot

On languages with two variables

inferredcites →https://doi.org/10.1007/11538363_22openalex-snapshot

Results on the Guarded Fragment with Equivalence or Transitive Relations

inferredcites →https://doi.org/10.1007/3-540-36576-1_19openalex-snapshot

The Two-Variable Guarded Fragment with Transitive Guards Is 2EXPTIME-Hard

inferredcites →https://doi.org/10.1007/978-3-540-75560-9_24openalex-snapshot

On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards

inferredcites →https://doi.org/10.1007/978-3-642-02930-1_22openalex-snapshot

Decidability of the Guarded Fragment with the Transitive Closure

inferredcites →https://doi.org/10.1016/0012-365x(86)90138-xopenalex-snapshot

Small solutions of linear Diophantine equations

inferredcites →https://doi.org/10.1016/0041-5553(80)90061-0openalex-snapshot

Polynomial algorithms in linear programming

inferredcites →https://doi.org/10.1016/j.apal.2004.01.003openalex-snapshot

The guarded fragment with transitive guards

inferredcites →https://doi.org/10.1023/a:1004275029985openalex-snapshot

Modal Languages and Bounded Fragments of Predicate Logic

inferredcites →https://doi.org/10.1109/lics.1999.782582openalex-snapshot

The two-variable guarded fragment with transitive relations

inferredcites →https://doi.org/10.1109/lics.2009.39openalex-snapshot

On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations

inferredcites →https://doi.org/10.1137/120900095openalex-snapshot

Two-Variable First-Order Logic with Equivalence Closure

inferredcites →https://doi.org/10.2178/jsl/1344862160openalex-snapshot

Small substructures and decidability issues for first-order logic with two variables

inferredcites →https://doi.org/10.2307/2586808openalex-snapshot

On the Restraining Power of Guards

inferredcites →https://doi.org/10.2307/421196openalex-snapshot

On the Decision Problem for Two-Variable First-Order Logic

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1093/logcom/exz012openalex-snapshot

On the satisfiability problem for fragments of two-variable logic with one transitive relation

inferred← citeshttps://doi.org/10.1093/oso/9780192867964.001.0001openalex-snapshot

Fragments of First-Order Logic

inferred← citeshttps://doi.org/10.1093/oso/9780192867964.002.0004openalex-snapshot

inferred← citeshttps://doi.org/10.1093/oso/9780192867964.002.0005openalex-snapshot

Dedication

inferred← citeshttps://doi.org/10.1093/oso/9780192867964.002.0006openalex-snapshot

Preface

inferred← citeshttps://doi.org/10.1093/oso/9780192867964.002.0009openalex-snapshot

List of Symbols

inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0001openalex-snapshot

Introduction

inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0002openalex-snapshot

Roots

inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0003openalex-snapshot

Variables

inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0004openalex-snapshot

Guards

inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0005openalex-snapshot

Prefixes

inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0006openalex-snapshot

Fluting

inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0007openalex-snapshot

Counting with one variable

inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0008openalex-snapshot

Counting with two variables

inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0009openalex-snapshot

Guarded counting

inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0010openalex-snapshot

Omitting graphs

inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0011openalex-snapshot

Modalities

inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0012openalex-snapshot

Equivalence

inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0013openalex-snapshot

Equivalence and counting

inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0014openalex-snapshot

Transitivity

inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0015openalex-snapshot

Trees

inferred← citeshttps://doi.org/10.1145/3174805openalex-snapshot

Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants

inferred← citeshttps://doi.org/10.1145/3242953.3242958openalex-snapshot

Two-variable logics with counting and semantic constraints

inferred← citeshttps://doi.org/10.4204/eptcs.243.4openalex-snapshot

Finite Model Reasoning in Expressive Fragments of First-Order Logic

inferred← citeshttps://doi.org/10.48550/arxiv.2005.01184openalex-snapshot

Algebraic classifications for fragments of first-order logic and beyond

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.