Sciweavers

265 search results - page 32 / 53
» Weakly Algebraizable Logics
Sort
View
DAM
2007
83views more  DAM 2007»
13 years 8 months ago
The proof theoretic strength of the Steinitz exchange theorem
We show that the logical theory QLA proves the Cayley–Hamilton theorem from the Steinitz exchange theorem together with a strengthening of the linear independence principle. Sin...
Michael Soltys
FMCAD
2006
Springer
14 years 8 days ago
Optimizations for LTL Synthesis
We present an approach to automatic synthesis of specifications given in Linear Time Logic. The approach is based on a translation through universal co-B
Barbara Jobstmann, Roderick Bloem
CSL
1999
Springer
14 years 27 days ago
A Road-Map on Complexity for Hybrid Logics
Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...
Carlos Areces, Patrick Blackburn, Maarten Marx
JELIA
1990
Springer
14 years 19 days ago
Awareness, Negation and Logical Omniscience
General Epistemic Logics suffer from the problem of logical omniscience, which is that an agent's knowledge and beliefs are closed under implication. There have been many att...
Zhisheng Huang, Karen L. Kwast
CAS
1999
92views more  CAS 1999»
13 years 8 months ago
Towards a Logical Reconstruction of Information Retrieval Theory
We here expand on a previous paper concerning the role of logic in information retrieval (IR) modelling. In that paper, among other things, we had pointed out how different ways of...
Fabrizio Sebastiani