Sciweavers

3658 search results - page 22 / 732
» The logic of proofs, semantically
Sort
View
IJAR
2007
86views more  IJAR 2007»
13 years 9 months ago
Non-deterministic semantics for logics with a consistency operator
In order to handle inconsistent knowledge bases in a reasonable way, one needs a logic which allows nontrivial inconsistent theories. Logics of this sort are called paraconsistent...
Arnon Avron
WOLLIC
2009
Springer
14 years 3 months ago
Ludics and Its Applications to Natural Language Semantics
Abstract. Proofs in Ludics, have an interpretation provided by their counter-proofs, that is the objects they interact with. We shall follow the same idea by proposing that sentenc...
Alain Lecomte, Myriam Quatrini
JLP
2006
81views more  JLP 2006»
13 years 9 months ago
Development graphs - Proof management for structured specifications
Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. In this work...
Till Mossakowski, Serge Autexier, Dieter Hutter
CORR
2011
Springer
153views Education» more  CORR 2011»
13 years 4 months ago
Proof-Theoretic Soundness and Completeness
We give a calculus for reasoning about the first-order fragment of classical logic that is adequate for giving the truth conditions of intuitionistic Kripke frames, and outline a...
Robert Rothenberg
POPL
2006
ACM
14 years 9 months ago
Formal certification of a compiler back-end or: programming a compiler with a proof assistant
This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a Clike imperative language) to PowerPC assembly code, u...
Xavier Leroy