:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Pratt-Hartmann, Ian
Format:	Preprint
Published:	2017
Subjects:	Logic in Computer Science
Online Access:	https://arxiv.org/abs/1707.05558
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics
by: Kazakov, Yevgeny, et al.
Published: (2009)

Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers
by: Pratt-Hartmann, Ian
Published: (2006)

Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants
by: Kieronski, Emanuel, et al.
Published: (2016)

Complexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers
by: Pratt-Hartmann, Ian
Published: (2004)

Data-Complexity of the Two-Variable Fragment with Counting Quantifiers
by: Pratt-Hartmann, Ian
Published: (2008)

On the Satisfiability of Local First-Order Logics with Data
by: Bollig, Benedikt, et al.
Published: (2023)

Checking Satisfiability of Hyperproperties using First-Order Logic
by: Beutner, Raven, et al.
Published: (2025)

Logics for the Relational Syllogistic
by: Pratt-Hartmann, Ian, et al.
Published: (2008)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
by: Barloy, Corentin, et al.
Published: (2025)

Decidability in First-Order Modal Logic with Non-Rigid Constants and Definite Descriptions
by: Artale, Alessandro, et al.
Published: (2025)

A Decidable Bundled Fragment of First-Order Modal Logic Without Finite Model Property
by: Joshi, Varad, et al.
Published: (2025)

Deciding the Existence of Interpolants and Definitions in First-Order Modal Logic
by: Kurucz, Agi, et al.
Published: (2023)

On Knowledge Compilation For Two-Variable First-Order Logic
by: Meng, Qiaolan, et al.
Published: (2026)

The Fluted Fragment with Transitive Relations
by: Pratt-Hartmann, Ian, et al.
Published: (2020)

Interpolant Existence is Undecidable for Two-Variable First-Order Logic with Two Equivalence Relations
by: Wolter, Frank, et al.
Published: (2024)

On the Complexity of the Numerically Definite Syllogistic and Related Fragments
by: Pratt-Hartmann, Ian
Published: (2007)

Decidability of Querying First-Order Theories via Countermodels of Finite Width
by: Feller, Thomas, et al.
Published: (2023)

The Syllogistic with Unity
by: Pratt-Hartmann, Ian
Published: (2011)

Decidability Results for Fragments of First-Order Logic via a Symbolic Model Property
by: Elad, Neta, et al.
Published: (2026)

Decidability of Quantum Modal Logic
by: Tokuo, Kenji
Published: (2026)

Dynamic Probability Logic: Decidability & Computability
by: Chopoghloo, Somayeh, et al.
Published: (2024)

Decidability of Quasi-Dense Modal Logics
by: Ostropolski-Nalewaja, Piotr, et al.
Published: (2024)

Adding Circumscription to Decidable Fragments of First-Order Logic: A Complexity Rollercoaster
by: Lutz, Carsten, et al.
Published: (2024)

Craig Interpolation for Decidable First-Order Fragments
by: Cate, Balder ten, et al.
Published: (2023)

Fusions of One-Variable First-Order Modal Logics
by: Kontchakov, Roman, et al.
Published: (2026)

Set Automata and Limits of Decidability of Two-Variable Logic on Data Words
by: Guha, Shibashis, et al.
Published: (2026)

Note on a Translation from First-Order Logic into the Calculus of Relations Preserving Validity and Finite Validity
by: Nakamura, Yoshiki
Published: (2023)

Taking Bi-Intuitionistic Logic First-Order: A Proof-Theoretic Investigation via Polytree Sequents
by: Lyon, Tim S., et al.
Published: (2024)

The Satisfiability and Validity Problems for Probabilistic Computational Tree Logic are Highly Undecidable
by: Chodil, Miroslav, et al.
Published: (2025)

The Adjacent Fragment and Quine's Limits of Decision
by: Bednarczyk, Bartosz, et al.
Published: (2024)

A Two-Watched Literal Scheme for First-Order Logic
by: Briefs, Yasmine, et al.
Published: (2026)

On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories
by: Haase, Christoph, et al.
Published: (2024)

Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets
by: Cesco, Arnaldo, et al.
Published: (2021)

Functions Definable by Numerical Set-Expressions
by: Pratt-Hartmann, Ian, et al.
Published: (2009)

Complex Algebras of Arithmetic
by: Düntsch, Ivo, et al.
Published: (2009)

Distributed First Order Logic
by: Ghidini, Chiara, et al.
Published: (2015)

Interpolation in First-Order Logic
by: Cate, Balder ten, et al.
Published: (2025)

The General and Finite Satisfiability Problems for PCTL are Undecidable
by: Chodil, Miroslav, et al.
Published: (2024)

Measuring Decidability as Related to Busy Beaver Numbers
by: Tandi, Gurpreet, et al.
Published: (2026)

Deciding Separation Logic with Pointer Arithmetic and Inductive Definitions
by: Su, Wanyun, et al.
Published: (2024)