1670 search results - page 21 / 334 » On Skolemization in constructive theories |
ENTCS
2006
13 years 7 months ago
2006
Computability theory, which investigates computable functions and computable sets, lies at the foundation of computer science. Its classical presentations usually involve a fair a...
BSL
2004
13 years 7 months ago
2004
Paul Cohen's method of forcing, together with Saul Kripke's related semantics for modal and intuitionistic logic, has had profound effects on a number of branches of mat...
SOSL
1993
13 years 11 months ago
1993
In this paper we study automatic veri cation of proofs in process algebra. Formulas of process algebra are represented by types in typed -calculus. Inhabitants (terms) of these ty...
Publication
MetaML is a statically typed functional programming language with special support for program generation. In addition to providing the standard features of contemporary programming...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract. Sequential game and Nash equilibrium are basic key concepts in game theory. In 1953, Kuhn showed that every sequential game has a Nash equilibrium. The two main steps of ...