The taming of recurrences in computability logic through cirquent calculus, Part I.
Giorgi JaparidzePublished in: Arch. Math. Log. (2013)
Keyphrases
- sequent calculus
- cut elimination
- computer algebra
- natural deduction
- formal language
- algebraic structure
- logic programming
- proof procedure
- linear logic
- automated theorem proving
- proof search
- automated reasoning
- table of contents
- classical logic
- inference rules
- linear time temporal logic
- relation algebra
- nonmonotonic logics
- knowledge representation
- transition systems
- proof theoretic
- logical framework
- proof theory
- multi valued
- theorem prover
- lambda calculus
- tableau calculus