Sciweavers

3552 search results - page 27 / 711
» Proof theory in the abstract
Sort
View
LICS
2006
IEEE
15 years 8 months ago
A Proof of Strong Normalisation using Domain Theory
U. Berger, [11] significantly simplified Tait’s normalisation proof for bar recursion [27], see
Thierry Coquand, Arnaud Spiwack
MSCS
2006
53views more  MSCS 2006»
15 years 1 months ago
Random reals and Lipschitz continuity
Abstract. Lipschitz continuity is used as a tool for analyzing the relationship between incomputability and randomness. Having presented a simpler proof of one of the major results...
Andrew E. M. Lewis, George Barmpalias
TAP
2008
Springer
153views Hardware» more  TAP 2008»
15 years 1 months ago
Bounded Relational Analysis of Free Data Types
Abstract. In this paper we report on our first experiences using the relational analysis provided by the Alloy tool with the theorem prover KIV in the context of specifications of ...
Andriy Dunets, Gerhard Schellhorn, Wolfgang Reif
CORR
2010
Springer
58views Education» more  CORR 2010»
14 years 11 months ago
Towards Theory of Massive-Parallel Proofs. Cellular Automata Approach
In the paper I sketch a theory of massively parallel proofs using cellular automata presentation of deduction. In this presentation inference rules play the role of cellular-autom...
Andrew Schumann
CADE
2000
Springer
15 years 6 months ago
Automated Proof Construction in Type Theory Using Resolution
We provide techniques to integrate resolution logic with equality in type theory. The results may be rendered as follows. − A clausification procedure in type theory, equipped w...
Marc Bezem, Dimitri Hendriks, Hans de Nivelle