:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Praveen, M., Ramesh, Raghavendra, Doidge, Isaac
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science C.2.2; F.4.1
Online Access:	https://arxiv.org/abs/2403.16637
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Constant time testability of first-order logic with modulo counting on finitary graphs
by: Adler, Isolde, et al.
Published: (2026)

Introducing The Maximum Common Bigraph Problem
by: Burns, Kyle, et al.
Published: (2026)

Deducibility in the full Lambek calculus with weakening is HAck-complete
by: Greati, Vitor, et al.
Published: (2024)

Hypersequent Calculi Have Ackermannian Complexity
by: Balasubramanian, A. R., et al.
Published: (2026)

On the Satisfaction Probabilities of $k$-CNF Formulas
by: Tantau, Till
Published: (2022)

When do homomorphism counts help in query algorithms?
by: Cate, Balder ten, et al.
Published: (2023)

Homomorphism Indistinguishability and Game Comonads for Restricted Conjunction and Requantification
by: Schindling, Georg
Published: (2025)

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

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

Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs
by: de Rezende, Susanna F., et al.
Published: (2019)

Complexity Results in Team Semantics: Nonemptiness Is Not So Complex
by: Anttila, Aleksi, et al.
Published: (2025)

Three Fixed-Dimension Satisfiability Semantics for Quantum Logic: Implications and an Explicit Separator
by: Higuchi, Joaquim Reizi
Published: (2026)

From Zonotopes to Proof Certificates: A Formal Pipeline for Safe Control Envelopes
by: Hellwig, Jonathan, et al.
Published: (2025)

Unravelling Abstract Cyclic Proofs into Proofs by Induction
by: Grotenhuis, Lide, et al.
Published: (2026)

Model Checking for Low Monodimensionality Fragments of CMSO on Topological-Minor-Free Graph Classes
by: Sau, Ignasi, et al.
Published: (2026)

From Compactifying Lambda-Letrec Terms to Recognizing Regular-Expression Processes
by: Grabmayer, Clemens
Published: (2024)

Degree-preserving Godel logics with an involution: intermediate logics and (ideal) paraconsistency
by: Coniglio, M. E., et al.
Published: (2026)

Semantics out of context: nominal absolute denotations for first-order logic and computation
by: Gabbay, Murdoch J.
Published: (2013)

Formal Verification of Diffusion Auctions
by: Galimullin, Rustam, et al.
Published: (2025)

Locality in Residuated-Lattice Structures
by: Carr, James
Published: (2025)

Notes on CSPs and Polymorphisms
by: Brady, Zarathustra
Published: (2022)

On the Formalization of Network Topology Matrices in HOL
by: Aksoy, Kubra, et al.
Published: (2026)

A Rust-to-Lean Verification Pipeline with AI Provers: An Experience Report
by: Klaus, Natalia, et al.
Published: (2026)

Finite Hilbert systems for Weak Kleene logics
by: Greati, Vitor, et al.
Published: (2024)

Axiomatizing the Logic of Ordinary Discourse
by: Greati, Vitor, et al.
Published: (2024)

A Resolution-Based Interactive Proof System for UNSAT
by: Czerner, Philipp, et al.
Published: (2024)

On the Descriptive Complexity of Groups without Abelian Normal Subgroups
by: Grochow, Joshua A., et al.
Published: (2022)

A Coq-based Axiomatization of Tarski's Mereogeometry
by: Barlatier, Patrick, et al.
Published: (2025)

Converting BPMN Diagrams to Privacy Calculus
by: Pitsiladis, Georgios V., et al.
Published: (2024)

FastLEC: Parallel Datapath Equivalence Checking with Hybrid Engines
by: Zhang, Xindi, et al.
Published: (2025)

Complexity Classification Transfer for CSPs via Algebraic Products
by: Bodirsky, Manuel, et al.
Published: (2022)

OnlineProver: Experience with a Visualisation Tool for Teaching Formal Proofs
by: Perháč, Ján, et al.
Published: (2025)

A Complete Finitary Refinement Type System for Scott-Open Properties
by: Riba, Colin, et al.
Published: (2026)

One Energy Game for the Spectrum between Branching Bisimilarity and Weak Trace Semantics
by: Bisping, Benjamin, et al.
Published: (2024)

Interpreting De Finetti's theorem in the Category of Integrable Cones (long version)
by: Raphaëlle, Crubillé
Published: (2026)

A Fibrational Perspective on Differential Linear Logic
by: Koleilat, Jad
Published: (2026)

On Higher-Order Probabilistic Verification via the Weighted Relational Model of Linear Logic
by: Lago, Ugo Dal, et al.
Published: (2026)

Relational Dualities and Bisimulation
by: Kozicki, Piotr, et al.
Published: (2026)

Deontic Temporal Logic for Formal Verification of AI Ethics
by: V., Priya T., et al.
Published: (2025)

Modal Logics -- RNmatrices vs. Nmatrices
by: Coniglio, Marcelo E., et al.
Published: (2024)