1101 search results - page 47 / 221 » Forcing in proof theory |
87
Voted
RTA
2005
Springer
15 years 6 months 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...
103
Voted
FOSSACS
2010
Springer
15 years 7 months ago
2010
Springer
Leftist grammars [Motwani et al., STOC 2000] are special semi-Thue systems where symbols can only insert or erase to their left. We develop a theory of leftist grammars seen as wor...
88
Voted
SYNTHESE
2010
14 years 11 months ago
2010
Though pictures are often used to present mathematical arguments, they are not typically thought to be an acceptable means for presenting mathematical arguments rigorously. With re...
107
click to vote
ML
2000
ACM
15 years 11 days ago
2000
ACM
Existing methods for exploiting awed domain theories depend on the use of a su ciently large set of training examples for diagnosing and repairing aws in the theory. In this paper,...
101
Voted
FSTTCS
2001
Springer
15 years 5 months ago
2001
Springer
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...