A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs.

Alessandra Carbone

Published in: Inf. Comput. (2010)

Keyphrases

sequent calculus
cut elimination
inference rules
natural deduction
linear logic
flow graphs
modal logic
theorem proving
wide class
proof search
theorem prover
logical framework
linear time temporal logic
decision procedures
sufficient conditions
flow graph
classical logic
smart card
pattern recognition