Sciweavers

103 search results - page 5 / 21
» Proof Systems for Effectively Propositional Logic
Sort
View
JSYML
2006
85views more  JSYML 2006»
13 years 7 months ago
An alternative semantics for quantified relevant logic
The quantified relevant logic RQ is given a new semantics in which a formula xA is true when there is some true proposition that implies all x-instantiations of A. Formulae are mo...
Robert Goldblatt, Edwin D. Mares
AML
2006
106views more  AML 2006»
13 years 7 months ago
Upper bounds on complexity of Frege proofs with limited use of certain schemata
The paper considers a commonly used axiomatization of the classical propositional logic and studies how different axiom schemata in this system contribute to proof complexity of th...
Pavel Naumov
ICFP
2010
ACM
13 years 8 months ago
VeriML: typed computation of logical terms inside a language with effects
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
Antonis Stampoulis, Zhong Shao
ICFP
2012
ACM
11 years 9 months ago
Propositions as sessions
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...
Philip Wadler
RTA
2010
Springer
13 years 11 months ago
A Proof Calculus Which Reduces Syntactic Bureaucracy
In usual proof systems, like the sequent calculus, only a very limited way of combining proofs is available through the tree structure. We present in this paper a logicindependent ...
Alessio Guglielmi, Tom Gundersen, Michel Parigot