leanTAP Revisited
| Abstract | A sequent calculus of a new sort is extracted from the Prolog program leanTAP. This calculus is sound and complete, even though it lacks almost all structural rules. Thinking of leanTAP as a sequent calculus provides a new perspective on it and, in some ways, makes it easier to understand. It is also easier to verify correctness and completeness of the Prolog implementation. In addition, it suggests extensions to other logics, some of which are considered here. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Options |
|
|||||||||
| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,709 |
| External links |
|
| Through your library | Only published papers are available at libraries |
Alexej P. Pynko (2009). Distributive-Lattice Semantics of Sequent Calculi with Structural Rules. Logica Universalis 3 (1).
Sara Negri (2002). Varieties of Linear Calculi. Journal of Philosophical Logic 31 (6):569-590.
Lloyd Humberstone (2007). Investigations Into a Left-Structural Right-Substructural Sequent Calculus. Journal of Logic, Language and Information 16 (2).
James Brotherston (2012). Bunched Logics Displayed. Studia Logica 100 (6):1223-1254.
Katalin Bimbó & J. Michael Dunn (2012). New Consecution Calculi for $R^{T}_{\To}$. Notre Dame Journal of Formal Logic 53 (4):491-509.
Raul Hakli & Sara Negri (2011). Reasoning About Collectively Accepted Group Beliefs. Journal of Philosophical Logic 40 (4):531-555.
J. Rasga, A. Sernadas & C. Sernadas (2013). Importing Logics: Soundness and Completeness Preservation. [REVIEW] Studia Logica 101 (1):117-155.
G. Sambin & S. Valentini (1980). A Modal Sequent Calculus for a Fragment of Arithmetic. Studia Logica 39 (2-3):245 - 256.
Jonathan P. Seldin (1978). A Sequent Calculus Formulation of Type Assignment with Equality Rules for the \Ambdaβ-Calculus. Journal of Symbolic Logic 43 (4):643-649.
Jan von Plato (2012). Gentzen's Proof Systems: Byproducts in a Work of Genius. Bulletin of Symbolic Logic 18 (3):313-367.
Brian Hill & Francesca Poggiolesi (2010). A Contraction-Free and Cut-Free Sequent Calculus for Propositional Dynamic Logic. Studia Logica 94 (1).
Roy Dyckhoff & Sara Negri (2000). Admissibility of Structural Rules for Contraction-Free Systems of Intuitionistic Logic. Journal of Symbolic Logic 65 (4):1499-1518.
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2010-12-22Total downloads0Recent downloads (6 months)0How can I increase my downloads? |

