1101 search results - page 15 / 221 » Forcing in proof theory |
TYPES
1993
Springer
13 years 11 months ago
1993
Springer
Abstract. A data link protocol developed and used by Philips Electronics is modeled and veri ed using I/O automata theory. Correctness is computer-checked with the Coq proof develo...
PROVSEC
2007
Springer
14 years 1 months ago
2007
Springer
Game-playing is an approach to write security proofs that are easy to verify. In this approach, security definitions and intractable problems are written as programs called games ...
BSL
2008
13 years 7 months ago
2008
We discuss the work of Paul Cohen in set theory and its influence, especially the background, discovery, development of forcing. Paul Joseph Cohen (1934
ACSC
2003
IEEE
14 years 24 days ago
2003
IEEE
Graphs where each node includes an amount of text are often used in applications. A typical example of such graphs is UML diagrams used in CASE tools. To make text information in ...
CADE
2004
Springer
14 years 27 days ago
2004
Springer
The paper presents a modular superposition calculus for the combination of first-order theories involving both total and partial functions. Modularity means that inferences are pu...