Sciweavers

90 search results - page 3 / 18
» A General Semantics for Quantified Modal Logic
Sort
View
AISC
1998
Springer
14 years 25 days ago
Bertrand Russell, Herbrand's Theorem, and the Assignment Statement
While propositional modal logic is a standard tool, first-order modal logic is not. Indeed, it is not generally understood that conventional first-order syntax is insufficiently ex...
Melvin Fitting
AML
2006
49views more  AML 2006»
13 years 8 months ago
No Escape from Vardanyan's theorem
Vardanyan's Theorem states that the set of PA-valid principles of Quantified Modal Logic, QML, is complete 0 2. We generalize this result to a wide class of theories. The cru...
Albert Visser, Maartje de Jonge
CSL
2010
Springer
13 years 9 months ago
Graded Computation Tree Logic with Binary Coding
Abstract. Graded path quantifiers have been recently introduced and investigated as a useful framework for generalizing standard existential and universal path quantifiers in the b...
Alessandro Bianco, Fabio Mogavero, Aniello Murano
APAL
2005
154views more  APAL 2005»
13 years 8 months ago
A Sahlqvist theorem for distributive modal logic
In this paper we consider distributive modal logic, a setting in which we may add modalities, such as classical types of modalities as well as weak forms of negation, to the fragm...
Mai Gehrke, Hideo Nagahashi, Yde Venema
LICS
1994
IEEE
14 years 21 days ago
A General Semantics for Evaluation Logic
The original semantics of Evaluation Logic in [Mog93] relies on additional properties of strong monads. This paper extends the original semantics by dropping all additional requir...
Eugenio Moggi