The taming of recurrences in computability logic through cirquent calculus, Part II.
Giorgi JaparidzePublished in: Arch. Math. Log. (2013)
Keyphrases
- computer algebra
- natural deduction
- sequent calculus
- formal language
- algebraic structure
- cut elimination
- transition systems
- proof search
- relation algebra
- proof procedure
- computational properties
- modal logic
- automated theorem proving
- linear logic
- asynchronous circuits
- multi valued
- inference rules
- predicate logic
- logical framework
- linear time temporal logic
- first order logic
- theorem prover
- model checking
- formal logic
- logic programming
- proof theoretic
- expressive power
- boolean algebra
- proof theory
- theorem proving
- genetic algorithm