Sciweavers

767 search results - page 27 / 154
» Logic for Mathematical Writing
Sort
View
ITP
2010
161views Mathematics» more  ITP 2010»
13 years 11 months ago
Separation Logic Adapted for Proofs by Rewriting
We present a formalisation of separation logic which, by avoiding the use of existential quantifiers, allows proofs that only use standard equational rewriting methods as found in...
Magnus O. Myreen
CIE
2005
Springer
14 years 1 months ago
A Logical Approach to Abstract Algebra
L APPROACH TO ABSTRACT ALGEBRA THIERRY COQUAND AND HENRI LOMBARDI Recent work in constructive mathematics show that Hilbert’s program works rge part of abstract algebra. Using in...
Thierry Coquand
ISIPTA
2005
IEEE
157views Mathematics» more  ISIPTA 2005»
14 years 1 months ago
Possibilistic Networks with Locally Weighted Knowledge Bases
Possibilistic networks and possibilistic logic bases are important tools to deal with uncertain pieces of information. Both of them offer a compact representation of possibility ...
Salem Benferhat, Salma Smaoui
ENTCS
2007
107views more  ENTCS 2007»
13 years 7 months ago
Event Domains, Stable Functions and Proof-Nets
We pursue the program of exposing the intrinsic mathematical structure of the “space of proofs” of a logical system [AJ94b]. We study the case of Multiplicative-Additive Linea...
Samson Abramsky
CADE
2001
Springer
14 years 7 months ago
More On Implicit Syntax
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
Marko Luther