1101 search results - page 74 / 221 » Forcing in proof theory |
95
Voted
BIRTHDAY
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. This paper gives a reduction-preserving translation from Coquand's dependent pattern matching [4] into a traditional type theory [11] with universes, inductive types...
ENTCS
2007
15 years 16 days ago
2007
We develop a sound and complete equational theory for the functional quantum programming language QML. The soundness and completeness of the theory are with respect to the previou...
102
Voted
IADIS
2003
15 years 1 months ago
2003
This paper proposes a conceptual framework that relates e-marketing strategy (Web-Design, Web-Promotion, Web-Price and Web-CRM) with performance at web and firm levels, while cons...
118
Voted
GRC
2008
IEEE
15 years 1 months ago
2008
IEEE
Granular computing is gradually changing from a label to a new field of study. The driving forces, the major schools of thought, and the future research directions on granular co...
91
Voted
DM
1999
15 years 7 days ago
1999
We say (n, e) (m, f), an (m, f) subgraph is forced, if every n-vertex graph of size e has an m-vertex spanned subgraph with f edges. For example, as Tur