:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Majumdar, Rupak, Sathiyanarayana, V. R.
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science
Online Access:	https://arxiv.org/abs/2404.19724
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Complete and Terminating Tableau Calculus for Undirected Graph
by: Nishimura, Yuki, et al.
Published: (2024)

A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2023)

Universal Proof Theory: Semi-analytic Rules and Uniform Interpolation
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2018)

Universal Proof Theory: Semi-analytic Rules and Craig Interpolation
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2018)

Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets
by: Patil, Jaikrishna Manojkumar, et al.
Published: (2025)

Proof-Theoretic Functional Completeness for the Connexive Logic C
by: Ayhan, Sara, et al.
Published: (2025)

Admissibility of Substitution Rule in Cyclic-Proof Systems
by: Saotome, Kenji, et al.
Published: (2025)

A Cut-free, Sound and Complete Russellian Theory of Definite Descriptions
by: Indrzejczak, Andrzej, et al.
Published: (2024)

Model Checking Linear Temporal Logic with Standpoint Modalities
by: Aghamov, Rajab, et al.
Published: (2025)

Towards a Proof System for Probabilistic Dynamic Logic
by: Johnsen, Einar Broch, et al.
Published: (2024)

Proof-theoretic Semantics for First-order Logic
by: Gheorghiu, Alexander V.
Published: (2024)

Foundations for an Abstract Proof Theory in the Context of Horn Rules
by: Lyon, Tim S., et al.
Published: (2023)

From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2023)

General Decidability Results for Systems with Continuous Counters
by: Balasubramanian, A. R., et al.
Published: (2025)

Probabilistic Strategies: Definability and the Tensor Completeness Problem
by: Bowler, Nathan, et al.
Published: (2025)

Proofs that Modify Proofs, 1/2
by: Towsner, Henry
Published: (2025)

Proof-theoretic Semantics for Second-order Logic
by: Gheorghiu, Alexander V., et al.
Published: (2025)

Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2024)

The Annotated Dependency Pair Framework for Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2024)

Proof-theoretic Semantics for the Logic of Bunched Implications
by: Gu, Tao, et al.
Published: (2023)

Proof-theoretic Semantics for Classical Propositional Logic with Assertion and Denial
by: Gheorghiu, Alexander V., et al.
Published: (2025)

From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity
by: Kassing, Jan-Christoph, et al.
Published: (2024)

Disproving (Positive) Almost-Sure Termination of Probabilistic Term Rewriting via Random Walks
by: Kassing, Jan-Christoph, et al.
Published: (2026)

Terminating Hybrid Tableaus for Ordered Models
by: Nishimura, Yuki
Published: (2025)

Proof-theoretic Semantics for Intuitionistic Multiplicative Linear Logic (Extended Abstract)
by: Gheorghiu, Alexander V., et al.
Published: (2023)

From Proof-theoretic Validity to Base-extension Semantics for Intuitionistic Propositional Logic
by: Gheorghiu, Alexander V., et al.
Published: (2022)

Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2025)

The Proof Analysis Problem
by: Arteche, Noel, et al.
Published: (2025)

MightyPPL: Verification of MITL with Past and Pnueli Modalities
by: Ho, Hsi-Ming, et al.
Published: (2025)

A Syntactic Approach to Computing Complete and Sound Abstraction in the Situation Calculus
by: Fang, Liangda, et al.
Published: (2024)

Proof Complexity of Linear Logics
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2026)

Cyclic Proofs for iGL via Corecursion
by: Miranda, Borja Sierra
Published: (2023)

A Sound and Complete Substitution Algorithm for Multimode Type Theory: Technical Report
by: Ceulemans, Joris, et al.
Published: (2024)

On the Completeness of Interpolation Algorithms
by: Hetzl, Stefan, et al.
Published: (2024)

Proof complexity of positive branching programs
by: Das, Anupam, et al.
Published: (2021)

Proof Theory and Decision Procedures for Deontic STIT Logics
by: Lyon, Tim S., et al.
Published: (2024)

Universal Proof Theory, TACL 2022 Lecture Notes
by: Iemhoff, Rosalie, et al.
Published: (2023)

Completions of Kleene's second model
by: Terwijn, Sebastiaan A.
Published: (2023)

An Introduction to Categorical Proof Theory
by: Tabatabai, Amirhossein Akbar
Published: (2024)

Categorical Proof-Theoretic Semantics
by: Pym, David, et al.
Published: (2023)