1101 search results - page 115 / 221 » Forcing in proof theory |
IPPS
2002
IEEE
15 years 5 months ago
2002
IEEE
We describe the mechanization of recent examples of compositional reasoning, due to Charpentier and Chandy [4]. The examples illustrate a new theory for composition proposed by Ch...
113
click to vote
FCT
1999
Springer
15 years 5 months ago
1999
Springer
Kleene’s theorem on recognizable languages in free monoids is considered to be of eminent importance in theoretical computer science. It has been generalized into various directi...
104
Voted
BIRTHDAY
2006
Springer
15 years 4 months ago
2006
Springer
We describe a gate level design of a FlexRay-like bus interface. An electronic control unit (ECU) is obtained by integrating this interface into the design of the verified VAMP pro...
102
click to vote
ECML
2006
Springer
15 years 4 months ago
2006
Springer
This paper studies the PAC and agnostic PAC learnability of some standard function classes in the learning in higher-order logic setting introduced by Lloyd et al. In particular, i...
75
Voted
APAL
2007
15 years 25 days ago
2007
In this article we study applications of the bounded functional interpretation to theories of feasible arithmetic and analysis. The main results show that the novel interpretation...