Representing scope in intuitionistic deductions

DOI10.1016/S0304-3975(98)00244-8MaRDI QIDQ1274448zbMATH OpenOpenAlexFDO

Authors Matthew Stone

Publication date 12 January 1999

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(98)00244-8

zbMATH Keywords

intuitionistic proofs

Mathematics Subject Classification ID

Other nonclassical logic (03B60)

Recommendations

• scientific article; zbMATH DE number 1348467
• scientific article; zbMATH DE number 2095713
• Goal-oriented proof-search in natural deduction for intuitionistic propositional logic
• scientific article; zbMATH DE number 1390270

Cites work

• scientific article; zbMATH DE number 3935002 (Why is no real title available?)
• scientific article; zbMATH DE number 3976991 (Why is no real title available?)
• scientific article; zbMATH DE number 3774914 (Why is no real title available?)
• scientific article; zbMATH DE number 49746 (Why is no real title available?)
• scientific article; zbMATH DE number 1292293 (Why is no real title available?)
• scientific article; zbMATH DE number 1348467 (Why is no real title available?)
• scientific article; zbMATH DE number 517003 (Why is no real title available?)
• scientific article; zbMATH DE number 978241 (Why is no real title available?)
• scientific article; zbMATH DE number 2079018 (Why is no real title available?)
• scientific article; zbMATH DE number 3222098 (Why is no real title available?)
• scientific article; zbMATH DE number 3274715 (Why is no real title available?)
• scientific article; zbMATH DE number 3300581 (Why is no real title available?)
• scientific article; zbMATH DE number 3358455 (Why is no real title available?)
• scientific article; zbMATH DE number 3395362 (Why is no real title available?)
• scientific article; zbMATH DE number 3422340 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• scientific article; zbMATH DE number 3074068 (Why is no real title available?)
• A generalization of analytic deduction via labelled deductive systems. I: Basic substructural logics
• A logic program for transforming sequent proofs to natural deduction proofs
• A logical analysis of modules in logic programming
• A proof procedure for the logic of hereditary Harrop formulas
• An intuitiomstic completeness theorem for intuitionistic predicate logic
• Are tableaux an improvement on truth-tables? Cut-free proofs and bivalence
• Constructive logics. I: A tutorial on proof systems and typed \(\lambda\)- calculi
• Constructive mathematics and computer programming
• Constructivism in mathematics. An introduction. Volume II
• Contraction-free sequent calculi for intuitionistic logic
• Converting non-classical matrix proofs into sequent-style systems
• Linear logic
• Logic Programming with Focusing Proofs in Linear Logic
• Modal Theorem Proving: An Equational Viewpoint
• Multimodal logic programming using equational and order-sorted logic
• On proof normalization in linear logic
• Proof methods for modal and intuitionistic logics
• Proof strategies in linear logic
• Proof-search in intuitionistic logic based on constraint satisfaction
• Resolution theorem proving in reified modal logics
• Semantics-Based Translation Methods for Modal Logics
• Some Syntactical Observations on Linear Logic
• T-string unification: unifying prefixes in non-classical proof methods
• The Taming of the Cut. Classical Refutations with Analytic Cut
• Theorem Proving via General Matings
• Uniform proofs as a foundation for logic programming

Cited in

(2)

• Interpolation theorems for intuitionistic predicate logic
• Scope Logic: An Extension to Hoare Logic for Pointers and Recursive Data Structures

Describes a project that uses

Uses Software

• Nuprl

This page was built for publication: Representing scope in intuitionistic deductions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1274448)