BSL
2004
13 years 10 months ago
2004
Paul Cohen's method of forcing, together with Saul Kripke's related semantics for modal and intuitionistic logic, has had profound effects on a number of branches of mat...
APAL
2002
13 years 10 months ago
2002
The paper introduces a semantics for the language of classical first order logic supplemented with the additional operators and . This semantics understands formulas as tasks. An ...
APAL
2004
13 years 10 months ago
2004
Modus ponens provides the central theme. There are laws, of the form A C. A logic (or other theory) L collects such laws. Any datum A (or theory T incorporating such data) provid...
AML
2004
13 years 10 months ago
2004
Abstract. Product logic is an important t-norm based fuzzy logic with conjunction interpreted as multiplication on the real unit interval [0, 1], while Cancellative hoop logic CHL ...
LOGCOM
2007
13 years 10 months ago
2007
The syntactic approach to epistemic logic avoids the logical omniscience problem by taking knowledge as primary rather than as defined in terms of possible worlds. In this study, ...
LOGCOM
2007
13 years 10 months ago
2007
Abstract. This article extends and improves work on tableau-based decision methods for hybrid logic by Bolander and Bra¨uner [5]. Their paper gives tableau-based decision procedur...
JSYML
2007
13 years 10 months ago
2007
Substructural fuzzy logics are substructural logics that are complete with respect to algebras whose lattice reduct is the real unit interval [0, 1]. In this paper, we introduce Un...
AI
2004
Springer
13 years 10 months ago
2004
Springer
Order-sorted logic has been formalized as first-order logic with sorted terms where sorts are ordered to build a hierarchy (called a sort-hierarchy). These sorted logics lead to u...
APAL
2005
13 years 10 months ago
2005
We introduce a generalization of Independence Friendly (IF) logic in which Eloise (the player) is restricted to a finite amount of information about Abelard's ('s) move...
APAL
2005
13 years 10 months ago
2005
We propose an extension of answer sets, that we call safe beliefs, that can be used to study several properties and notions of answer sets and logic programming from a more genera...