3047 search results - page 110 / 610 » On the Meaning of Logical Completeness |
167
click to vote
GLVLSI
1999
IEEE
15 years 10 months ago
1999
IEEE
Despite the seemingly endless upwards spiral of modern VLSI technology, many experts are predicting a hard wall for CMOS in about a decade. Given this, researchers continue to loo...
186
click to vote
AML
2010
15 years 6 months ago
2010
Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'. We ext...
154
click to vote
AML
2006
15 years 6 months ago
2006
Abstract Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'...
186
click to vote
CSL
2007
Springer
16 years 14 days ago
2007
Springer
A focused proof system provides a normal form to cut-free proofs that structures the application of invertible and non-invertible inference rules. The focused proof system of Andre...
158
click to vote
LFCS
2007
Springer
16 years 13 days ago
2007
Springer
Interval-based temporal logics are an important research area in computer science and artificial intelligence. In this paper we investigate decidability and expressiveness issues ...