Sciweavers

2272 search results - page 250 / 455
» A Calculus for
Sort
View
ENTCS
2007
72views more  ENTCS 2007»
15 years 4 months ago
Observational Equivalence for the Interaction Combinators and Internal Separation
We define an observational equivalence for Lafont’s interaction combinators, which we prove to be the least discriminating non-trivial congruence on total nets (nets admitting ...
Damiano Mazza
MST
2008
119views more  MST 2008»
15 years 4 months ago
Logical Equivalence for Subtyping Object and Recursive Types
Subtyping in first order object calculi is studied with respect to the logical semantics obtained by identifying terms that satisfy the same set of predicates, as formalised throu...
Steffen van Bakel, Ugo de'Liguoro
85
Voted
NA
2008
72views more  NA 2008»
15 years 4 months ago
The numerical evaluation of a challenging integral
Standard numerical analysis tools, combined with elementary calculus, are deployed to evaluate a densely and wildly oscillatory integral proposed as a computational problem in the...
Walter Gautschi
190
Voted
LOGCOM
2006
58views more  LOGCOM 2006»
15 years 4 months ago
Proof Theory for Casari's Comparative Logics
Comparative logics were introduced by Casari in the 1980s to treat aspects of comparative reasoning occurring in natural language. In this paper Gentzen systems are defined for the...
George Metcalfe
JAPLL
2007
142views more  JAPLL 2007»
15 years 4 months ago
Cut-free common knowledge
Starting off from the infinitary system for common knowledge over multi-modal epistemic logic presented in Alberucci and J¨ager [1], we apply the finite model property to “...
Gerhard Jäger, Mathis Kretz, Thomas Studer