# A Tableau-Based Theorem Proving Method for Intuitionistic Logic

@inproceedings{Bittel2001ATT, title={A Tableau-Based Theorem Proving Method for Intuitionistic Logic}, author={Oliver Bittel and Fachhochschule Konstanz}, year={2001} }

- Published 2001

A new tableau-based calculus for first-order intuitionistic logic is proposed. The calculus is obtained from the tableau calculus for classical logic by extending its rules by A-terms. Aterms are seen as compact representation of natural deduction proofs. The benefits from that approach are two-fold. First, proof search methods known for classical logic can be adopted: Run-time-Skolemization and unification. In contrast to the conventional tableau, sequent, or natural deduction calculus for… CONTINUE READING

#### Citations

##### Publications citing this paper.

## Representing Scope in Intuitionistic Deductions

View 16 Excerpts

Highly Influenced

#### References

##### Publications referenced by this paper.

Showing 1-7 of 7 references

## Proofs and Types

View 3 Excerpts

Highly Influenced

## in Logical Foundations of Functional Programming

View 1 Excerpt

## HARP: A tableau-based theorem prover

View 1 Excerpt

## Matrix Proof Methods for Modal Logics

View 2 Excerpts