On the public citation graph

Undecidability results on two-variable logics

https://doi.org/10.1007/bfb0023464
0 signed · 56 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/3-540-56992-8_15openalex-snapshot
Inductive definability with counting on finite structures
inferredcites →https://doi.org/10.1007/978-3-642-59207-2openalex-snapshot
The Classical Decision Problem
inferredcites →https://doi.org/10.1007/978-3-662-21676-7openalex-snapshot
Bounded Variable Logics and Counting
inferredcites →https://doi.org/10.1016/0168-0072(89)90023-7openalex-snapshot
Dominoes and the complexity of subclasses of logical theories
inferredcites →https://doi.org/10.1016/s0304-0208(08)73075-5openalex-snapshot
Recurring Dominoes: Making the Highly Undecidable Highly Understandable
inferredcites →https://doi.org/10.1016/s0304-0208(13)73561-8openalex-snapshot
Annals of Discrete Mathematics
inferredcites →https://doi.org/10.1109/lics.1997.614957openalex-snapshot
Two-variable logic with counting is decidable
inferredcites →https://doi.org/10.1145/4904.4993openalex-snapshot
Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness
inferredcites →https://doi.org/10.2307/2275466openalex-snapshot
The Härtig quantifier: a survey
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.1006/jcss.1999.1627openalex-snapshot
Regular Path Queries with Constraints
inferred← citeshttps://doi.org/10.1006/jsco.1999.0362openalex-snapshot
Goals and Benchmarks for Automated Map Reasoning
inferred← citeshttps://doi.org/10.1007/3-540-28788-4_12openalex-snapshot
Quantifiers and Logical Reductions
inferred← citeshttps://doi.org/10.1007/3-540-45757-7_7openalex-snapshot
Towards Service Description Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-69738-1_7openalex-snapshot
Shape Analysis of Single-Parent Heaps
inferred← citeshttps://doi.org/10.1007/978-3-642-02930-1_22openalex-snapshot
Decidability of the Guarded Fragment with the Transitive Closure
inferred← citeshttps://doi.org/10.1007/978-3-642-16242-8_14openalex-snapshot
On the Complexity of the Bernays-Schönfinkel Class with Datalog
inferred← citeshttps://doi.org/10.1007/978-3-662-21676-7openalex-snapshot
Bounded Variable Logics and Counting
inferred← citeshttps://doi.org/10.1007/bfb0055090openalex-snapshot
Reasoning about the past with two-way automata
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50023-0openalex-snapshot
Encoding Two-Valued Nonclassical Logics in Classical Logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.05.044openalex-snapshot
Monadic Second-Order Logic and Transitive Closure Logics over Trees
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.065openalex-snapshot
Proving Resource Consumption of Low-level Programs Using Automated Theorem Provers
inferred← citeshttps://doi.org/10.1016/j.fss.2020.01.011openalex-snapshot
On transitive modal many-valued logics
inferred← citeshttps://doi.org/10.1016/j.ic.2014.08.004openalex-snapshot
Complexity of two-variable dependence logic and IF-logic
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.08.003openalex-snapshot
Verification of multi-linked heaps
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.09.028openalex-snapshot
One-variable logic meets Presburger arithmetic
inferred← citeshttps://doi.org/10.1016/s0168-0072(96)00047-4openalex-snapshot
Canonization for two variables and puzzles on the square
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00308-9openalex-snapshot
On logics with two variables
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80008-5openalex-snapshot
5 Model theory of modal logic
inferred← citeshttps://doi.org/10.1017/bsl.2023.30openalex-snapshot
INTERLEAVING LOGIC AND COUNTING
inferred← citeshttps://doi.org/10.1051/ita/2012027openalex-snapshot
On Core XPath with Inflationary Fixed Points
inferred← citeshttps://doi.org/10.1093/logcom/11.6.933openalex-snapshot
The Complexity of Regularity in Grammar Logics and Related Modal Logics
inferred← citeshttps://doi.org/10.1109/icsnc.2008.11openalex-snapshot
Automated Evaluation of Reusable Learning Objects via a Decision Support System
inferred← citeshttps://doi.org/10.1109/lics.1997.614957openalex-snapshot
Two-variable logic with counting is decidable
inferred← citeshttps://doi.org/10.1109/lics.1998.705684openalex-snapshot
On the boundedness problem for two-variable first-order logic
inferred← citeshttps://doi.org/10.1109/lics.1999.782582openalex-snapshot
The two-variable guarded fragment with transitive relations
inferred← citeshttps://doi.org/10.1109/lics.1999.782585openalex-snapshot
Guarded fixed point logic
inferred← citeshttps://doi.org/10.1109/lics.2011.14openalex-snapshot
Complexity of Two-Variable Dependence Logic and IF-Logic
inferred← citeshttps://doi.org/10.1109/lics.2012.53openalex-snapshot
Two-Variable First-Order Logic with Equivalence Closure
inferred← citeshttps://doi.org/10.1109/lics.2013.12openalex-snapshot
Two-Variable Logic with Counting and Trees
inferred← citeshttps://doi.org/10.1145/2603088.2603142openalex-snapshot
Expressive completeness of separation logic with two variables and no separating conjunction
inferred← citeshttps://doi.org/10.1145/263661.263676openalex-snapshot
Regular path queries with constraints
inferred← citeshttps://doi.org/10.1145/2701414openalex-snapshot
Guarded Negation
inferred← citeshttps://doi.org/10.1145/2724711openalex-snapshot
Two-Variable Separation Logic and Its Inner Circle
inferred← citeshttps://doi.org/10.1145/2835490openalex-snapshot
Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction
inferred← citeshttps://doi.org/10.1145/2933575.2933592openalex-snapshot
A Step Up in Expressiveness of Decidable Fixpoint Logics
inferred← citeshttps://doi.org/10.1145/2983622openalex-snapshot
Two-Variable Logic with Counting and Trees
inferred← citeshttps://doi.org/10.1145/3129173.3129178openalex-snapshot
A survey on guarded negation
inferred← citeshttps://doi.org/10.1145/3242953.3242958openalex-snapshot
Two-variable logics with counting and semantic constraints
inferred← citeshttps://doi.org/10.2307/420954openalex-snapshot
Finite Variable Logics in Descriptive Complexity Theory
inferred← citeshttps://doi.org/10.2307/421196openalex-snapshot
On the Decision Problem for Two-Variable First-Order Logic
inferred← citeshttps://doi.org/10.26456/vtpmk653openalex-snapshot
Trees as a tool for modelling undecidable problems
inferred← citeshttps://doi.org/10.29007/z359openalex-snapshot
The Triguarded Fragment with Transitivity
inferred← citeshttps://doi.org/10.4230/lipics.csl.2012.396openalex-snapshot
Two-Variable Universal Logic with Transitive Closure
inferred← citeshttps://doi.org/10.4230/lipics.csl.2016.13openalex-snapshot
Monadic Second Order Finite Satisfiability and Unbounded Tree-Width
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.