97 search results - page 6 / 20 » Semi-Contraction: Axioms and Construction |
TYPES
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. In the FTA project in Nijmegen we have formalized a constructive proof of the Fundamental Theorem of Algebra. In the formalization, we have first defined the (constructiv...
VMCAI
2004
Springer
14 years 28 days ago
2004
Springer
Typed Assembly Languages (TALs) can be used to validate the safety of assembly-language programs. However, typing rules are usually trusted as axioms. In this paper, we show how to...
AMAI
2000
Springer
13 years 7 months ago
2000
Springer
An event space is a set of instantaneous events that vary both in time and specificity. The concept of an event space provides a foundation for a logical--i.e., modular and open-a...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We take a fresh look at the logics of informational dependence and independence of Hintikka and Sandu and V¨a¨an¨anen, and their compositional semantics due to Hodges. We show h...
CIE
2005
Springer
14 years 1 months ago
2005
Springer
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. The general...