Sciweavers

877 search results - page 11 / 176
» Structural Cut Elimination
Sort
View
TABLEAUX
2009
Springer
15 years 6 months ago
Taming Displayed Tense Logics Using Nested Sequents with Deep Inference
We consider two sequent calculi for tense logic in which the syntactic judgements are nested sequents, i.e., a tree of traditional onesided sequents built from multisets of formula...
Rajeev Goré, Linda Postniece, Alwen Tiu
TLCA
2005
Springer
15 years 5 months ago
Naming Proofs in Classical Propositional Logic
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
François Lamarche, Lutz Straßburger
TYPES
1998
Springer
15 years 3 months ago
Proof Normalization Modulo
We define a generic notion of cut that applies to many first-order theories. We prove a generic cut elimination theorem showing that the cut elimination property holds for all theo...
Gilles Dowek, Benjamin Werner
LPAR
2001
Springer
15 years 4 months ago
A Local System for Classical Logic
Abstract. The calculus of structures is a framework for specifying logical systems, which is similar to the one-sided sequent calculus but more general. We present a system of infe...
Kai Brünnler, Alwen Fernanto Tiu
174
Voted
ICDE
2003
IEEE
159views Database» more  ICDE 2003»
16 years 1 months ago
Scaling up the ALIAS Duplicate Elimination System
Duplicate elimination is an important stage in integrating data from multiple sources. The challenges involved are finding a robust deduplication function that can identify when t...
Sunita Sarawagi, Alok Kirpal