Definite Formulae, Negation-as-Failure, and the Base-Extension Semantics of Intuitionistic Propositional Logic

DOI10.18778/0138-0680.2023.16arXiv2210.05336MaRDI QIDQ6200465

David J. Pym, Alexander V. Gheorghiu

Publication date: 29 February 2024

Published in: Bulletin of the Section of Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2210.05336

zbMATH Keywords

logic programmingproof-theoretic semanticsbilateralismnegation-as-failure

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bilateralism in proof-theoretic semantics
• Uniform proofs as a foundation for logic programming
• Book review of: N. Kürbis, Proof and falsity: a logical investigation
• Falsification, natural deduction and bi-intuitionistic logic
• A Proof-Theoretic Approach to Logic Programming. I. Clauses as Rules
• Contributions to the Theory of Logic Programming
• A Proof-Theoretic Approach to Logic Programming
• Success and failure for hereditary Harrop formulae
• Rejection
• Base-extension semantics for intuitionistic sentential logic
• Classical logic without bivalence
• A logical analysis of modules in logic programming
• On an inferential semantics for classical logic
• Logic and structure

This page was built for publication: Definite Formulae, Negation-as-Failure, and the Base-Extension Semantics of Intuitionistic Propositional Logic