Sciweavers

1101 search results - page 59 / 221
» Forcing in proof theory
Sort
View
CADE
1992
Springer
14 years 2 months ago
Implementing the Meta-Theory of Deductive Systems
Abstract. We exhibit a methodology for formulating and verifying metatheorems about deductive systems in the Elf language, an implementation of the LF Logical Framework with an ope...
Frank Pfenning, Ekkehard Rohwedder
ENTCS
2006
124views more  ENTCS 2006»
13 years 10 months ago
Generic Trace Theory
Trace semantics has been defined for various non-deterministic systems with different input/output types, or with different types of "non-determinism" such as classical ...
Ichiro Hasuo, Bart Jacobs, Ana Sokolova
IPL
2008
118views more  IPL 2008»
13 years 10 months ago
Slicing for modern program structures: a theory for eliminating irrelevant loops
Slicing is a program transformation technique with numerous applications, as it allows the user to focus on the parts of a program that are relevant for a given purpose. Ideally, ...
Torben Amtoft
JCB
2007
78views more  JCB 2007»
13 years 10 months ago
Sorting by Reciprocal Translocations via Reversals Theory
The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of genome...
Michal Ozery-Flato, Ron Shamir
AMC
1999
128views more  AMC 1999»
13 years 9 months ago
An elementary result in the stability theory of time-invariant nonlinear discrete dynamical systems
The stability of the equilibria of time-invariant nonlinear dynamical systems with discrete time scale is investigated. We present an elementary proof showing that in the case of ...
Weiye Li, Ferenc Szidarovszky