Sciweavers

261 search results - page 15 / 53
» Proof Normalization Modulo
Sort
View
AML
2007
80views more  AML 2007»
13 years 6 months ago
Normal forms for fuzzy logics: a proof-theoretic approach
A method is described for obtaining conjunctive normal forms for logics using Gentzen-style rules possessing a special kind of strong invertibility. This method is then applied to ...
Petr Cintula, George Metcalfe
AMC
2007
100views more  AMC 2007»
13 years 6 months ago
An alternative proof for the explicit equations of motion for mechanical systems with independent non-ideal constraints
An alternative proof for the explicit equations of motion for mechanical systems with independent non-ideal constraints is proposed in this paper. These equations are derived with...
Po Chih Chen, Chia-Ou Chang, W. T. Chang Chien
LICS
2005
IEEE
14 years 9 days ago
Eager Normal Form Bisimulation
This paper describes two new bisimulation equivalences for the pure untyped call-by-value λ-calculus, called enf bisimilarity and enf bisimilarity up to η. They are based on eag...
Soren Lassen
LFCS
1994
Springer
13 years 10 months ago
Strong Normalization in a Non-Deterministic Typed Lambda-Calculus
In a previous paper [4], we introduced a non-deterministic -calculus (-LK) whose type system corresponds exactly to Gentzen's cut-free LK [9]. This calculus, however, cannot b...
Philippe de Groote
TLCA
2007
Springer
14 years 25 days ago
An Isomorphism Between Cut-Elimination Procedure and Proof Reduction
Abstract. This paper introduces a cut-elimination procedure of the intuitionistic sequent calculus and shows that it is isomorphic to the proof reduction of the intuitionistic natu...
Koji Nakazawa