5499 search results - page 227 / 1100 » Generalized Rewrite Theories |
169
click to vote
AML
2006
15 years 7 months ago
2006
Vardanyan's Theorem states that the set of PA-valid principles of Quantified Modal Logic, QML, is complete 0 2. We generalize this result to a wide class of theories. The cru...
164
click to vote
CSL
2002
Springer
15 years 7 months ago
2002
Springer
Ludics has been proposed by Girard as an abstract general approach to proof theory. We explain how its basic notions correspond to those of the "innocent strategy" apprao...
245
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing d...
189
click to vote
RTA
2005
Springer
16 years 21 days ago
2005
Springer
Proofs of equalities may be built from assumptions using proof rules for reflexivity, symmetry, and transitivity. Reflexivity is an axiom proving x=x for any x; symmetry is a 1-p...
190
click to vote
CTRS
1990
15 years 11 months ago
1990
Completion procedures, originated from the seminal work of Knuth and Bendix, are wellknown as procedures for generating confluent rewrite systems, i.e. decision procedures for al ...