Labelled proof systems for intuitionistic provability

MaRDI QIDQ2701978zbMATH OpenFDO

Authors Vincent Balat, Didier Galmiche

Publication date 12 March 2001

zbMATH Keywords

classical logicintuitionistic provabilitylabelled proof systemslabelled sequent calculilinear logicproof-netproof-search

Mathematics Subject Classification ID

Proof theory in general (including proof-theoretic semantics) (03F03) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Recommendations

• Label-free proof systems for intuitionistic modal logic IS5
• On the intuitionistic force of classical search
• scientific article; zbMATH DE number 1390270
• On the intuitionistic force of classical search (extended abstract)
• Proof analysis in non-classical logics

Cited in

(11)

• Proof-search in type-theoretic languages: An introduction
• A compositional proof system on a category of labelled transition systems
• Proof-search and proof nets in mixed linear logic
• Proof-search of propositional intuitionistic logic sequents by means of classical logic calculus
• Label-free proof systems for intuitionistic modal logic IS5
• A fully labelled proof system for intuitionistic modal logics
• scientific article; zbMATH DE number 510780 (Why is no real title available?)
• Proof-search in intuitionistic logic based on constraint satisfaction
• Studying provability in implicational intuitionistic logic: the formula tree approach
• Intuitionistic Letcc via Labelled Deduction
• scientific article; zbMATH DE number 7700618 (Why is no real title available?)

This page was built for publication: Labelled proof systems for intuitionistic provability

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