Sciweavers

3658 search results - page 84 / 732
» The logic of proofs, semantically
Sort
View
JOLLI
2008
122views more  JOLLI 2008»
13 years 10 months ago
The Basic Constructive Logic for Negation-Consistency
In this paper, consistency is understood in the standard way, i.e. as the absence of a contradiction. The basic constructive logic BK c4 , which is adequate to this sense of consis...
Gemma Robles
ISMVL
2000
IEEE
90views Hardware» more  ISMVL 2000»
14 years 2 months ago
Structures with Many-Valued Information and Their Relational Proof Theory
We present a uniform relational framework for developing proof systems for theories of manyvaluedness that may have the form of a logical system, of a class of algebra or of an in...
Ivo Düntsch, Wendy MacCaull, Ewa Orlowska
CORR
2008
Springer
61views Education» more  CORR 2008»
13 years 10 months ago
Short proofs of strong normalization
This paper presents simple, syntactic strong normalization proofs for the simply-typed -calculus and the polymorphic -calculus (system F) with the full set of logical connectives, ...
Aleksander Wojdyga
TPHOL
2007
IEEE
14 years 4 months ago
Proof Pearl: The Termination Analysis of Terminator
Terminator is a static analysis tool developed by Microsoft Research for proving termination of Windows device drivers written in C. This proof pearl describes a formalization in h...
Joe Hurd
ENTCS
2008
85views more  ENTCS 2008»
13 years 10 months ago
Formalising in Nominal Isabelle Crary's Completeness Proof for Equivalence Checking
In the book on Advanced Topics in Types and Programming Languages, Crary illustrates the reasoning technique of logical relations in a case study about equivalence checking. He pr...
Julien Narboux, Christian Urban