Sciweavers

Share
BSL
2004
100views more  BSL 2004»
9 years 9 months ago
Forcing in proof theory
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...
Jeremy Avigad
APAL
2002
101views more  APAL 2002»
9 years 9 months ago
The logic of tasks
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 ...
Giorgi Japaridze
APAL
2004
78views more  APAL 2004»
9 years 9 months ago
Ternary relations and relevant semantics
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...
Robert K. Meyer
AML
2004
96views more  AML 2004»
9 years 9 months ago
Analytic Calculi for Product Logics
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 ...
George Metcalfe, Nicola Olivetti, Dov M. Gabbay
LOGCOM
2007
115views more  LOGCOM 2007»
9 years 9 months ago
The Dynamics of Syntactic Knowledge
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, ...
Thomas Ågotnes, Natasha Alechina
LOGCOM
2007
97views more  LOGCOM 2007»
9 years 9 months ago
Termination for Hybrid Tableaus
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...
Thomas Bolander, Patrick Blackburn
JSYML
2007
85views more  JSYML 2007»
9 years 9 months ago
Substructural fuzzy logics
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...
George Metcalfe, Franco Montagna
AI
2004
Springer
9 years 9 months ago
Order-sorted logic programming with predicate hierarchy
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...
Ken Kaneiwa
APAL
2005
73views more  APAL 2005»
9 years 9 months ago
Finite information logic
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...
Rohit Parikh, Jouko A. Väänänen
APAL
2005
135views more  APAL 2005»
9 years 9 months ago
Safe beliefs for propositional theories
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...
Mauricio Osorio, Juan Antonio Navarro Pérez...
books