Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

CSL
2002
Springer

favoriteEmaildiscussreport

93views Automated Reasoning» more CSL 2002»

On Generalizations of Semi-terms of Particularly Simple Form

13 years 4 months ago

On Generalizations of Semi-terms of Particularly Simple Form

Download cl-informatik.uibk.ac.at

Abstract. We show that Gentzen's sequent calculus admits generalization of semi-terms of particularly simple form. This theorem extends one of the main results in [BS95] to languages L with functions of arbitrary arity and the central result in [KP88] to semi-terms.

Matthias Baaz, Georg Moser

Real-time Traffic

Arbitrary Arity | Automated Reasoning | CSL 2002 | Sequent Calculus | Simple Form |

claim paper

Related Content

» Forming Beliefs about a Changing World

» A Simple IRUWB Receiver Adapted to MultiUser Interferences

» Extension of the FormClosure Property to Underactuated Hands

» Unifying practical uncertainty representations I Generalized pboxes

» A Simple ClosedClassOpenClass Factorization for Improved Language Modeling

» A Rational Function Lens Distortion Model for General Cameras

» A Generalized Method for Integrating Rulebased Knowledge into Inductive Methods Through Vi...

» Beginnings of a Theory of General Database Completions

» Javert fully automatic mining of general temporal properties from dynamic traces

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2002
Where	CSL
Authors	Matthias Baaz, Georg Moser

Comments (0)