Representing scope in intuitionistic deductions

DOI10.1016/S0304-3975(98)00244-8zbMath0912.68188OpenAlexW2058399339MaRDI QIDQ1274448

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)

Related Items

Interpolation theorems for intuitionistic predicate logic

Uses Software

• Nuprl

Cites Work

• Linear logic
• Proof methods for modal and intuitionistic logics
• Constructivism in mathematics. An introduction. Volume II
• Multimodal logic programming using equational and order-sorted logic
• Constructive logics. I: A tutorial on proof systems and typed \(\lambda\)- calculi
• A proof procedure for the logic of hereditary Harrop formulas
• Are tableaux an improvement on truth-tables? Cut-free proofs and bivalence
• Resolution theorem proving in reified modal logics
• Proof strategies in linear logic
• On proof normalization in linear logic
• A generalization of analytic deduction via labelled deductive systems. I: Basic substructural logics
• Uniform proofs as a foundation for logic programming
• Constructive mathematics and computer programming
• Theorem Proving via General Matings
• Semantics-Based Translation Methods for Modal Logics
• Some Syntactical Observations on Linear Logic
• Modal Theorem Proving: An Equational Viewpoint
• Logic Programming with Focusing Proofs in Linear Logic
• Contraction-free sequent calculi for intuitionistic logic
• An intuitiomstic completeness theorem for intuitionistic predicate logic
• The Taming of the Cut. Classical Refutations with Analytic Cut
• T-string unification: Unifying prefixes in non-classical proof methods
• Proof-search in intuitionistic logic based on constraint satisfaction
• Converting non-classical matrix proofs into sequent-style systems
• A logical analysis of modules in logic programming
• A logic program for transforming sequent proofs to natural deduction proofs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item