Sciweavers

81 search results - page 3 / 17
» Sound and Complete Tree-Sequent Calculus for Inquisitive Log...
Sort
View
APAL
2010
129views more  APAL 2010»
14 years 9 months ago
Kripke models for classical logic
We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cut-free completeness. We discuss the meaning of the new notion and its a...
Danko Ilik, Gyesik Lee, Hugo Herbelin
CORR
2011
Springer
173views Education» more  CORR 2011»
14 years 4 months ago
Linear Dependent Types and Relative Completeness
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
Ugo Dal Lago, Marco Gaboardi
CADE
2010
Springer
14 years 10 months ago
Classical Logic with Partial Functions
Abstract. We introduce a semantics for classical logic with partial functions. We believe that the semantics is natural. When a formula contains a subterm in which a function is ap...
Hans de Nivelle
LOGCOM
2010
136views more  LOGCOM 2010»
14 years 8 months ago
Combining Derivations and Refutations for Cut-free Completeness in Bi-intuitionistic Logic
Bi-intuitionistic logic is the union of intuitionistic and dual intuitionistic logic, and was introduced by Rauszer as a Hilbert calculus with algebraic and Kripke semantics. But ...
Rajeev Goré, Linda Postniece
FUIN
2007
90views more  FUIN 2007»
14 years 9 months ago
A Resolution Calculus with Shared Literals
We present a resolution calculus for first-order logic using a more concise formalism for representing sets of clauses. The idea is to represent the clause set at hand as a Direct...
Nicolas Peltier