Sciweavers

247 search results - page 15 / 50
» A Proof System and a Decision Procedure for Equality Logic
Sort
View
ICTCS
2003
Springer
14 years 21 days ago
On the Computational Complexity of Cut-Elimination in Linear Logic
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
Harry G. Mairson, Kazushige Terui
JOLLI
2002
141views more  JOLLI 2002»
13 years 7 months ago
Naming Worlds in Modal and Temporal Logic
In this paper we suggest adding to predicate modal and temporal logic a locality predicate W which gives names to worlds (or time points). We also study an equal time predicate D(x...
Dov M. Gabbay, G. Malod
LPAR
2010
Springer
13 years 6 months ago
Labelled Unit Superposition Calculi for Instantiation-Based Reasoning
The Inst-Gen-Eq method is an instantiation-based calculus which is complete for first-order clause logic modulo equality. Its distinctive feature is that it combines first-order ...
Konstantin Korovin, Christoph Sticksel
IJAR
2007
86views more  IJAR 2007»
13 years 7 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
TYPES
1995
Springer
13 years 11 months ago
A Natural Deduction Approach to Dynamic Logic
Natural Deduction style presentations of program logics are useful in view of the implementation of such logics in interactive proof development environments, based on type theory,...
Furio Honsell, Marino Miculan