Sciweavers

Share
31 search results - page 1 / 7
» Proof search and Co-NP completeness for many-valued logics
Sort
View
FSS
2016
60views FPGA» more  FSS 2016»
4 years 4 months ago
Proof search and Co-NP completeness for many-valued logics
We provide a methodology to introduce proof search oriented calculi for a large class of many-valued logics, and a sufficient condition for their Co-NP completeness. Our results a...
Mattia Bongini, Agata Ciabattoni, Franco Montagna
RTA
2015
Springer
4 years 3 months ago
No complete linear term rewriting system for propositional logic
Recently it has been observed that the set of all sound linear inference rules in propositional logic is already coNP-complete, i.e. that every boolean tautology can be written as...
Anupam Das, Lutz Straßburger
CSL
2007
Springer
10 years 2 months ago
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
Dale Miller, Alexis Saurin
CSL
2007
Springer
10 years 2 months ago
Focusing and Polarization in Intuitionistic Logic
A focused proof system provides a normal form to cut-free proofs that structures the application of invertible and non-invertible inference rules. The focused proof system of Andre...
Chuck Liang, Dale Miller
CADE
2006
Springer
10 years 8 months ago
Geometric Resolution: A Proof Procedure Based on Finite Model Search
We present a proof procedure that is complete for first-order logic, but which can also be used when searching for finite models. The procedure uses a normal form which is based on...
Hans de Nivelle, Jia Meng
books