Sciweavers

2529 search results - page 41 / 506
» The Logical Structure of Binding
Sort
View
LICS
1995
IEEE
15 years 1 months ago
Structural Cut Elimination
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding...
Frank Pfenning
FMSD
2006
77views more  FMSD 2006»
14 years 9 months ago
Data structures for symbolic multi-valued model-checking
Multi-valued logics can be effectively used to reason about incomplete and/or inconsistent systems, e.g. during early software requirements or as the systems evolve. In our earlie...
Marsha Chechik, Arie Gurfinkel, Benet Devereux, Al...
AIML
2008
14 years 11 months ago
Modal logic of time division
A logic LTD is defined, inspired by [37]. It is syntactically like basic modal logic with an additional unary operator but it has an interval-based semantics on structures with arb...
Tero Tulenheimo
BMCBI
2010
153views more  BMCBI 2010»
14 years 10 months ago
Analysis of substructural variation in families of enzymatic proteins with applications to protein function prediction
Background: Structural variations caused by a wide range of physico-chemical and biological sources directly influence the function of a protein. For enzymatic proteins, the struc...
Drew H. Bryant, Mark Moll, Brian Y. Chen, Viachesl...
RTA
2005
Springer
15 years 3 months ago
Universal Algebra for Termination of Higher-Order Rewriting
Abstract. We show that the structures of binding algebras and Σmonoids by Fiore, Plotkin and Turi are sound and complete models of Klop’s Combinatory Reduction Systems (CRSs). T...
Makoto Hamana