In this paper the problem of reasoning on properties of mathematical objects is considered in the context of symbolic computation. Automated reasoning mechanisms are proposed as a new basic computing tool in a symbolic computation system. These mechanisms are aimed to support the semantical correctn
β¦ LIBER β¦
A sequent calculus for limit computable mathematics
β Scribed by Stefano Berardi; Yoriyuki Yamagata
- Book ID
- 108054636
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 353 KB
- Volume
- 153
- Category
- Article
- ISSN
- 0168-0072
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A Sequent Calculus for Automated Reasoni
β
Gianna Cioni; Attilio Colagrossi; Alfonso Miola
π
Article
π
1995
π
Elsevier Science
π
English
β 680 KB
A simple sequent calculus for partial fu
β
Morten Elvang-GΓΈransson; Olaf Owe
π
Article
π
1993
π
Elsevier Science
π
English
β 871 KB
A Sequent Calculus for a Negative Free L
β
Norbert Gratzl
π
Article
π
2010
π
Springer Netherlands
π
English
β 273 KB
A Sequent Calculus for Propositional Dyn
β
J. SakalauskaitΔ
π
Article
π
2004
π
Springer
π
English
β 82 KB
A modal sequent calculus for a fragment
β
G. Sambin; S. Valentini
π
Article
π
1980
π
Springer Netherlands
π
English
β 657 KB
Global properties of canonical derivability predicates (the standard example is Pr( ) in Peano Arithmetic) are studied here by means of a suitable propositional modal logic GL. i whole book [1] has appeared on GIL and we refer to it for more information and a bibliography on GL. Here we propose a se
M-calculus β a sequent method for automa
β
A. V. Mantsivoda
π
Article
π
1993
π
Springer US
π
English
β 496 KB